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/BtNorthAmerica_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/BtNorthAmerica_3.pddl
Parsing...
Parsing: [0.000s CPU, 0.012s 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.010s wall-clock]
Generated 173 rules.
Computing model... [0.230s CPU, 0.232s wall-clock]
4414 relevant atoms
7421 auxiliary atoms
11835 final queue length
15510 total queue pushes
Completing instantiation... [0.230s CPU, 0.231s wall-clock]
Instantiating: [0.500s CPU, 0.491s 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.290s CPU, 0.292s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.040s CPU, 0.040s 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: 33272 KB
Writing output... [0.050s CPU, 0.049s wall-clock]
Done! [0.910s CPU, 0.916s 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=274372, notReached=9688, spurious=1096
12 operators are spurious because were not triggered
H^2 mutexes added fw: 9688, unreachable: 0
0 of 3513 operators detected as spurious
Total mutex and disambiguation time: 0.76865 iterations: 2
4844 of 4844 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
4844 of 4844 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
4844 of 4844 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: 4844
Preprocessor task size: 29406
Writing output...
Preprocessor time: 0.945808s
Preprocessor peak memory: 13152 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.000353293s]
Simplifying transitions... done!
done reading input! [t=0.0937986s]
building causal graph...done! [t=0.0962751s]
packing state variables...Variables: 248
Bytes per state: 36
done! [t=0.0964634s]
done initalizing global data [t=0.0964688s]
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 242 245 239 236 243 238 241 240 218 206 224 233 203 246 215 221 212 234 235 230 200 237 227 209 0 244 220 226 199 229 205 247 232 223 217 202 208 211 214 
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.174s
Starting Stackelberg bounded search...
 opt: 0.004 reg: 0 solved: 1 total time: 2.08946
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 2.08952
 opt: 0.002 reg: 0 solved: 1 total time: 2.10604
 opt: 0.005 reg: 0 solved: 1 total time: 2.11158
 opt: 0.007 reg: 0 solved: 1 total time: 2.11959
 opt: 0.004 reg: 0 solved: 1 total time: 2.12396
 opt: 0.006 reg: 0 solved: 1 total time: 2.13008
 opt: 0.007 reg: 0 solved: 1 total time: 2.13786
 opt: 0.008 reg: 0 solved: 1 total time: 2.14675
 opt: 0.006 reg: 0 solved: 1 total time: 2.15389
 opt: 0.009 reg: 0 solved: 1 total time: 2.16322
 opt: 0.008 reg: 0 solved: 1 total time: 2.17193
 opt: 0.007 reg: 0 solved: 1 total time: 2.17978
 opt: 0.008 reg: 0 solved: 1 total time: 2.18865
 opt: 0.013 reg: 0 solved: 2 total time: 2.20211
L = 1, leader states: 8192, follower subproblems: 8192, F:100000, total time: 2.20221
 opt: 0.034 reg: 0 solved: 2 total time: 2.25678
 opt: 0.038 reg: 0 solved: 2 total time: 2.29546
L = 2, leader states: 1.06288e+06, follower subproblems: 1.06288e+06, F:100000, total time: 2.29561
 opt: 0.041 reg: 0 solved: 2 total time: 2.35705
 opt: 0.031 reg: 0 solved: 3 total time: 2.38902
 opt: 0.039 reg: 0.001 solved: 5 total time: 2.42989
 opt: 0.04 reg: 0.002 solved: 4 total time: 2.47272
 opt: 0.09 reg: 0.003 solved: 4 total time: 2.56611
 opt: 0.038 reg: 0.007 solved: 7 total time: 2.61251
 opt: 0.047 reg: 0.011 solved: 6 total time: 2.67215
 opt: 0.043 reg: 0.03 solved: 10 total time: 2.74553
 opt: 0.035 reg: 0.046 solved: 8 total time: 2.82734
 opt: 0.077 reg: 0.002 solved: 4 total time: 2.90747
 opt: 0.055 reg: 0.003 solved: 5 total time: 2.96685
 opt: 0.116 reg: 0.003 solved: 8 total time: 3.08735
 opt: 0.088 reg: 0.002 solved: 5 total time: 3.17894
 opt: 0.053 reg: 0.003 solved: 7 total time: 3.23646
 opt: 0.097 reg: 0.002 solved: 7 total time: 3.33692
 opt: 0.137 reg: 0.002 solved: 7 total time: 3.47707
 opt: 0.039 reg: 0.008 solved: 11 total time: 3.52579
 opt: 0.116 reg: 0.01 solved: 7 total time: 3.6523
 opt: 0.19 reg: 0.012 solved: 8 total time: 3.85532
 opt: 0.14 reg: 0.005 solved: 8 total time: 4.00153
 opt: 0.128 reg: 0.007 solved: 8 total time: 4.13821
 opt: 0.042 reg: 0.024 solved: 9 total time: 4.20521
 opt: 0.043 reg: 0.04 solved: 13 total time: 4.2894
 opt: 0.064 reg: 0.012 solved: 10 total time: 4.36637
 opt: 0.064 reg: 0.029 solved: 11 total time: 4.46019
 opt: 0.091 reg: 0.024 solved: 11 total time: 4.5758
 opt: 0.15 reg: 0.017 solved: 11 total time: 4.74371
 opt: 0.103 reg: 0.02 solved: 10 total time: 4.86813
 opt: 0.067 reg: 0.046 solved: 13 total time: 4.98253
 opt: 0.184 reg: 0.038 solved: 11 total time: 5.20561
 opt: 0.158 reg: 0.027 solved: 10 total time: 5.39136
 opt: 0.097 reg: 0.041 solved: 13 total time: 5.52987
 opt: 0.161 reg: 0.033 solved: 13 total time: 5.72443
 opt: 0.107 reg: 0.027 solved: 11 total time: 5.85982
 opt: 0.066 reg: 0.092 solved: 12 total time: 6.01877
 opt: 0.162 reg: 0.016 solved: 11 total time: 6.19819
 opt: 0.025 solved: 2147483647 total time: 6.22337
L = 3, leader states: 3.35544e+07, follower subproblems: 3.35544e+07, F:2147483647, total time: 6.26346
Search time: 4.202s
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_next-step t0 t1 blaststepdone
				 fix_switch t1 s99 blaststepdone
				 fix_switch t1 s76 blaststepdone
				 fix_switch t1 s63 blaststepdone
				 fix_switch t1 s40 blaststepdone
				 fix_switch t1 s4 blaststepdone
				 fix_switch t1 s38 blaststepdone
				 fix_switch t1 s27 blaststepdone
				 fix_switch t1 s2 blaststepdone
				 fix_switch t1 s135 blaststepdone
				 fix_switch t1 s112 blaststepdone
				 fix_switch t1 s110 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s74 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 53
Solved by optimal solver: 53
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 53
Solved follower subproblems: 53
Optimal solver time: 3.39s
Cost-bounded solver time: 0s
Follower search time: 3.39s
Total time: 6.28279s
Optimal engine:
Peak memory: 542856 KB
@@@T8311@@@
Done!
real 8.61
user 7.92
sys 0.45
