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/RedBestel_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/RedBestel_4.pddl
Parsing...
Parsing: [0.010s CPU, 0.015s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.004s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.013s wall-clock]
Preparing model... [0.010s CPU, 0.011s wall-clock]
Generated 173 rules.
Computing model... [0.440s CPU, 0.448s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.490s CPU, 0.491s wall-clock]
Instantiating: [0.970s CPU, 0.976s 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.010s 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.047s wall-clock]
Translating task: [0.610s CPU, 0.606s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
1 operators removed
4 propositions removed
Detecting unreachable propositions: [0.070s CPU, 0.074s 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: 7128
Translator axioms: 0
Translator task size: 39872
Translator peak memory: 49200 KB
Writing output... [0.090s CPU, 0.090s wall-clock]
Done! [1.800s CPU, 1.811s 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.
7128 of 7128 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=674208, notReached=19576, spurious=1772
15 operators are spurious because were not triggered
H^2 mutexes added fw: 19576, unreachable: 0
0 of 7113 operators detected as spurious
Total mutex and disambiguation time: 2.8217 iterations: 2
9788 of 9788 mutex groups necessary.
7113 of 7128 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
9788 of 9788 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
9788 of 9788 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: 9788
Preprocessor task size: 59318
Writing output...
Preprocessor time: 3.25283s
Preprocessor peak memory: 27732 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.000360715s]
Simplifying transitions... done!
done reading input! [t=0.193154s]
building causal graph...done! [t=0.197956s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.198085s]
done initalizing global data [t=0.19809s]
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 385 387 384 377 375 386 374 380 382 388 340 334 343 367 370 337 328 390 355 349 331 381 389 383 352 364 346 376 373 378 361 0 358 379 369 339 348 354 360 333 357 391 345 351 327 366 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: 1.097s
Starting Stackelberg bounded search...
 opt: 0.033 reg: 0 solved: 1 total time: 4.62442
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 4.62456
 opt: 0.006 reg: 0 solved: 1 total time: 4.66996
 opt: 0.026 reg: 0 solved: 1 total time: 4.69693
 opt: 0.01 reg: 0 solved: 1 total time: 4.70777
 opt: 0.009 reg: 0 solved: 1 total time: 4.71735
 opt: 0.015 reg: 0 solved: 1 total time: 4.73349
 opt: 0.009 reg: 0 solved: 1 total time: 4.74348
 opt: 0.011 reg: 0 solved: 1 total time: 4.75524
 opt: 0.016 reg: 0 solved: 1 total time: 4.77152
 opt: 0.011 reg: 0 solved: 1 total time: 4.78332
 opt: 0.016 reg: 0 solved: 1 total time: 4.79953
 opt: 0.012 reg: 0 solved: 1 total time: 4.81228
 opt: 0.013 reg: 0 solved: 1 total time: 4.82594
 opt: 0.013 reg: 0 solved: 1 total time: 4.84017
 opt: 0.012 reg: 0 solved: 1 total time: 4.85276
 opt: 0.013 reg: 0 solved: 1 total time: 4.86655
 opt: 0.012 reg: 0 solved: 1 total time: 4.87941
 opt: 0.142 reg: 0 solved: 2 total time: 5.02172
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 5.02195
 opt: 0.115 reg: 0 solved: 2 total time: 5.20554
 opt: 0.119 reg: 0 solved: 2 total time: 5.32578
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 5.32602
 opt: 0.084 reg: 0.001 solved: 6 total time: 5.4879
 opt: 0.072 reg: 0.001 solved: 4 total time: 5.56269
 opt: 0.07 reg: 0.001 solved: 2 total time: 5.63488
 opt: 0.106 reg: 0.003 solved: 4 total time: 5.74482
 opt: 0.076 reg: 0.008 solved: 7 total time: 5.82983
 opt: 0.061 reg: 0.006 solved: 3 total time: 5.89744
 opt: 0.358 reg: 0.007 solved: 3 total time: 6.26388
 opt: 0.12 reg: 0.01 solved: 5 total time: 6.3949
 opt: 0.154 reg: 0.005 solved: 3 total time: 6.55485
 opt: 0.068 reg: 0.016 solved: 9 total time: 6.64082
 opt: 0.157 reg: 0.016 solved: 6 total time: 6.81504
 opt: 0.125 reg: 0.017 solved: 7 total time: 6.95795
 opt: 0.095 reg: 0.015 solved: 5 total time: 7.06877
 opt: 0.076 reg: 0.023 solved: 8 total time: 7.16912
 opt: 0.093 reg: 0.035 solved: 10 total time: 7.29835
 opt: 0.352 reg: 0.006 solved: 9 total time: 7.6566
 opt: 0.067 reg: 0.008 solved: 11 total time: 7.73297
 opt: 0.154 reg: 0.015 solved: 10 total time: 7.90291
 opt: 0.409 reg: 0.02 solved: 11 total time: 8.3331
 opt: 0.092 reg: 0.04 solved: 12 total time: 8.46694
 opt: 0.162 reg: 0.041 solved: 12 total time: 8.67095
 opt: 0.857 reg: 0.007 solved: 8 total time: 9.53399
 opt: 0.1 reg: 0.016 solved: 14 total time: 9.65083
 opt: 0.101 reg: 0.039 solved: 13 total time: 9.79219
 opt: 0.17 reg: 0.037 solved: 14 total time: 9.99986
 opt: 0.1 reg: 0.024 solved: 15 total time: 10.1251
 opt: 0.109 reg: 0.045 solved: 17 total time: 10.2796
 opt: 0.179 reg: 0.048 solved: 13 total time: 10.5076
 opt: 0.156 reg: 0.019 solved: 17 total time: 10.6838
 opt: 0.107 reg: 0.031 solved: 16 total time: 10.8231
 opt: 0.174 reg: 0.016 solved: 15 total time: 11.0138
 opt: 0.159 reg: 0.026 solved: 16 total time: 11.1998
 opt: 0.031 solved: 2147483647 total time: 11.2313
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 11.2924
Search time: 6.753s
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 s85 blaststepdone
				 fix_switch t1 s606 blaststepdone
				 fix_switch t1 s589 blaststepdone
				 fix_switch t1 s522 blaststepdone
				 fix_switch t1 s505 blaststepdone
				 fix_switch t1 s438 blaststepdone
				 fix_switch t1 s421 blaststepdone
				 fix_switch t1 s354 blaststepdone
				 fix_switch t1 s337 blaststepdone
				 fix_switch t1 s270 blaststepdone
				 fix_switch t1 s253 blaststepdone
				 fix_switch t1 s186 blaststepdone
				 fix_switch t1 s18 blaststepdone
				 fix_switch t1 s169 blaststepdone
				 fix_switch t1 s102 blaststepdone
				 fix_switch t1 s1 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 53
Solved by optimal solver: 53
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 53
Solved follower subproblems: 53
Optimal solver time: 5.807s
Cost-bounded solver time: 0s
Follower search time: 5.807s
Total time: 11.3381s
Optimal engine:
Peak memory: 710920 KB
@@@T16636@@@
Done!
real 16.87
user 14.97
sys 1.73
