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/Niif_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/Niif_4.pddl
Parsing...
Parsing: [0.020s CPU, 0.015s 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.440s CPU, 0.441s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.440s CPU, 0.445s wall-clock]
Instantiating: [0.920s CPU, 0.921s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.013s 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.000s 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.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.045s wall-clock]
Translating task: [0.600s CPU, 0.600s 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: 49204 KB
Writing output... [0.090s CPU, 0.087s wall-clock]
Done! [1.740s CPU, 1.746s 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: 2.94045 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.36617s
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.000318812s]
Simplifying transitions... done!
done reading input! [t=0.18444s]
building causal graph...done! [t=0.188698s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.188821s]
done initalizing global data [t=0.188826s]
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 383 376 388 386 384 374 375 380 377 387 343 370 334 340 346 328 373 390 355 364 337 382 379 385 349 358 367 389 331 378 361 0 352 381 369 351 339 354 360 333 357 391 345 366 327 348 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: 0.52s
Starting Stackelberg bounded search...
 opt: 0.006 reg: 0 solved: 1 total time: 3.64304
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 3.6431
 opt: 0.003 reg: 0 solved: 1 total time: 3.67152
 opt: 0.012 reg: 0 solved: 1 total time: 3.68413
 opt: 0.006 reg: 0 solved: 1 total time: 3.69125
 opt: 0.006 reg: 0 solved: 1 total time: 3.69808
 opt: 0.01 reg: 0 solved: 1 total time: 3.70887
 opt: 0.007 reg: 0 solved: 1 total time: 3.71609
 opt: 0.009 reg: 0 solved: 1 total time: 3.72525
 opt: 0.012 reg: 0 solved: 1 total time: 3.73827
 opt: 0.009 reg: 0 solved: 1 total time: 3.74765
 opt: 0.013 reg: 0 solved: 1 total time: 3.76183
 opt: 0.01 reg: 0 solved: 1 total time: 3.77243
 opt: 0.012 reg: 0 solved: 1 total time: 3.78544
 opt: 0.011 reg: 0 solved: 1 total time: 3.79723
 opt: 0.01 reg: 0 solved: 1 total time: 3.80817
 opt: 0.013 reg: 0 solved: 1 total time: 3.82178
 opt: 0.012 reg: 0 solved: 1 total time: 3.83412
 opt: 0.02 reg: 0 solved: 2 total time: 3.85489
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 3.85503
 opt: 0.055 reg: 0 solved: 2 total time: 3.94241
 opt: 0.069 reg: 0 solved: 2 total time: 4.01253
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 4.01272
 opt: 0.063 reg: 0 solved: 4 total time: 4.11845
 opt: 0.05 reg: 0 solved: 2 total time: 4.16961
 opt: 0.076 reg: 0 solved: 3 total time: 4.24707
 opt: 0.219 reg: 0 solved: 3 total time: 4.46747
 opt: 0.067 reg: 0.001 solved: 5 total time: 4.53632
 opt: 0.07 reg: 0.001 solved: 6 total time: 4.60843
 opt: 0.068 reg: 0.002 solved: 7 total time: 4.67982
 opt: 0.081 reg: 0.002 solved: 4 total time: 4.76432
 opt: 0.199 reg: 0.002 solved: 4 total time: 4.96642
 opt: 0.054 reg: 0.009 solved: 8 total time: 5.03061
 opt: 0.099 reg: 0.011 solved: 6 total time: 5.14151
 opt: 0.273 reg: 0.018 solved: 8 total time: 5.43303
 opt: 0.074 reg: 0.025 solved: 9 total time: 5.53344
 opt: 0.682 reg: 0.002 solved: 6 total time: 6.21782
 opt: 0.356 reg: 0.006 solved: 8 total time: 6.58002
 opt: 0.295 reg: 0.004 solved: 6 total time: 6.88038
 opt: 0.085 reg: 0.018 solved: 12 total time: 6.98389
 opt: 0.372 reg: 0.016 solved: 6 total time: 7.37338
 opt: 0.197 reg: 0.02 solved: 8 total time: 7.59108
 opt: 0.269 reg: 0.01 solved: 8 total time: 7.87098
 opt: 0.105 reg: 0.01 solved: 8 total time: 7.98736
 opt: 0.093 reg: 0.027 solved: 11 total time: 8.10863
 opt: 0.091 reg: 0.036 solved: 10 total time: 8.23647
 opt: 0.096 reg: 0.035 solved: 14 total time: 8.36866
 opt: 0.276 reg: 0.016 solved: 8 total time: 8.66209
 opt: 0.158 reg: 0.036 solved: 12 total time: 8.85654
 opt: 0.238 reg: 0.035 solved: 12 total time: 9.13098
 opt: 0.561 reg: 0.024 solved: 12 total time: 9.71686
 opt: 0.118 reg: 0.071 solved: 13 total time: 9.90765
 opt: 0.161 reg: 0.016 solved: 10 total time: 10.0853
 opt: 0.431 reg: 0.029 solved: 12 total time: 10.5469
 opt: 0.122 reg: 0.054 solved: 17 total time: 10.7231
 opt: 0.134 reg: 0.019 solved: 10 total time: 10.8768
 opt: 0.181 reg: 0.041 solved: 14 total time: 11.1004
 opt: 0.177 reg: 0.033 solved: 14 total time: 11.3114
 opt: 0.266 reg: 0.04 solved: 10 total time: 11.6178
 opt: 0.119 reg: 0.077 solved: 16 total time: 11.8144
 opt: 0.911 reg: 0.016 solved: 8 total time: 12.7414
 opt: 0.172 reg: 0.033 solved: 12 total time: 12.9475
 opt: 0.329 reg: 0.042 solved: 10 total time: 13.3195
 opt: 0.591 reg: 0.034 solved: 10 total time: 13.9449
 opt: 0.505 reg: 0.028 solved: 10 total time: 14.4782
 opt: 0.134 reg: 0.052 solved: 15 total time: 14.6655
 opt: 0.514 reg: 0.019 solved: 10 total time: 15.1998
 opt: 0.402 reg: 0.017 solved: 10 total time: 15.6205
 opt: 0.398 reg: 0.013 solved: 10 total time: 16.033
 opt: 0.697 reg: 0.017 solved: 10 total time: 16.7477
 opt: 0.343 reg: 0.032 solved: 12 total time: 17.1243
 opt: 0.911 reg: 0.064 solved: 14 total time: 18.0997
 opt: 0.618 reg: 0.01 solved: 10 total time: 18.7288
 opt: 0.743 reg: 0.009 solved: 12 total time: 19.4815
 opt: 0.317 reg: 0.014 solved: 10 total time: 19.8133
 opt: 0.662 reg: 0.009 solved: 12 total time: 20.4849
 opt: 0.218 reg: 0.034 solved: 16 total time: 20.7382
 opt: 0.395 reg: 0.03 solved: 8 total time: 21.1645
 opt: 0.633 reg: 0.023 solved: 10 total time: 21.8208
 opt: 0.407 reg: 0.019 solved: 12 total time: 22.2474
 opt: 0.489 reg: 0.014 solved: 12 total time: 22.7506
 opt: 0.702 reg: 0.016 solved: 12 total time: 23.4695
 opt: 0.354 reg: 0.028 solved: 16 total time: 23.8521
 opt: 0.191 reg: 0.019 solved: 16 total time: 24.0632
 opt: 0.511 reg: 0.034 solved: 14 total time: 24.6093
 opt: 0.287 reg: 0.03 solved: 16 total time: 24.9265
 opt: 0.609 reg: 0.022 solved: 16 total time: 25.5581
 opt: 0.054 solved: 2147483647 total time: 25.613
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 25.7341
Search time: 22.164s
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 s98 blaststepdone
				 fix_switch t1 s80 blaststepdone
				 fix_switch t1 s65 blaststepdone
				 fix_switch t1 s47 blaststepdone
				 fix_switch t1 s263 blaststepdone
				 fix_switch t1 s245 blaststepdone
				 fix_switch t1 s230 blaststepdone
				 fix_switch t1 s212 blaststepdone
				 fix_switch t1 s197 blaststepdone
				 fix_switch t1 s179 blaststepdone
				 fix_switch t1 s146 blaststepdone
				 fix_switch t1 s14 blaststepdone
				 fix_switch t1 s131 blaststepdone
				 fix_switch t1 s113 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s32 blaststepdone
				 fix_switch t2 s164 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 85
Solved by optimal solver: 85
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 85
Solved follower subproblems: 85
Optimal solver time: 20.378s
Cost-bounded solver time: 0s
Follower search time: 20.378s
Total time: 25.7841s
Optimal engine:
Peak memory: 686548 KB
@@@T31119@@@
Done!
real 31.30
user 30.46
sys 0.72
