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/Ntt_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/Ntt_4.pddl
Parsing...
Parsing: [0.020s CPU, 0.016s 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.020s CPU, 0.012s wall-clock]
Preparing model... [0.010s CPU, 0.011s wall-clock]
Generated 173 rules.
Computing model... [0.460s CPU, 0.463s wall-clock]
8456 relevant atoms
13381 auxiliary atoms
21837 final queue length
29232 total queue pushes
Completing instantiation... [0.470s CPU, 0.467s wall-clock]
Instantiating: [0.970s CPU, 0.968s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s 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.020s 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.046s wall-clock]
Translating task: [0.630s CPU, 0.630s 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.080s 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: 49204 KB
Writing output... [0.110s CPU, 0.120s wall-clock]
Done! [1.860s CPU, 1.867s 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: 4.20997 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: 4.69153s
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.000304789s]
Simplifying transitions... done!
done reading input! [t=0.209664s]
building causal graph...done! [t=0.214295s]
packing state variables...Variables: 392
Bytes per state: 52
done! [t=0.21442s]
done initalizing global data [t=0.214424s]
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 376 379 384 385 377 382 380 383 389 334 364 367 340 343 328 346 390 352 355 370 374 386 387 337 349 331 378 358 388 373 0 361 381 345 354 348 360 339 333 369 391 357 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: 872 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.561s
Starting Stackelberg bounded search...
 opt: 0.006 reg: 0 solved: 1 total time: 4.00872
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 4.00877
 opt: 0.003 reg: 0 solved: 1 total time: 4.04427
 opt: 0.013 reg: 0 solved: 1 total time: 4.05747
 opt: 0.007 reg: 0 solved: 1 total time: 4.06541
 opt: 0.007 reg: 0 solved: 1 total time: 4.07262
 opt: 0.011 reg: 0 solved: 1 total time: 4.08424
 opt: 0.007 reg: 0 solved: 1 total time: 4.09172
 opt: 0.009 reg: 0 solved: 1 total time: 4.10087
 opt: 0.013 reg: 0 solved: 1 total time: 4.11455
 opt: 0.009 reg: 0 solved: 1 total time: 4.1245
 opt: 0.015 reg: 0 solved: 1 total time: 4.14018
 opt: 0.011 reg: 0 solved: 1 total time: 4.15164
 opt: 0.014 reg: 0 solved: 1 total time: 4.16653
 opt: 0.013 reg: 0 solved: 1 total time: 4.17983
 opt: 0.012 reg: 0 solved: 1 total time: 4.1921
 opt: 0.014 reg: 0 solved: 1 total time: 4.20729
 opt: 0.014 reg: 0 solved: 1 total time: 4.22156
 opt: 0.02 reg: 0 solved: 2 total time: 4.24237
L = 1, leader states: 131072, follower subproblems: 131072, F:100000, total time: 4.24251
 opt: 0.05 reg: 0 solved: 2 total time: 4.32725
 opt: 0.069 reg: 0 solved: 2 total time: 4.39736
L = 2, leader states: 8.60934e+07, follower subproblems: 8.60934e+07, F:100000, total time: 4.39756
 opt: 0.054 reg: 0 solved: 2 total time: 4.49786
 opt: 0.088 reg: 0 solved: 3 total time: 4.58766
 opt: 0.067 reg: 0.001 solved: 5 total time: 4.65696
 opt: 0.067 reg: 0.001 solved: 4 total time: 4.72653
 opt: 0.243 reg: 0.001 solved: 3 total time: 4.97135
 opt: 0.103 reg: 0.002 solved: 4 total time: 5.07694
 opt: 0.226 reg: 0.002 solved: 4 total time: 5.30542
 opt: 0.075 reg: 0.003 solved: 6 total time: 5.38451
 opt: 0.091 reg: 0.013 solved: 10 total time: 5.48984
 opt: 0.111 reg: 0.017 solved: 6 total time: 5.61909
 opt: 0.088 reg: 0.02 solved: 8 total time: 5.72825
 opt: 0.411 reg: 0.003 solved: 6 total time: 6.14307
 opt: 0.159 reg: 0.002 solved: 6 total time: 6.30605
 opt: 0.075 reg: 0.005 solved: 7 total time: 6.38749
 opt: 0.62 reg: 0.007 solved: 9 total time: 7.01499
 opt: 0.138 reg: 0.014 solved: 10 total time: 7.16778
 opt: 0.106 reg: 0.026 solved: 14 total time: 7.30072
 opt: 0.129 reg: 0.009 solved: 8 total time: 7.43967
 opt: 0.11 reg: 0.024 solved: 12 total time: 7.57463
 opt: 0.535 reg: 0.023 solved: 8 total time: 8.13274
 opt: 0.346 reg: 0.018 solved: 6 total time: 8.49773
 opt: 0.134 reg: 0.022 solved: 8 total time: 8.65444
 opt: 0.313 reg: 0.017 solved: 8 total time: 8.98522
 opt: 0.242 reg: 0.036 solved: 10 total time: 9.26456
 opt: 0.227 reg: 0.029 solved: 8 total time: 9.52246
 opt: 0.627 reg: 0.019 solved: 8 total time: 10.1696
 opt: 0.565 reg: 0.03 solved: 10 total time: 10.7657
 opt: 0.113 reg: 0.054 solved: 11 total time: 10.9339
 opt: 0.157 reg: 0.015 solved: 12 total time: 11.1073
 opt: 0.189 reg: 0.012 solved: 12 total time: 11.3094
 opt: 0.147 reg: 0.016 solved: 10 total time: 11.4733
 opt: 0.456 reg: 0.013 solved: 10 total time: 11.9431
 opt: 0.64 reg: 0.019 solved: 12 total time: 12.6028
 opt: 0.525 reg: 0.017 solved: 8 total time: 13.1455
 opt: 0.441 reg: 0.011 solved: 8 total time: 13.5984
 opt: 0.523 reg: 0.014 solved: 10 total time: 14.1367
 opt: 0.119 reg: 0.037 solved: 15 total time: 14.294
 opt: 0.588 reg: 0.019 solved: 10 total time: 14.9019
 opt: 0.119 reg: 0.046 solved: 13 total time: 15.068
 opt: 0.328 reg: 0.059 solved: 12 total time: 15.4554
 opt: 0.871 reg: 0.055 solved: 12 total time: 16.3816
 opt: 0.997 reg: 0.044 solved: 10 total time: 17.4235
 opt: 0.07 reg: 0.038 solved: 16 total time: 17.5321
 opt: 0.615 reg: 0.015 solved: 10 total time: 18.1631
 opt: 0.322 reg: 0.011 solved: 10 total time: 18.497
 opt: 0.677 reg: 0.01 solved: 10 total time: 19.1847
 opt: 0.728 reg: 0.01 solved: 10 total time: 19.9234
 opt: 0.499 reg: 0.009 solved: 10 total time: 20.4323
 opt: 0.157 reg: 0.026 solved: 14 total time: 20.6162
 opt: 0.683 reg: 0.013 solved: 10 total time: 21.3135
 opt: 0.123 reg: 0.035 solved: 17 total time: 21.4728
 opt: 0.931 reg: 0.019 solved: 12 total time: 22.4235
 opt: 0.662 reg: 0.016 solved: 12 total time: 23.1028
 opt: 0.669 reg: 0.031 solved: 10 total time: 23.8034
 opt: 0.556 reg: 0.026 solved: 10 total time: 24.3862
 opt: 0.277 reg: 0.04 solved: 14 total time: 24.7042
 opt: 0.275 reg: 0.005 solved: 12 total time: 24.9853
 opt: 0.839 reg: 0.005 solved: 12 total time: 25.8302
 opt: 0.058 solved: 2147483647 total time: 25.8886
L = 3, leader states: 8.58993e+09, follower subproblems: 8.58993e+09, F:2147483647, total time: 26.0006
Search time: 22.064s
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 s82 blaststepdone
				 fix_switch t1 s81 blaststepdone
				 fix_switch t1 s40 blaststepdone
				 fix_switch t1 s327 blaststepdone
				 fix_switch t1 s287 blaststepdone
				 fix_switch t1 s286 blaststepdone
				 fix_switch t1 s246 blaststepdone
				 fix_switch t1 s245 blaststepdone
				 fix_switch t1 s205 blaststepdone
				 fix_switch t1 s204 blaststepdone
				 fix_switch t1 s164 blaststepdone
				 fix_switch t1 s163 blaststepdone
				 fix_switch t1 s122 blaststepdone
				 fix_switch t1 s0 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s41 blaststepdone
				 fix_switch t2 s123 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 79
Solved by optimal solver: 79
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 79
Solved follower subproblems: 79
Optimal solver time: 20.621s
Cost-bounded solver time: 0s
Follower search time: 20.621s
Total time: 26.0488s
Optimal engine:
Peak memory: 677468 KB
@@@T32832@@@
Done!
real 33.03
user 32.14
sys 0.75
