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/Arpanet19719_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/Arpanet19719_4.pddl
Parsing...
Parsing: [0.020s CPU, 0.123s 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.430s CPU, 0.434s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.470s CPU, 0.473s wall-clock]
Instantiating: [0.930s CPU, 0.942s 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.000s 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.050s CPU, 0.046s wall-clock]
Translating task: [0.600s CPU, 0.601s 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.077s 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.091s wall-clock]
Done! [1.780s 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=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.99987 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.43405s
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.00027397s]
Simplifying transitions... done!
done reading input! [t=0.191801s]
building causal graph...done! [t=0.196519s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.196649s]
done initalizing global data [t=0.196654s]
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 376 385 380 388 383 387 382 389 377 375 370 343 358 334 349 337 352 390 331 364 373 386 374 379 340 328 361 378 355 384 346 0 367 381 351 366 348 357 336 339 360 391 369 345 327 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.587s
Starting Stackelberg bounded search...
 opt: 0.007 reg: 0 solved: 1 total time: 4.06129
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 4.06136
 opt: 0.004 reg: 0 solved: 1 total time: 4.09278
 opt: 0.014 reg: 0 solved: 1 total time: 4.10743
 opt: 0.007 reg: 0 solved: 1 total time: 4.11538
 opt: 0.007 reg: 0 solved: 1 total time: 4.12288
 opt: 0.013 reg: 0 solved: 1 total time: 4.13606
 opt: 0.008 reg: 0 solved: 1 total time: 4.14461
 opt: 0.01 reg: 0 solved: 1 total time: 4.15572
 opt: 0.015 reg: 0 solved: 1 total time: 4.17133
 opt: 0.01 reg: 0 solved: 1 total time: 4.18226
 opt: 0.017 reg: 0 solved: 1 total time: 4.19945
 opt: 0.013 reg: 0 solved: 1 total time: 4.21339
 opt: 0.015 reg: 0 solved: 1 total time: 4.22929
 opt: 0.013 reg: 0 solved: 1 total time: 4.24334
 opt: 0.013 reg: 0 solved: 1 total time: 4.25693
 opt: 0.016 reg: 0 solved: 1 total time: 4.27348
 opt: 0.015 reg: 0 solved: 1 total time: 4.28896
 opt: 0.024 reg: 0 solved: 2 total time: 4.31391
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 4.31409
 opt: 0.093 reg: 0 solved: 3 total time: 4.44551
 opt: 0.127 reg: 0 solved: 3 total time: 4.57444
 opt: 0.111 reg: 0 solved: 2 total time: 4.6874
 opt: 0.34 reg: 0 solved: 3 total time: 5.02815
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 5.02849
 opt: 0.096 reg: 0.001 solved: 5 total time: 5.18062
 opt: 0.098 reg: 0.004 solved: 9 total time: 5.28388
 opt: 0.113 reg: 0.007 solved: 7 total time: 5.40497
 opt: 0.119 reg: 0.008 solved: 3 total time: 5.53386
 opt: 0.297 reg: 0.009 solved: 3 total time: 5.84139
 opt: 0.162 reg: 0.018 solved: 7 total time: 6.02239
 opt: 0.108 reg: 0.133 solved: 4 total time: 6.26366
 opt: 0.185 reg: 0.061 solved: 8 total time: 6.51126
 opt: 0.94 reg: 0.037 solved: 6 total time: 7.48748
 opt: 0.503 reg: 0.02 solved: 7 total time: 8.01156
 opt: 0.106 reg: 0.013 solved: 5 total time: 8.13141
 opt: 0.247 reg: 0.011 solved: 5 total time: 8.39014
 opt: 0.233 reg: 0.013 solved: 7 total time: 8.63673
 opt: 0.41 reg: 0.011 solved: 5 total time: 9.05843
 opt: 0.343 reg: 0.007 solved: 5 total time: 9.4095
 opt: 0.092 reg: 0.019 solved: 12 total time: 9.52188
 opt: 0.118 reg: 0.005 solved: 10 total time: 9.64542
 opt: 0.452 reg: 0.01 solved: 7 total time: 10.1083
 opt: 0.111 reg: 0.035 solved: 13 total time: 10.2551
 opt: 0.601 reg: 0.024 solved: 7 total time: 10.8812
 opt: 0.528 reg: 0.011 solved: 7 total time: 11.4212
 opt: 0.083 reg: 0.034 solved: 11 total time: 11.5399
 opt: 0.113 reg: 0.013 solved: 15 total time: 11.6677
 opt: 0.145 reg: 0.024 solved: 9 total time: 11.838
 opt: 0.264 reg: 0.025 solved: 9 total time: 12.1275
 opt: 0.369 reg: 0.044 solved: 11 total time: 12.5406
 opt: 0.58 reg: 0.017 solved: 13 total time: 13.1376
 opt: 0.659 reg: 0.015 solved: 11 total time: 13.8122
 opt: 0.351 reg: 0.014 solved: 9 total time: 14.1739
 opt: 0.634 reg: 0.014 solved: 9 total time: 14.8231
 opt: 0.812 reg: 0.01 solved: 9 total time: 15.6456
 opt: 0.352 reg: 0.02 solved: 7 total time: 16.0194
 opt: 0.535 reg: 0.014 solved: 7 total time: 16.5696
 opt: 0.208 reg: 0.042 solved: 15 total time: 16.8207
 opt: 0.221 reg: 0.045 solved: 13 total time: 17.0882
 opt: 0.279 reg: 0.036 solved: 11 total time: 17.4049
 opt: 0.56 reg: 0.031 solved: 9 total time: 17.9963
 opt: 0.616 reg: 0.017 solved: 9 total time: 18.6299
 opt: 0.535 reg: 0.028 solved: 11 total time: 19.1938
 opt: 0.44 reg: 0.019 solved: 9 total time: 19.6535
 opt: 0.534 reg: 0.018 solved: 9 total time: 20.2063
 opt: 0.233 reg: 0.044 solved: 15 total time: 20.4844
 opt: 0.624 reg: 0.022 solved: 9 total time: 21.1313
 opt: 0.691 reg: 0.017 solved: 9 total time: 21.84
 opt: 0.709 reg: 0.018 solved: 9 total time: 22.5673
 opt: 0.712 reg: 0.047 solved: 13 total time: 23.3268
 opt: 0.403 reg: 0.024 solved: 9 total time: 23.7539
 opt: 0.325 reg: 0.026 solved: 13 total time: 24.1059
 opt: 0.627 reg: 0.025 solved: 9 total time: 24.7587
 opt: 0.402 reg: 0.03 solved: 13 total time: 25.1915
 opt: 0.359 reg: 0.043 solved: 11 total time: 25.5943
 opt: 0.481 reg: 0.024 solved: 11 total time: 26.0999
 opt: 0.914 reg: 0.02 solved: 9 total time: 27.0347
 opt: 0.682 reg: 0.018 solved: 9 total time: 27.7349
 opt: 0.632 reg: 0.026 solved: 11 total time: 28.3936
 opt: 0.729 reg: 0.021 solved: 11 total time: 29.1445
 opt: 0.117 reg: 0.041 solved: 14 total time: 29.3037
 opt: 0.757 reg: 0.031 solved: 15 total time: 30.0913
 opt: 0.532 reg: 0.041 solved: 11 total time: 30.6647
 opt: 0.789 reg: 0.04 solved: 11 total time: 31.4947
 opt: 0.386 reg: 0.068 solved: 13 total time: 31.9503
 opt: 0.477 reg: 0.014 solved: 13 total time: 32.4417
 opt: 0.882 reg: 0.012 solved: 11 total time: 33.3358
 opt: 0.543 reg: 0.015 solved: 13 total time: 33.8947
 opt: 0.127 reg: 0.032 solved: 16 total time: 34.0541
 opt: 0.853 reg: 0.03 solved: 15 total time: 34.9372
 opt: 0.398 reg: 0.02 solved: 15 total time: 35.356
 opt: 0.466 reg: 0.025 solved: 11 total time: 35.8481
 opt: 0.845 reg: 0.042 solved: 13 total time: 36.7359
 opt: 0.528 reg: 0.025 solved: 11 total time: 37.2892
 opt: 0.772 reg: 0.03 solved: 13 total time: 38.0927
 opt: 0.632 reg: 0.025 solved: 13 total time: 38.75
 opt: 0.063 solved: 2147483647 total time: 38.8139
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 38.9875
Search time: 35.048s
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 s88 blaststepdone
				 fix_switch t1 s70 blaststepdone
				 fix_switch t1 s65 blaststepdone
				 fix_switch t1 s52 blaststepdone
				 fix_switch t1 s34 blaststepdone
				 fix_switch t1 s16 blaststepdone
				 fix_switch t1 s142 blaststepdone
				 fix_switch t1 s124 blaststepdone
				 fix_switch t1 s106 blaststepdone
				 fix_switch t1 s101 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s83 blaststepdone
				 fix_switch t2 s47 blaststepdone
				 fix_switch t2 s29 blaststepdone
				 fix_switch t2 s137 blaststepdone
				 fix_switch t2 s119 blaststepdone
				 fix_switch t2 s11 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 95
Solved by optimal solver: 95
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 95
Solved follower subproblems: 95
Optimal solver time: 32.734s
Cost-bounded solver time: 0s
Follower search time: 32.734s
Total time: 39.0644s
Optimal engine:
Peak memory: 667408 KB
@@@T44635@@@
Done!
real 45.50
user 43.09
sys 1.47
