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/Canerie_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/Canerie_3.pddl
Parsing...
Parsing: [0.020s CPU, 0.017s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s 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.250s CPU, 0.249s wall-clock]
4414 relevant atoms
7421 auxiliary atoms
11835 final queue length
15510 total queue pushes
Completing instantiation... [0.240s CPU, 0.236s wall-clock]
Instantiating: [0.520s CPU, 0.515s 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.010s 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.010s 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.300s CPU, 0.300s 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.045s 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.052s wall-clock]
Done! [0.960s CPU, 0.962s 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=274140, notReached=9920, spurious=1096
12 operators are spurious because were not triggered
H^2 mutexes added fw: 9920, unreachable: 0
0 of 3513 operators detected as spurious
Total mutex and disambiguation time: 0.880861 iterations: 2
4960 of 4960 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
4960 of 4960 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
4960 of 4960 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: 4960
Preprocessor task size: 29638
Writing output...
Preprocessor time: 1.0796s
Preprocessor peak memory: 13560 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.000382942s]
Simplifying transitions... done!
done reading input! [t=0.0940341s]
building causal graph...done! [t=0.0963032s]
packing state variables...Variables: 248
Bytes per state: 36
done! [t=0.0965265s]
done initalizing global data [t=0.0965322s]
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 243 245 238 234 241 239 242 237 212 233 224 203 218 246 215 206 227 235 236 230 200 244 209 221 0 240 232 220 223 226 229 247 205 202 217 199 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: 538 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.179s
Starting Stackelberg bounded search...
 opt: 0.004 reg: 0 solved: 1 total time: 2.29997
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 2.30002
 opt: 0.002 reg: 0 solved: 1 total time: 2.31434
 opt: 0.004 reg: 0 solved: 1 total time: 2.31882
 opt: 0.005 reg: 0 solved: 1 total time: 2.32476
 opt: 0.003 reg: 0 solved: 1 total time: 2.32851
 opt: 0.004 reg: 0 solved: 1 total time: 2.3332
 opt: 0.005 reg: 0 solved: 1 total time: 2.3391
 opt: 0.006 reg: 0 solved: 1 total time: 2.34609
 opt: 0.006 reg: 0 solved: 1 total time: 2.35256
 opt: 0.007 reg: 0 solved: 1 total time: 2.36034
 opt: 0.006 reg: 0 solved: 1 total time: 2.36732
 opt: 0.005 reg: 0 solved: 1 total time: 2.37345
 opt: 0.007 reg: 0 solved: 1 total time: 2.38078
 opt: 0.011 reg: 0 solved: 2 total time: 2.39292
L = 1, leader states: 8192, follower subproblems: 8192, F:100000, total time: 2.39302
 opt: 0.027 reg: 0 solved: 2 total time: 2.43852
 opt: 0.03 reg: 0 solved: 2 total time: 2.46928
L = 2, leader states: 1.06288e+06, follower subproblems: 1.06288e+06, F:100000, total time: 2.46943
 opt: 0.024 reg: 0 solved: 2 total time: 2.51049
 opt: 0.032 reg: 0 solved: 4 total time: 2.5431
 opt: 0.031 reg: 0 solved: 5 total time: 2.57551
 opt: 0.045 reg: 0.001 solved: 3 total time: 2.62219
 opt: 0.044 reg: 0.004 solved: 10 total time: 2.67196
 opt: 0.104 reg: 0.004 solved: 3 total time: 2.78088
 opt: 0.042 reg: 0.007 solved: 9 total time: 2.83089
 opt: 0.048 reg: 0.008 solved: 6 total time: 2.88727
 opt: 0.047 reg: 0.01 solved: 8 total time: 2.94573
 opt: 0.061 reg: 0.018 solved: 5 total time: 3.0256
 opt: 0.092 reg: 0.015 solved: 5 total time: 3.13432
 opt: 0.042 reg: 0.025 solved: 7 total time: 3.20229
 opt: 0.047 reg: 0.017 solved: 11 total time: 3.26702
 opt: 0.078 reg: 0.006 solved: 8 total time: 3.35163
 opt: 0.102 reg: 0.008 solved: 8 total time: 3.46249
 opt: 0.127 reg: 0.009 solved: 5 total time: 3.59961
 opt: 0.067 reg: 0.025 solved: 11 total time: 3.69218
 opt: 0.163 reg: 0.014 solved: 8 total time: 3.86966
 opt: 0.049 reg: 0.041 solved: 13 total time: 3.96069
 opt: 0.113 reg: 0.006 solved: 8 total time: 4.08159
 opt: 0.089 reg: 0.008 solved: 5 total time: 4.17981
 opt: 0.101 reg: 0.012 solved: 11 total time: 4.29422
 opt: 0.052 reg: 0.021 solved: 12 total time: 4.3677
 opt: 0.136 reg: 0.036 solved: 11 total time: 4.54044
 opt: 0.18 reg: 0.019 solved: 11 total time: 4.73998
 opt: 0.165 reg: 0.021 solved: 8 total time: 4.92685
 opt: 0.066 reg: 0.018 solved: 11 total time: 5.01151
 opt: 0.022 solved: 2147483647 total time: 5.03364
L = 3, leader states: 3.35544e+07, follower subproblems: 3.35544e+07, F:2147483647, total time: 5.084
Search time: 2.809s
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 s81 blaststepdone
				 fix_switch t1 s67 blaststepdone
				 fix_switch t1 s63 blaststepdone
				 fix_switch t1 s49 blaststepdone
				 fix_switch t1 s35 blaststepdone
				 fix_switch t1 s3 blaststepdone
				 fix_switch t1 s17 blaststepdone
				 fix_switch t1 s113 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s99 blaststepdone
				 fix_switch t2 s95 blaststepdone
				 fix_switch t2 s31 blaststepdone
				 fix_switch t2 s127 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 44
Solved by optimal solver: 44
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 44
Solved follower subproblems: 44
Optimal solver time: 2.301s
Cost-bounded solver time: 0s
Follower search time: 2.301s
Total time: 5.10309s
Optimal engine:
Peak memory: 518432 KB
@@@T7326@@@
Done!
real 7.53
user 6.96
sys 0.44
