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/TataNld_2.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/TataNld_2.pddl
Parsing...
Parsing: [0.010s CPU, 0.013s 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.020s CPU, 0.011s wall-clock]
Generated 173 rules.
Computing model... [0.340s CPU, 0.342s wall-clock]
6231 relevant atoms
10157 auxiliary atoms
16388 final queue length
21723 total queue pushes
Completing instantiation... [0.360s CPU, 0.361s wall-clock]
Instantiating: [0.750s CPU, 0.736s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.012s 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...
318 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.010s CPU, 0.003s wall-clock]
Computing fact groups: [0.020s CPU, 0.022s 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.030s CPU, 0.033s wall-clock]
Translating task: [0.420s CPU, 0.418s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.050s CPU, 0.058s wall-clock]
Translator variables: 320
Translator derived variables: 0
Translator facts: 684
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 49
Translator operators: 5129
Translator axioms: 0
Translator task size: 28770
Translator peak memory: 40784 KB
Writing output... [0.070s CPU, 0.069s wall-clock]
Done! [1.340s CPU, 1.334s 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.
320 variables of 320 necessary
0 of 3 mutex groups necessary.
5129 of 5129 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 684 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=102400, notReached=364034, spurious=1422
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=452846, notReached=13588, spurious=1422
16 operators are spurious because were not triggered
H^2 mutexes added fw: 13588, unreachable: 0
0 of 5113 operators detected as spurious
Total mutex and disambiguation time: 1.69478 iterations: 2
6794 of 6794 mutex groups necessary.
5113 of 5129 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 5113
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 320
6794 of 6794 mutex groups necessary.
5113 of 5113 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
320 variables of 320 of 320 necessary
The causal graph is not acyclic.
320 variables of 320 necessary
6794 of 6794 mutex groups necessary.
5113 of 5113 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 320
Preprocessor facts: 684
Preprocessor derived variables: 0
Preprocessor operators: 5113
Preprocessor mutex groups: 6794
Preprocessor task size: 42228
Writing output...
Preprocessor time: 1.98032s
Preprocessor peak memory: 18916 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.000355347s]
Simplifying transitions... done!
done reading input! [t=0.137385s]
building causal graph...done! [t=0.141005s]
packing state variables...Variables: 320
Bytes per state: 44
done! [t=0.141275s]
done initalizing global data [t=0.141279s]
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() = 271
leader_vars_follower_preconditioned.size() = 270
follower_operators.size() = 4842
leader_operators.size() = 271
Initializing Symbolic Variables
Sym variable order: 1 19 234 29 248 192 66 38 108 136 270 150 178 7 80 122 94 188 220 52 164 206 31 104 26 258 76 174 202 244 34 216 132 62 3 114 230 48 58 118 146 184 290 160 254 90 142 128 212 13 86 198 72 226 170 100 44 45 129 73 293 20 156 185 255 115 240 157 14 87 143 241 59 101 199 171 27 227 25 213 217 77 147 203 245 91 161 231 63 119 4 175 35 133 105 49 189 180 208 40 32 194 96 82 124 250 261 54 9 68 138 110 236 222 278 85 99 166 113 43 152 141 253 57 287 12 211 239 169 71 197 183 127 18 179 155 2 274 123 207 225 137 8 249 81 95 165 53 193 39 67 235 109 151 116 200 60 256 242 221 214 46 74 15 88 172 186 297 158 126 144 130 238 102 98 182 252 228 140 210 42 11 196 168 284 56 70 154 209 84 181 224 55 112 139 97 223 41 125 10 111 237 153 83 195 167 148 281 264 50 17 251 69 176 120 134 106 246 5 204 64 78 92 162 36 51 205 218 135 121 190 65 163 219 149 177 6 232 107 191 247 79 267 30 93 233 37 28 21 33 173 243 131 159 215 117 187 75 16 201 61 89 103 145 257 229 301 23 24 22 47 302 271 294 285 259 282 262 265 279 288 298 319 275 313 296 273 276 316 292 0 269 312 315 299 277 300 268 272 291 295 317 318 314 289 260 283 303 286 266 280 263 307 310 305 304 306 308 309 311 
Num variables: 320 => 331
Initialize Symbolic Manager(662, 24169, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 405 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.337s
Starting Stackelberg bounded search...
 opt: 0.113 reg: 0 solved: 1 total time: 3.12789
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 3.12796
 opt: 0.019 reg: 0 solved: 1 total time: 3.16723
 opt: 0.022 reg: 0 solved: 1 total time: 3.18954
 opt: 0.021 reg: 0 solved: 1 total time: 3.21165
 opt: 0.02 reg: 0 solved: 1 total time: 3.23266
 opt: 0.022 reg: 0 solved: 1 total time: 3.25491
 opt: 0.022 reg: 0 solved: 1 total time: 3.27749
 opt: 0.02 reg: 0 solved: 1 total time: 3.29843
 opt: 0.021 reg: 0 solved: 1 total time: 3.32055
 opt: 0.022 reg: 0 solved: 1 total time: 3.34286
 opt: 0.022 reg: 0 solved: 1 total time: 3.36587
 opt: 0.041 reg: 0 solved: 1 total time: 3.40737
 opt: 0.017 reg: 0 solved: 1 total time: 3.42552
 opt: 0.023 reg: 0 solved: 1 total time: 3.44919
 opt: 0.105 reg: 0 solved: 2 total time: 3.55466
L = 1, leader states: 32768, follower subproblems: 32768, F:100000, total time: 3.55478
 opt: 0.067 reg: 0 solved: 2 total time: 3.64531
 opt: 0.027 reg: 0 solved: 1 total time: 3.67272
 opt: 0.058 reg: 0 solved: 2 total time: 3.73142
L = 2, leader states: 9.56594e+06, follower subproblems: 9.56594e+06, F:100000, total time: 3.73161
 opt: 0.1 reg: 0 solved: 7 total time: 3.8584
 opt: 0.08 reg: 0.001 solved: 5 total time: 3.9423
 opt: 0.057 reg: 0.001 solved: 2 total time: 4.00288
 opt: 0.105 reg: 0.006 solved: 6 total time: 4.1147
 opt: 0.073 reg: 0.015 solved: 5 total time: 4.20529
 opt: 0.066 reg: 0.012 solved: 3 total time: 4.28571
 opt: 0.074 reg: 0.01 solved: 6 total time: 4.37235
 opt: 0.074 reg: 0.002 solved: 4 total time: 4.4513
 opt: 0.075 reg: 0.003 solved: 3 total time: 4.53202
 opt: 0.126 reg: 0.011 solved: 5 total time: 4.67232
 opt: 0.105 reg: 0.02 solved: 7 total time: 4.79956
 opt: 0.071 reg: 0.018 solved: 9 total time: 4.89144
 opt: 0.202 reg: 0.012 solved: 7 total time: 5.10798
 opt: 0.096 reg: 0.045 solved: 11 total time: 5.25231
 opt: 0.197 reg: 0.028 solved: 5 total time: 5.4795
 opt: 0.081 reg: 0.011 solved: 5 total time: 5.57431
 opt: 0.112 reg: 0.011 solved: 8 total time: 5.69984
 opt: 0.219 reg: 0.024 solved: 8 total time: 5.94599
 opt: 0.09 reg: 0.028 solved: 9 total time: 6.06707
 opt: 0.077 reg: 0.013 solved: 11 total time: 6.16055
 opt: 0.078 reg: 0.017 solved: 10 total time: 6.25791
 opt: 0.106 reg: 0.513 solved: 12 total time: 6.87914
 opt: 1.415 reg: 0.017 solved: 11 total time: 8.31203
 opt: 0.348 reg: 0.008 solved: 11 total time: 8.66958
 opt: 0.211 solved: 2147483647 total time: 8.88293
L = 3, leader states: 5.36871e+08, follower subproblems: 5.36871e+08, F:2147483647, total time: 8.93698
Search time: 5.957s
Total number of leader states: 1.8857e+10
Total number of follower subproblems: 1.24803e+10
Pareto-frontier size: 1
Pareto-frontier: (3,2147483647) 
	 fix ops costs: 3, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_switch t0 s47 blaststepdone
				 fix_switch t0 s192 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s97 blaststepdone
				 fix_switch t1 s94 blaststepdone
				 fix_switch t1 s52 blaststepdone
				 fix_switch t1 s40 blaststepdone
				 fix_switch t1 s286 blaststepdone
				 fix_switch t1 s284 blaststepdone
				 fix_switch t1 s242 blaststepdone
				 fix_switch t1 s239 blaststepdone
				 fix_switch t1 s197 blaststepdone
				 fix_switch t1 s185 blaststepdone
				 fix_switch t1 s141 blaststepdone
				 fix_switch t1 s139 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 43
Solved by optimal solver: 43
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 43
Solved follower subproblems: 43
Optimal solver time: 4.9s
Cost-bounded solver time: 0s
Follower search time: 4.9s
Total time: 8.96591s
Optimal engine:
Peak memory: 603828 KB
@@@T12478@@@
Done!
real 12.74
user 12.05
sys 0.49
