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/Cogentco_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/Cogentco_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.005s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.020s wall-clock]
Preparing model... [0.010s CPU, 0.012s wall-clock]
Generated 173 rules.
Computing model... [0.250s CPU, 0.250s wall-clock]
4414 relevant atoms
7421 auxiliary atoms
11835 final queue length
15510 total queue pushes
Completing instantiation... [0.250s CPU, 0.253s wall-clock]
Instantiating: [0.540s CPU, 0.545s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s 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.010s 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.024s wall-clock]
Translating task: [0.330s CPU, 0.330s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.050s CPU, 0.045s 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.060s CPU, 0.053s wall-clock]
Done! [1.030s CPU, 1.022s 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=274604, notReached=9456, spurious=1096
12 operators are spurious because were not triggered
H^2 mutexes added fw: 9456, unreachable: 0
0 of 3513 operators detected as spurious
Total mutex and disambiguation time: 0.844803 iterations: 2
4728 of 4728 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
4728 of 4728 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
4728 of 4728 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: 4728
Preprocessor task size: 29174
Writing output...
Preprocessor time: 1.03636s
Preprocessor peak memory: 12852 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.000329344s]
Simplifying transitions... done!
done reading input! [t=0.0939862s]
building causal graph...done! [t=0.0967418s]
packing state variables...Variables: 248
Bytes per state: 36
done! [t=0.0969508s]
done initalizing global data [t=0.0969556s]
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 241 234 237 239 244 245 236 203 227 200 233 209 212 246 230 238 242 243 215 221 206 235 224 240 0 218 229 199 205 226 232 247 202 223 217 220 208 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: 426 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.196s
Starting Stackelberg bounded search...
 opt: 0.003 reg: 0 solved: 1 total time: 2.34214
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 2.34219
 opt: 0.002 reg: 0 solved: 1 total time: 2.35585
 opt: 0.004 reg: 0 solved: 1 total time: 2.36002
 opt: 0.004 reg: 0 solved: 1 total time: 2.36506
 opt: 0.002 reg: 0 solved: 1 total time: 2.36814
 opt: 0.004 reg: 0 solved: 1 total time: 2.37226
 opt: 0.004 reg: 0 solved: 1 total time: 2.37705
 opt: 0.005 reg: 0 solved: 1 total time: 2.38276
 opt: 0.004 reg: 0 solved: 1 total time: 2.38757
 opt: 0.006 reg: 0 solved: 1 total time: 2.39466
 opt: 0.006 reg: 0 solved: 1 total time: 2.40143
 opt: 0.005 reg: 0 solved: 1 total time: 2.40758
 opt: 0.006 reg: 0 solved: 1 total time: 2.41447
 opt: 0.01 reg: 0 solved: 2 total time: 2.42511
L = 1, leader states: 8192, follower subproblems: 8192, F:100000, total time: 2.42522
 opt: 0.034 reg: 0 solved: 2 total time: 2.4781
 opt: 0.022 reg: 0 solved: 2 total time: 2.50042
L = 2, leader states: 1.06288e+06, follower subproblems: 1.06288e+06, F:100000, total time: 2.50055
 opt: 0.027 reg: 0 solved: 5 total time: 2.54469
 opt: 0.028 reg: 0 solved: 4 total time: 2.5742
 opt: 0.026 reg: 0.001 solved: 2 total time: 2.60208
 opt: 0.022 reg: 0.001 solved: 3 total time: 2.62666
 opt: 0.045 reg: 0.001 solved: 3 total time: 2.67416
 opt: 0.088 reg: 0.002 solved: 4 total time: 2.76522
 opt: 0.093 reg: 0.001 solved: 4 total time: 2.8607
 opt: 0.052 reg: 0.003 solved: 5 total time: 2.91724
 opt: 0.041 reg: 0.007 solved: 6 total time: 2.96648
 opt: 0.073 reg: 0.007 solved: 6 total time: 3.04684
 opt: 0.065 reg: 0.003 solved: 3 total time: 3.11558
 opt: 0.033 reg: 0.013 solved: 8 total time: 3.16307
 opt: 0.038 reg: 0.025 solved: 9 total time: 3.22787
 opt: 0.033 reg: 0.028 solved: 7 total time: 3.29047
 opt: 0.047 reg: 0.023 solved: 7 total time: 3.36175
 opt: 0.048 reg: 0.025 solved: 8 total time: 3.43559
 opt: 0.062 reg: 0.03 solved: 9 total time: 3.52905
 opt: 0.025 reg: 0.006 solved: 10 total time: 3.56142
 opt: 0.15 reg: 0.011 solved: 10 total time: 3.72354
 opt: 0.036 reg: 0.021 solved: 12 total time: 3.78233
 opt: 0.179 reg: 0.031 solved: 12 total time: 3.99291
 opt: 0.043 reg: 0.023 solved: 13 total time: 4.06096
 opt: 0.046 reg: 0.016 solved: 11 total time: 4.12415
 opt: 0.058 reg: 0.023 solved: 11 total time: 4.20605
 opt: 0.062 reg: 0.036 solved: 13 total time: 4.30537
 opt: 0.013 solved: 2147483647 total time: 4.31893
L = 3, leader states: 3.35544e+07, follower subproblems: 3.35544e+07, F:2147483647, total time: 4.34374
Search time: 2.024s
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 s77 blaststepdone
				 fix_switch t1 s647 blaststepdone
				 fix_switch t1 s631 blaststepdone
				 fix_switch t1 s612 blaststepdone
				 fix_switch t1 s61 blaststepdone
				 fix_switch t1 s457 blaststepdone
				 fix_switch t1 s441 blaststepdone
				 fix_switch t1 s422 blaststepdone
				 fix_switch t1 s42 blaststepdone
				 fix_switch t1 s267 blaststepdone
				 fix_switch t1 s251 blaststepdone
				 fix_switch t1 s232 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 42
Solved by optimal solver: 42
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 42
Solved follower subproblems: 42
Optimal solver time: 1.554s
Cost-bounded solver time: 0s
Follower search time: 1.554s
Total time: 4.36232s
Optimal engine:
Peak memory: 507896 KB
@@@T6597@@@
Done!
real 7.00
user 6.13
sys 0.54
