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/Tw_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/Tw_3.pddl
Parsing...
Parsing: [0.010s CPU, 0.028s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.004s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
Preparing model... [0.010s CPU, 0.010s wall-clock]
Generated 173 rules.
Computing model... [0.240s CPU, 0.238s wall-clock]
4414 relevant atoms
7421 auxiliary atoms
11835 final queue length
15510 total queue pushes
Completing instantiation... [0.230s CPU, 0.234s wall-clock]
Instantiating: [0.500s CPU, 0.502s 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...
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.030s CPU, 0.023s wall-clock]
Translating task: [0.300s CPU, 0.293s 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.043s 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: 33264 KB
Writing output... [0.050s CPU, 0.052s wall-clock]
Done! [0.930s CPU, 0.948s 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=274596, notReached=9464, spurious=1096
12 operators are spurious because were not triggered
H^2 mutexes added fw: 9464, unreachable: 0
0 of 3513 operators detected as spurious
Total mutex and disambiguation time: 0.860942 iterations: 2
4732 of 4732 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
4732 of 4732 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
4732 of 4732 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: 4732
Preprocessor task size: 29182
Writing output...
Preprocessor time: 1.05119s
Preprocessor peak memory: 12776 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.00035222s]
Simplifying transitions... done!
done reading input! [t=0.0933935s]
building causal graph...done! [t=0.0960735s]
packing state variables...Variables: 248
Bytes per state: 36
done! [t=0.0962716s]
done initalizing global data [t=0.0962765s]
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 214 229 199 205 232 208 223 247 211 226 202 217 220 244 0 203 227 235 233 224 200 239 243 245 221 246 206 212 209 215 218 230 237 236 240 242 241 238 234 
Num variables: 248 => 257
Initialize Symbolic Manager(514, 31128, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 426 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.325s
Starting Stackelberg bounded search...
 opt: 0.862 reg: 0 solved: 1 total time: 3.46535
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 3.46543
 opt: 0.155 reg: 0 solved: 1 total time: 3.63224
 opt: 0.153 reg: 0 solved: 1 total time: 3.78602
 opt: 0.154 reg: 0 solved: 1 total time: 3.94068
 opt: 0.153 reg: 0 solved: 1 total time: 4.09381
 opt: 0.154 reg: 0 solved: 1 total time: 4.24797
 opt: 0.156 reg: 0 solved: 1 total time: 4.40416
 opt: 0.158 reg: 0 solved: 1 total time: 4.56234
 opt: 0.153 reg: 0 solved: 1 total time: 4.71595
 opt: 0.154 reg: 0 solved: 1 total time: 4.87001
 opt: 0.154 reg: 0 solved: 1 total time: 5.02437
 opt: 0.155 reg: 0 solved: 1 total time: 5.17979
 opt: 0.217 reg: 0 solved: 1 total time: 5.39746
 opt: 0.217 reg: 0 solved: 2 total time: 5.61436
L = 1, leader states: 8192, follower subproblems: 8192, F:100000, total time: 5.61447
 opt: 0.193 reg: 0 solved: 3 total time: 5.82258
 opt: 0.176 reg: 0 solved: 2 total time: 5.99952
 opt: 0.191 reg: 0 solved: 3 total time: 6.19158
 opt: 0.228 reg: 0 solved: 3 total time: 6.42058
L = 2, leader states: 1.06288e+06, follower subproblems: 1.06288e+06, F:100000, total time: 6.42101
 opt: 0.182 reg: 0 solved: 3 total time: 6.61971
 opt: 0.171 reg: 0 solved: 2 total time: 6.79255
 opt: 0.227 reg: 0 solved: 3 total time: 7.02085
 opt: 0.187 reg: 0.002 solved: 6 total time: 7.2111
 opt: 0.177 reg: 0.004 solved: 4 total time: 7.3934
 opt: 0.18 reg: 0.018 solved: 7 total time: 7.59256
 opt: 0.18 reg: 0.002 solved: 5 total time: 7.77534
 opt: 0.264 reg: 0.002 solved: 6 total time: 8.04217
 opt: 0.257 reg: 0.004 solved: 7 total time: 8.30359
 opt: 0.2 reg: 0.004 solved: 6 total time: 8.50857
 opt: 0.185 reg: 0.007 solved: 4 total time: 8.70159
 opt: 0.232 reg: 0.006 solved: 4 total time: 8.94093
 opt: 0.228 reg: 0.008 solved: 6 total time: 9.17765
 opt: 0.243 reg: 0.005 solved: 6 total time: 9.42638
 opt: 0.247 reg: 0.01 solved: 7 total time: 9.68461
 opt: 0.185 reg: 0.03 solved: 9 total time: 9.90061
 opt: 0.187 reg: 0.015 solved: 8 total time: 10.1043
 opt: 0.285 reg: 0.008 solved: 9 total time: 10.3986
 opt: 0.208 reg: 0.02 solved: 10 total time: 10.6276
 opt: 0.293 reg: 0.013 solved: 10 total time: 10.9353
 opt: 0.285 reg: 0.011 solved: 9 total time: 11.2321
 opt: 0.23 reg: 0.03 solved: 10 total time: 11.4934
 opt: 0.23 reg: 0.024 solved: 7 total time: 11.7485
 opt: 0.308 reg: 0.024 solved: 9 total time: 12.0815
 opt: 0.283 reg: 0.017 solved: 7 total time: 12.3825
 opt: 0.286 reg: 0.015 solved: 9 total time: 12.6838
 opt: 0.29 reg: 0.014 solved: 9 total time: 12.9883
 opt: 0.284 reg: 0.013 solved: 9 total time: 13.2867
 opt: 0.191 reg: 0.013 solved: 11 total time: 13.4915
 opt: 0.243 reg: 0.008 solved: 9 total time: 13.7431
 opt: 0.28 reg: 0.015 solved: 10 total time: 14.039
 opt: 0.318 reg: 0.012 solved: 10 total time: 14.3698
 opt: 0.322 reg: 0.012 solved: 9 total time: 14.7044
 opt: 0.218 reg: 0.042 solved: 13 total time: 14.9651
 opt: 0.272 reg: 0.007 solved: 10 total time: 15.2451
 opt: 0.219 reg: 0.018 solved: 12 total time: 15.4834
 opt: 0.358 reg: 0.013 solved: 12 total time: 15.8551
 opt: 0.369 reg: 0.447 solved: 13 total time: 16.6705
 opt: 0.821 reg: 0.013 solved: 12 total time: 17.5047
 opt: 0.295 reg: 0.018 solved: 10 total time: 17.8187
 opt: 0.331 reg: 0.009 solved: 12 total time: 18.1595
 opt: 0.302 reg: 0.01 solved: 10 total time: 18.4714
 opt: 0.415 reg: 0.01 solved: 10 total time: 18.897
 opt: 0.215 solved: 2147483647 total time: 19.113
L = 3, leader states: 3.35544e+07, follower subproblems: 3.35544e+07, F:2147483647, total time: 19.1432
Search time: 16.582s
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_switch t0 s69 blaststepdone
				 fix_switch t0 s282 blaststepdone
				 fix_switch t0 s140 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s68 blaststepdone
				 fix_switch t1 s61 blaststepdone
				 fix_switch t1 s281 blaststepdone
				 fix_switch t1 s274 blaststepdone
				 fix_switch t1 s211 blaststepdone
				 fix_switch t1 s210 blaststepdone
				 fix_switch t1 s203 blaststepdone
				 fix_switch t1 s139 blaststepdone
				 fix_switch t1 s132 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 62
Solved by optimal solver: 62
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 62
Solved follower subproblems: 62
Optimal solver time: 15.466s
Cost-bounded solver time: 0s
Follower search time: 15.466s
Total time: 19.1613s
Optimal engine:
Peak memory: 549820 KB
@@@T21368@@@
Done!
real 21.69
user 20.67
sys 0.74
