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/BtEurope_4.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/BtEurope_4.pddl
Parsing...
Parsing: [0.010s CPU, 0.017s 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.020s CPU, 0.011s wall-clock]
Generated 173 rules.
Computing model... [0.410s CPU, 0.418s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.450s CPU, 0.444s wall-clock]
Instantiating: [0.900s CPU, 0.897s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.014s 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...
390 uncovered facts
Choosing groups: [0.000s CPU, 0.001s wall-clock]
Building translation key... [0.000s CPU, 0.003s wall-clock]
Computing fact groups: [0.020s CPU, 0.024s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.010s 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.040s CPU, 0.044s wall-clock]
Translating task: [0.590s CPU, 0.592s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.070s CPU, 0.075s wall-clock]
Translator variables: 392
Translator derived variables: 0
Translator facts: 834
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 55
Translator operators: 7129
Translator axioms: 0
Translator task size: 39878
Translator peak memory: 49200 KB
Writing output... [0.090s CPU, 0.089s wall-clock]
Done! [1.710s CPU, 1.718s 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.
392 variables of 392 necessary
0 of 3 mutex groups necessary.
7129 of 7129 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 834 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=153664, notReached=540120, spurious=1772
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=673616, notReached=20168, spurious=1772
16 operators are spurious because were not triggered
H^2 mutexes added fw: 20168, unreachable: 0
0 of 7113 operators detected as spurious
Total mutex and disambiguation time: 3.47122 iterations: 2
10084 of 10084 mutex groups necessary.
7113 of 7129 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 7113
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 392
10084 of 10084 mutex groups necessary.
7113 of 7113 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
392 variables of 392 of 392 necessary
The causal graph is not acyclic.
392 variables of 392 necessary
10084 of 10084 mutex groups necessary.
7113 of 7113 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 392
Preprocessor facts: 834
Preprocessor derived variables: 0
Preprocessor operators: 7113
Preprocessor mutex groups: 10084
Preprocessor task size: 59910
Writing output...
Preprocessor time: 3.94385s
Preprocessor peak memory: 29716 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.000264942s]
Simplifying transitions... done!
done reading input! [t=0.194725s]
building causal graph...done! [t=0.199431s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.19955s]
done initalizing global data [t=0.199557s]
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() = 341
leader_vars_follower_preconditioned.size() = 340
follower_operators.size() = 6772
leader_operators.size() = 341
Initializing Symbolic Variables
Sym variable order: 1 36 56 232 120 37 280 184 264 200 25 248 88 40 332 5 136 300 312 296 20 152 168 22 72 60 124 104 140 216 76 268 284 204 236 9 188 139 108 344 92 43 252 44 341 107 172 220 316 156 123 219 203 235 155 315 171 8 267 75 283 48 91 80 112 299 251 240 224 59 304 187 13 356 96 208 288 320 64 144 160 192 23 322 128 242 176 258 210 256 306 114 50 178 162 272 98 15 290 274 109 130 285 194 66 61 226 362 77 205 82 146 253 33 301 269 317 347 10 237 157 221 93 45 189 302 174 125 173 141 222 126 142 94 286 350 11 190 270 254 46 318 292 276 206 110 62 238 196 212 132 158 29 78 68 180 368 17 148 228 100 52 217 84 116 324 308 137 335 57 89 2 265 260 249 201 164 244 6 121 297 129 153 313 185 113 24 73 35 41 27 241 289 233 169 305 105 81 359 321 225 177 14 281 193 65 138 257 49 234 154 282 161 273 209 74 218 122 250 7 58 97 186 42 90 338 145 266 298 170 314 202 279 167 231 329 263 71 151 39 215 103 199 4 106 135 87 21 83 119 247 295 311 55 163 31 183 115 99 211 275 179 147 259 16 307 323 131 195 111 143 47 291 191 227 207 51 319 243 67 127 353 365 255 326 271 287 12 95 63 223 310 70 303 214 182 159 86 166 294 3 246 134 79 175 102 150 278 239 38 371 118 230 32 198 261 133 101 85 262 69 26 53 181 229 18 54 293 213 277 325 197 309 149 117 34 245 165 19 28 30 375 376 379 384 374 386 387 388 380 331 364 367 340 370 334 343 328 390 346 382 377 385 383 349 373 355 361 381 352 389 337 0 358 378 369 339 348 354 360 333 357 391 345 351 327 366 336 342 330 372 363 
Num variables: 392 => 404
Initialize Symbolic Manager(808, 19801, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 872 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 1.11s
Starting Stackelberg bounded search...
 opt: 0.047 reg: 0 solved: 1 total time: 4.77658
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 4.77667
 opt: 0.128 reg: 0 solved: 1 total time: 4.93811
 opt: 0.023 reg: 0 solved: 1 total time: 4.96182
 opt: 0.01 reg: 0 solved: 1 total time: 4.97273
 opt: 0.009 reg: 0 solved: 1 total time: 4.98207
 opt: 0.016 reg: 0 solved: 1 total time: 4.99882
 opt: 0.008 reg: 0 solved: 1 total time: 5.00806
 opt: 0.011 reg: 0 solved: 1 total time: 5.01927
 opt: 0.015 reg: 0 solved: 1 total time: 5.03521
 opt: 0.011 reg: 0 solved: 1 total time: 5.04667
 opt: 0.016 reg: 0 solved: 1 total time: 5.06327
 opt: 0.011 reg: 0 solved: 1 total time: 5.07535
 opt: 0.014 reg: 0 solved: 1 total time: 5.08987
 opt: 0.013 reg: 0 solved: 1 total time: 5.10316
 opt: 0.012 reg: 0 solved: 1 total time: 5.11553
 opt: 0.014 reg: 0 solved: 1 total time: 5.1299
 opt: 0.013 reg: 0 solved: 1 total time: 5.14393
 opt: 0.054 reg: 0 solved: 2 total time: 5.19879
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 5.19895
 opt: 0.085 reg: 0 solved: 2 total time: 5.33247
 opt: 0.05 reg: 0 solved: 2 total time: 5.3832
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 5.38338
 opt: 0.057 reg: 0 solved: 2 total time: 5.49813
 opt: 0.081 reg: 0.001 solved: 3 total time: 5.58044
 opt: 0.073 reg: 0.012 solved: 4 total time: 5.6672
 opt: 0.249 reg: 0.003 solved: 4 total time: 5.92062
 opt: 0.062 reg: 0.008 solved: 6 total time: 5.99202
 opt: 0.249 reg: 0.006 solved: 4 total time: 6.24785
 opt: 0.087 reg: 0.01 solved: 5 total time: 6.34639
 opt: 0.256 reg: 0.005 solved: 3 total time: 6.60844
 opt: 0.267 reg: 0.007 solved: 6 total time: 6.8827
 opt: 0.393 reg: 0.003 solved: 6 total time: 7.27935
 opt: 0.325 reg: 0.004 solved: 6 total time: 7.60943
 opt: 0.212 reg: 0.003 solved: 6 total time: 7.82605
 opt: 0.092 reg: 0.023 solved: 13 total time: 7.94289
 opt: 0.053 reg: 0.004 solved: 8 total time: 8.00157
 opt: 0.097 reg: 0.02 solved: 10 total time: 8.11925
 opt: 0.086 reg: 0.019 solved: 7 total time: 8.22549
 opt: 0.3 reg: 0.025 solved: 8 total time: 8.55194
 opt: 0.1 reg: 0.04 solved: 9 total time: 8.6931
 opt: 0.83 reg: 0.028 solved: 10 total time: 9.55135
 opt: 0.287 reg: 0.01 solved: 8 total time: 9.84933
 opt: 0.06 reg: 0.014 solved: 12 total time: 9.92439
 opt: 0.265 reg: 0.016 solved: 10 total time: 10.2066
 opt: 0.387 reg: 0.016 solved: 8 total time: 10.6108
 opt: 0.087 reg: 0.023 solved: 11 total time: 10.7226
 opt: 0.102 reg: 0.032 solved: 14 total time: 10.858
 opt: 0.466 reg: 0.019 solved: 8 total time: 11.3434
 opt: 0.475 reg: 0.037 solved: 12 total time: 11.8561
 opt: 0.431 reg: 0.013 solved: 12 total time: 12.3008
 opt: 0.432 reg: 0.012 solved: 8 total time: 12.7462
 opt: 0.382 reg: 0.035 solved: 10 total time: 13.1643
 opt: 0.173 reg: 0.03 solved: 10 total time: 13.3685
 opt: 0.364 reg: 0.021 solved: 10 total time: 13.7536
 opt: 0.204 reg: 0.044 solved: 12 total time: 14.0024
 opt: 0.875 reg: 0.018 solved: 12 total time: 14.8959
 opt: 0.567 reg: 0.011 solved: 10 total time: 15.4747
 opt: 0.126 reg: 0.033 solved: 17 total time: 15.6353
 opt: 0.131 reg: 0.017 solved: 15 total time: 15.7851
 opt: 0.561 reg: 0.028 solved: 10 total time: 16.3748
 opt: 0.517 reg: 0.061 solved: 8 total time: 16.9538
 opt: 0.075 reg: 0.023 solved: 16 total time: 17.054
 opt: 0.457 reg: 0.033 solved: 12 total time: 17.5448
 opt: 0.547 reg: 0.026 solved: 8 total time: 18.1187
 opt: 0.5 reg: 0.037 solved: 10 total time: 18.6559
 opt: 0.371 reg: 0.036 solved: 12 total time: 19.0641
 opt: 0.524 reg: 0.028 solved: 10 total time: 19.6165
 opt: 0.726 reg: 0.035 solved: 12 total time: 20.3783
 opt: 0.462 reg: 0.022 solved: 10 total time: 20.8633
 opt: 0.41 reg: 0.02 solved: 10 total time: 21.2942
 opt: 0.51 reg: 0.032 solved: 8 total time: 21.8375
 opt: 0.554 reg: 0.038 solved: 12 total time: 22.4301
 opt: 0.638 reg: 0.031 solved: 10 total time: 23.0996
 opt: 0.421 reg: 0.022 solved: 10 total time: 23.5437
 opt: 0.453 reg: 0.023 solved: 10 total time: 24.0209
 opt: 0.953 reg: 0.019 solved: 10 total time: 24.9938
 opt: 0.336 reg: 0.041 solved: 16 total time: 25.3719
 opt: 0.578 reg: 0.02 solved: 12 total time: 25.9707
 opt: 0.899 reg: 0.015 solved: 12 total time: 26.8853
 opt: 0.259 reg: 0.012 solved: 16 total time: 27.1577
 opt: 0.061 solved: 2147483647 total time: 27.2191
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 27.3377
Search time: 22.677s
Total number of leader states: 4.6644e+11
Total number of follower subproblems: 3.09514e+11
Pareto-frontier size: 1
Pareto-frontier: (3,2147483647) 
	 fix ops costs: 3, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s95 blaststepdone
				 fix_switch t1 s71 blaststepdone
				 fix_switch t1 s65 blaststepdone
				 fix_switch t1 s47 blaststepdone
				 fix_switch t1 s41 blaststepdone
				 fix_switch t1 s23 blaststepdone
				 fix_switch t1 s191 blaststepdone
				 fix_switch t1 s185 blaststepdone
				 fix_switch t1 s167 blaststepdone
				 fix_switch t1 s161 blaststepdone
				 fix_switch t1 s143 blaststepdone
				 fix_switch t1 s137 blaststepdone
				 fix_switch t1 s119 blaststepdone
				 fix_switch t1 s113 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s89 blaststepdone
				 fix_switch t2 s17 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 79
Solved by optimal solver: 79
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 79
Solved follower subproblems: 79
Optimal solver time: 21.055s
Cost-bounded solver time: 0s
Follower search time: 21.055s
Total time: 27.3874s
Optimal engine:
Peak memory: 704812 KB
@@@T33279@@@
Done!
real 33.62
user 31.66
sys 1.67
