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/Ntelos_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/Ntelos_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.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.237s wall-clock]
4414 relevant atoms
7421 auxiliary atoms
11835 final queue length
15510 total queue pushes
Completing instantiation... [0.230s CPU, 0.228s wall-clock]
Instantiating: [0.490s CPU, 0.497s 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.010s CPU, 0.002s wall-clock]
Computing fact groups: [0.030s 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.021s wall-clock]
Translating task: [0.300s CPU, 0.299s 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.042s 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.047s wall-clock]
Done! [0.940s CPU, 0.930s 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.767968 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: 0.951832s
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.000342966s]
Simplifying transitions... done!
done reading input! [t=0.0922901s]
building causal graph...done! [t=0.0945399s]
packing state variables...Variables: 248
Bytes per state: 36
done! [t=0.0947028s]
done initalizing global data [t=0.0947064s]
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 243 244 237 245 238 239 236 200 233 227 203 212 230 246 206 242 235 234 218 224 209 240 215 241 0 221 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.177s
Starting Stackelberg bounded search...
 opt: 0.003 reg: 0 solved: 1 total time: 2.17002
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 2.17007
 opt: 0.002 reg: 0 solved: 1 total time: 2.18493
 opt: 0.005 reg: 0 solved: 1 total time: 2.19077
 opt: 0.007 reg: 0 solved: 1 total time: 2.19849
 opt: 0.004 reg: 0 solved: 1 total time: 2.20345
 opt: 0.008 reg: 0 solved: 1 total time: 2.21178
 opt: 0.007 reg: 0 solved: 1 total time: 2.21938
 opt: 0.008 reg: 0 solved: 1 total time: 2.2278
 opt: 0.006 reg: 0 solved: 1 total time: 2.2344
 opt: 0.008 reg: 0 solved: 1 total time: 2.24334
 opt: 0.007 reg: 0 solved: 1 total time: 2.25126
 opt: 0.006 reg: 0 solved: 1 total time: 2.25823
 opt: 0.007 reg: 0 solved: 1 total time: 2.26631
 opt: 0.012 reg: 0 solved: 2 total time: 2.27901
L = 1, leader states: 8192, follower subproblems: 8192, F:100000, total time: 2.2791
 opt: 0.032 reg: 0 solved: 2 total time: 2.33011
 opt: 0.029 reg: 0 solved: 3 total time: 2.36009
 opt: 0.044 reg: 0 solved: 3 total time: 2.40534
 opt: 0.057 reg: 0 solved: 3 total time: 2.46364
L = 2, leader states: 1.06288e+06, follower subproblems: 1.06288e+06, F:100000, total time: 2.46382
 opt: 0.037 reg: 0 solved: 3 total time: 2.52052
 opt: 0.029 reg: 0.001 solved: 2 total time: 2.55104
 opt: 0.036 reg: 0.001 solved: 4 total time: 2.58996
 opt: 0.089 reg: 0.002 solved: 4 total time: 2.68195
 opt: 0.101 reg: 0.002 solved: 4 total time: 2.78531
 opt: 0.094 reg: 0.002 solved: 3 total time: 2.88259
 opt: 0.033 reg: 0.006 solved: 6 total time: 2.9226
 opt: 0.149 reg: 0.006 solved: 6 total time: 3.07857
 opt: 0.026 reg: 0.008 solved: 5 total time: 3.11356
 opt: 0.132 reg: 0.01 solved: 6 total time: 3.25649
 opt: 0.062 reg: 0.007 solved: 6 total time: 3.32658
 opt: 0.03 reg: 0.026 solved: 10 total time: 3.38453
 opt: 0.031 reg: 0.003 solved: 8 total time: 3.41892
 opt: 0.024 reg: 0.004 solved: 7 total time: 3.44777
 opt: 0.116 reg: 0.017 solved: 7 total time: 3.58206
 opt: 0.17 reg: 0.021 solved: 10 total time: 3.77385
 opt: 0.14 reg: 0.015 solved: 7 total time: 3.93011
 opt: 0.095 reg: 0.008 solved: 7 total time: 4.03335
 opt: 0.099 reg: 0.019 solved: 6 total time: 4.15244
 opt: 0.048 reg: 0.034 solved: 12 total time: 4.23543
 opt: 0.027 reg: 0.008 solved: 9 total time: 4.27171
 opt: 0.105 reg: 0.014 solved: 7 total time: 4.39124
 opt: 0.139 reg: 0.015 solved: 9 total time: 4.5459
 opt: 0.119 reg: 0.015 solved: 9 total time: 4.68071
 opt: 0.029 reg: 0.035 solved: 11 total time: 4.74563
 opt: 0.138 reg: 0.05 solved: 10 total time: 4.93478
 opt: 0.046 reg: 0.024 solved: 13 total time: 5.00623
 opt: 0.176 reg: 0.013 solved: 10 total time: 5.19624
 opt: 0.158 reg: 0.012 solved: 9 total time: 5.36748
 opt: 0.177 reg: 0.018 solved: 12 total time: 5.5636
 opt: 0.023 solved: 2147483647 total time: 5.58747
L = 3, leader states: 3.35544e+07, follower subproblems: 3.35544e+07, F:2147483647, total time: 5.6235
Search time: 3.48s
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 s107 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s64 blaststepdone
				 fix_switch t1 s60 blaststepdone
				 fix_switch t1 s57 blaststepdone
				 fix_switch t1 s17 blaststepdone
				 fix_switch t1 s158 blaststepdone
				 fix_switch t1 s154 blaststepdone
				 fix_switch t1 s151 blaststepdone
				 fix_switch t1 s13 blaststepdone
				 fix_switch t1 s111 blaststepdone
				 fix_switch t1 s104 blaststepdone
				 fix_switch t1 s10 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 49
Solved by optimal solver: 49
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 49
Solved follower subproblems: 49
Optimal solver time: 2.93s
Cost-bounded solver time: 0s
Follower search time: 2.93s
Total time: 5.64322s
Optimal engine:
Peak memory: 531604 KB
@@@T7705@@@
Done!
real 8.06
user 7.20
sys 0.57
