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/Easynet_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/Easynet_4.pddl
Parsing...
Parsing: [0.010s CPU, 0.017s 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.011s wall-clock]
Preparing model... [0.010s CPU, 0.010s wall-clock]
Generated 173 rules.
Computing model... [0.420s CPU, 0.414s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.460s CPU, 0.468s wall-clock]
Instantiating: [0.910s CPU, 0.915s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s 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.046s wall-clock]
Translating task: [0.620s CPU, 0.625s 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.081s 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: 49464 KB
Writing output... [0.100s CPU, 0.093s wall-clock]
Done! [1.770s CPU, 1.781s 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.13158 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.56963s
Preprocessor peak memory: 27792 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.000360818s]
Simplifying transitions... done!
done reading input! [t=0.197254s]
building causal graph...done! [t=0.202295s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.202425s]
done initalizing global data [t=0.202429s]
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 375 374 381 383 389 382 386 388 387 331 370 373 349 343 337 358 390 334 328 346 377 384 379 361 352 355 378 340 380 364 0 367 385 369 351 357 345 360 336 339 391 333 366 327 348 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: 728 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.662s
Starting Stackelberg bounded search...
 opt: 0.006 reg: 0 solved: 1 total time: 3.96721
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 3.96727
 opt: 0.003 reg: 0 solved: 1 total time: 3.99808
 opt: 0.013 reg: 0 solved: 1 total time: 4.01166
 opt: 0.035 reg: 0.001 solved: 1 total time: 4.04921
 opt: 0.017 reg: 0 solved: 1 total time: 4.06726
 opt: 0.02 reg: 0 solved: 1 total time: 4.08835
 opt: 0.011 reg: 0.001 solved: 1 total time: 4.10205
 opt: 0.011 reg: 0 solved: 1 total time: 4.11465
 opt: 0.017 reg: 0 solved: 1 total time: 4.13243
 opt: 0.013 reg: 0.001 solved: 1 total time: 4.14738
 opt: 0.017 reg: 0 solved: 1 total time: 4.16602
 opt: 0.013 reg: 0.001 solved: 1 total time: 4.18119
 opt: 0.018 reg: 0 solved: 1 total time: 4.19993
 opt: 0.015 reg: 0.001 solved: 1 total time: 4.21689
 opt: 0.014 reg: 0.001 solved: 1 total time: 4.23285
 opt: 0.016 reg: 0.001 solved: 1 total time: 4.25071
 opt: 0.015 reg: 0.001 solved: 1 total time: 4.26703
 opt: 0.023 reg: 0 solved: 2 total time: 4.29104
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 4.2912
 opt: 0.104 reg: 0.001 solved: 2 total time: 4.5384
 opt: 0.122 reg: 0 solved: 2 total time: 4.66126
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 4.6615
 opt: 0.089 reg: 0 solved: 4 total time: 4.84856
 opt: 0.067 reg: 0 solved: 2 total time: 4.91691
 opt: 0.191 reg: 0.001 solved: 4 total time: 5.11008
 opt: 0.119 reg: 0.001 solved: 4 total time: 5.2312
 opt: 0.096 reg: 0.002 solved: 3 total time: 5.33014
 opt: 0.312 reg: 0.001 solved: 3 total time: 5.64397
 opt: 0.062 reg: 0.003 solved: 6 total time: 5.71053
 opt: 0.07 reg: 0.004 solved: 5 total time: 5.78542
 opt: 0.306 reg: 0.005 solved: 6 total time: 6.09721
 opt: 0.222 reg: 0.031 solved: 10 total time: 6.35037
 opt: 0.363 reg: 0.022 solved: 6 total time: 6.73655
 opt: 0.072 reg: 0.04 solved: 9 total time: 6.849
 opt: 0.461 reg: 0.065 solved: 10 total time: 7.37477
 opt: 0.175 reg: 0.049 solved: 7 total time: 7.60009
 opt: 0.115 reg: 0.025 solved: 12 total time: 7.7411
 opt: 0.301 reg: 0.003 solved: 6 total time: 8.04598
 opt: 0.848 reg: 0.006 solved: 14 total time: 8.8997
 opt: 0.078 reg: 0.009 solved: 8 total time: 8.98784
 opt: 0.432 reg: 0.014 solved: 10 total time: 9.43445
 opt: 0.51 reg: 0.011 solved: 10 total time: 9.95643
 opt: 0.308 reg: 0.011 solved: 8 total time: 10.2766
 opt: 0.132 reg: 0.015 solved: 10 total time: 10.4238
 opt: 0.412 reg: 0.006 solved: 6 total time: 10.843
 opt: 0.073 reg: 0.007 solved: 8 total time: 10.9238
 opt: 0.418 reg: 0.01 solved: 8 total time: 11.3519
 opt: 0.36 reg: 0.008 solved: 8 total time: 11.7201
 opt: 0.469 reg: 0.022 solved: 10 total time: 12.2115
 opt: 0.325 reg: 0.021 solved: 10 total time: 12.5586
 opt: 0.063 reg: 0.029 solved: 11 total time: 12.652
 opt: 0.469 reg: 0.009 solved: 8 total time: 13.1314
 opt: 0.435 reg: 0.016 solved: 10 total time: 13.5837
 opt: 0.555 reg: 0.028 solved: 12 total time: 14.1672
 opt: 0.556 reg: 0.024 solved: 8 total time: 14.7471
 opt: 0.565 reg: 0.027 solved: 10 total time: 15.3404
 opt: 0.815 reg: 0.029 solved: 12 total time: 16.1851
 opt: 0.556 reg: 0.024 solved: 10 total time: 16.7661
 opt: 0.623 reg: 0.018 solved: 10 total time: 17.4075
 opt: 0.163 reg: 0.026 solved: 12 total time: 17.5974
 opt: 0.297 reg: 0.007 solved: 8 total time: 17.9023
 opt: 0.507 reg: 0.008 solved: 10 total time: 18.4181
 opt: 0.535 reg: 0.018 solved: 14 total time: 18.9724
 opt: 0.618 reg: 0.033 solved: 12 total time: 19.6231
 opt: 0.566 reg: 0.03 solved: 10 total time: 20.2201
 opt: 0.686 reg: 0.028 solved: 12 total time: 20.9354
 opt: 0.422 reg: 0.025 solved: 8 total time: 21.383
 opt: 0.411 reg: 0.023 solved: 10 total time: 21.8171
 opt: 0.535 reg: 0.016 solved: 10 total time: 22.3691
 opt: 0.299 reg: 0.015 solved: 10 total time: 22.6843
 opt: 0.493 reg: 0.026 solved: 12 total time: 23.2036
 opt: 0.445 reg: 0.018 solved: 10 total time: 23.6676
 opt: 0.442 reg: 0.019 solved: 12 total time: 24.129
 opt: 1.041 reg: 0.021 solved: 12 total time: 25.1906
 opt: 0.671 reg: 0.026 solved: 14 total time: 25.8882
 opt: 0.583 reg: 0.022 solved: 12 total time: 26.4941
 opt: 0.528 reg: 0.018 solved: 12 total time: 27.0406
 opt: 0.611 reg: 0.019 solved: 12 total time: 27.671
 opt: 0.534 reg: 0.02 solved: 14 total time: 28.2265
 opt: 0.063 reg: 0.031 solved: 13 total time: 28.3219
 opt: 0.688 reg: 0.018 solved: 12 total time: 29.0287
 opt: 0.699 reg: 0.026 solved: 14 total time: 29.7547
 opt: 0.522 reg: 0.026 solved: 12 total time: 30.3029
 opt: 0.159 reg: 0.03 solved: 14 total time: 30.4913
 opt: 0.396 reg: 0.032 solved: 12 total time: 30.92
 opt: 0.4 reg: 0.039 solved: 14 total time: 31.3593
 opt: 0.509 reg: 0.024 solved: 12 total time: 31.8926
 opt: 0.057 reg: 0.049 solved: 15 total time: 31.9999
 opt: 0.458 reg: 0.024 solved: 12 total time: 32.4827
 opt: 0.58 reg: 0.048 solved: 14 total time: 33.1115
 opt: 0.551 reg: 0.035 solved: 12 total time: 33.6989
 opt: 0.442 reg: 0.039 solved: 14 total time: 34.1799
 opt: 0.109 reg: 0.054 solved: 16 total time: 34.3434
 opt: 0.051 solved: 2147483647 total time: 34.3952
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 34.4834
Search time: 30.605s
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 s49 blaststepdone
				 fix_switch t0 s35 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s96 blaststepdone
				 fix_switch t1 s91 blaststepdone
				 fix_switch t1 s82 blaststepdone
				 fix_switch t1 s77 blaststepdone
				 fix_switch t1 s7 blaststepdone
				 fix_switch t1 s68 blaststepdone
				 fix_switch t1 s63 blaststepdone
				 fix_switch t1 s54 blaststepdone
				 fix_switch t1 s40 blaststepdone
				 fix_switch t1 s26 blaststepdone
				 fix_switch t1 s21 blaststepdone
				 fix_switch t1 s12 blaststepdone
				 fix_switch t1 s110 blaststepdone
				 fix_switch t1 s105 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 92
Solved by optimal solver: 92
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 92
Solved follower subproblems: 92
Optimal solver time: 28.597s
Cost-bounded solver time: 0s
Follower search time: 28.597s
Total time: 34.5341s
Optimal engine:
Peak memory: 679488 KB
@@@T40122@@@
Done!
real 40.34
user 38.34
sys 1.82
