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/Garr201008_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/Garr201008_4.pddl
Parsing...
Parsing: [0.020s CPU, 0.014s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.004s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.013s wall-clock]
Preparing model... [0.020s CPU, 0.016s wall-clock]
Generated 173 rules.
Computing model... [0.460s CPU, 0.466s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.500s CPU, 0.498s wall-clock]
Instantiating: [1.010s CPU, 1.008s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.020s CPU, 0.016s 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.010s CPU, 0.003s wall-clock]
Computing fact groups: [0.030s CPU, 0.027s 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.050s CPU, 0.046s wall-clock]
Translating task: [0.620s CPU, 0.629s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.090s CPU, 0.082s 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.100s CPU, 0.097s wall-clock]
Done! [1.890s CPU, 1.884s 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=674192, notReached=19592, spurious=1772
16 operators are spurious because were not triggered
H^2 mutexes added fw: 19592, unreachable: 0
0 of 7113 operators detected as spurious
Total mutex and disambiguation time: 3.11392 iterations: 2
9796 of 9796 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
9796 of 9796 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
9796 of 9796 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: 9796
Preprocessor task size: 59334
Writing output...
Preprocessor time: 3.56144s
Preprocessor peak memory: 27792 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.000330965s]
Simplifying transitions... done!
done reading input! [t=0.208859s]
building causal graph...done! [t=0.214149s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.214278s]
done initalizing global data [t=0.214282s]
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 384 387 377 386 382 385 383 388 373 370 343 334 367 337 361 390 340 349 346 374 378 389 328 364 331 380 355 381 352 0 358 379 348 360 345 369 339 333 366 391 357 351 327 354 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: 728 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.593s
Starting Stackelberg bounded search...
 opt: 0.006 reg: 0 solved: 1 total time: 4.15427
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 4.15434
 opt: 0.003 reg: 0 solved: 1 total time: 4.18615
 opt: 0.018 reg: 0 solved: 1 total time: 4.20449
 opt: 0.009 reg: 0 solved: 1 total time: 4.2146
 opt: 0.009 reg: 0 solved: 1 total time: 4.22375
 opt: 0.015 reg: 0 solved: 1 total time: 4.23924
 opt: 0.009 reg: 0 solved: 1 total time: 4.24869
 opt: 0.012 reg: 0 solved: 1 total time: 4.26091
 opt: 0.017 reg: 0 solved: 1 total time: 4.27808
 opt: 0.013 reg: 0 solved: 1 total time: 4.29172
 opt: 0.019 reg: 0 solved: 1 total time: 4.31129
 opt: 0.014 reg: 0 solved: 1 total time: 4.32572
 opt: 0.016 reg: 0 solved: 1 total time: 4.34271
 opt: 0.016 reg: 0 solved: 1 total time: 4.35919
 opt: 0.014 reg: 0 solved: 1 total time: 4.37407
 opt: 0.017 reg: 0 solved: 1 total time: 4.39214
 opt: 0.015 reg: 0 solved: 1 total time: 4.40753
 opt: 0.024 reg: 0 solved: 2 total time: 4.4322
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 4.43235
 opt: 0.069 reg: 0 solved: 2 total time: 4.541
 opt: 0.084 reg: 0 solved: 2 total time: 4.62556
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 4.62578
 opt: 0.068 reg: 0 solved: 4 total time: 4.74757
 opt: 0.075 reg: 0.002 solved: 6 total time: 4.82527
 opt: 0.174 reg: 0.002 solved: 4 total time: 5.00242
 opt: 0.127 reg: 0.004 solved: 6 total time: 5.13472
 opt: 0.329 reg: 0.003 solved: 4 total time: 5.46731
 opt: 0.068 reg: 0.002 solved: 2 total time: 5.53869
 opt: 0.069 reg: 0.004 solved: 3 total time: 5.61203
 opt: 0.245 reg: 0.006 solved: 6 total time: 5.86401
 opt: 0.074 reg: 0.014 solved: 8 total time: 5.95317
 opt: 0.073 reg: 0.019 solved: 5 total time: 6.04618
 opt: 0.064 reg: 0.037 solved: 9 total time: 6.1478
 opt: 0.135 reg: 0.002 solved: 8 total time: 6.28649
 opt: 0.219 reg: 0.001 solved: 3 total time: 6.50681
 opt: 0.327 reg: 0.014 solved: 6 total time: 6.84855
 opt: 0.258 reg: 0.003 solved: 6 total time: 7.11095
 opt: 0.073 reg: 0.008 solved: 7 total time: 7.19241
 opt: 0.094 reg: 0.017 solved: 12 total time: 7.30403
 opt: 0.091 reg: 0.027 solved: 10 total time: 7.42342
 opt: 0.339 reg: 0.022 solved: 10 total time: 7.78588
 opt: 0.253 reg: 0.025 solved: 8 total time: 8.06461
 opt: 0.158 reg: 0.036 solved: 12 total time: 8.25967
 opt: 0.66 reg: 0.005 solved: 11 total time: 8.92438
 opt: 0.4 reg: 0.006 solved: 10 total time: 9.33111
 opt: 0.461 reg: 0.021 solved: 12 total time: 9.81453
 opt: 0.437 reg: 0.015 solved: 10 total time: 10.2673
 opt: 0.271 reg: 0.018 solved: 8 total time: 10.5569
 opt: 0.505 reg: 0.023 solved: 10 total time: 11.086
 opt: 0.336 reg: 0.018 solved: 8 total time: 11.441
 opt: 0.059 reg: 0.047 solved: 13 total time: 11.5488
 opt: 0.13 reg: 0.006 solved: 10 total time: 11.6856
 opt: 0.442 reg: 0.006 solved: 8 total time: 12.1345
 opt: 0.06 reg: 0.026 solved: 14 total time: 12.2212
 opt: 0.553 reg: 0.027 solved: 10 total time: 12.8022
 opt: 0.408 reg: 0.05 solved: 12 total time: 13.2608
 opt: 0.354 reg: 0.006 solved: 8 total time: 13.6224
 opt: 0.454 reg: 0.007 solved: 10 total time: 14.0843
 opt: 0.521 reg: 0.006 solved: 10 total time: 14.6123
 opt: 0.058 reg: 0.023 solved: 15 total time: 14.6938
 opt: 0.547 reg: 0.01 solved: 8 total time: 15.2514
 opt: 0.434 reg: 0.015 solved: 10 total time: 15.7007
 opt: 0.424 reg: 0.007 solved: 8 total time: 16.1325
 opt: 0.415 reg: 0.008 solved: 10 total time: 16.5562
 opt: 0.611 reg: 0.007 solved: 10 total time: 17.1748
 opt: 0.327 reg: 0.007 solved: 10 total time: 17.51
 opt: 0.458 reg: 0.027 solved: 14 total time: 17.9956
 opt: 0.5 reg: 0.034 solved: 12 total time: 18.53
 opt: 0.637 reg: 0.017 solved: 10 total time: 19.1848
 opt: 0.443 reg: 0.01 solved: 10 total time: 19.639
 opt: 0.043 solved: 2147483647 total time: 19.6826
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 19.7676
Search time: 15.683s
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_switch t0 s81 blaststepdone
				 fix_switch t0 s331 blaststepdone
				 fix_switch t0 s31 blaststepdone
				 fix_switch t0 s281 blaststepdone
				 fix_switch t0 s131 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s69 blaststepdone
				 fix_switch t1 s381 blaststepdone
				 fix_switch t1 s369 blaststepdone
				 fix_switch t1 s319 blaststepdone
				 fix_switch t1 s269 blaststepdone
				 fix_switch t1 s231 blaststepdone
				 fix_switch t1 s219 blaststepdone
				 fix_switch t1 s19 blaststepdone
				 fix_switch t1 s181 blaststepdone
				 fix_switch t1 s169 blaststepdone
				 fix_switch t1 s119 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 69
Solved by optimal solver: 69
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 69
Solved follower subproblems: 69
Optimal solver time: 14.66s
Cost-bounded solver time: 0s
Follower search time: 14.66s
Total time: 19.8171s
Optimal engine:
Peak memory: 698976 KB
@@@T25509@@@
Done!
real 25.75
user 24.67
sys 0.90
