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/Bbnplanet_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/Bbnplanet_3.pddl
Parsing...
Parsing: [0.010s CPU, 0.022s 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.000s CPU, 0.010s wall-clock]
Generated 173 rules.
Computing model... [0.240s CPU, 0.239s wall-clock]
4451 relevant atoms
7520 auxiliary atoms
11971 final queue length
15670 total queue pushes
Completing instantiation... [0.260s CPU, 0.248s wall-clock]
Instantiating: [0.520s CPU, 0.517s 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.000s CPU, 0.000s wall-clock]
Choosing groups...
258 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.020s CPU, 0.019s 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.023s 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.043s 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.050s CPU, 0.048s wall-clock]
Done! [0.950s CPU, 0.962s 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=300956, notReached=9288, spurious=1120
16 operators are spurious because were not triggered
H^2 mutexes added fw: 9288, unreachable: 0
0 of 3533 operators detected as spurious
Total mutex and disambiguation time: 0.905779 iterations: 2
4644 of 4644 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
4644 of 4644 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
4644 of 4644 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: 4644
Preprocessor task size: 29154
Writing output...
Preprocessor time: 1.09666s
Preprocessor peak memory: 13420 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.000322228s]
Simplifying transitions... done!
done reading input! [t=0.0951519s]
building causal graph...done! [t=0.0979763s]
packing state variables...Variables: 260
Bytes per state: 36
done! [t=0.0982046s]
done initalizing global data [t=0.0982089s]
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 47 107 35 71 28 143 155 95 119 8 179 191 218 167 83 131 59 127 187 20 139 175 103 163 115 4 43 55 79 31 91 202 67 159 51 135 87 151 183 234 123 195 12 147 171 99 63 39 75 111 160 112 148 196 29 76 238 100 184 13 52 40 64 124 88 172 136 142 70 178 82 130 46 214 7 106 154 34 118 94 190 58 192 132 25 72 222 166 108 84 180 9 156 48 168 120 144 96 122 24 60 182 36 86 2 110 158 194 146 11 74 38 98 134 230 170 62 89 50 53 113 23 197 101 77 149 137 161 14 125 173 242 210 185 41 65 93 33 81 57 105 153 6 177 141 69 189 129 45 165 117 21 80 92 152 44 104 176 140 5 32 68 206 56 164 116 188 128 18 90 78 186 198 150 54 114 138 3 66 42 162 102 126 174 121 30 109 19 193 157 226 73 10 37 97 145 181 49 169 85 61 27 26 133 17 22 16 15 249 256 252 254 236 244 220 212 224 232 209 201 228 229 241 204 250 248 258 246 257 217 233 225 237 208 251 240 0 213 247 245 216 221 259 253 200 205 255 203 215 243 235 207 199 219 211 223 239 231 227 
Num variables: 260 => 269
Initialize Symbolic Manager(538, 29739, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 278 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.168s
Starting Stackelberg bounded search...
 opt: 0.003 reg: 0 solved: 1 total time: 2.31782
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 2.31786
 opt: 0.003 reg: 0 solved: 1 total time: 2.33244
 opt: 0.003 reg: 0 solved: 1 total time: 2.3362
 opt: 0.005 reg: 0 solved: 1 total time: 2.34201
 opt: 0.003 reg: 0 solved: 1 total time: 2.34616
 opt: 0.004 reg: 0 solved: 1 total time: 2.3505
 opt: 0.004 reg: 0 solved: 1 total time: 2.35511
 opt: 0.005 reg: 0 solved: 1 total time: 2.36028
 opt: 0.004 reg: 0 solved: 1 total time: 2.36497
 opt: 0.005 reg: 0 solved: 1 total time: 2.37055
 opt: 0.006 reg: 0 solved: 1 total time: 2.37705
 opt: 0.004 reg: 0 solved: 1 total time: 2.38196
 opt: 0.005 reg: 0 solved: 1 total time: 2.38737
 opt: 0.011 reg: 0 solved: 2 total time: 2.39897
L = 1, leader states: 8192, follower subproblems: 8192, F:100000, total time: 2.39905
 opt: 0.024 reg: 0 solved: 2 total time: 2.43654
 opt: 0.029 reg: 0 solved: 2 total time: 2.4664
L = 2, leader states: 1.06288e+06, follower subproblems: 1.06288e+06, F:100000, total time: 2.46652
 opt: 0.043 reg: 0 solved: 4 total time: 2.5276
 opt: 0.025 reg: 0 solved: 2 total time: 2.55354
 opt: 0.043 reg: 0 solved: 4 total time: 2.59782
 opt: 0.026 reg: 0 solved: 3 total time: 2.62583
 opt: 0.108 reg: 0.001 solved: 4 total time: 2.73566
 opt: 0.104 reg: 0 solved: 4 total time: 2.84128
 opt: 0.111 reg: 0 solved: 4 total time: 2.95365
 opt: 0.025 reg: 0.001 solved: 3 total time: 2.98106
 opt: 0.131 reg: 0.002 solved: 4 total time: 3.115
L = 3, leader states: 3.35544e+07, follower subproblems: 3.35544e+07, F:100000, total time: 3.11528
 opt: 0.068 reg: 0.001 solved: 4 total time: 3.20338
 opt: 0.022 reg: 0.001 solved: 2 total time: 3.22745
 opt: 0.109 reg: 0.002 solved: 4 total time: 3.33932
 opt: 0.101 reg: 0.001 solved: 4 total time: 3.4432
 opt: 0.074 reg: 0.002 solved: 4 total time: 3.51964
 opt: 0.069 reg: 0.001 solved: 4 total time: 3.59152
 opt: 0.049 reg: 0.004 solved: 3 total time: 3.64429
 opt: 0.113 reg: 0.004 solved: 4 total time: 3.76292
 opt: 0.05 reg: 0.005 solved: 4 total time: 3.81864
 opt: 0.04 reg: 0.013 solved: 4 total time: 3.87304
 opt: 0.067 reg: 0.018 solved: 5 total time: 3.95996
 opt: 0.131 reg: 0.003 solved: 4 total time: 4.09523
 opt: 0.104 reg: 0.001 solved: 4 total time: 4.20202
 opt: 0.077 reg: 0.008 solved: 6 total time: 4.28835
 opt: 0.108 reg: 0.014 solved: 4 total time: 4.41115
 opt: 0.066 reg: 0.031 solved: 6 total time: 4.50894
 opt: 0.089 reg: 0.009 solved: 6 total time: 4.60819
 opt: 0.06 reg: 0.004 solved: 6 total time: 4.67387
 opt: 0.156 reg: 0.004 solved: 4 total time: 4.83479
 opt: 0.048 reg: 0.012 solved: 5 total time: 4.89568
 opt: 0.202 reg: 0.019 solved: 6 total time: 5.11734
 opt: 0.181 reg: 0.003 solved: 6 total time: 5.30252
 opt: 0.042 reg: 0.004 solved: 4 total time: 5.34971
 opt: 0.24 reg: 0.009 solved: 6 total time: 5.59977
 opt: 0.053 reg: 0.012 solved: 6 total time: 5.66601
 opt: 0.136 reg: 0.018 solved: 5 total time: 5.82098
 opt: 0.079 reg: 0.03 solved: 6 total time: 5.93155
 opt: 0.06 reg: 0.011 solved: 6 total time: 6.00302
 opt: 0.082 reg: 0.018 solved: 6 total time: 6.10427
 opt: 0.259 reg: 0.008 solved: 6 total time: 6.37303
 opt: 0.241 reg: 0.011 solved: 6 total time: 6.6263
 opt: 0.156 reg: 0.013 solved: 6 total time: 6.79646
 opt: 0.181 reg: 0.016 solved: 6 total time: 6.99424
 opt: 0.175 reg: 0.017 solved: 6 total time: 7.18746
 opt: 0.071 reg: 0.037 solved: 6 total time: 7.29611
 opt: 0.236 reg: 0.002 solved: 6 total time: 7.53518
 opt: 0.085 reg: 0.006 solved: 8 total time: 7.62826
 opt: 0.052 reg: 0.014 solved: 6 total time: 7.69572
 opt: 0.16 reg: 0.017 solved: 6 total time: 7.87364
 opt: 0.052 reg: 0.022 solved: 6 total time: 7.94817
 opt: 0.174 reg: 0.018 solved: 6 total time: 8.14129
 opt: 0.202 reg: 0.024 solved: 6 total time: 8.3688
 opt: 0.167 reg: 0.002 solved: 6 total time: 8.53961
 opt: 0.174 reg: 0.003 solved: 6 total time: 8.7174
 opt: 0.086 reg: 0.006 solved: 6 total time: 8.81068
 opt: 0.214 reg: 0.004 solved: 6 total time: 9.02977
 opt: 0.179 reg: 0.004 solved: 6 total time: 9.21346
 opt: 0.142 reg: 0.004 solved: 6 total time: 9.36047
 opt: 0.128 reg: 0.004 solved: 6 total time: 9.49273
 opt: 0.237 reg: 0.007 solved: 6 total time: 9.7384
 opt: 0.186 reg: 0.008 solved: 6 total time: 9.93299
 opt: 0.087 reg: 0.035 solved: 8 total time: 10.0561
 opt: 0.234 reg: 0.008 solved: 6 total time: 10.2999
 opt: 0.198 reg: 0.006 solved: 6 total time: 10.505
 opt: 0.066 reg: 0.008 solved: 6 total time: 10.5811
 opt: 0.254 reg: 0.01 solved: 6 total time: 10.8457
 opt: 0.073 reg: 0.012 solved: 6 total time: 10.9323
 opt: 0.068 reg: 0.022 solved: 8 total time: 11.024
 opt: 0.213 reg: 0.011 solved: 6 total time: 11.2498
 opt: 0.182 reg: 0.01 solved: 6 total time: 11.443
 opt: 0.205 reg: 0.007 solved: 6 total time: 11.656
 opt: 0.094 reg: 0.02 solved: 8 total time: 11.7711
 opt: 0.23 reg: 0.02 solved: 6 total time: 12.0226
 opt: 0.099 reg: 0.037 solved: 8 total time: 12.1601
 opt: 0.089 reg: 0.02 solved: 8 total time: 12.2709
 opt: 0.087 reg: 0.029 solved: 9 total time: 12.3886
 opt: 0.1 reg: 0.009 solved: 8 total time: 12.4986
 opt: 0.083 reg: 0.016 solved: 8 total time: 12.5986
 opt: 0.209 reg: 0.022 solved: 6 total time: 12.831
 opt: 0.069 reg: 0.036 solved: 8 total time: 12.9374
 opt: 0.074 reg: 0.008 solved: 8 total time: 13.0203
 opt: 0.075 reg: 0.01 solved: 8 total time: 13.1061
 opt: 0.092 reg: 0.011 solved: 8 total time: 13.2098
 opt: 0.099 reg: 0.641 solved: 9 total time: 13.9497
 opt: 0.376 reg: 0.01 solved: 8 total time: 14.3372
 opt: 0.093 reg: 0.014 solved: 8 total time: 14.4457
 opt: 0.077 reg: 0.017 solved: 8 total time: 14.5412
 opt: 0.092 reg: 0.026 solved: 11 total time: 14.6605
 opt: 0.082 reg: 0.021 solved: 8 total time: 14.7651
 opt: 0.08 reg: 0.014 solved: 8 total time: 14.8606
 opt: 0.084 reg: 0.016 solved: 8 total time: 14.9618
 opt: 0.314 reg: 0.014 solved: 8 total time: 15.2909
 opt: 0.236 reg: 0.014 solved: 8 total time: 15.5422
 opt: 0.235 reg: 0.012 solved: 8 total time: 15.7902
 opt: 0.307 reg: 0.014 solved: 8 total time: 16.113
 opt: 0.219 reg: 0.015 solved: 8 total time: 16.3487
 opt: 0.286 reg: 0.013 solved: 8 total time: 16.6485
 opt: 0.233 reg: 0.017 solved: 8 total time: 16.9004
 opt: 0.177 reg: 0.017 solved: 8 total time: 17.0962
 opt: 0.157 reg: 0.014 solved: 8 total time: 17.268
 opt: 0.158 reg: 0.027 solved: 8 total time: 17.4543
 opt: 0.086 reg: 0.035 solved: 8 total time: 17.576
 opt: 0.267 reg: 0.005 solved: 8 total time: 17.8489
 opt: 0.265 reg: 0.007 solved: 8 total time: 18.1215
 opt: 0.167 reg: 0.009 solved: 8 total time: 18.2995
 opt: 0.076 reg: 0.015 solved: 8 total time: 18.3914
 opt: 0.272 reg: 0.019 solved: 8 total time: 18.6828
 opt: 0.087 reg: 0.027 solved: 8 total time: 18.7982
 opt: 0.215 reg: 0.036 solved: 8 total time: 19.0511
 opt: 0.363 reg: 0.047 solved: 8 total time: 19.4623
 opt: 0.1 reg: 0.032 solved: 8 total time: 19.5962
 opt: 0.208 reg: 0.04 solved: 8 total time: 19.8455
 opt: 0.239 reg: 0.006 solved: 8 total time: 20.0922
 opt: 0.257 reg: 0.005 solved: 8 total time: 20.3559
 opt: 0.356 reg: 0.009 solved: 8 total time: 20.7219
 opt: 0.244 reg: 0.01 solved: 8 total time: 20.9771
 opt: 0.29 reg: 0.012 solved: 8 total time: 21.2807
 opt: 0.265 reg: 0.018 solved: 8 total time: 21.5643
 opt: 0.325 reg: 0.017 solved: 8 total time: 21.9078
 opt: 0.088 reg: 0.018 solved: 8 total time: 22.0144
 opt: 0.097 reg: 0.043 solved: 10 total time: 22.1555
 opt: 0.18 reg: 0.02 solved: 8 total time: 22.3571
 opt: 0.232 reg: 0.036 solved: 8 total time: 22.6269
 opt: 0.221 reg: 0.044 solved: 8 total time: 22.8936
 opt: 0.263 reg: 0.033 solved: 8 total time: 23.1908
 opt: 0.29 reg: 0.039 solved: 8 total time: 23.5208
 opt: 0.091 reg: 0.027 solved: 8 total time: 23.6409
 opt: 0.092 reg: 0.035 solved: 10 total time: 23.7696
 opt: 0.343 reg: 0.019 solved: 8 total time: 24.1326
 opt: 0.203 reg: 0.037 solved: 8 total time: 24.374
 opt: 0.225 reg: 0.051 solved: 8 total time: 24.6508
 opt: 0.086 reg: 0.028 solved: 8 total time: 24.767
 opt: 0.253 reg: 0.011 solved: 8 total time: 25.0326
 opt: 0.103 reg: 0.026 solved: 12 total time: 25.1626
 opt: 0.09 reg: 0.04 solved: 10 total time: 25.2944
 opt: 0.341 reg: 0.007 solved: 8 total time: 25.6444
 opt: 0.189 reg: 0.01 solved: 8 total time: 25.8454
 opt: 0.32 reg: 0.013 solved: 8 total time: 26.1799
 opt: 0.22 reg: 0.049 solved: 10 total time: 26.45
 opt: 0.865 reg: 0.048 solved: 8 total time: 27.3638
 opt: 0.256 reg: 0.009 solved: 8 total time: 27.6308
 opt: 0.304 reg: 0.007 solved: 8 total time: 27.9424
 opt: 0.303 reg: 0.007 solved: 8 total time: 28.254
 opt: 0.131 reg: 0.027 solved: 12 total time: 28.4139
 opt: 0.195 solved: 2147483647 total time: 28.6101
L = 4, leader states: 4.88281e+08, follower subproblems: 4.88281e+08, F:2147483647, total time: 28.6669
Search time: 26.398s
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 s90 blaststepdone
				 fix_switch t1 s65 blaststepdone
				 fix_switch t1 s43 blaststepdone
				 fix_switch t1 s40 blaststepdone
				 fix_switch t1 s15 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s98 blaststepdone
				 fix_switch t2 s93 blaststepdone
				 fix_switch t2 s73 blaststepdone
				 fix_switch t2 s68 blaststepdone
				 fix_switch t2 s48 blaststepdone
				 fix_switch t2 s23 blaststepdone
				 fix_switch t2 s18 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 160
Solved by optimal solver: 160
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 160
Solved follower subproblems: 160
Optimal solver time: 23.216s
Cost-bounded solver time: 0s
Follower search time: 23.216s
Total time: 28.6849s
Optimal engine:
Peak memory: 634060 KB
@@@T31013@@@
Done!
real 32.05
user 30.38
sys 0.63
