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/Globenet_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/Globenet_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.010s CPU, 0.011s wall-clock]
Preparing model... [0.010s CPU, 0.010s wall-clock]
Generated 173 rules.
Computing model... [0.230s CPU, 0.236s wall-clock]
4414 relevant atoms
7421 auxiliary atoms
11835 final queue length
15510 total queue pushes
Completing instantiation... [0.260s CPU, 0.255s wall-clock]
Instantiating: [0.520s CPU, 0.522s 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.018s 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.024s wall-clock]
Translating task: [0.300s CPU, 0.302s 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: 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.048s wall-clock]
Done! [0.960s CPU, 0.960s 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.796859 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.983224s
Preprocessor peak memory: 13176 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.000313805s]
Simplifying transitions... done!
done reading input! [t=0.0910497s]
building causal graph...done! [t=0.0934343s]
packing state variables...Variables: 248
Bytes per state: 36
done! [t=0.093635s]
done initalizing global data [t=0.0936412s]
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 239 237 244 234 238 236 243 242 221 218 200 227 233 246 230 212 224 235 245 206 203 240 215 209 0 241 208 220 223 226 229 247 205 202 217 199 232 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.171s
Starting Stackelberg bounded search...
 opt: 0.003 reg: 0 solved: 1 total time: 2.23792
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 2.23796
 opt: 0.002 reg: 0 solved: 1 total time: 2.25148
 opt: 0.004 reg: 0 solved: 1 total time: 2.25619
 opt: 0.005 reg: 0 solved: 1 total time: 2.2622
 opt: 0.003 reg: 0 solved: 1 total time: 2.26601
 opt: 0.004 reg: 0 solved: 1 total time: 2.27072
 opt: 0.005 reg: 0 solved: 1 total time: 2.27614
 opt: 0.006 reg: 0 solved: 1 total time: 2.28292
 opt: 0.005 reg: 0 solved: 1 total time: 2.28859
 opt: 0.007 reg: 0 solved: 1 total time: 2.29601
 opt: 0.006 reg: 0 solved: 1 total time: 2.30278
 opt: 0.005 reg: 0 solved: 1 total time: 2.3088
 opt: 0.006 reg: 0 solved: 1 total time: 2.31546
 opt: 0.009 reg: 0 solved: 2 total time: 2.32547
L = 1, leader states: 8192, follower subproblems: 8192, F:100000, total time: 2.32558
 opt: 0.034 reg: 0 solved: 2 total time: 2.3769
 opt: 0.025 reg: 0 solved: 2 total time: 2.40281
L = 2, leader states: 1.06288e+06, follower subproblems: 1.06288e+06, F:100000, total time: 2.40297
 opt: 0.022 reg: 0 solved: 2 total time: 2.4429
 opt: 0.036 reg: 0 solved: 3 total time: 2.47996
 opt: 0.025 reg: 0.001 solved: 5 total time: 2.5065
 opt: 0.03 reg: 0.002 solved: 4 total time: 2.53889
 opt: 0.042 reg: 0.001 solved: 4 total time: 2.5832
 opt: 0.057 reg: 0.001 solved: 4 total time: 2.64308
 opt: 0.076 reg: 0.003 solved: 5 total time: 2.72321
 opt: 0.083 reg: 0.002 solved: 3 total time: 2.80893
 opt: 0.04 reg: 0.003 solved: 5 total time: 2.85234
 opt: 0.034 reg: 0.005 solved: 6 total time: 2.89234
 opt: 0.03 reg: 0.014 solved: 8 total time: 2.9367
 opt: 0.043 reg: 0.03 solved: 9 total time: 3.01112
 opt: 0.026 reg: 0.003 solved: 7 total time: 3.04076
 opt: 0.081 reg: 0.003 solved: 7 total time: 3.1258
 opt: 0.053 reg: 0.002 solved: 7 total time: 3.18177
 opt: 0.027 reg: 0.009 solved: 10 total time: 3.21911
 opt: 0.112 reg: 0.011 solved: 7 total time: 3.34263
 opt: 0.044 reg: 0.011 solved: 7 total time: 3.39892
 opt: 0.059 reg: 0.017 solved: 10 total time: 3.47654
 opt: 0.197 reg: 0.019 solved: 10 total time: 3.69319
 opt: 0.161 reg: 0.049 solved: 8 total time: 3.90398
 opt: 0.179 reg: 0.038 solved: 10 total time: 4.12236
 opt: 0.093 reg: 0.034 solved: 8 total time: 4.25041
 opt: 0.036 reg: 0.051 solved: 11 total time: 4.33806
 opt: 0.141 reg: 0.012 solved: 8 total time: 4.49229
 opt: 0.12 reg: 0.005 solved: 8 total time: 4.61859
 opt: 0.141 reg: 0.011 solved: 10 total time: 4.77113
 opt: 0.175 reg: 0.016 solved: 11 total time: 4.96404
 opt: 0.02 solved: 2147483647 total time: 4.98422
L = 3, leader states: 3.35544e+07, follower subproblems: 3.35544e+07, F:2147483647, total time: 5.03121
Search time: 2.821s
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 s58 blaststepdone
				 fix_switch t1 s39 blaststepdone
				 fix_switch t1 s259 blaststepdone
				 fix_switch t1 s240 blaststepdone
				 fix_switch t1 s192 blaststepdone
				 fix_switch t1 s173 blaststepdone
				 fix_switch t1 s131 blaststepdone
				 fix_switch t1 s125 blaststepdone
				 fix_switch t1 s106 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s64 blaststepdone
				 fix_switch t2 s265 blaststepdone
				 fix_switch t2 s198 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.312s
Cost-bounded solver time: 0s
Follower search time: 2.312s
Total time: 5.05304s
Optimal engine:
Peak memory: 523968 KB
@@@T7174@@@
Done!
real 7.46
user 6.67
sys 0.57
