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/Marwan_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/Marwan_3.pddl
Parsing...
Parsing: [0.020s CPU, 0.014s 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.010s wall-clock]
Preparing model... [0.010s CPU, 0.009s wall-clock]
Generated 173 rules.
Computing model... [0.210s CPU, 0.218s wall-clock]
4443 relevant atoms
7488 auxiliary atoms
11931 final queue length
15630 total queue pushes
Completing instantiation... [0.230s CPU, 0.223s wall-clock]
Instantiating: [0.460s CPU, 0.467s 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.010s 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.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.030s CPU, 0.022s wall-clock]
Translating task: [0.280s CPU, 0.273s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.030s CPU, 0.037s 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: 33520 KB
Writing output... [0.050s CPU, 0.046s wall-clock]
Done! [0.870s CPU, 0.868s 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
14 operators are spurious because were not triggered
H^2 mutexes added fw: 9264, unreachable: 0
0 of 3531 operators detected as spurious
Total mutex and disambiguation time: 0.787727 iterations: 2
4632 of 4632 mutex groups necessary.
3531 of 3545 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 3531
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.
3531 of 3531 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.
3531 of 3531 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: 3531
Preprocessor mutex groups: 4632
Preprocessor task size: 29114
Writing output...
Preprocessor time: 0.963454s
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.000369402s]
Simplifying transitions... done!
done reading input! [t=0.0905594s]
building causal graph...done! [t=0.0932189s]
packing state variables...Variables: 256
Bytes per state: 36
done! [t=0.0933957s]
done initalizing global data [t=0.0933996s]
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() = 3322
leader_operators.size() = 209
Initializing Symbolic Variables
Sym variable order: 1 16 20 26 19 159 123 135 29 63 147 195 12 87 171 75 39 51 111 99 231 37 183 169 97 157 224 85 133 10 73 181 109 49 121 61 145 193 48 96 36 180 156 132 84 9 192 60 168 144 72 108 120 25 220 68 116 92 128 104 56 152 188 80 140 5 176 206 164 213 44 32 190 142 94 178 46 166 7 118 130 106 82 34 70 58 154 161 89 173 238 41 137 101 14 113 125 197 53 77 65 185 149 2 126 30 54 66 198 102 162 174 3 42 114 90 78 138 186 150 155 17 191 217 179 119 107 83 143 8 95 35 131 187 71 59 47 139 127 167 55 115 163 4 103 175 91 151 67 202 31 79 43 189 69 57 33 45 177 117 153 6 165 105 93 81 209 141 28 129 27 50 24 146 62 110 228 74 38 11 194 98 122 21 182 86 170 134 112 23 158 172 40 64 184 88 196 13 148 76 124 234 136 100 160 52 15 18 22 221 225 203 239 214 235 210 199 248 222 247 223 219 216 251 211 255 208 252 204 207 0 229 227 253 205 233 254 200 243 240 250 245 244 237 212 236 241 218 215 226 232 230 201 249 246 242 
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.153s
Starting Stackelberg bounded search...
 opt: 0.048 reg: 0 solved: 1 total time: 2.14862
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 2.14868
 opt: 0.009 reg: 0 solved: 1 total time: 2.16907
 opt: 0.011 reg: 0 solved: 1 total time: 2.1809
 opt: 0.012 reg: 0 solved: 1 total time: 2.19359
 opt: 0.011 reg: 0 solved: 1 total time: 2.20488
 opt: 0.011 reg: 0 solved: 1 total time: 2.21672
 opt: 0.012 reg: 0 solved: 1 total time: 2.22931
 opt: 0.013 reg: 0 solved: 1 total time: 2.24289
 opt: 0.012 reg: 0 solved: 1 total time: 2.25534
 opt: 0.013 reg: 0 solved: 1 total time: 2.26894
 opt: 0.013 reg: 0 solved: 1 total time: 2.28251
 opt: 0.012 reg: 0 solved: 1 total time: 2.29534
 opt: 0.017 reg: 0 solved: 1 total time: 2.31286
 opt: 0.031 reg: 0 solved: 2 total time: 2.34467
L = 1, leader states: 8192, follower subproblems: 8192, F:100000, total time: 2.34477
 opt: 0.034 reg: 0 solved: 2 total time: 2.39329
 opt: 0.036 reg: 0 solved: 2 total time: 2.42992
L = 2, leader states: 1.06288e+06, follower subproblems: 1.06288e+06, F:100000, total time: 2.43006
 opt: 0.044 reg: 0 solved: 4 total time: 2.49136
 opt: 0.03 reg: 0 solved: 2 total time: 2.52246
 opt: 0.045 reg: 0 solved: 3 total time: 2.56901
 opt: 0.071 reg: 0.001 solved: 4 total time: 2.64241
 opt: 0.103 reg: 0.001 solved: 4 total time: 2.74819
 opt: 0.089 reg: 0.001 solved: 4 total time: 2.83922
 opt: 0.057 reg: 0.004 solved: 6 total time: 2.90231
 opt: 0.053 reg: 0.01 solved: 5 total time: 2.96725
 opt: 0.066 reg: 0.014 solved: 4 total time: 3.04853
 opt: 0.051 reg: 0.029 solved: 6 total time: 3.12953
 opt: 0.083 reg: 0.002 solved: 6 total time: 3.21582
 opt: 0.131 reg: 0.001 solved: 6 total time: 3.34904
 opt: 0.084 reg: 0.001 solved: 6 total time: 3.4356
 opt: 0.047 reg: 0.006 solved: 6 total time: 3.48933
 opt: 0.079 reg: 0.013 solved: 6 total time: 3.58244
 opt: 0.066 reg: 0.017 solved: 9 total time: 3.66696
 opt: 0.153 reg: 0.004 solved: 8 total time: 3.82504
 opt: 0.054 reg: 0.014 solved: 8 total time: 3.89406
 opt: 0.107 reg: 0.018 solved: 8 total time: 4.02082
 opt: 0.209 reg: 0.012 solved: 8 total time: 4.24278
 opt: 0.061 reg: 0.043 solved: 9 total time: 4.34759
 opt: 0.223 reg: 0.012 solved: 9 total time: 4.58383
 opt: 0.103 reg: 0.013 solved: 8 total time: 4.70111
 opt: 0.116 reg: 0.009 solved: 8 total time: 4.82809
 opt: 0.051 reg: 0.031 solved: 8 total time: 4.91113
 opt: 0.066 reg: 0.024 solved: 10 total time: 5.00295
 opt: 0.06 reg: 0.009 solved: 9 total time: 5.07348
 opt: 0.132 reg: 0.019 solved: 10 total time: 5.22578
 opt: 0.182 reg: 0.01 solved: 9 total time: 5.41844
 opt: 0.125 reg: 0.017 solved: 9 total time: 5.56123
 opt: 0.264 reg: 0.016 solved: 9 total time: 5.84219
 opt: 0.218 reg: 0.025 solved: 10 total time: 6.08629
 opt: 0.65 reg: 0.035 solved: 10 total time: 6.77175
L = 3, leader states: 3.35544e+07, follower subproblems: 3.35544e+07, F:100000, total time: 6.77223
 opt: 0.136 reg: 0.019 solved: 4 total time: 6.94763
 opt: 0.087 reg: 0.016 solved: 4 total time: 7.05201
 opt: 0.062 reg: 0.007 solved: 2 total time: 7.12294
 opt: 0.114 reg: 0.005 solved: 4 total time: 7.24236
 opt: 0.18 reg: 0.005 solved: 4 total time: 7.42867
 opt: 0.142 reg: 0.004 solved: 4 total time: 7.57574
 opt: 0.108 reg: 0.012 solved: 4 total time: 7.6969
 opt: 0.149 reg: 0.015 solved: 4 total time: 7.86221
 opt: 0.164 reg: 0.006 solved: 4 total time: 8.03334
 opt: 0.13 reg: 0.027 solved: 6 total time: 8.1923
 opt: 0.182 reg: 0.055 solved: 6 total time: 8.43021
 opt: 0.124 reg: 0.026 solved: 6 total time: 8.58087
 opt: 0.167 reg: 0.003 solved: 6 total time: 8.75219
 opt: 0.187 reg: 0.015 solved: 4 total time: 8.95518
 opt: 0.166 reg: 0.024 solved: 8 total time: 9.14577
 opt: 0.177 reg: 0.017 solved: 4 total time: 9.34127
 opt: 0.163 reg: 0.031 solved: 4 total time: 9.53602
 opt: 0.357 reg: 0.057 solved: 8 total time: 9.95068
 opt: 0.127 reg: 0.055 solved: 7 total time: 10.1338
 opt: 0.215 reg: 0.004 solved: 6 total time: 10.3541
 opt: 0.21 reg: 0.004 solved: 6 total time: 10.5697
 opt: 0.131 reg: 0.003 solved: 6 total time: 10.7058
 opt: 0.209 reg: 0.004 solved: 6 total time: 10.9208
 opt: 0.093 reg: 0.018 solved: 5 total time: 11.033
 opt: 0.168 reg: 0.014 solved: 6 total time: 11.2164
 opt: 0.174 reg: 0.021 solved: 8 total time: 11.4118
 opt: 0.268 reg: 0.02 solved: 6 total time: 11.7013
 opt: 0.215 reg: 0.01 solved: 6 total time: 11.9281
 opt: 0.18 reg: 0.028 solved: 8 total time: 12.138
 opt: 0.3 reg: 0.021 solved: 6 total time: 12.4606
 opt: 0.176 reg: 0.02 solved: 6 total time: 12.6574
 opt: 0.207 reg: 0.02 solved: 6 total time: 12.8851
 opt: 0.165 reg: 0.007 solved: 8 total time: 13.058
 opt: 0.222 reg: 0.008 solved: 6 total time: 13.2891
 opt: 0.202 reg: 0.008 solved: 6 total time: 13.501
 opt: 0.178 reg: 0.008 solved: 6 total time: 13.6884
 opt: 0.102 solved: 2147483647 total time: 13.7913
L = 4, leader states: 4.88281e+08, follower subproblems: 4.88281e+08, F:2147483647, total time: 13.8633
Search time: 11.792s
Total number of leader states: 7.05325e+09
Total number of follower subproblems: 4.61502e+09
Pareto-frontier size: 1
Pareto-frontier: (4,2147483647) 
	 fix ops costs: 4, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s55 blaststepdone
				 fix_switch t1 s49 blaststepdone
				 fix_switch t1 s39 blaststepdone
				 fix_switch t1 s33 blaststepdone
				 fix_switch t1 s1 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s7 blaststepdone
				 fix_switch t2 s23 blaststepdone
				 fix_switch t2 s17 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_switch t3 s50 blaststepdone
				 fix_switch t3 s34 blaststepdone
				 fix_switch t3 s2 blaststepdone
				 fix_switch t3 s18 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 86
Solved by optimal solver: 86
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 86
Solved follower subproblems: 86
Optimal solver time: 10.505s
Cost-bounded solver time: 0s
Follower search time: 10.505s
Total time: 13.8816s
Optimal engine:
Peak memory: 580012 KB
@@@T15892@@@
Done!
real 16.12
user 15.46
sys 0.49
