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/Evolink_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/Evolink_4.pddl
Parsing...
Parsing: [0.020s CPU, 0.014s 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.010s CPU, 0.011s wall-clock]
Generated 173 rules.
Computing model... [0.450s CPU, 0.450s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.480s CPU, 0.478s wall-clock]
Instantiating: [0.960s CPU, 0.964s 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.020s CPU, 0.025s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.010s 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.047s wall-clock]
Translating task: [0.660s CPU, 0.663s 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.083s 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.096s wall-clock]
Done! [1.870s CPU, 1.872s 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.378 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.82203s
Preprocessor peak memory: 29712 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.000261797s]
Simplifying transitions... done!
done reading input! [t=0.215408s]
building causal graph...done! [t=0.220473s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.220603s]
done initalizing global data [t=0.220608s]
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 386 383 384 385 387 375 374 382 388 334 340 349 343 367 331 370 355 390 328 379 389 380 377 352 337 364 361 376 358 378 373 0 346 381 369 351 348 360 339 336 357 391 333 345 327 366 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.749s
Starting Stackelberg bounded search...
 opt: 0.006 reg: 0 solved: 1 total time: 4.16058
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 4.16064
 opt: 0.003 reg: 0 solved: 1 total time: 4.19694
 opt: 0.013 reg: 0 solved: 1 total time: 4.21053
 opt: 0.007 reg: 0 solved: 1 total time: 4.2183
 opt: 0.006 reg: 0 solved: 1 total time: 4.22517
 opt: 0.012 reg: 0 solved: 1 total time: 4.23737
 opt: 0.007 reg: 0 solved: 1 total time: 4.24475
 opt: 0.009 reg: 0 solved: 1 total time: 4.25439
 opt: 0.013 reg: 0 solved: 1 total time: 4.26795
 opt: 0.01 reg: 0 solved: 1 total time: 4.27914
 opt: 0.015 reg: 0 solved: 1 total time: 4.2951
 opt: 0.011 reg: 0 solved: 1 total time: 4.30661
 opt: 0.012 reg: 0 solved: 1 total time: 4.31944
 opt: 0.012 reg: 0 solved: 1 total time: 4.33247
 opt: 0.011 reg: 0 solved: 1 total time: 4.34438
 opt: 0.013 reg: 0 solved: 1 total time: 4.35814
 opt: 0.011 reg: 0 solved: 1 total time: 4.37028
 opt: 0.02 reg: 0 solved: 2 total time: 4.39062
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 4.39078
 opt: 0.08 reg: 0 solved: 2 total time: 4.50624
 opt: 0.069 reg: 0 solved: 3 total time: 4.57633
 opt: 0.087 reg: 0 solved: 3 total time: 4.66461
 opt: 0.219 reg: 0 solved: 3 total time: 4.88534
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 4.88561
 opt: 0.07 reg: 0 solved: 3 total time: 5.00384
 opt: 0.058 reg: 0.001 solved: 4 total time: 5.06479
 opt: 0.067 reg: 0.003 solved: 5 total time: 5.13547
 opt: 0.096 reg: 0.005 solved: 5 total time: 5.23688
 opt: 0.318 reg: 0.004 solved: 5 total time: 5.55961
 opt: 0.201 reg: 0.003 solved: 3 total time: 5.76469
 opt: 0.073 reg: 0.006 solved: 6 total time: 5.84423
 opt: 0.08 reg: 0.011 solved: 8 total time: 5.93627
 opt: 0.073 reg: 0.018 solved: 7 total time: 6.02869
 opt: 0.107 reg: 0.012 solved: 5 total time: 6.14843
 opt: 0.055 reg: 0.027 solved: 9 total time: 6.23186
 opt: 0.056 reg: 0.004 solved: 11 total time: 6.29401
 opt: 0.109 reg: 0.004 solved: 9 total time: 6.40843
 opt: 0.608 reg: 0.004 solved: 7 total time: 7.02141
 opt: 0.276 reg: 0.003 solved: 7 total time: 7.30196
 opt: 0.38 reg: 0.004 solved: 5 total time: 7.68654
 opt: 0.111 reg: 0.004 solved: 7 total time: 7.80232
 opt: 0.315 reg: 0.009 solved: 9 total time: 8.12704
 opt: 0.49 reg: 0.014 solved: 7 total time: 8.63111
 opt: 0.621 reg: 0.016 solved: 9 total time: 9.26818
 opt: 0.104 reg: 0.036 solved: 14 total time: 9.40909
 opt: 0.362 reg: 0.008 solved: 7 total time: 9.77926
 opt: 0.319 reg: 0.017 solved: 11 total time: 10.1157
 opt: 0.088 reg: 0.03 solved: 10 total time: 10.2344
 opt: 0.221 reg: 0.032 solved: 9 total time: 10.4889
 opt: 0.408 reg: 0.058 solved: 11 total time: 10.9555
 opt: 0.544 reg: 0.036 solved: 9 total time: 11.5363
 opt: 0.102 reg: 0.066 solved: 12 total time: 11.7057
 opt: 0.116 reg: 0.019 solved: 13 total time: 11.8417
 opt: 0.181 reg: 0.028 solved: 13 total time: 12.0512
 opt: 0.449 reg: 0.035 solved: 9 total time: 12.5357
 opt: 0.112 reg: 0.039 solved: 17 total time: 12.6882
 opt: 0.5 reg: 0.019 solved: 7 total time: 13.2076
 opt: 0.34 reg: 0.063 solved: 13 total time: 13.6114
 opt: 0.433 reg: 0.005 solved: 7 total time: 14.0503
 opt: 0.156 reg: 0.027 solved: 11 total time: 14.2349
 opt: 0.317 reg: 0.014 solved: 9 total time: 14.5669
 opt: 1.106 reg: 0.022 solved: 13 total time: 15.6952
 opt: 0.591 reg: 0.007 solved: 7 total time: 16.2941
 opt: 0.86 reg: 0.019 solved: 13 total time: 17.1733
 opt: 0.127 reg: 0.029 solved: 15 total time: 17.331
 opt: 0.524 reg: 0.012 solved: 9 total time: 17.8683
 opt: 0.711 reg: 0.031 solved: 11 total time: 18.6107
 opt: 0.367 reg: 0.014 solved: 9 total time: 18.9922
 opt: 0.743 reg: 0.014 solved: 9 total time: 19.7494
 opt: 0.253 reg: 0.026 solved: 11 total time: 20.0292
 opt: 0.173 reg: 0.047 solved: 13 total time: 20.2502
 opt: 0.262 reg: 0.035 solved: 13 total time: 20.5485
 opt: 0.496 reg: 0.026 solved: 13 total time: 21.0712
 opt: 0.221 reg: 0.022 solved: 15 total time: 21.3157
 opt: 0.364 reg: 0.016 solved: 11 total time: 21.6971
 opt: 0.689 reg: 0.017 solved: 11 total time: 22.4035
 opt: 0.43 reg: 0.015 solved: 13 total time: 22.8485
 opt: 0.417 reg: 0.012 solved: 13 total time: 23.2793
 opt: 0.672 reg: 0.018 solved: 9 total time: 23.9701
 opt: 0.439 reg: 0.026 solved: 11 total time: 24.4353
 opt: 0.36 reg: 0.021 solved: 11 total time: 24.8167
 opt: 0.13 reg: 0.043 solved: 16 total time: 24.9913
 opt: 0.635 reg: 0.036 solved: 11 total time: 25.6637
 opt: 0.199 reg: 0.051 solved: 15 total time: 25.9146
 opt: 0.541 reg: 0.008 solved: 15 total time: 26.4634
 opt: 0.497 reg: 0.018 solved: 11 total time: 26.9796
 opt: 0.295 reg: 0.012 solved: 15 total time: 27.2877
 opt: 0.806 reg: 0.02 solved: 11 total time: 28.1149
 opt: 0.065 solved: 2147483647 total time: 28.1811
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 28.3192
Search time: 24.238s
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 s86 blaststepdone
				 fix_switch t1 s53 blaststepdone
				 fix_switch t1 s50 blaststepdone
				 fix_switch t1 s269 blaststepdone
				 fix_switch t1 s266 blaststepdone
				 fix_switch t1 s230 blaststepdone
				 fix_switch t1 s197 blaststepdone
				 fix_switch t1 s194 blaststepdone
				 fix_switch t1 s161 blaststepdone
				 fix_switch t1 s158 blaststepdone
				 fix_switch t1 s14 blaststepdone
				 fix_switch t1 s125 blaststepdone
				 fix_switch t1 s122 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s89 blaststepdone
				 fix_switch t2 s233 blaststepdone
				 fix_switch t2 s17 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 87
Solved by optimal solver: 87
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 87
Solved follower subproblems: 87
Optimal solver time: 22.535s
Cost-bounded solver time: 0s
Follower search time: 22.535s
Total time: 28.3724s
Optimal engine:
Peak memory: 683760 KB
@@@T34310@@@
Done!
real 34.66
user 33.53
sys 0.84
