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/Garr201111_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/Garr201111_3.pddl
Parsing...
Parsing: [0.010s CPU, 0.012s 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.020s CPU, 0.011s wall-clock]
Preparing model... [0.010s CPU, 0.010s wall-clock]
Generated 173 rules.
Computing model... [0.240s CPU, 0.241s wall-clock]
4443 relevant atoms
7488 auxiliary atoms
11931 final queue length
15630 total queue pushes
Completing instantiation... [0.240s CPU, 0.242s wall-clock]
Instantiating: [0.510s CPU, 0.512s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.020s 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...
254 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.019s 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.024s wall-clock]
Translating task: [0.310s CPU, 0.318s 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.041s wall-clock]
Translator variables: 256
Translator derived variables: 0
Translator facts: 550
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 43
Translator operators: 3545
Translator axioms: 0
Translator task size: 19963
Translator peak memory: 33516 KB
Writing output... [0.050s CPU, 0.050s wall-clock]
Done! [0.970s CPU, 0.966s 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.
256 variables of 256 necessary
0 of 3 mutex groups necessary.
3545 of 3545 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 550 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=65536, notReached=235852, spurious=1112
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=292124, notReached=9264, spurious=1112
16 operators are spurious because were not triggered
H^2 mutexes added fw: 9264, unreachable: 0
0 of 3529 operators detected as spurious
Total mutex and disambiguation time: 0.880701 iterations: 2
4632 of 4632 mutex groups necessary.
3529 of 3545 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 3529
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 256
4632 of 4632 mutex groups necessary.
3529 of 3529 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
256 variables of 256 of 256 necessary
The causal graph is not acyclic.
256 variables of 256 necessary
4632 of 4632 mutex groups necessary.
3529 of 3529 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 256
Preprocessor facts: 550
Preprocessor derived variables: 0
Preprocessor operators: 3529
Preprocessor mutex groups: 4632
Preprocessor task size: 29102
Writing output...
Preprocessor time: 1.08471s
Preprocessor peak memory: 13356 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.000353221s]
Simplifying transitions... done!
done reading input! [t=0.105024s]
building causal graph...done! [t=0.108108s]
packing state variables...Variables: 256
Bytes per state: 36
done! [t=0.108326s]
done initalizing global data [t=0.108331s]
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() = 3320
leader_operators.size() = 209
Initializing Symbolic Variables
Sym variable order: 1 22 27 20 46 190 118 154 166 34 58 213 7 130 82 178 142 94 70 149 77 106 125 41 197 89 113 185 14 161 238 173 53 101 65 23 137 108 48 84 15 36 120 72 60 156 9 168 221 96 180 144 85 132 121 192 193 29 133 37 181 224 10 61 157 97 145 109 169 49 78 138 73 42 126 114 102 150 3 198 162 174 30 54 66 209 90 186 26 189 45 93 141 69 153 6 81 129 105 117 165 98 177 57 2 62 33 228 170 194 182 110 134 11 158 44 146 74 122 38 86 176 50 32 164 80 104 68 5 188 56 128 116 205 92 140 152 127 67 163 31 202 91 43 115 4 139 151 55 175 103 187 21 16 171 159 231 79 123 63 39 111 135 12 99 183 195 147 75 87 35 155 51 131 191 83 95 143 8 179 71 47 217 59 167 107 119 184 160 112 235 136 100 172 88 13 52 64 124 76 196 40 19 25 148 18 24 17 28 244 248 253 249 241 203 236 226 207 229 223 211 215 219 200 234 251 250 254 252 216 230 222 243 240 0 245 227 208 233 237 246 255 204 212 201 220 242 247 232 199 210 206 214 218 225 239 
Num variables: 256 => 265
Initialize Symbolic Manager(530, 30188, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 274 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.172s
Starting Stackelberg bounded search...
 opt: 0.003 reg: 0 solved: 1 total time: 2.2798
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 2.27985
 opt: 0.002 reg: 0 solved: 1 total time: 2.29318
 opt: 0.004 reg: 0 solved: 1 total time: 2.29753
 opt: 0.005 reg: 0 solved: 1 total time: 2.30319
 opt: 0.003 reg: 0 solved: 1 total time: 2.30712
 opt: 0.004 reg: 0 solved: 1 total time: 2.3119
 opt: 0.005 reg: 0 solved: 1 total time: 2.31721
 opt: 0.005 reg: 0 solved: 1 total time: 2.32316
 opt: 0.005 reg: 0 solved: 1 total time: 2.32841
 opt: 0.006 reg: 0 solved: 1 total time: 2.33467
 opt: 0.005 reg: 0 solved: 1 total time: 2.34043
 opt: 0.005 reg: 0 solved: 1 total time: 2.34568
 opt: 0.005 reg: 0 solved: 1 total time: 2.35094
 opt: 0.01 reg: 0 solved: 2 total time: 2.36173
L = 1, leader states: 8192, follower subproblems: 8192, F:100000, total time: 2.36181
 opt: 0.022 reg: 0 solved: 2 total time: 2.39971
 opt: 0.027 reg: 0 solved: 2 total time: 2.42738
L = 2, leader states: 1.06288e+06, follower subproblems: 1.06288e+06, F:100000, total time: 2.42754
 opt: 0.021 reg: 0 solved: 2 total time: 2.46537
 opt: 0.034 reg: 0 solved: 4 total time: 2.50041
 opt: 0.092 reg: 0 solved: 4 total time: 2.59359
 opt: 0.028 reg: 0.001 solved: 4 total time: 2.62304
 opt: 0.047 reg: 0.003 solved: 6 total time: 2.67457
 opt: 0.033 reg: 0.006 solved: 4 total time: 2.71448
 opt: 0.078 reg: 0.006 solved: 4 total time: 2.79965
 opt: 0.024 reg: 0.008 solved: 3 total time: 2.83228
 opt: 0.13 reg: 0.012 solved: 4 total time: 2.97509
 opt: 0.042 reg: 0.014 solved: 5 total time: 3.03233
 opt: 0.043 reg: 0.017 solved: 6 total time: 3.09297
 opt: 0.042 reg: 0.003 solved: 6 total time: 3.13968
 opt: 0.043 reg: 0.007 solved: 6 total time: 3.19108
 opt: 0.059 reg: 0.016 solved: 8 total time: 3.26694
 opt: 0.041 reg: 0.012 solved: 6 total time: 3.32179
 opt: 0.053 reg: 0.033 solved: 8 total time: 3.40904
 opt: 0.038 reg: 0.018 solved: 6 total time: 3.4662
 opt: 0.09 reg: 0.006 solved: 8 total time: 3.56369
 opt: 0.076 reg: 0.021 solved: 8 total time: 3.66257
 opt: 0.079 reg: 0.026 solved: 8 total time: 3.76895
 opt: 0.149 reg: 0.007 solved: 8 total time: 3.92606
 opt: 0.066 reg: 0.012 solved: 9 total time: 4.00544
 opt: 0.082 reg: 0.025 solved: 10 total time: 4.11458
 opt: 0.083 reg: 0.031 solved: 8 total time: 4.23037
 opt: 0.256 reg: 0.01 solved: 8 total time: 4.49881
 opt: 0.078 reg: 0.02 solved: 12 total time: 4.59837
 opt: 0.077 reg: 0.029 solved: 8 total time: 4.70586
 opt: 0.088 reg: 0.012 solved: 11 total time: 4.80773
 opt: 0.112 solved: 2147483647 total time: 4.92055
L = 3, leader states: 3.35544e+07, follower subproblems: 3.35544e+07, F:2147483647, total time: 4.97483
Search time: 2.723s
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 s76 blaststepdone
				 fix_switch t1 s54 blaststepdone
				 fix_switch t1 s219 blaststepdone
				 fix_switch t1 s21 blaststepdone
				 fix_switch t1 s186 blaststepdone
				 fix_switch t1 s164 blaststepdone
				 fix_switch t1 s131 blaststepdone
				 fix_switch t1 s109 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s69 blaststepdone
				 fix_switch t2 s179 blaststepdone
				 fix_switch t2 s14 blaststepdone
				 fix_switch t2 s124 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: 2.2s
Cost-bounded solver time: 0s
Follower search time: 2.2s
Total time: 4.99763s
Optimal engine:
Peak memory: 522700 KB
@@@T7225@@@
Done!
real 7.45
user 6.81
sys 0.49
