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/Karen_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/Karen_4.pddl
Parsing...
Parsing: [0.010s CPU, 0.021s 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.020s CPU, 0.013s wall-clock]
Preparing model... [0.010s CPU, 0.011s wall-clock]
Generated 173 rules.
Computing model... [0.490s CPU, 0.489s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.460s CPU, 0.473s wall-clock]
Instantiating: [1.000s CPU, 1.004s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.020s CPU, 0.015s 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.640s CPU, 0.638s 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.085s 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.095s wall-clock]
Done! [1.880s CPU, 1.899s 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.20209 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.65006s
Preprocessor peak memory: 27788 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.000281061s]
Simplifying transitions... done!
done reading input! [t=0.213639s]
building causal graph...done! [t=0.218936s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.219077s]
done initalizing global data [t=0.219082s]
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 388 384 376 381 374 382 387 386 389 328 343 331 349 340 358 346 334 390 337 377 380 383 379 361 364 352 355 378 370 375 367 0 373 385 348 357 366 345 336 363 360 391 369 351 327 333 354 342 330 339 372 
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.557s
Starting Stackelberg bounded search...
 opt: 0.005 reg: 0 solved: 1 total time: 3.90844
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 3.9085
 opt: 0.003 reg: 0 solved: 1 total time: 3.93845
 opt: 0.012 reg: 0 solved: 1 total time: 3.95092
 opt: 0.007 reg: 0 solved: 1 total time: 3.95875
 opt: 0.006 reg: 0 solved: 1 total time: 3.96557
 opt: 0.011 reg: 0 solved: 1 total time: 3.97762
 opt: 0.007 reg: 0 solved: 1 total time: 3.98545
 opt: 0.009 reg: 0 solved: 1 total time: 3.99531
 opt: 0.017 reg: 0 solved: 1 total time: 4.01279
 opt: 0.01 reg: 0 solved: 1 total time: 4.02329
 opt: 0.014 reg: 0 solved: 1 total time: 4.03841
 opt: 0.011 reg: 0 solved: 1 total time: 4.05002
 opt: 0.012 reg: 0 solved: 1 total time: 4.063
 opt: 0.011 reg: 0 solved: 1 total time: 4.07473
 opt: 0.01 reg: 0 solved: 1 total time: 4.08556
 opt: 0.012 reg: 0 solved: 1 total time: 4.09849
 opt: 0.012 reg: 0 solved: 1 total time: 4.11114
 opt: 0.017 reg: 0 solved: 2 total time: 4.12893
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 4.12907
 opt: 0.056 reg: 0 solved: 3 total time: 4.21987
 opt: 0.045 reg: 0 solved: 2 total time: 4.26627
 opt: 0.084 reg: 0 solved: 3 total time: 4.35143
 opt: 0.108 reg: 0 solved: 3 total time: 4.46088
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 4.46112
 opt: 0.05 reg: 0 solved: 2 total time: 4.55684
 opt: 0.111 reg: 0 solved: 3 total time: 4.66909
 opt: 0.072 reg: 0 solved: 3 total time: 4.7424
 opt: 0.05 reg: 0.002 solved: 5 total time: 4.79553
 opt: 0.184 reg: 0.004 solved: 5 total time: 4.98378
 opt: 0.17 reg: 0.004 solved: 5 total time: 5.15837
 opt: 0.061 reg: 0.013 solved: 7 total time: 5.23426
 opt: 0.111 reg: 0.024 solved: 7 total time: 5.36976
 opt: 0.362 reg: 0.025 solved: 5 total time: 5.75731
 opt: 0.064 reg: 0.017 solved: 9 total time: 5.8396
 opt: 0.072 reg: 0.003 solved: 4 total time: 5.91563
 opt: 0.236 reg: 0.005 solved: 5 total time: 6.15677
 opt: 0.284 reg: 0.006 solved: 9 total time: 6.44801
 opt: 0.058 reg: 0.011 solved: 8 total time: 6.51745
 opt: 0.121 reg: 0.012 solved: 9 total time: 6.65238
 opt: 0.218 reg: 0.016 solved: 7 total time: 6.88723
 opt: 0.496 reg: 0.014 solved: 7 total time: 7.39777
 opt: 0.44 reg: 0.008 solved: 7 total time: 7.84644
 opt: 0.068 reg: 0.018 solved: 6 total time: 7.93397
 opt: 0.367 reg: 0.019 solved: 7 total time: 8.32058
 opt: 0.481 reg: 0.021 solved: 9 total time: 8.82262
 opt: 0.081 reg: 0.035 solved: 11 total time: 8.94027
 opt: 0.576 reg: 0.009 solved: 9 total time: 9.52597
 opt: 0.454 reg: 0.005 solved: 9 total time: 9.98501
 opt: 0.326 reg: 0.012 solved: 11 total time: 10.3238
 opt: 0.063 reg: 0.018 solved: 10 total time: 10.4061
 opt: 0.851 reg: 0.022 solved: 11 total time: 11.2794
 opt: 0.382 reg: 0.019 solved: 9 total time: 11.6816
 opt: 0.374 reg: 0.02 solved: 7 total time: 12.0761
 opt: 0.329 reg: 0.02 solved: 7 total time: 12.4258
 opt: 0.431 reg: 0.023 solved: 9 total time: 12.8797
 opt: 0.35 reg: 0.015 solved: 9 total time: 13.245
 opt: 0.117 reg: 0.034 solved: 11 total time: 13.3964
 opt: 0.254 reg: 0.002 solved: 7 total time: 13.6535
 opt: 0.608 reg: 0.006 solved: 9 total time: 14.2679
 opt: 0.284 reg: 0.012 solved: 11 total time: 14.5648
 opt: 0.375 reg: 0.013 solved: 11 total time: 14.9535
 opt: 0.514 reg: 0.011 solved: 9 total time: 15.4794
 opt: 0.345 reg: 0.008 solved: 9 total time: 15.8335
 opt: 0.367 reg: 0.008 solved: 9 total time: 16.2088
 opt: 0.502 reg: 0.013 solved: 11 total time: 16.7251
 opt: 0.633 reg: 0.009 solved: 11 total time: 17.3671
 opt: 0.389 reg: 0.01 solved: 11 total time: 17.7666
 opt: 0.095 reg: 0.031 solved: 15 total time: 17.8931
 opt: 0.217 reg: 0.027 solved: 11 total time: 18.1378
 opt: 0.254 reg: 0.02 solved: 9 total time: 18.4133
 opt: 0.335 reg: 0.013 solved: 11 total time: 18.7631
 opt: 0.476 reg: 0.011 solved: 9 total time: 19.2509
 opt: 0.478 reg: 0.011 solved: 9 total time: 19.7405
 opt: 0.443 reg: 0.017 solved: 11 total time: 20.2019
 opt: 0.395 reg: 0.012 solved: 9 total time: 20.6098
 opt: 0.105 reg: 0.033 solved: 17 total time: 20.7491
 opt: 0.327 reg: 0.018 solved: 11 total time: 21.0951
 opt: 0.49 reg: 0.01 solved: 11 total time: 21.5965
 opt: 0.37 reg: 0.01 solved: 11 total time: 21.977
 opt: 0.153 reg: 0.036 solved: 15 total time: 22.1675
 opt: 0.066 reg: 0.019 solved: 12 total time: 22.2539
 opt: 0.481 reg: 0.021 solved: 11 total time: 22.7568
 opt: 0.099 reg: 0.053 solved: 13 total time: 22.9097
 opt: 0.29 reg: 0.016 solved: 11 total time: 23.2165
 opt: 0.073 reg: 0.031 solved: 14 total time: 23.3218
 opt: 0.165 reg: 0.074 solved: 13 total time: 23.5624
 opt: 0.392 reg: 0.049 solved: 11 total time: 24.0045
 opt: 0.578 reg: 0.035 solved: 17 total time: 24.6182
 opt: 0.509 reg: 0.028 solved: 13 total time: 25.1562
 opt: 0.62 reg: 0.054 solved: 15 total time: 25.8308
 opt: 0.45 reg: 0.04 solved: 13 total time: 26.3218
 opt: 0.405 reg: 0.009 solved: 13 total time: 26.7369
 opt: 0.49 reg: 0.036 solved: 15 total time: 27.2636
 opt: 0.51 reg: 0.039 solved: 11 total time: 27.8131
 opt: 0.451 reg: 0.04 solved: 13 total time: 28.3058
 opt: 0.852 reg: 0.012 solved: 15 total time: 29.1698
 opt: 0.489 reg: 0.547 solved: 13 total time: 30.2054
 opt: 0.415 reg: 0.041 solved: 11 total time: 30.6623
 opt: 0.485 reg: 0.009 solved: 13 total time: 31.157
 opt: 0.533 reg: 0.011 solved: 13 total time: 31.702
 opt: 0.556 reg: 0.015 solved: 15 total time: 32.2739
 opt: 0.066 reg: 0.034 solved: 16 total time: 32.3757
 opt: 0.176 reg: 0.025 solved: 17 total time: 32.578
 opt: 0.624 reg: 0.034 solved: 13 total time: 33.2375
 opt: 0.582 reg: 0.016 solved: 11 total time: 33.8361
 opt: 0.429 reg: 0.023 solved: 15 total time: 34.2889
 opt: 0.515 reg: 0.013 solved: 11 total time: 34.8174
 opt: 0.609 reg: 0.022 solved: 13 total time: 35.4496
 opt: 0.536 reg: 0.019 solved: 13 total time: 36.0053
 opt: 0.335 reg: 0.013 solved: 11 total time: 36.3537
 opt: 0.377 reg: 0.012 solved: 11 total time: 36.7441
 opt: 0.504 reg: 0.022 solved: 13 total time: 37.2713
 opt: 0.494 reg: 0.012 solved: 11 total time: 37.7785
 opt: 0.52 reg: 0.023 solved: 15 total time: 38.322
 opt: 0.636 reg: 0.02 solved: 13 total time: 38.979
 opt: 0.415 reg: 0.018 solved: 13 total time: 39.4134
 opt: 0.593 reg: 0.037 solved: 17 total time: 40.0444
 opt: 0.632 reg: 0.034 solved: 17 total time: 40.7111
 opt: 0.436 reg: 0.038 solved: 11 total time: 41.1857
 opt: 0.398 reg: 0.05 solved: 13 total time: 41.634
 opt: 0.061 solved: 2147483647 total time: 41.6958
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 41.7775
Search time: 37.954s
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 s80 blaststepdone
				 fix_switch t0 s55 blaststepdone
				 fix_switch t0 s5 blaststepdone
				 fix_switch t0 s180 blaststepdone
				 fix_switch t0 s130 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s75 blaststepdone
				 fix_switch t1 s50 blaststepdone
				 fix_switch t1 s30 blaststepdone
				 fix_switch t1 s25 blaststepdone
				 fix_switch t1 s175 blaststepdone
				 fix_switch t1 s155 blaststepdone
				 fix_switch t1 s150 blaststepdone
				 fix_switch t1 s125 blaststepdone
				 fix_switch t1 s105 blaststepdone
				 fix_switch t1 s100 blaststepdone
				 fix_switch t1 s0 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 119
Solved by optimal solver: 119
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 119
Solved follower subproblems: 119
Optimal solver time: 35.145s
Cost-bounded solver time: 0s
Follower search time: 35.145s
Total time: 41.8247s
Optimal engine:
Peak memory: 752440 KB
@@@T47623@@@
Done!
real 47.80
user 46.83
sys 0.84
