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/Geant2009_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/Geant2009_3.pddl
Parsing...
Parsing: [0.010s CPU, 0.014s 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.011s wall-clock]
Preparing model... [0.010s CPU, 0.009s wall-clock]
Generated 173 rules.
Computing model... [0.230s CPU, 0.225s wall-clock]
4414 relevant atoms
7421 auxiliary atoms
11835 final queue length
15510 total queue pushes
Completing instantiation... [0.230s CPU, 0.226s wall-clock]
Instantiating: [0.490s CPU, 0.480s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.010s 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...
246 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.020s CPU, 0.017s 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.020s CPU, 0.022s wall-clock]
Translating task: [0.300s CPU, 0.305s 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.042s wall-clock]
Translator variables: 248
Translator derived variables: 0
Translator facts: 534
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 43
Translator operators: 3525
Translator axioms: 0
Translator task size: 19822
Translator peak memory: 33264 KB
Writing output... [0.040s CPU, 0.047s wall-clock]
Done! [0.920s CPU, 0.919s 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.
248 variables of 248 necessary
0 of 3 mutex groups necessary.
3525 of 3525 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 534 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=61504, notReached=222556, spurious=1096
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=274364, notReached=9696, spurious=1096
12 operators are spurious because were not triggered
H^2 mutexes added fw: 9696, unreachable: 0
0 of 3513 operators detected as spurious
Total mutex and disambiguation time: 0.788466 iterations: 2
4848 of 4848 mutex groups necessary.
3513 of 3525 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 3513
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 248
4848 of 4848 mutex groups necessary.
3513 of 3513 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
248 variables of 248 of 248 necessary
The causal graph is not acyclic.
248 variables of 248 necessary
4848 of 4848 mutex groups necessary.
3513 of 3513 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 248
Preprocessor facts: 534
Preprocessor derived variables: 0
Preprocessor operators: 3513
Preprocessor mutex groups: 4848
Preprocessor task size: 29414
Writing output...
Preprocessor time: 0.981682s
Preprocessor peak memory: 13172 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.000355195s]
Simplifying transitions... done!
done reading input! [t=0.0924661s]
building causal graph...done! [t=0.0949207s]
packing state variables...Variables: 248
Bytes per state: 36
done! [t=0.0951131s]
done initalizing global data [t=0.0951183s]
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() = 3304
leader_operators.size() = 209
Initializing Symbolic Variables
Sym variable order: 1 33 207 153 177 69 57 81 93 6 117 141 105 45 165 129 189 17 25 21 16 143 179 20 35 95 213 59 155 167 8 191 83 47 71 107 119 41 131 24 125 29 185 173 161 14 149 231 89 101 137 65 77 197 113 53 18 15 68 104 19 176 188 92 44 32 128 5 140 164 56 204 80 115 152 22 116 187 127 175 55 151 139 67 4 201 79 163 43 91 122 31 222 103 194 98 158 146 86 182 170 11 50 110 2 38 62 74 49 97 193 133 134 85 169 145 37 10 181 73 61 121 157 219 192 84 109 216 180 48 120 60 9 168 96 144 132 156 108 160 36 72 184 228 88 172 148 52 13 64 76 196 40 100 124 99 87 136 39 112 135 111 225 12 183 171 159 63 123 147 195 51 78 75 42 90 150 198 66 162 114 3 30 126 186 174 102 54 138 28 34 178 82 142 94 154 106 7 130 58 190 210 166 70 46 23 118 26 27 214 220 199 208 226 232 223 247 202 211 217 205 229 239 0 209 200 235 212 230 233 234 238 244 224 246 218 221 215 227 206 203 243 236 242 241 237 240 245 
Num variables: 248 => 257
Initialize Symbolic Manager(514, 31128, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 482 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.4s
Starting Stackelberg bounded search...
 opt: 1.189 reg: 0 solved: 1 total time: 4.11275
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 4.11285
 opt: 0.824 reg: 0 solved: 1 total time: 4.94697
 opt: 0.277 reg: 0 solved: 1 total time: 5.22391
 opt: 0.265 reg: 0 solved: 1 total time: 5.48951
 opt: 0.275 reg: 0 solved: 1 total time: 5.76519
 opt: 0.274 reg: 0 solved: 1 total time: 6.03968
 opt: 0.304 reg: 0 solved: 1 total time: 6.34419
 opt: 0.272 reg: 0 solved: 1 total time: 6.61662
 opt: 0.269 reg: 0 solved: 1 total time: 6.88566
 opt: 0.266 reg: 0 solved: 1 total time: 7.15213
 opt: 0.278 reg: 0 solved: 1 total time: 7.42992
 opt: 0.276 reg: 0 solved: 1 total time: 7.70625
 opt: 0.325 reg: 0 solved: 1 total time: 8.03113
 opt: 0.364 reg: 0 solved: 2 total time: 8.39541
L = 1, leader states: 8192, follower subproblems: 8192, F:100000, total time: 8.39553
 opt: 0.318 reg: 0 solved: 3 total time: 8.73486
 opt: 0.323 reg: 0 solved: 2 total time: 9.05836
 opt: 0.349 reg: 0 solved: 3 total time: 9.40788
 opt: 0.384 reg: 0 solved: 3 total time: 9.79248
L = 2, leader states: 1.06288e+06, follower subproblems: 1.06288e+06, F:100000, total time: 9.79297
 opt: 0.31 reg: 0.001 solved: 4 total time: 10.123
 opt: 0.296 reg: 0.005 solved: 6 total time: 10.4246
 opt: 0.298 reg: 0.004 solved: 3 total time: 10.7272
 opt: 0.324 reg: 0.01 solved: 6 total time: 11.0627
 opt: 0.38 reg: 0.009 solved: 4 total time: 11.4521
 opt: 0.328 reg: 0.007 solved: 6 total time: 11.7869
 opt: 0.306 reg: 0.017 solved: 5 total time: 12.1106
 opt: 0.362 reg: 0.016 solved: 5 total time: 12.4894
 opt: 0.359 reg: 0.011 solved: 3 total time: 12.8597
 opt: 0.392 reg: 0.018 solved: 6 total time: 13.2707
 opt: 0.333 reg: 0.008 solved: 9 total time: 13.6129
 opt: 0.429 reg: 0.001 solved: 9 total time: 14.0436
 opt: 0.386 reg: 0.001 solved: 6 total time: 14.4312
 opt: 0.321 reg: 0.005 solved: 8 total time: 14.7573
 opt: 0.342 reg: 0.014 solved: 7 total time: 15.1137
 opt: 0.41 reg: 0.019 solved: 9 total time: 15.5433
 opt: 0.434 reg: 0.019 solved: 6 total time: 15.9963
 opt: 0.369 reg: 0.022 solved: 7 total time: 16.388
 opt: 0.435 reg: 0.023 solved: 9 total time: 16.8461
 opt: 0.363 reg: 0.019 solved: 11 total time: 17.2291
 opt: 0.48 reg: 0.012 solved: 8 total time: 17.7198
 opt: 0.377 reg: 0.013 solved: 9 total time: 18.1101
 opt: 0.461 reg: 0.041 solved: 7 total time: 18.6124
 opt: 0.399 reg: 0.045 solved: 11 total time: 19.0571
 opt: 0.446 reg: 0.027 solved: 7 total time: 19.5313
 opt: 0.466 reg: 0.028 solved: 8 total time: 20.0258
 opt: 0.342 solved: 2147483647 total time: 20.3679
L = 3, leader states: 3.35544e+07, follower subproblems: 3.35544e+07, F:2147483647, total time: 20.4248
Search time: 17.548s
Total number of leader states: 7.67047e+08
Total number of follower subproblems: 5.05594e+08
Pareto-frontier size: 1
Pareto-frontier: (3,2147483647) 
	 fix ops costs: 3, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_switch t0 s94 blaststepdone
				 fix_switch t0 s36 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s91 blaststepdone
				 fix_switch t1 s81 blaststepdone
				 fix_switch t1 s7 blaststepdone
				 fix_switch t1 s65 blaststepdone
				 fix_switch t1 s62 blaststepdone
				 fix_switch t1 s4 blaststepdone
				 fix_switch t1 s33 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s52 blaststepdone
				 fix_switch t2 s23 blaststepdone
				 fix_switch t2 s110 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 45
Solved by optimal solver: 45
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 45
Solved follower subproblems: 45
Optimal solver time: 16.98s
Cost-bounded solver time: 0s
Follower search time: 16.98s
Total time: 20.4457s
Optimal engine:
Peak memory: 548244 KB
@@@T22560@@@
Done!
real 22.81
user 21.38
sys 1.22
