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/Grnet_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/Grnet_4.pddl
Parsing...
Parsing: [0.020s CPU, 0.030s 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.013s wall-clock]
Preparing model... [0.020s CPU, 0.012s wall-clock]
Generated 173 rules.
Computing model... [0.420s CPU, 0.432s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.460s CPU, 0.457s wall-clock]
Instantiating: [0.920s CPU, 0.925s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.020s 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.030s CPU, 0.025s 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.040s CPU, 0.044s wall-clock]
Translating task: [0.640s CPU, 0.637s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.080s 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: 49196 KB
Writing output... [0.100s CPU, 0.098s wall-clock]
Done! [1.810s CPU, 1.823s 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.2149 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.64958s
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.000311772s]
Simplifying transitions... done!
done reading input! [t=0.194987s]
building causal graph...done! [t=0.19961s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.199736s]
done initalizing global data [t=0.199741s]
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 381 374 383 388 377 387 386 384 380 349 370 343 328 373 355 334 346 390 340 389 385 382 378 337 352 361 358 376 364 375 331 0 367 379 351 339 348 366 327 360 357 391 336 345 369 333 354 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.549s
Starting Stackelberg bounded search...
 opt: 0.006 reg: 0 solved: 1 total time: 3.85264
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 3.85272
 opt: 0.003 reg: 0 solved: 1 total time: 3.88295
 opt: 0.012 reg: 0 solved: 1 total time: 3.89596
 opt: 0.007 reg: 0 solved: 1 total time: 3.90372
 opt: 0.007 reg: 0 solved: 1 total time: 3.911
 opt: 0.011 reg: 0 solved: 1 total time: 3.92306
 opt: 0.007 reg: 0 solved: 1 total time: 3.93108
 opt: 0.009 reg: 0 solved: 1 total time: 3.9407
 opt: 0.013 reg: 0 solved: 1 total time: 3.95451
 opt: 0.01 reg: 0 solved: 1 total time: 3.96473
 opt: 0.015 reg: 0 solved: 1 total time: 3.98086
 opt: 0.011 reg: 0 solved: 1 total time: 3.99268
 opt: 0.013 reg: 0 solved: 1 total time: 4.00682
 opt: 0.017 reg: 0 solved: 1 total time: 4.02499
 opt: 0.012 reg: 0 solved: 1 total time: 4.03753
 opt: 0.014 reg: 0 solved: 1 total time: 4.05199
 opt: 0.013 reg: 0 solved: 1 total time: 4.06523
 opt: 0.019 reg: 0 solved: 2 total time: 4.08504
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 4.08521
 opt: 0.066 reg: 0 solved: 2 total time: 4.18773
 opt: 0.053 reg: 0 solved: 2 total time: 4.24126
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 4.24147
 opt: 0.056 reg: 0 solved: 4 total time: 4.34414
 opt: 0.052 reg: 0 solved: 2 total time: 4.39779
 opt: 0.139 reg: 0.001 solved: 4 total time: 4.53894
 opt: 0.079 reg: 0.001 solved: 3 total time: 4.62069
 opt: 0.066 reg: 0.004 solved: 6 total time: 4.69161
 opt: 0.231 reg: 0.003 solved: 3 total time: 4.92645
 opt: 0.077 reg: 0.004 solved: 5 total time: 5.00843
 opt: 0.101 reg: 0.005 solved: 6 total time: 5.11559
 opt: 0.094 reg: 0.024 solved: 12 total time: 5.23468
 opt: 0.222 reg: 0.001 solved: 4 total time: 5.45823
 opt: 0.082 reg: 0.004 solved: 8 total time: 5.54575
 opt: 0.078 reg: 0.005 solved: 7 total time: 5.63009
 opt: 0.087 reg: 0.008 solved: 8 total time: 5.72628
 opt: 0.898 reg: 0.012 solved: 6 total time: 6.63584
 opt: 0.258 reg: 0.011 solved: 6 total time: 6.90648
 opt: 0.475 reg: 0.016 solved: 8 total time: 7.39813
 opt: 0.305 reg: 0.008 solved: 6 total time: 7.71217
 opt: 0.088 reg: 0.026 solved: 9 total time: 7.82725
 opt: 0.062 reg: 0.027 solved: 8 total time: 7.91706
 opt: 0.098 reg: 0.022 solved: 11 total time: 8.03845
 opt: 0.065 reg: 0.006 solved: 10 total time: 8.11042
 opt: 0.278 reg: 0.015 solved: 8 total time: 8.40413
 opt: 0.443 reg: 0.017 solved: 10 total time: 8.86554
 opt: 0.353 reg: 0.017 solved: 10 total time: 9.23675
 opt: 0.116 reg: 0.04 solved: 15 total time: 9.39469
 opt: 0.349 reg: 0.011 solved: 8 total time: 9.75514
 opt: 0.395 reg: 0.006 solved: 8 total time: 10.1578
 opt: 0.395 reg: 0.005 solved: 8 total time: 10.5584
 opt: 0.192 reg: 0.015 solved: 10 total time: 10.7658
 opt: 0.296 reg: 0.012 solved: 10 total time: 11.0742
 opt: 0.299 reg: 0.009 solved: 8 total time: 11.3831
 opt: 0.118 reg: 0.027 solved: 13 total time: 11.5296
 opt: 0.08 reg: 0.056 solved: 14 total time: 11.6663
 opt: 0.698 reg: 0.014 solved: 10 total time: 12.379
 opt: 0.372 reg: 0.007 solved: 10 total time: 12.7594
 opt: 0.18 reg: 0.02 solved: 12 total time: 12.9601
 opt: 0.562 reg: 0.043 solved: 14 total time: 13.5657
 opt: 0.566 reg: 0.042 solved: 16 total time: 14.1741
 opt: 0.422 reg: 0.016 solved: 10 total time: 14.6134
 opt: 0.681 reg: 0.02 solved: 10 total time: 15.3158
 opt: 0.534 reg: 0.062 solved: 14 total time: 15.9123
 opt: 0.32 reg: 0.032 solved: 10 total time: 16.2649
 opt: 0.321 reg: 0.063 solved: 12 total time: 16.649
 opt: 0.208 reg: 0.011 solved: 12 total time: 16.8688
 opt: 0.643 reg: 0.014 solved: 12 total time: 17.527
 opt: 0.32 reg: 0.022 solved: 14 total time: 17.87
 opt: 0.784 reg: 0.013 solved: 10 total time: 18.6675
 opt: 0.499 reg: 0.01 solved: 10 total time: 19.1778
 opt: 0.242 reg: 0.023 solved: 14 total time: 19.4441
 opt: 0.358 reg: 0.02 solved: 12 total time: 19.8227
 opt: 1.036 reg: 0.029 solved: 14 total time: 20.8881
 opt: 0.89 reg: 0.025 solved: 14 total time: 21.8034
 opt: 0.682 reg: 0.015 solved: 10 total time: 22.5007
 opt: 0.557 reg: 0.02 solved: 14 total time: 23.0783
 opt: 0.367 reg: 0.025 solved: 12 total time: 23.4715
 opt: 0.429 reg: 0.015 solved: 14 total time: 23.9161
 opt: 0.434 reg: 0.014 solved: 10 total time: 24.3652
 opt: 0.575 reg: 0.011 solved: 10 total time: 24.9514
 opt: 0.518 reg: 0.018 solved: 12 total time: 25.4879
 opt: 0.128 reg: 0.033 solved: 17 total time: 25.6501
 opt: 0.471 reg: 0.037 solved: 12 total time: 26.1586
 opt: 0.063 solved: 2147483647 total time: 26.2222
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 26.3919
Search time: 22.614s
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 s90 blaststepdone
				 fix_switch t1 s82 blaststepdone
				 fix_switch t1 s59 blaststepdone
				 fix_switch t1 s51 blaststepdone
				 fix_switch t1 s28 blaststepdone
				 fix_switch t1 s245 blaststepdone
				 fix_switch t1 s214 blaststepdone
				 fix_switch t1 s183 blaststepdone
				 fix_switch t1 s152 blaststepdone
				 fix_switch t1 s121 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s237 blaststepdone
				 fix_switch t2 s206 blaststepdone
				 fix_switch t2 s20 blaststepdone
				 fix_switch t2 s175 blaststepdone
				 fix_switch t2 s144 blaststepdone
				 fix_switch t2 s113 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 82
Solved by optimal solver: 82
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 82
Solved follower subproblems: 82
Optimal solver time: 21.105s
Cost-bounded solver time: 0s
Follower search time: 21.105s
Total time: 26.4414s
Optimal engine:
Peak memory: 678116 KB
@@@T32133@@@
Done!
real 32.33
user 31.50
sys 0.68
