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/Belnet2009_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/Belnet2009_3.pddl
Parsing...
Parsing: [0.020s CPU, 0.016s 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.220s CPU, 0.220s wall-clock]
4451 relevant atoms
7520 auxiliary atoms
11971 final queue length
15670 total queue pushes
Completing instantiation... [0.240s CPU, 0.237s wall-clock]
Instantiating: [0.480s CPU, 0.486s 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...
258 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.276s 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.038s wall-clock]
Translator variables: 260
Translator derived variables: 0
Translator facts: 558
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 43
Translator operators: 3549
Translator axioms: 0
Translator task size: 19991
Translator peak memory: 33480 KB
Writing output... [0.040s CPU, 0.047s wall-clock]
Done! [0.900s CPU, 0.896s 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.
260 variables of 260 necessary
0 of 3 mutex groups necessary.
3549 of 3549 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 558 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=67600, notReached=242644, spurious=1120
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=300924, notReached=9320, spurious=1120
16 operators are spurious because were not triggered
H^2 mutexes added fw: 9320, unreachable: 0
0 of 3533 operators detected as spurious
Total mutex and disambiguation time: 0.889689 iterations: 2
4660 of 4660 mutex groups necessary.
3533 of 3549 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 3533
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 260
4660 of 4660 mutex groups necessary.
3533 of 3533 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
260 variables of 260 of 260 necessary
The causal graph is not acyclic.
260 variables of 260 necessary
4660 of 4660 mutex groups necessary.
3533 of 3533 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 260
Preprocessor facts: 558
Preprocessor derived variables: 0
Preprocessor operators: 3533
Preprocessor mutex groups: 4660
Preprocessor task size: 29186
Writing output...
Preprocessor time: 1.06691s
Preprocessor peak memory: 13392 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.000292937s]
Simplifying transitions... done!
done reading input! [t=0.0909557s]
building causal graph...done! [t=0.0936734s]
packing state variables...Variables: 260
Bytes per state: 36
done! [t=0.0938879s]
done initalizing global data [t=0.0938926s]
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() = 3324
leader_operators.size() = 209
Initializing Symbolic Variables
Sym variable order: 1 15 23 21 20 16 202 27 163 55 187 127 31 79 175 4 43 67 91 103 139 115 151 26 183 18 39 111 195 171 75 159 99 12 234 87 51 123 147 172 63 135 52 76 64 184 160 148 196 124 112 13 238 100 84 40 88 144 136 108 180 36 192 120 9 156 222 168 48 96 230 72 60 132 194 74 122 86 50 11 98 182 158 146 110 170 62 134 92 38 68 140 188 56 152 176 104 5 116 80 44 206 164 128 32 2 101 19 65 24 185 125 77 41 173 14 149 161 53 197 242 113 89 137 155 59 131 143 35 95 8 119 47 107 179 191 71 90 83 218 42 174 22 167 17 150 54 102 138 30 3 186 126 78 198 114 162 66 69 165 141 57 33 81 129 6 177 189 210 153 105 45 117 118 93 178 154 70 106 130 94 214 7 142 58 34 46 166 82 190 193 181 121 37 226 133 10 109 157 97 85 73 61 169 49 28 145 25 29 251 255 248 254 232 228 216 220 244 240 205 209 200 224 201 236 225 247 258 253 246 250 252 245 221 241 233 217 0 212 208 257 237 229 259 249 204 213 256 199 223 243 207 219 203 239 231 211 235 215 227 
Num variables: 260 => 269
Initialize Symbolic Manager(538, 29739, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 298 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.164s
Starting Stackelberg bounded search...
 opt: 0.003 reg: 0 solved: 1 total time: 2.27545
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 2.2755
 opt: 0.002 reg: 0 solved: 1 total time: 2.29053
 opt: 0.003 reg: 0 solved: 1 total time: 2.29437
 opt: 0.004 reg: 0 solved: 1 total time: 2.29947
 opt: 0.003 reg: 0 solved: 1 total time: 2.30264
 opt: 0.004 reg: 0 solved: 1 total time: 2.30732
 opt: 0.004 reg: 0 solved: 1 total time: 2.31192
 opt: 0.005 reg: 0 solved: 1 total time: 2.31778
 opt: 0.005 reg: 0 solved: 1 total time: 2.32325
 opt: 0.005 reg: 0 solved: 1 total time: 2.32903
 opt: 0.005 reg: 0 solved: 1 total time: 2.33469
 opt: 0.005 reg: 0 solved: 1 total time: 2.34007
 opt: 0.005 reg: 0 solved: 1 total time: 2.3456
 opt: 0.012 reg: 0 solved: 2 total time: 2.35777
L = 1, leader states: 8192, follower subproblems: 8192, F:100000, total time: 2.35786
 opt: 0.026 reg: 0 solved: 2 total time: 2.39919
 opt: 0.019 reg: 0 solved: 2 total time: 2.41915
L = 2, leader states: 1.06288e+06, follower subproblems: 1.06288e+06, F:100000, total time: 2.4193
 opt: 0.025 reg: 0 solved: 3 total time: 2.46133
 opt: 0.021 reg: 0 solved: 2 total time: 2.48285
 opt: 0.041 reg: 0 solved: 4 total time: 2.52565
 opt: 0.112 reg: 0.001 solved: 4 total time: 2.63882
 opt: 0.025 reg: 0.001 solved: 3 total time: 2.66638
 opt: 0.039 reg: 0.003 solved: 4 total time: 2.70905
 opt: 0.118 reg: 0.003 solved: 4 total time: 2.83057
 opt: 0.097 reg: 0.001 solved: 4 total time: 2.93016
L = 3, leader states: 3.35544e+07, follower subproblems: 3.35544e+07, F:100000, total time: 2.93045
 opt: 0.024 reg: 0.002 solved: 2 total time: 2.97297
 opt: 0.037 reg: 0.007 solved: 4 total time: 3.01863
 opt: 0.034 reg: 0.018 solved: 4 total time: 3.07174
 opt: 0.037 reg: 0.02 solved: 3 total time: 3.12896
 opt: 0.04 reg: 0.004 solved: 4 total time: 3.17444
 opt: 0.049 reg: 0.006 solved: 4 total time: 3.22977
 opt: 0.069 reg: 0.011 solved: 5 total time: 3.31085
 opt: 0.088 reg: 0.006 solved: 4 total time: 3.4062
 opt: 0.122 reg: 0.003 solved: 4 total time: 3.5325
 opt: 0.099 reg: 0.004 solved: 4 total time: 3.63645
 opt: 0.149 reg: 0.004 solved: 5 total time: 3.79048
 opt: 0.113 reg: 0.005 solved: 4 total time: 3.90989
 opt: 0.073 reg: 0.015 solved: 6 total time: 3.99903
 opt: 0.118 reg: 0.021 solved: 4 total time: 4.13965
 opt: 0.129 reg: 0.016 solved: 4 total time: 4.28616
 opt: 0.069 reg: 0.022 solved: 6 total time: 4.37843
 opt: 0.096 reg: 0.002 solved: 6 total time: 4.47815
 opt: 0.06 reg: 0.005 solved: 5 total time: 4.54468
 opt: 0.077 reg: 0.009 solved: 6 total time: 4.63196
 opt: 0.179 reg: 0.012 solved: 6 total time: 4.82431
 opt: 0.108 reg: 0.027 solved: 6 total time: 4.96067
 opt: 0.077 reg: 0.034 solved: 6 total time: 5.07349
 opt: 0.159 reg: 0.003 solved: 6 total time: 5.2367
 opt: 0.082 reg: 0.008 solved: 10 total time: 5.32779
 opt: 0.07 reg: 0.015 solved: 6 total time: 5.41361
 opt: 0.14 reg: 0.027 solved: 6 total time: 5.58139
 opt: 0.063 reg: 0.01 solved: 6 total time: 5.65501
 opt: 0.073 reg: 0.017 solved: 6 total time: 5.74639
 opt: 0.206 reg: 0.025 solved: 6 total time: 5.97833
 opt: 0.072 reg: 0.037 solved: 6 total time: 6.08933
 opt: 0.062 reg: 0.041 solved: 6 total time: 6.19333
 opt: 0.174 reg: 0.041 solved: 6 total time: 6.40929
 opt: 0.1 reg: 0.034 solved: 9 total time: 6.54443
 opt: 0.171 reg: 0.007 solved: 6 total time: 6.72337
 opt: 0.077 reg: 0.011 solved: 8 total time: 6.81217
 opt: 0.052 reg: 0.019 solved: 6 total time: 6.88441
 opt: 0.186 reg: 0.038 solved: 6 total time: 7.10983
 opt: 0.21 reg: 0.002 solved: 6 total time: 7.32202
 opt: 0.139 reg: 0.002 solved: 6 total time: 7.46385
 opt: 0.178 reg: 0.004 solved: 6 total time: 7.64626
 opt: 0.175 reg: 0.004 solved: 6 total time: 7.82663
 opt: 0.077 reg: 0.007 solved: 6 total time: 7.91194
 opt: 0.132 reg: 0.006 solved: 6 total time: 8.05178
 opt: 0.158 reg: 0.008 solved: 6 total time: 8.21881
 opt: 0.137 reg: 0.01 solved: 6 total time: 8.36748
 opt: 0.097 reg: 0.008 solved: 6 total time: 8.47307
 opt: 0.099 reg: 0.009 solved: 6 total time: 8.58277
 opt: 0.088 reg: 0.021 solved: 9 total time: 8.6938
 opt: 0.227 reg: 0.007 solved: 6 total time: 8.92918
 opt: 0.223 reg: 0.005 solved: 6 total time: 9.15799
 opt: 0.16 reg: 0.009 solved: 6 total time: 9.32862
 opt: 0.124 reg: 0.016 solved: 6 total time: 9.46977
 opt: 0.207 reg: 0.017 solved: 6 total time: 9.69459
 opt: 0.179 reg: 0.013 solved: 6 total time: 9.88745
 opt: 0.09 reg: 0.576 solved: 8 total time: 10.5541
 opt: 0.124 reg: 0.009 solved: 6 total time: 10.6881
 opt: 0.164 reg: 0.009 solved: 6 total time: 10.8628
 opt: 0.089 reg: 0.026 solved: 8 total time: 10.9785
 opt: 0.081 reg: 0.034 solved: 8 total time: 11.0949
 opt: 0.081 reg: 0.025 solved: 8 total time: 11.2017
 opt: 0.235 reg: 0.009 solved: 6 total time: 11.4467
 opt: 0.095 reg: 0.01 solved: 8 total time: 11.5527
 opt: 0.108 reg: 0.027 solved: 8 total time: 11.6887
 opt: 0.232 reg: 0.046 solved: 10 total time: 11.9678
 opt: 0.123 reg: 0.04 solved: 8 total time: 12.1319
 opt: 0.082 reg: 0.013 solved: 8 total time: 12.2282
 opt: 0.224 reg: 0.025 solved: 6 total time: 12.4791
 opt: 0.085 reg: 0.049 solved: 8 total time: 12.6138
 opt: 0.251 reg: 0.021 solved: 8 total time: 12.8873
 opt: 0.104 reg: 0.007 solved: 8 total time: 12.9993
 opt: 0.098 reg: 0.007 solved: 8 total time: 13.1056
 opt: 0.231 reg: 0.01 solved: 6 total time: 13.3479
 opt: 0.094 reg: 0.013 solved: 8 total time: 13.4559
 opt: 0.089 reg: 0.014 solved: 8 total time: 13.5605
 opt: 0.079 reg: 0.041 solved: 8 total time: 13.6812
 opt: 0.097 reg: 0.01 solved: 8 total time: 13.7895
 opt: 0.243 reg: 0.015 solved: 8 total time: 14.0483
 opt: 0.109 reg: 0.064 solved: 12 total time: 14.2225
 opt: 0.135 reg: 0.012 solved: 8 total time: 14.3715
 opt: 0.317 reg: 0.026 solved: 8 total time: 14.7157
 opt: 0.31 reg: 0.036 solved: 8 total time: 15.0629
 opt: 0.272 reg: 0.007 solved: 8 total time: 15.343
 opt: 0.1 reg: 0.017 solved: 10 total time: 15.4616
 opt: 0.08 reg: 0.015 solved: 8 total time: 15.5578
 opt: 0.1 reg: 0.021 solved: 8 total time: 15.6794
 opt: 0.263 reg: 0.018 solved: 8 total time: 15.9621
 opt: 0.253 reg: 0.017 solved: 8 total time: 16.2333
 opt: 0.086 reg: 0.019 solved: 8 total time: 16.3405
 opt: 0.144 reg: 0.051 solved: 8 total time: 16.5367
 opt: 0.282 reg: 0.022 solved: 8 total time: 16.8419
 opt: 0.293 reg: 0.023 solved: 8 total time: 17.158
 opt: 0.236 reg: 0.048 solved: 8 total time: 17.4429
 opt: 0.246 reg: 0.016 solved: 8 total time: 17.7059
 opt: 0.11 reg: 0.013 solved: 8 total time: 17.8308
 opt: 0.273 reg: 0.018 solved: 8 total time: 18.1231
 opt: 0.097 reg: 0.036 solved: 8 total time: 18.2581
 opt: 0.28 reg: 0.033 solved: 8 total time: 18.5724
 opt: 0.105 reg: 0.04 solved: 10 total time: 18.7184
 opt: 0.193 solved: 2147483647 total time: 18.9117
L = 4, leader states: 4.88281e+08, follower subproblems: 4.88281e+08, F:2147483647, total time: 18.9694
Search time: 16.737s
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 s9 blaststepdone
				 fix_switch t1 s81 blaststepdone
				 fix_switch t1 s72 blaststepdone
				 fix_switch t1 s60 blaststepdone
				 fix_switch t1 s51 blaststepdone
				 fix_switch t1 s39 blaststepdone
				 fix_switch t1 s18 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s80 blaststepdone
				 fix_switch t2 s59 blaststepdone
				 fix_switch t2 s38 blaststepdone
				 fix_switch t2 s30 blaststepdone
				 fix_switch t2 s17 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 123
Solved by optimal solver: 123
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 123
Solved follower subproblems: 123
Optimal solver time: 14.115s
Cost-bounded solver time: 0s
Follower search time: 14.115s
Total time: 18.9893s
Optimal engine:
Peak memory: 595620 KB
@@@T21162@@@
Done!
real 21.52
user 20.52
sys 0.69
