INFO     Running translator.
INFO     translator input: ['/nfs/home/student.aau.dk/rtollu18/dat7/netstack/pddl-domains/domain-cc.pddl', '/nfs/home/student.aau.dk/rtollu18/dat7/netstack/zoo_pddl/GtsCe_2.pddl']
INFO     translator arguments: []
INFO     translator time limit: None
INFO     translator memory limit: 25600 MB
INFO     callstring: /usr/bin/python2 /nfs/home/student.aau.dk/rtollu18/dat7/netstack/stackelberg-planner-sls/translate/translate.py /nfs/home/student.aau.dk/rtollu18/dat7/netstack/pddl-domains/domain-cc.pddl /nfs/home/student.aau.dk/rtollu18/dat7/netstack/zoo_pddl/GtsCe_2.pddl
Parsing...
Parsing: [0.020s CPU, 0.013s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
Preparing model... [0.010s CPU, 0.010s wall-clock]
Generated 173 rules.
Computing model... [0.250s CPU, 0.245s wall-clock]
4432 relevant atoms
7469 auxiliary atoms
11901 final queue length
15588 total queue pushes
Completing instantiation... [0.260s CPU, 0.255s wall-clock]
Instantiating: [0.530s CPU, 0.532s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.011s wall-clock]
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.001s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
252 uncovered facts
Choosing groups: [0.010s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.020s CPU, 0.019s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.000s CPU, 0.001s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.001s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.030s CPU, 0.025s wall-clock]
Translating task: [0.310s CPU, 0.302s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.040s CPU, 0.043s wall-clock]
Translator variables: 254
Translator derived variables: 0
Translator facts: 546
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 43
Translator operators: 3537
Translator axioms: 0
Translator task size: 19906
Translator peak memory: 33320 KB
Writing output... [0.050s CPU, 0.050s wall-clock]
Done! [0.980s CPU, 0.977s wall-clock]
INFO     Running preprocessor (release).
INFO     preprocessor input: output.sas
INFO     preprocessor arguments: []
INFO     preprocessor time limit: None
INFO     preprocessor memory limit: 25600 MB
INFO     callstring: /nfs/home/student.aau.dk/rtollu18/dat7/netstack/stackelberg-planner-sls/preprocess/preprocess < output.sas
Building causal graph...
The causal graph is not acyclic.
254 variables of 254 necessary
0 of 3 mutex groups necessary.
3537 of 3537 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 546 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=64516, notReached=232492, spurious=1108
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=287580, notReached=9428, spurious=1108
14 operators are spurious because were not triggered
H^2 mutexes added fw: 9428, unreachable: 0
0 of 3523 operators detected as spurious
Total mutex and disambiguation time: 0.824365 iterations: 2
4714 of 4714 mutex groups necessary.
3523 of 3537 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 3523
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 254
4714 of 4714 mutex groups necessary.
3523 of 3523 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
254 variables of 254 of 254 necessary
The causal graph is not acyclic.
254 variables of 254 necessary
4714 of 4714 mutex groups necessary.
3523 of 3523 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 254
Preprocessor facts: 546
Preprocessor derived variables: 0
Preprocessor operators: 3523
Preprocessor mutex groups: 4714
Preprocessor task size: 29220
Writing output...
Preprocessor time: 1.00949s
Preprocessor peak memory: 13228 KB
done
INFO     Running search (release).
INFO     search input: output
INFO     search arguments: ['--search', 'sym_stackelberg(optimal_engine=symbolic(plan_reuse_minimal_task_upper_bound=true,plan_reuse_upper_bound=true),upper_bound_pruning=false,min_relevant_follower_cost=100000)']
INFO     search time limit: None
INFO     search memory limit: 25600 MB
INFO     search executable: /nfs/home/student.aau.dk/rtollu18/dat7/netstack/stackelberg-planner-sls/search/downward
INFO     callstring: /nfs/home/student.aau.dk/rtollu18/dat7/netstack/stackelberg-planner-sls/search/downward --search 'sym_stackelberg(optimal_engine=symbolic(plan_reuse_minimal_task_upper_bound=true,plan_reuse_upper_bound=true),upper_bound_pruning=false,min_relevant_follower_cost=100000)' --plan-file sas_plan < output
reading input... [t=0.00035625s]
Simplifying transitions... done!
done reading input! [t=0.108488s]
building causal graph...done! [t=0.111482s]
packing state variables...Variables: 254
Bytes per state: 36
done! [t=0.111725s]
done initalizing global data [t=0.111733s]
Begin sort_operators()...
Begin divide_ariables()...
Begin clean_follower_actions()...
Begin create_new_variable_indices()...
Begin check_leader_vars_follower_preconditioned()...
Begin compute_leader_facts_ops_sets()...
leader_variable_domain.size() = 209
leader_vars_follower_preconditioned.size() = 208
follower_operators.size() = 3314
leader_operators.size() = 209
Initializing Symbolic Variables
Sym variable order: 1 26 25 167 27 215 119 59 131 95 179 8 35 155 191 143 47 71 107 83 29 22 66 198 54 114 126 78 3 150 138 42 174 162 30 186 90 19 202 102 187 175 115 21 151 67 163 4 43 79 31 91 55 127 139 103 129 45 177 117 93 153 105 6 33 209 57 69 141 165 18 81 44 23 189 20 80 15 104 152 92 164 68 56 188 5 176 116 32 206 130 128 140 94 190 46 154 212 7 82 34 166 178 106 2 58 70 118 89 142 101 161 185 149 53 41 77 14 197 125 173 113 236 137 120 60 168 65 72 84 9 192 48 156 219 132 36 108 96 180 144 17 195 183 99 16 63 159 39 87 12 135 123 171 51 147 111 223 230 75 133 181 145 37 49 109 10 169 73 157 85 121 100 97 193 160 61 88 184 64 52 40 13 124 76 233 148 196 136 112 122 172 158 98 134 38 194 146 50 11 86 170 227 74 110 62 24 182 28 243 240 244 241 245 242 214 235 250 211 232 208 229 217 225 247 252 239 204 222 201 200 248 221 246 218 0 205 251 249 238 226 237 253 199 220 210 231 234 207 216 224 213 203 228 
Num variables: 254 => 263
Initialize Symbolic Manager(526, 30418, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 350 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.187s
Starting Stackelberg bounded search...
 opt: 0.004 reg: 0 solved: 1 total time: 2.18592
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 2.18597
 opt: 0.003 reg: 0 solved: 1 total time: 2.20355
 opt: 0.005 reg: 0 solved: 1 total time: 2.20914
 opt: 0.006 reg: 0 solved: 1 total time: 2.21577
 opt: 0.003 reg: 0 solved: 1 total time: 2.21968
 opt: 0.005 reg: 0 solved: 1 total time: 2.22528
 opt: 0.006 reg: 0 solved: 1 total time: 2.23181
 opt: 0.007 reg: 0 solved: 1 total time: 2.2398
 opt: 0.007 reg: 0 solved: 1 total time: 2.24706
 opt: 0.007 reg: 0 solved: 1 total time: 2.25508
 opt: 0.007 reg: 0 solved: 1 total time: 2.2626
 opt: 0.006 reg: 0 solved: 1 total time: 2.26933
 opt: 0.007 reg: 0 solved: 1 total time: 2.27738
 opt: 0.013 reg: 0 solved: 2 total time: 2.29156
L = 1, leader states: 8192, follower subproblems: 8192, F:100000, total time: 2.29167
 opt: 0.025 reg: 0 solved: 2 total time: 2.33744
 opt: 0.037 reg: 0 solved: 2 total time: 2.37556
L = 2, leader states: 1.06288e+06, follower subproblems: 1.06288e+06, F:100000, total time: 2.37571
 opt: 0.035 reg: 0 solved: 3 total time: 2.43109
 opt: 0.037 reg: 0.001 solved: 4 total time: 2.46934
 opt: 0.04 reg: 0.001 solved: 2 total time: 2.51162
 opt: 0.06 reg: 0.002 solved: 4 total time: 2.57479
 opt: 0.072 reg: 0.002 solved: 4 total time: 2.65008
 opt: 0.028 reg: 0.002 solved: 3 total time: 2.68185
 opt: 0.156 reg: 0.004 solved: 4 total time: 2.84329
 opt: 0.057 reg: 0.004 solved: 3 total time: 2.90529
L = 3, leader states: 3.35544e+07, follower subproblems: 3.35544e+07, F:100000, total time: 2.9055
 opt: 0.061 reg: 0.023 solved: 8 total time: 3.01231
 opt: 0.085 reg: 0.025 solved: 4 total time: 3.12337
 opt: 0.037 reg: 0.001 solved: 3 total time: 3.16265
 opt: 0.055 reg: 0.001 solved: 4 total time: 3.22051
 opt: 0.052 reg: 0.002 solved: 4 total time: 3.27579
 opt: 0.055 reg: 0.003 solved: 4 total time: 3.33472
 opt: 0.023 reg: 0.001 solved: 2 total time: 3.36008
 opt: 0.039 reg: 0.009 solved: 6 total time: 3.40913
 opt: 0.064 reg: 0.017 solved: 4 total time: 3.49193
 opt: 0.035 reg: 0.023 solved: 5 total time: 3.55166
 opt: 0.04 reg: 0.021 solved: 7 total time: 3.61388
 opt: 0.033 reg: 0 solved: 4 total time: 3.64845
 opt: 0.128 reg: 0.003 solved: 4 total time: 3.78072
 opt: 0.076 reg: 0.019 solved: 9 total time: 3.87693
 opt: 0.083 reg: 0.002 solved: 4 total time: 3.96304
 opt: 0.047 reg: 0.002 solved: 4 total time: 4.01247
 opt: 0.114 reg: 0.002 solved: 4 total time: 4.12938
 opt: 0.038 reg: 0.007 solved: 7 total time: 4.17479
 opt: 0.039 reg: 0.026 solved: 9 total time: 4.24077
 opt: 0.172 reg: 0.005 solved: 9 total time: 4.4191
 opt: 0.029 reg: 0.007 solved: 4 total time: 4.45632
 opt: 0.049 reg: 0.014 solved: 9 total time: 4.5208
 opt: 0.048 reg: 0.024 solved: 6 total time: 4.59371
 opt: 0.048 reg: 0.034 solved: 7 total time: 4.67692
 opt: 0.108 reg: 0.026 solved: 4 total time: 4.81171
 opt: 0.04 reg: 0.025 solved: 8 total time: 4.87793
 opt: 0.042 reg: 0.011 solved: 8 total time: 4.93225
 opt: 0.05 reg: 0.019 solved: 9 total time: 5.00259
 opt: 0.045 reg: 0.048 solved: 13 total time: 5.0974
 opt: 0.146 reg: 0.029 solved: 6 total time: 5.27309
 opt: 0.053 reg: 0.007 solved: 9 total time: 5.33491
 opt: 0.052 reg: 0.011 solved: 9 total time: 5.39917
 opt: 0.048 reg: 0.016 solved: 9 total time: 5.46498
 opt: 0.051 reg: 0.014 solved: 9 total time: 5.53063
 opt: 0.052 reg: 0.014 solved: 9 total time: 5.59738
 opt: 0.038 reg: 0.021 solved: 6 total time: 5.65783
 opt: 0.297 reg: 0.024 solved: 9 total time: 5.97953
 opt: 0.046 reg: 0.021 solved: 9 total time: 6.04816
 opt: 0.049 reg: 0.005 solved: 9 total time: 6.10317
 opt: 0.041 reg: 0.008 solved: 9 total time: 6.15339
 opt: 0.042 reg: 0.009 solved: 9 total time: 6.20587
 opt: 0.045 reg: 0.008 solved: 9 total time: 6.26068
 opt: 0.053 reg: 0.008 solved: 9 total time: 6.32308
 opt: 0.26 reg: 0.01 solved: 9 total time: 6.59341
 opt: 0.04 reg: 0.01 solved: 9 total time: 6.64511
 opt: 0.048 reg: 0.023 solved: 9 total time: 6.71801
 opt: 0.05 reg: 0.029 solved: 9 total time: 6.79833
 opt: 0.04 reg: 0.035 solved: 9 total time: 6.87523
 opt: 0.04 reg: 0.025 solved: 9 total time: 6.94129
 opt: 0.042 reg: 0.018 solved: 9 total time: 7.0034
 opt: 0.043 reg: 0.023 solved: 9 total time: 7.0707
 opt: 0.043 reg: 0.019 solved: 9 total time: 7.13364
 opt: 0.039 reg: 0.019 solved: 9 total time: 7.19246
 opt: 0.03 reg: 0.017 solved: 9 total time: 7.24092
 opt: 0.043 reg: 0.017 solved: 9 total time: 7.30187
 opt: 0.041 reg: 0.021 solved: 9 total time: 7.36513
 opt: 0.269 reg: 0.017 solved: 9 total time: 7.65196
 opt: 0.05 reg: 0.03 solved: 9 total time: 7.73292
 opt: 0.04 reg: 0.025 solved: 9 total time: 7.79918
 opt: 0.044 reg: 0.007 solved: 9 total time: 7.8509
 opt: 0.041 reg: 0.006 solved: 9 total time: 7.89946
 opt: 0.2 reg: 0.01 solved: 9 total time: 8.1108
 opt: 0.055 reg: 0.033 solved: 12 total time: 8.1997
 opt: 0.042 reg: 0.01 solved: 9 total time: 8.25343
 opt: 0.586 reg: 0.025 solved: 9 total time: 8.86547
 opt: 0.053 reg: 0.031 solved: 9 total time: 8.95104
 opt: 0.05 reg: 0.006 solved: 9 total time: 9.00808
 opt: 0.234 reg: 0.007 solved: 9 total time: 9.24937
 opt: 0.201 reg: 0.012 solved: 9 total time: 9.46329
 opt: 0.229 reg: 0.014 solved: 9 total time: 9.7074
 opt: 0.25 reg: 0.012 solved: 9 total time: 9.97068
 opt: 0.234 reg: 0.014 solved: 9 total time: 10.2201
 opt: 0.044 reg: 0.012 solved: 9 total time: 10.2771
 opt: 0.055 reg: 0.016 solved: 9 total time: 10.3486
 opt: 0.041 reg: 0.017 solved: 9 total time: 10.4082
 opt: 0.26 reg: 0.016 solved: 9 total time: 10.685
 opt: 0.051 reg: 0.017 solved: 9 total time: 10.7539
 opt: 0.046 reg: 0.016 solved: 9 total time: 10.817
 opt: 0.04 reg: 0.017 solved: 9 total time: 10.8748
 opt: 0.269 reg: 0.015 solved: 9 total time: 11.1598
 opt: 0.215 reg: 0.015 solved: 9 total time: 11.3911
 opt: 0.201 reg: 0.015 solved: 9 total time: 11.6081
 opt: 0.219 reg: 0.017 solved: 9 total time: 11.8448
 opt: 0.052 reg: 0.014 solved: 9 total time: 11.9126
 opt: 0.053 reg: 0.019 solved: 9 total time: 11.9854
 opt: 0.033 solved: 2147483647 total time: 12.019
L = 4, leader states: 4.88281e+08, follower subproblems: 4.88281e+08, F:2147483647, total time: 12.0668
Search time: 9.916s
Total number of leader states: 7.05325e+09
Total number of follower subproblems: 4.61502e+09
Pareto-frontier size: 1
Pareto-frontier: (4,2147483647) 
	 fix ops costs: 4, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s95 blaststepdone
				 fix_switch t1 s270 blaststepdone
				 fix_switch t1 s245 blaststepdone
				 fix_switch t1 s240 blaststepdone
				 fix_switch t1 s142 blaststepdone
				 fix_switch t1 s131 blaststepdone
				 fix_switch t1 s125 blaststepdone
				 fix_switch t1 s100 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s93 blaststepdone
				 fix_switch t2 s287 blaststepdone
				 fix_switch t2 s276 blaststepdone
				 fix_switch t2 s238 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 110
Solved by optimal solver: 110
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 110
Solved follower subproblems: 110
Optimal solver time: 8.297s
Cost-bounded solver time: 0s
Follower search time: 8.297s
Total time: 12.0864s
Optimal engine:
Peak memory: 588308 KB
@@@T14278@@@
Done!
real 14.50
user 13.72
sys 0.62
