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/Garr201107_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/Garr201107_4.pddl
Parsing...
Parsing: [0.010s CPU, 0.012s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s 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.450s CPU, 0.455s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.470s CPU, 0.480s wall-clock]
Instantiating: [0.960s CPU, 0.970s 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.000s 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.047s wall-clock]
Translating task: [0.650s CPU, 0.649s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.090s CPU, 0.091s 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: 49208 KB
Writing output... [0.100s CPU, 0.105s wall-clock]
Done! [1.870s CPU, 1.883s 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.40475 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.8627s
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.000297274s]
Simplifying transitions... done!
done reading input! [t=0.195628s]
building causal graph...done! [t=0.200263s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.20039s]
done initalizing global data [t=0.200394s]
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 375 383 384 389 379 386 388 382 387 331 340 349 367 352 343 328 355 390 337 378 385 380 376 373 334 364 358 377 361 381 346 0 370 374 369 366 348 351 357 363 360 391 336 345 327 339 354 342 330 372 333 
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.552s
Starting Stackelberg bounded search...
 opt: 0.006 reg: 0 solved: 1 total time: 3.88131
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 3.88138
 opt: 0.003 reg: 0 solved: 1 total time: 3.91134
 opt: 0.013 reg: 0 solved: 1 total time: 3.92504
 opt: 0.007 reg: 0 solved: 1 total time: 3.93257
 opt: 0.006 reg: 0 solved: 1 total time: 3.93959
 opt: 0.011 reg: 0 solved: 1 total time: 3.95149
 opt: 0.007 reg: 0 solved: 1 total time: 3.95902
 opt: 0.009 reg: 0 solved: 1 total time: 3.96845
 opt: 0.013 reg: 0 solved: 1 total time: 3.98186
 opt: 0.01 reg: 0 solved: 1 total time: 3.99212
 opt: 0.014 reg: 0 solved: 1 total time: 4.0071
 opt: 0.013 reg: 0 solved: 1 total time: 4.02045
 opt: 0.013 reg: 0 solved: 1 total time: 4.0338
 opt: 0.012 reg: 0 solved: 1 total time: 4.04668
 opt: 0.011 reg: 0 solved: 1 total time: 4.05838
 opt: 0.013 reg: 0 solved: 1 total time: 4.07197
 opt: 0.012 reg: 0 solved: 1 total time: 4.08456
 opt: 0.019 reg: 0 solved: 2 total time: 4.10472
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 4.10488
 opt: 0.073 reg: 0 solved: 2 total time: 4.21282
 opt: 0.055 reg: 0 solved: 2 total time: 4.26833
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 4.26854
 opt: 0.097 reg: 0 solved: 3 total time: 4.41163
 opt: 0.053 reg: 0 solved: 2 total time: 4.46613
 opt: 0.058 reg: 0.001 solved: 5 total time: 4.52637
 opt: 0.051 reg: 0.004 solved: 6 total time: 4.58228
 opt: 0.063 reg: 0.007 solved: 4 total time: 4.65371
 opt: 0.228 reg: 0.005 solved: 3 total time: 4.88803
 opt: 0.158 reg: 0.005 solved: 4 total time: 5.05241
 opt: 0.208 reg: 0.008 solved: 6 total time: 5.26909
 opt: 0.208 reg: 0.005 solved: 4 total time: 5.48345
 opt: 0.08 reg: 0.015 solved: 8 total time: 5.5791
 opt: 0.087 reg: 0.026 solved: 10 total time: 5.69375
 opt: 0.085 reg: 0.028 solved: 7 total time: 5.80788
 opt: 0.212 reg: 0.016 solved: 6 total time: 6.03683
 opt: 0.144 reg: 0.025 solved: 10 total time: 6.20652
 opt: 0.131 reg: 0.002 solved: 8 total time: 6.34135
 opt: 0.201 reg: 0.004 solved: 10 total time: 6.54721
 opt: 0.121 reg: 0.003 solved: 8 total time: 6.67184
 opt: 0.091 reg: 0.006 solved: 9 total time: 6.77007
 opt: 0.551 reg: 0.013 solved: 10 total time: 7.33546
 opt: 0.17 reg: 0.008 solved: 6 total time: 7.51502
 opt: 0.284 reg: 0.008 solved: 6 total time: 7.80831
 opt: 0.482 reg: 0.013 solved: 10 total time: 8.30426
 opt: 0.944 reg: 0.01 solved: 8 total time: 9.25859
 opt: 0.562 reg: 0.007 solved: 8 total time: 9.82814
 opt: 0.411 reg: 0.011 solved: 10 total time: 10.2515
 opt: 0.484 reg: 0.009 solved: 8 total time: 10.7454
 opt: 0.092 reg: 0.026 solved: 11 total time: 10.8641
 opt: 0.317 reg: 0.004 solved: 8 total time: 11.1868
 opt: 0.416 reg: 0.003 solved: 8 total time: 11.6067
 opt: 0.493 reg: 0.003 solved: 8 total time: 12.1033
 opt: 0.598 reg: 0.009 solved: 10 total time: 12.7109
 opt: 0.583 reg: 0.006 solved: 10 total time: 13.3004
 opt: 0.095 reg: 0.016 solved: 12 total time: 13.4129
 opt: 0.766 reg: 0.037 solved: 10 total time: 14.2163
 opt: 0.107 reg: 0.029 solved: 14 total time: 14.3533
 opt: 0.108 reg: 0.013 solved: 15 total time: 14.4754
 opt: 0.174 reg: 0.032 solved: 12 total time: 14.682
 opt: 0.616 reg: 0.074 solved: 10 total time: 15.3726
 opt: 0.437 reg: 0.01 solved: 10 total time: 15.8208
 opt: 0.517 reg: 0.01 solved: 10 total time: 16.3486
 opt: 0.593 reg: 0.009 solved: 10 total time: 16.9513
 opt: 0.607 reg: 0.023 solved: 12 total time: 17.5818
 opt: 0.515 reg: 0.012 solved: 10 total time: 18.1094
 opt: 0.649 reg: 0.011 solved: 10 total time: 18.7695
 opt: 0.509 reg: 0.017 solved: 12 total time: 19.296
 opt: 0.753 reg: 0.016 solved: 12 total time: 20.065
 opt: 0.554 reg: 0.015 solved: 10 total time: 20.6355
 opt: 0.66 reg: 0.01 solved: 10 total time: 21.3064
 opt: 0.125 reg: 0.03 solved: 13 total time: 21.4625
 opt: 0.204 reg: 0.048 solved: 12 total time: 21.7156
 opt: 0.624 reg: 0.035 solved: 12 total time: 22.3757
 opt: 0.427 reg: 0.021 solved: 12 total time: 22.8244
 opt: 0.566 reg: 0.024 solved: 12 total time: 23.4153
 opt: 0.716 reg: 0.025 solved: 12 total time: 24.1571
 opt: 0.058 solved: 2147483647 total time: 24.2154
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 24.3435
Search time: 20.533s
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 s75 blaststepdone
				 fix_switch t1 s68 blaststepdone
				 fix_switch t1 s399 blaststepdone
				 fix_switch t1 s392 blaststepdone
				 fix_switch t1 s345 blaststepdone
				 fix_switch t1 s291 blaststepdone
				 fix_switch t1 s284 blaststepdone
				 fix_switch t1 s237 blaststepdone
				 fix_switch t1 s21 blaststepdone
				 fix_switch t1 s183 blaststepdone
				 fix_switch t1 s14 blaststepdone
				 fix_switch t1 s129 blaststepdone
				 fix_switch t1 s122 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s338 blaststepdone
				 fix_switch t2 s230 blaststepdone
				 fix_switch t2 s176 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 75
Solved by optimal solver: 75
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 75
Solved follower subproblems: 75
Optimal solver time: 19.363s
Cost-bounded solver time: 0s
Follower search time: 19.363s
Total time: 24.3919s
Optimal engine:
Peak memory: 714272 KB
@@@T30364@@@
Done!
real 30.55
user 29.70
sys 0.72
