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/Renater2008_3.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/Renater2008_3.pddl
Parsing...
Parsing: [0.020s CPU, 0.063s 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.011s wall-clock]
Generated 173 rules.
Computing model... [0.240s CPU, 0.249s wall-clock]
4451 relevant atoms
7520 auxiliary atoms
11971 final queue length
15670 total queue pushes
Completing instantiation... [0.240s CPU, 0.250s wall-clock]
Instantiating: [0.530s CPU, 0.530s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.011s 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...
258 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.002s wall-clock]
Computing fact groups: [0.010s CPU, 0.019s 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.020s CPU, 0.023s wall-clock]
Translating task: [0.290s CPU, 0.299s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
2 operators removed
4 propositions removed
Detecting unreachable propositions: [0.050s CPU, 0.044s wall-clock]
Translator variables: 260
Translator derived variables: 0
Translator facts: 558
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 43
Translator operators: 3547
Translator axioms: 0
Translator task size: 19979
Translator peak memory: 33480 KB
Writing output... [0.060s CPU, 0.058s wall-clock]
Done! [0.980s CPU, 1.027s 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.
260 variables of 260 necessary
0 of 3 mutex groups necessary.
3547 of 3547 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 558 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=67600, notReached=242644, spurious=1120
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=301252, notReached=8992, spurious=1120
14 operators are spurious because were not triggered
H^2 mutexes added fw: 8992, unreachable: 0
0 of 3533 operators detected as spurious
Total mutex and disambiguation time: 0.914798 iterations: 2
4496 of 4496 mutex groups necessary.
3533 of 3547 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 3533
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 260
4496 of 4496 mutex groups necessary.
3533 of 3533 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
260 variables of 260 of 260 necessary
The causal graph is not acyclic.
260 variables of 260 necessary
4496 of 4496 mutex groups necessary.
3533 of 3533 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 260
Preprocessor facts: 558
Preprocessor derived variables: 0
Preprocessor operators: 3533
Preprocessor mutex groups: 4496
Preprocessor task size: 28858
Writing output...
Preprocessor time: 1.11276s
Preprocessor peak memory: 13020 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.000294888s]
Simplifying transitions... done!
done reading input! [t=0.0992269s]
building causal graph...done! [t=0.102069s]
packing state variables...Variables: 260
Bytes per state: 36
done! [t=0.102292s]
done initalizing global data [t=0.102295s]
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() = 209
leader_vars_follower_preconditioned.size() = 208
follower_operators.size() = 3324
leader_operators.size() = 209
Initializing Symbolic Variables
Sym variable order: 1 17 26 149 113 53 41 242 173 65 77 101 14 197 185 161 137 89 125 22 27 24 88 20 172 100 148 112 64 124 160 13 136 196 76 40 52 21 168 238 184 192 108 144 132 60 72 180 120 9 156 222 151 48 36 84 96 31 67 79 103 43 91 4 163 187 127 202 115 139 55 58 175 94 154 70 82 178 46 7 166 214 142 106 190 130 118 117 34 189 33 153 69 165 57 6 129 105 93 177 45 141 81 145 2 49 193 210 73 37 133 10 61 181 157 85 121 97 226 114 109 90 169 138 198 126 174 3 42 186 78 102 150 162 66 30 54 195 135 171 183 111 159 51 123 12 87 99 63 147 75 234 83 191 47 71 155 39 179 119 8 107 143 95 131 167 218 35 59 28 23 152 19 25 16 92 116 44 188 56 104 5 164 176 32 128 68 80 206 140 170 110 29 134 50 74 146 182 11 230 62 98 86 38 158 122 194 18 15 227 199 219 203 235 231 223 207 215 211 243 239 257 208 204 259 248 241 247 237 244 245 0 217 200 221 233 229 253 256 254 251 258 250 225 209 224 212 213 236 240 201 205 232 228 220 216 249 246 252 255 
Num variables: 260 => 269
Initialize Symbolic Manager(538, 29739, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 190 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.164s
Starting Stackelberg bounded search...
 opt: 0.514 reg: 0 solved: 1 total time: 3.05733
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 3.0574
 opt: 0.853 reg: 0 solved: 1 total time: 3.92244
 opt: 0.099 reg: 0 solved: 1 total time: 4.02194
 opt: 0.118 reg: 0 solved: 1 total time: 4.14043
 opt: 0.119 reg: 0 solved: 1 total time: 4.26042
 opt: 0.127 reg: 0 solved: 1 total time: 4.38851
 opt: 0.13 reg: 0 solved: 1 total time: 4.5187
 opt: 0.124 reg: 0 solved: 1 total time: 4.64354
 opt: 0.118 reg: 0 solved: 1 total time: 4.76249
 opt: 0.118 reg: 0 solved: 1 total time: 4.88113
 opt: 0.116 reg: 0 solved: 1 total time: 4.99785
 opt: 0.116 reg: 0 solved: 1 total time: 5.11423
 opt: 0.108 reg: 0 solved: 1 total time: 5.223
 opt: 0.218 reg: 0 solved: 2 total time: 5.44109
L = 1, leader states: 8192, follower subproblems: 8192, F:100000, total time: 5.44122
 opt: 0.134 reg: 0 solved: 2 total time: 5.59372
 opt: 0.104 reg: 0 solved: 2 total time: 5.69885
L = 2, leader states: 1.06288e+06, follower subproblems: 1.06288e+06, F:100000, total time: 5.69902
 opt: 0.135 reg: 0 solved: 4 total time: 5.85104
 opt: 0.108 reg: 0 solved: 2 total time: 5.96136
 opt: 0.131 reg: 0.001 solved: 4 total time: 6.09443
 opt: 0.129 reg: 0.002 solved: 3 total time: 6.22741
 opt: 0.136 reg: 0.002 solved: 3 total time: 6.36735
 opt: 0.204 reg: 0.003 solved: 4 total time: 6.57696
L = 3, leader states: 3.35544e+07, follower subproblems: 3.35544e+07, F:100000, total time: 6.57812
 opt: 0.119 reg: 0.004 solved: 3 total time: 6.71919
 opt: 0.103 reg: 0.005 solved: 2 total time: 6.82934
 opt: 0.134 reg: 0.023 solved: 6 total time: 6.98713
 opt: 0.147 reg: 0.002 solved: 4 total time: 7.13775
 opt: 0.129 reg: 0.003 solved: 4 total time: 7.27201
 opt: 0.135 reg: 0.004 solved: 4 total time: 7.41333
 opt: 0.588 reg: 0.005 solved: 4 total time: 8.00832
 opt: 1.571 reg: 0.003 solved: 4 total time: 9.58255
 opt: 0.298 reg: 0.003 solved: 4 total time: 9.88458
 opt: 0.323 reg: 0.003 solved: 4 total time: 10.2126
 opt: 0.294 reg: 0.007 solved: 4 total time: 10.5149
 opt: 0.235 reg: 0.012 solved: 6 total time: 10.764
 opt: 0.238 reg: 0.027 solved: 5 total time: 11.0301
 opt: 0.274 reg: 0.008 solved: 6 total time: 11.3143
 opt: 0.313 reg: 0.006 solved: 6 total time: 11.635
 opt: 0.249 reg: 0.013 solved: 5 total time: 11.8991
 opt: 0.319 reg: 0.016 solved: 6 total time: 12.2363
 opt: 0.34 reg: 0.011 solved: 6 total time: 12.5885
 opt: 0.305 reg: 0.014 solved: 4 total time: 12.9091
 opt: 0.333 reg: 0.014 solved: 6 total time: 13.2578
 opt: 0.235 reg: 0.039 solved: 9 total time: 13.5332
 opt: 0.339 reg: 0.038 solved: 6 total time: 13.9118
 opt: 0.232 reg: 0.033 solved: 6 total time: 14.178
 opt: 0.302 reg: 0.006 solved: 6 total time: 14.4879
 opt: 0.371 reg: 0.002 solved: 6 total time: 14.8624
 opt: 0.244 reg: 0.012 solved: 8 total time: 15.1209
 opt: 0.314 reg: 0.005 solved: 6 total time: 15.4418
 opt: 0.347 reg: 0.002 solved: 6 total time: 15.793
 opt: 0.288 reg: 0.005 solved: 6 total time: 16.088
 opt: 0.315 reg: 0.494 solved: 6 total time: 16.8984
 opt: 1.467 reg: 0.008 solved: 6 total time: 18.3739
 opt: 0.373 reg: 0.006 solved: 6 total time: 18.7549
 opt: 0.384 reg: 0.007 solved: 6 total time: 19.1479
 opt: 0.259 reg: 0.016 solved: 9 total time: 19.4257
 opt: 0.314 reg: 0.005 solved: 6 total time: 19.7459
 opt: 0.346 reg: 0.007 solved: 6 total time: 20.1007
 opt: 0.287 reg: 0.014 solved: 6 total time: 20.4032
 opt: 0.417 reg: 0.021 solved: 6 total time: 20.8428
 opt: 0.252 reg: 0.052 solved: 8 total time: 21.1489
 opt: 0.309 reg: 0.005 solved: 8 total time: 21.4653
 opt: 0.321 reg: 0.009 solved: 6 total time: 21.7971
 opt: 0.381 reg: 0.013 solved: 6 total time: 22.1934
 opt: 0.332 reg: 0.012 solved: 8 total time: 22.5391
 opt: 0.388 reg: 0.007 solved: 8 total time: 22.9355
 opt: 0.705 reg: 0.023 solved: 8 total time: 23.664
 opt: 1.431 reg: 0.006 solved: 6 total time: 25.1018
 opt: 0.36 reg: 0.003 solved: 6 total time: 25.467
 opt: 0.243 reg: 0.01 solved: 6 total time: 25.7223
 opt: 0.354 reg: 0.018 solved: 8 total time: 26.0958
 opt: 0.301 reg: 0.034 solved: 8 total time: 26.4323
 opt: 0.383 reg: 0.011 solved: 6 total time: 26.8281
 opt: 0.378 reg: 0.005 solved: 6 total time: 27.2132
 opt: 0.251 reg: 0.027 solved: 10 total time: 27.4924
 opt: 0.387 reg: 0.01 solved: 6 total time: 27.8916
 opt: 0.409 reg: 0.031 solved: 8 total time: 28.3334
 opt: 0.358 reg: 0.001 solved: 8 total time: 28.6941
 opt: 0.411 reg: 0.002 solved: 8 total time: 29.1087
 opt: 0.418 reg: 0.002 solved: 8 total time: 29.5301
 opt: 0.401 reg: 0.002 solved: 8 total time: 29.9343
 opt: 0.341 reg: 0.001 solved: 8 total time: 30.2779
 opt: 0.315 reg: 0.003 solved: 6 total time: 30.597
 opt: 0.4 reg: 0.005 solved: 8 total time: 31.0042
 opt: 0.353 reg: 0.003 solved: 8 total time: 31.3616
 opt: 0.35 reg: 0.006 solved: 6 total time: 31.7192
 opt: 0.373 reg: 0.007 solved: 6 total time: 32.1005
 opt: 0.385 reg: 0.009 solved: 8 total time: 32.4963
 opt: 0.448 reg: 0.006 solved: 8 total time: 32.9527
 opt: 0.381 reg: 0.006 solved: 8 total time: 33.3409
 opt: 0.246 reg: 0.019 solved: 8 total time: 33.6077
 opt: 0.423 reg: 0.028 solved: 8 total time: 34.0608
 opt: 0.326 reg: 0.015 solved: 8 total time: 34.4039
 opt: 0.326 reg: 0.016 solved: 8 total time: 34.7473
 opt: 0.316 reg: 0.026 solved: 8 total time: 35.091
 opt: 0.413 reg: 0.026 solved: 8 total time: 35.5317
 opt: 0.783 reg: 0.016 solved: 8 total time: 36.3321
 opt: 0.367 reg: 0.029 solved: 6 total time: 36.7298
 opt: 0.4 reg: 0.016 solved: 8 total time: 37.1473
 opt: 0.363 reg: 0.026 solved: 8 total time: 37.5377
 opt: 0.306 reg: 0.026 solved: 8 total time: 37.8718
 opt: 0.412 reg: 0.005 solved: 8 total time: 38.2906
 opt: 0.435 reg: 0.004 solved: 8 total time: 38.7313
 opt: 0.434 reg: 0.004 solved: 8 total time: 39.1706
 opt: 0.407 reg: 0.003 solved: 8 total time: 39.5831
 opt: 0.333 reg: 0.007 solved: 8 total time: 39.925
 opt: 0.31 reg: 0.012 solved: 8 total time: 40.2483
 opt: 0.448 reg: 0.013 solved: 8 total time: 40.7109
 opt: 0.407 reg: 0.011 solved: 8 total time: 41.1296
 opt: 1.781 reg: 0.028 solved: 12 total time: 42.9384
 opt: 0.454 reg: 0.01 solved: 8 total time: 43.4039
 opt: 0.416 reg: 0.005 solved: 8 total time: 43.8267
 opt: 0.475 reg: 0.006 solved: 8 total time: 44.3086
 opt: 0.481 reg: 0.018 solved: 8 total time: 44.8091
 opt: 0.427 reg: 0.03 solved: 8 total time: 45.2677
 opt: 0.458 reg: 0.041 solved: 8 total time: 45.7688
 opt: 0.253 reg: 0.009 solved: 10 total time: 46.0319
 opt: 0.426 reg: 0.015 solved: 8 total time: 46.4752
 opt: 0.417 reg: 0.011 solved: 8 total time: 46.9044
 opt: 0.356 reg: 0.008 solved: 8 total time: 47.2699
 opt: 0.425 reg: 0.008 solved: 8 total time: 47.7046
 opt: 0.473 reg: 0.024 solved: 8 total time: 48.2033
 opt: 0.465 reg: 0.041 solved: 8 total time: 48.7102
 opt: 0.324 reg: 0.035 solved: 8 total time: 49.0705
 opt: 0.449 reg: 0.009 solved: 8 total time: 49.53
 opt: 0.383 reg: 0.008 solved: 8 total time: 49.923
 opt: 0.408 reg: 0.006 solved: 8 total time: 50.3385
 opt: 0.438 reg: 0.006 solved: 8 total time: 50.7846
 opt: 0.377 reg: 0.008 solved: 8 total time: 51.1718
 opt: 0.257 reg: 0.018 solved: 11 total time: 51.4485
 opt: 0.317 reg: 0.014 solved: 8 total time: 51.7817
 opt: 0.346 reg: 0.006 solved: 8 total time: 52.1357
 opt: 0.397 reg: 0.007 solved: 8 total time: 52.5416
 opt: 0.28 solved: 2147483647 total time: 52.8224
L = 4, leader states: 4.88281e+08, follower subproblems: 4.88281e+08, F:2147483647, total time: 52.8761
Search time: 50.413s
Total number of leader states: 7.05325e+09
Total number of follower subproblems: 4.61502e+09
Pareto-frontier size: 1
Pareto-frontier: (4,2147483647) 
	 fix ops costs: 4, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s90 blaststepdone
				 fix_switch t1 s73 blaststepdone
				 fix_switch t1 s57 blaststepdone
				 fix_switch t1 s24 blaststepdone
				 fix_switch t1 s123 blaststepdone
				 fix_switch t1 s106 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s87 blaststepdone
				 fix_switch t2 s7 blaststepdone
				 fix_switch t2 s54 blaststepdone
				 fix_switch t2 s40 blaststepdone
				 fix_switch t2 s21 blaststepdone
				 fix_switch t2 s120 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 134
Solved by optimal solver: 134
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 134
Solved follower subproblems: 134
Optimal solver time: 48.097s
Cost-bounded solver time: 0s
Follower search time: 48.097s
Total time: 52.8947s
Optimal engine:
Peak memory: 635208 KB
@@@T55293@@@
Done!
real 55.55
user 54.63
sys 0.63
