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/Colt_2.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/Colt_2.pddl
Parsing...
Parsing: [0.010s CPU, 0.011s 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.011s wall-clock]
Preparing model... [0.010s CPU, 0.009s wall-clock]
Generated 173 rules.
Computing model... [0.160s CPU, 0.160s wall-clock]
2999 relevant atoms
5221 auxiliary atoms
8220 final queue length
10623 total queue pushes
Completing instantiation... [0.160s CPU, 0.154s wall-clock]
Instantiating: [0.340s CPU, 0.340s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.009s 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...
186 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.001s wall-clock]
Computing fact groups: [0.010s CPU, 0.014s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.001s wall-clock]
Building dictionary for full mutex groups... [0.010s CPU, 0.000s wall-clock]
Building mutex information...
Building mutex information: [0.000s CPU, 0.000s wall-clock]
Translating task...
Processing axioms...
Simplifying axioms... [0.000s CPU, 0.000s wall-clock]
Processing axioms: [0.010s CPU, 0.015s wall-clock]
Translating task: [0.180s CPU, 0.187s 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.026s wall-clock]
Translator variables: 188
Translator derived variables: 0
Translator facts: 408
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 37
Translator operators: 2299
Translator axioms: 0
Translator task size: 12980
Translator peak memory: 27764 KB
Writing output... [0.030s CPU, 0.032s wall-clock]
Done! [0.620s CPU, 0.620s 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.
188 variables of 188 necessary
0 of 3 mutex groups necessary.
2299 of 2299 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 408 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=35344, notReached=130302, spurious=818
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=159578, notReached=6068, spurious=818
10 operators are spurious because were not triggered
H^2 mutexes added fw: 6068, unreachable: 0
0 of 2289 operators detected as spurious
Total mutex and disambiguation time: 0.339975 iterations: 2
3034 of 3034 mutex groups necessary.
2289 of 2299 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 2289
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 188
3034 of 3034 mutex groups necessary.
2289 of 2289 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
188 variables of 188 of 188 necessary
The causal graph is not acyclic.
188 variables of 188 necessary
3034 of 3034 mutex groups necessary.
2289 of 2289 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 188
Preprocessor facts: 408
Preprocessor derived variables: 0
Preprocessor operators: 2289
Preprocessor mutex groups: 3034
Preprocessor task size: 18960
Writing output...
Preprocessor time: 0.45422s
Preprocessor peak memory: 8712 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.000292605s]
Simplifying transitions... done!
done reading input! [t=0.0611136s]
building causal graph...done! [t=0.0628148s]
packing state variables...Variables: 188
Bytes per state: 28
done! [t=0.0629383s]
done initalizing global data [t=0.0629421s]
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() = 155
leader_vars_follower_preconditioned.size() = 154
follower_operators.size() = 2134
leader_operators.size() = 155
Initializing Symbolic Variables
Sym variable order: 1 24 18 29 109 69 155 129 49 6 59 89 119 39 99 139 79 21 22 113 133 63 83 73 53 167 10 103 43 123 20 33 93 143 74 54 34 134 124 114 94 11 170 144 84 64 104 44 25 35 105 95 45 75 85 125 12 145 173 115 135 55 65 16 142 72 164 92 42 82 102 9 52 32 62 132 112 122 2 17 27 57 37 137 117 127 67 4 149 47 97 107 87 77 152 38 48 128 138 118 5 108 68 88 78 28 98 58 131 121 31 71 111 81 8 51 141 61 91 101 161 41 19 140 130 158 120 90 60 80 7 100 40 70 30 50 110 146 26 66 36 106 116 3 86 126 76 46 136 56 96 14 13 15 23 180 176 179 184 178 183 166 175 169 148 163 186 160 182 185 172 157 177 154 181 0 151 174 147 165 171 187 150 156 153 162 168 159 
Num variables: 188 => 197
Initialize Symbolic Manager(394, 40609, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 305 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.078s
Starting Stackelberg bounded search...
 opt: 0.002 reg: 0 solved: 1 total time: 1.55809
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 1.55813
 opt: 0.001 reg: 0 solved: 1 total time: 1.56628
 opt: 0.002 reg: 0 solved: 1 total time: 1.56856
 opt: 0.004 reg: 0 solved: 1 total time: 1.57318
 opt: 0.004 reg: 0 solved: 1 total time: 1.57736
 opt: 0.003 reg: 0 solved: 1 total time: 1.58089
 opt: 0.003 reg: 0 solved: 1 total time: 1.58483
 opt: 0.002 reg: 0 solved: 1 total time: 1.58772
 opt: 0.004 reg: 0 solved: 1 total time: 1.59211
 opt: 0.008 reg: 0 solved: 2 total time: 1.60076
 opt: 0.003 reg: 0 solved: 1 total time: 1.60474
 opt: 0.004 reg: 0 solved: 1 total time: 1.60905
L = 1, leader states: 2048, follower subproblems: 2048, F:100000, total time: 1.60912
 opt: 0.018 reg: 0 solved: 2 total time: 1.63543
 opt: 0.02 reg: 0 solved: 2 total time: 1.65602
L = 2, leader states: 118098, follower subproblems: 118098, F:100000, total time: 1.65612
 opt: 0.017 reg: 0 solved: 4 total time: 1.68259
 opt: 0.02 reg: 0 solved: 3 total time: 1.70414
 opt: 0.016 reg: 0 solved: 2 total time: 1.72073
 opt: 0.019 reg: 0 solved: 3 total time: 1.74117
 opt: 0.041 reg: 0 solved: 3 total time: 1.78314
 opt: 0.025 reg: 0.001 solved: 4 total time: 1.80979
 opt: 0.015 reg: 0.003 solved: 6 total time: 1.82844
 opt: 0.016 reg: 0.004 solved: 5 total time: 1.84952
 opt: 0.053 reg: 0.005 solved: 6 total time: 1.90786
 opt: 0.054 reg: 0.004 solved: 6 total time: 1.96709
 opt: 0.016 reg: 0.009 solved: 7 total time: 1.99276
 opt: 0.023 reg: 0.014 solved: 8 total time: 2.0313
 opt: 0.027 reg: 0.012 solved: 11 total time: 2.07138
 opt: 0.065 reg: 0.003 solved: 7 total time: 2.14105
 opt: 0.073 reg: 0.005 solved: 8 total time: 2.21998
 opt: 0.065 reg: 0.004 solved: 7 total time: 2.28981
 opt: 0.02 reg: 0.009 solved: 9 total time: 2.32041
 opt: 0.091 reg: 0.022 solved: 9 total time: 2.43497
 opt: 0.035 reg: 0.021 solved: 8 total time: 2.49215
 opt: 0.085 reg: 0.029 solved: 9 total time: 2.60682
 opt: 0.012 solved: 2147483647 total time: 2.61916
L = 3, leader states: 2.09715e+06, follower subproblems: 2.09715e+06, F:2147483647, total time: 2.63552
Search time: 1.092s
Total number of leader states: 3.15142e+07
Total number of follower subproblems: 2.06399e+07
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 s51 blaststepdone
				 fix_switch t1 s50 blaststepdone
				 fix_switch t1 s305 blaststepdone
				 fix_switch t1 s30 blaststepdone
				 fix_switch t1 s260 blaststepdone
				 fix_switch t1 s204 blaststepdone
				 fix_switch t1 s203 blaststepdone
				 fix_switch t1 s183 blaststepdone
				 fix_switch t1 s152 blaststepdone
				 fix_switch t1 s107 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 35
Solved by optimal solver: 35
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 35
Solved follower subproblems: 35
Optimal solver time: 0.866s
Cost-bounded solver time: 0s
Follower search time: 0.866s
Total time: 2.6473s
Optimal engine:
Peak memory: 532628 KB
@@@T3891@@@
Done!
real 4.10
user 3.58
sys 0.38
