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/SwitchL3_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/SwitchL3_4.pddl
Parsing...
Parsing: [0.020s CPU, 0.015s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s 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.520s CPU, 0.511s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.490s CPU, 0.487s wall-clock]
Instantiating: [1.040s CPU, 1.038s 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.001s 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.026s 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.049s wall-clock]
Translating task: [0.660s CPU, 0.658s 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.085s 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.099s wall-clock]
Done! [1.960s CPU, 1.952s 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=674208, notReached=19576, spurious=1772
16 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: 3.13095 iterations: 2
9788 of 9788 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
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.59064s
Preprocessor peak memory: 27736 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.000281273s]
Simplifying transitions... done!
done reading input! [t=0.196874s]
building causal graph...done! [t=0.201687s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.201818s]
done initalizing global data [t=0.201823s]
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 384 376 387 375 388 380 382 377 340 346 370 343 373 337 358 352 390 367 379 383 381 374 361 349 355 328 378 364 385 334 0 331 389 348 342 345 369 360 333 357 391 366 351 327 354 336 339 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.579s
Starting Stackelberg bounded search...
 opt: 0.006 reg: 0 solved: 1 total time: 3.87434
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 3.87441
 opt: 0.003 reg: 0 solved: 1 total time: 3.90395
 opt: 0.011 reg: 0 solved: 1 total time: 3.91604
 opt: 0.007 reg: 0 solved: 1 total time: 3.92344
 opt: 0.006 reg: 0 solved: 1 total time: 3.93001
 opt: 0.01 reg: 0 solved: 1 total time: 3.94097
 opt: 0.006 reg: 0 solved: 1 total time: 3.94808
 opt: 0.008 reg: 0 solved: 1 total time: 3.95694
 opt: 0.012 reg: 0 solved: 1 total time: 3.96985
 opt: 0.009 reg: 0 solved: 1 total time: 3.9791
 opt: 0.014 reg: 0 solved: 1 total time: 3.99326
 opt: 0.01 reg: 0 solved: 1 total time: 4.00354
 opt: 0.012 reg: 0 solved: 1 total time: 4.01627
 opt: 0.015 reg: 0 solved: 1 total time: 4.03248
 opt: 0.01 reg: 0 solved: 1 total time: 4.04335
 opt: 0.013 reg: 0 solved: 1 total time: 4.05664
 opt: 0.011 reg: 0 solved: 1 total time: 4.06871
 opt: 0.017 reg: 0 solved: 2 total time: 4.08686
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 4.087
 opt: 0.075 reg: 0 solved: 2 total time: 4.19634
 opt: 0.054 reg: 0 solved: 2 total time: 4.25147
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 4.25167
 opt: 0.056 reg: 0 solved: 3 total time: 4.35351
 opt: 0.089 reg: 0 solved: 3 total time: 4.44413
 opt: 0.05 reg: 0 solved: 2 total time: 4.49612
 opt: 0.073 reg: 0 solved: 3 total time: 4.57063
 opt: 0.06 reg: 0.001 solved: 5 total time: 4.63335
 opt: 0.07 reg: 0.003 solved: 4 total time: 4.70655
 opt: 0.131 reg: 0.002 solved: 4 total time: 4.84005
 opt: 0.147 reg: 0.002 solved: 4 total time: 4.98941
 opt: 0.049 reg: 0.008 solved: 6 total time: 5.04756
 opt: 0.179 reg: 0.007 solved: 5 total time: 5.23454
 opt: 0.21 reg: 0.008 solved: 6 total time: 5.45367
 opt: 0.073 reg: 0.016 solved: 7 total time: 5.54456
 opt: 0.098 reg: 0.018 solved: 7 total time: 5.66248
 opt: 0.057 reg: 0.015 solved: 10 total time: 5.73595
 opt: 0.074 reg: 0.006 solved: 8 total time: 5.81664
 opt: 0.638 reg: 0.009 solved: 8 total time: 6.46359
 opt: 0.076 reg: 0.013 solved: 9 total time: 6.5535
 opt: 0.109 reg: 0.015 solved: 9 total time: 6.67875
 opt: 0.35 reg: 0.015 solved: 10 total time: 7.04517
 opt: 0.083 reg: 0.022 solved: 11 total time: 7.15201
 opt: 0.056 reg: 0.033 solved: 12 total time: 7.24159
 opt: 0.427 reg: 0.039 solved: 12 total time: 7.70884
 opt: 0.097 reg: 0.052 solved: 13 total time: 7.85915
 opt: 0.145 reg: 0.047 solved: 11 total time: 8.05197
 opt: 0.098 reg: 0.049 solved: 14 total time: 8.19996
 opt: 0.145 reg: 0.033 solved: 13 total time: 8.37961
 opt: 0.146 reg: 0.054 solved: 14 total time: 8.58001
 opt: 0.058 reg: 0.074 solved: 15 total time: 8.71361
 opt: 0.532 reg: 0.082 solved: 15 total time: 9.32751
 opt: 0.107 reg: 0.044 solved: 17 total time: 9.47967
 opt: 0.117 reg: 0.039 solved: 16 total time: 9.63612
 opt: 0.165 reg: 0.046 solved: 17 total time: 9.84807
 opt: 0.175 reg: 0.038 solved: 16 total time: 10.0617
 opt: 0.037 solved: 2147483647 total time: 10.0996
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 10.1633
Search time: 6.347s
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 s89 blaststepdone
				 fix_switch t1 s86 blaststepdone
				 fix_switch t1 s7 blaststepdone
				 fix_switch t1 s48 blaststepdone
				 fix_switch t1 s45 blaststepdone
				 fix_switch t1 s4 blaststepdone
				 fix_switch t1 s294 blaststepdone
				 fix_switch t1 s291 blaststepdone
				 fix_switch t1 s253 blaststepdone
				 fix_switch t1 s250 blaststepdone
				 fix_switch t1 s212 blaststepdone
				 fix_switch t1 s209 blaststepdone
				 fix_switch t1 s171 blaststepdone
				 fix_switch t1 s168 blaststepdone
				 fix_switch t1 s130 blaststepdone
				 fix_switch t1 s127 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 54
Solved by optimal solver: 54
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 54
Solved follower subproblems: 54
Optimal solver time: 5.286s
Cost-bounded solver time: 0s
Follower search time: 5.286s
Total time: 10.2105s
Optimal engine:
Peak memory: 677836 KB
@@@T15987@@@
Done!
real 16.19
user 15.37
sys 0.68
