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/Janetbackbone_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/Janetbackbone_2.pddl
Parsing...
Parsing: [0.010s CPU, 0.045s 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.020s CPU, 0.014s wall-clock]
Preparing model... [0.010s CPU, 0.009s wall-clock]
Generated 173 rules.
Computing model... [0.120s CPU, 0.124s wall-clock]
1945 relevant atoms
3528 auxiliary atoms
5473 final queue length
6948 total queue pushes
Completing instantiation... [0.090s CPU, 0.092s wall-clock]
Instantiating: [0.240s CPU, 0.245s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.008s wall-clock]
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
Instantiating groups... [0.000s CPU, 0.000s wall-clock]
Collecting mutex groups... [0.000s CPU, 0.000s wall-clock]
Choosing groups...
140 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.013s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s 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.009s wall-clock]
Translating task: [0.120s CPU, 0.121s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.010s CPU, 0.017s wall-clock]
Translator variables: 142
Translator derived variables: 0
Translator facts: 310
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 31
Translator operators: 1407
Translator axioms: 0
Translator task size: 8009
Translator peak memory: 23816 KB
Writing output... [0.020s CPU, 0.021s wall-clock]
Done! [0.430s CPU, 0.469s 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.
142 variables of 142 necessary
0 of 3 mutex groups necessary.
1407 of 1407 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 310 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=20164, notReached=75344, spurious=592
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=92056, notReached=3452, spurious=592
7 operators are spurious because were not triggered
H^2 mutexes added fw: 3452, unreachable: 0
0 of 1400 operators detected as spurious
Total mutex and disambiguation time: 0.158182 iterations: 2
1726 of 1726 mutex groups necessary.
1400 of 1407 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 1400
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 142
1726 of 1726 mutex groups necessary.
1400 of 1400 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
142 variables of 142 of 142 necessary
The causal graph is not acyclic.
142 variables of 142 necessary
1726 of 1726 mutex groups necessary.
1400 of 1400 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 142
Preprocessor facts: 310
Preprocessor derived variables: 0
Preprocessor operators: 1400
Preprocessor mutex groups: 1726
Preprocessor task size: 11394
Writing output...
Preprocessor time: 0.22973s
Preprocessor peak memory: 6016 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.000322043s]
Simplifying transitions... done!
done reading input! [t=0.0398183s]
building causal graph...done! [t=0.0411773s]
packing state variables...Variables: 142
Bytes per state: 20
done! [t=0.0413022s]
done initalizing global data [t=0.0413064s]
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() = 109
leader_vars_follower_preconditioned.size() = 108
follower_operators.size() = 1291
leader_operators.size() = 109
Initializing Symbolic Variables
Sym variable order: 1 20 17 11 23 47 79 71 105 63 4 87 95 39 31 55 13 14 19 30 46 86 78 102 62 3 70 54 22 38 94 59 43 75 99 83 8 67 91 35 51 27 121 69 29 101 93 77 10 128 53 61 85 37 45 2 12 26 82 74 117 98 7 34 90 58 50 66 42 113 25 73 33 41 97 6 65 57 49 81 89 68 44 76 60 124 92 9 84 52 28 36 100 15 16 72 80 88 32 48 5 56 24 109 64 96 40 18 21 135 130 126 112 111 119 120 132 133 137 136 123 122 140 103 104 108 0 138 116 141 127 131 107 134 115 139 118 129 114 106 125 110 
Num variables: 142 => 151
Initialize Symbolic Manager(302, 52980, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 110 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.034s
Starting Stackelberg bounded search...
 opt: 0.002 reg: 0 solved: 1 total time: 1.21818
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 1.21822
 opt: 0.001 reg: 0 solved: 1 total time: 1.22439
 opt: 0.001 reg: 0 solved: 1 total time: 1.22575
 opt: 0.003 reg: 0 solved: 1 total time: 1.2292
 opt: 0.002 reg: 0 solved: 1 total time: 1.23201
 opt: 0.003 reg: 0 solved: 1 total time: 1.236
 opt: 0.003 reg: 0 solved: 1 total time: 1.23991
 opt: 0.002 reg: 0 solved: 1 total time: 1.24266
 opt: 0.002 reg: 0 solved: 1 total time: 1.24531
 opt: 0.006 reg: 0 solved: 2 total time: 1.25153
L = 1, leader states: 512, follower subproblems: 512, F:100000, total time: 1.2516
 opt: 0.015 reg: 0 solved: 3 total time: 1.27194
 opt: 0.01 reg: 0 solved: 2 total time: 1.2827
 opt: 0.015 reg: 0 solved: 4 total time: 1.29876
 opt: 0.015 reg: 0 solved: 3 total time: 1.31518
 opt: 0.019 reg: 0.002 solved: 4 total time: 1.33715
 opt: 0.027 reg: 0.002 solved: 4 total time: 1.36643
 opt: 0.019 reg: 0.001 solved: 3 total time: 1.38814
 opt: 0.02 reg: 0.001 solved: 3 total time: 1.41026
L = 2, leader states: 13122, follower subproblems: 13122, F:100000, total time: 1.41038
 opt: 0.012 reg: 0.002 solved: 3 total time: 1.43107
 opt: 0.012 reg: 0.003 solved: 2 total time: 1.44665
 opt: 0.035 reg: 0.004 solved: 4 total time: 1.48703
 opt: 0.033 reg: 0.003 solved: 4 total time: 1.52472
 opt: 0.029 reg: 0.007 solved: 4 total time: 1.56209
 opt: 0.027 reg: 0.011 solved: 4 total time: 1.60105
 opt: 0.023 reg: 0.014 solved: 3 total time: 1.63992
 opt: 0.028 reg: 0.015 solved: 4 total time: 1.68326
 opt: 0.034 reg: 0.014 solved: 4 total time: 1.73154
 opt: 0.021 reg: 0.011 solved: 4 total time: 1.76406
 opt: 0.035 reg: 0.004 solved: 4 total time: 1.80412
 opt: 0.04 reg: 0.002 solved: 4 total time: 1.84721
 opt: 0.035 reg: 0.004 solved: 4 total time: 1.88749
 opt: 0.032 reg: 0.004 solved: 4 total time: 1.92409
L = 3, leader states: 131072, follower subproblems: 131072, F:100000, total time: 1.92431
 opt: 0.012 reg: 0.004 solved: 2 total time: 1.94684
 opt: 0.025 reg: 0.008 solved: 4 total time: 1.98086
 opt: 0.017 reg: 0.004 solved: 3 total time: 2.00329
 opt: 0.026 reg: 0.011 solved: 5 total time: 2.04048
 opt: 0.033 reg: 0.019 solved: 4 total time: 2.09286
 opt: 0.023 reg: 0.005 solved: 4 total time: 2.1217
 opt: 0.021 reg: 0.004 solved: 4 total time: 2.14871
 opt: 0.023 reg: 0.001 solved: 4 total time: 2.17386
 opt: 0.038 reg: 0.001 solved: 4 total time: 2.21454
 opt: 0.041 reg: 0.001 solved: 4 total time: 2.25797
 opt: 0.035 reg: 0.001 solved: 4 total time: 2.29498
 opt: 0.025 reg: 0.005 solved: 5 total time: 2.32668
 opt: 0.037 reg: 0.009 solved: 4 total time: 2.37319
 opt: 0.045 reg: 0.006 solved: 4 total time: 2.42494
 opt: 0.024 reg: 0.017 solved: 5 total time: 2.46655
 opt: 0.024 reg: 0.018 solved: 6 total time: 2.50916
 opt: 0.044 reg: 0.007 solved: 4 total time: 2.56038
 opt: 0.039 reg: 0.005 solved: 4 total time: 2.60557
 opt: 0.025 reg: 0.009 solved: 6 total time: 2.64093
 opt: 0.036 reg: 0.004 solved: 4 total time: 2.68192
 opt: 0.047 reg: 0.016 solved: 5 total time: 2.74635
 opt: 0.023 reg: 0.023 solved: 5 total time: 2.79388
 opt: 0.023 reg: 0.007 solved: 5 total time: 2.82567
 opt: 0.047 reg: 0.007 solved: 6 total time: 2.8813
 opt: 0.039 reg: 0.013 solved: 4 total time: 2.9347
 opt: 0.034 reg: 0.024 solved: 5 total time: 2.99478
 opt: 0.029 reg: 0.013 solved: 6 total time: 3.03777
 opt: 0.022 reg: 0.008 solved: 5 total time: 3.06893
 opt: 0.033 reg: 0.005 solved: 5 total time: 3.10846
 opt: 0.037 reg: 0.003 solved: 5 total time: 3.15021
 opt: 0.044 reg: 0.016 solved: 6 total time: 3.21129
 opt: 0.02 reg: 0.027 solved: 5 total time: 3.25931
 opt: 0.036 reg: 0.003 solved: 5 total time: 3.29922
 opt: 0.021 reg: 0.001 solved: 6 total time: 3.32308
 opt: 0.024 reg: 0.002 solved: 6 total time: 3.34983
 opt: 0.039 reg: 0.003 solved: 5 total time: 3.39264
 opt: 0.042 reg: 0.004 solved: 6 total time: 3.43961
 opt: 0.056 reg: 0.003 solved: 6 total time: 3.49952
 opt: 0.025 reg: 0.011 solved: 6 total time: 3.53663
 opt: 0.045 reg: 0.015 solved: 6 total time: 3.59753
 opt: 0.023 reg: 0.01 solved: 6 total time: 3.63252
 opt: 0.024 reg: 0.024 solved: 6 total time: 3.68197
 opt: 0.038 reg: 0.024 solved: 6 total time: 3.74597
 opt: 0.027 reg: 0.016 solved: 6 total time: 3.79017
 opt: 0.036 reg: 0.014 solved: 6 total time: 3.84196
 opt: 0.034 reg: 0.014 solved: 6 total time: 3.89076
 opt: 0.04 reg: 0.016 solved: 6 total time: 3.94842
 opt: 0.035 reg: 0.014 solved: 6 total time: 3.99859
 opt: 0.039 reg: 0.013 solved: 6 total time: 4.05195
 opt: 0.05 reg: 0.016 solved: 6 total time: 4.11918
 opt: 0.028 reg: 0.013 solved: 6 total time: 4.16073
L = 4, leader states: 781250, follower subproblems: 781250, F:100000, total time: 4.16099
 opt: 0.022 reg: 0.018 solved: 3 total time: 4.20867
 opt: 0.016 reg: 0.002 solved: 2 total time: 4.22753
 opt: 0.028 reg: 0.006 solved: 4 total time: 4.26258
 opt: 0.032 reg: 0.013 solved: 4 total time: 4.30783
 opt: 0.027 reg: 0.017 solved: 4 total time: 4.35296
 opt: 0.044 reg: 0.009 solved: 4 total time: 4.40751
 opt: 0.027 reg: 0.005 solved: 4 total time: 4.44
 opt: 0.042 reg: 0.003 solved: 4 total time: 4.48673
 opt: 0.051 reg: 0.003 solved: 4 total time: 4.54174
 opt: 0.027 reg: 0.004 solved: 4 total time: 4.57341
 opt: 0.043 reg: 0.006 solved: 4 total time: 4.6243
 opt: 0.03 reg: 0.023 solved: 6 total time: 4.67875
 opt: 0.047 reg: 0.001 solved: 4 total time: 4.72859
 opt: 0.043 reg: 0.001 solved: 4 total time: 4.77436
 opt: 0.037 reg: 0.001 solved: 4 total time: 4.81373
 opt: 0.025 reg: 0.002 solved: 4 total time: 4.8412
 opt: 0.04 reg: 0.002 solved: 4 total time: 4.8843
 opt: 0.036 reg: 0.002 solved: 4 total time: 4.92322
 opt: 0.026 reg: 0.002 solved: 4 total time: 4.95175
 opt: 0.027 reg: 0.004 solved: 4 total time: 4.98409
 opt: 0.052 reg: 0.022 solved: 6 total time: 5.05964
 opt: 0.045 reg: 0.004 solved: 4 total time: 5.10951
 opt: 0.032 reg: 0.014 solved: 5 total time: 5.15599
 opt: 0.042 reg: 0.016 solved: 6 total time: 5.21523
 opt: 0.057 reg: 0.025 solved: 6 total time: 5.2977
 opt: 0.046 reg: 0.02 solved: 4 total time: 5.36432
 opt: 0.026 reg: 0.027 solved: 4 total time: 5.41855
 opt: 0.034 reg: 0.009 solved: 4 total time: 5.4629
 opt: 0.038 reg: 0.009 solved: 4 total time: 5.51134
 opt: 0.058 reg: 0.012 solved: 6 total time: 5.58257
 opt: 0.039 reg: 0.008 solved: 4 total time: 5.63097
 opt: 0.043 reg: 0.007 solved: 4 total time: 5.68152
 opt: 0.03 reg: 0.013 solved: 5 total time: 5.72585
 opt: 0.041 reg: 0.015 solved: 4 total time: 5.78287
 opt: 0.058 reg: 0.017 solved: 6 total time: 5.85942
 opt: 0.034 reg: 0.018 solved: 5 total time: 5.91272
 opt: 0.054 reg: 0.02 solved: 5 total time: 5.9873
 opt: 0.033 reg: 0.008 solved: 5 total time: 6.02952
 opt: 0.036 reg: 0.01 solved: 4 total time: 6.07671
 opt: 0.043 reg: 0.012 solved: 5 total time: 6.13378
 opt: 0.037 reg: 0.01 solved: 5 total time: 6.18193
 opt: 0.049 reg: 0.016 solved: 4 total time: 6.24796
 opt: 0.066 reg: 0.022 solved: 6 total time: 6.33626
 opt: 0.031 reg: 0.028 solved: 5 total time: 6.39618
 opt: 0.049 reg: 0.02 solved: 6 total time: 6.46553
 opt: 0.051 reg: 0.02 solved: 6 total time: 6.53787
 opt: 0.046 reg: 0.012 solved: 5 total time: 6.59653
 opt: 0.061 reg: 0.009 solved: 5 total time: 6.66757
 opt: 0.045 reg: 0.02 solved: 5 total time: 6.73312
 opt: 0.047 reg: 0.024 solved: 6 total time: 6.80555
 opt: 0.055 reg: 0.02 solved: 5 total time: 6.88164
 opt: 0.033 solved: 2147483647 total time: 6.91581
L = 5, leader states: 3.35923e+06, follower subproblems: 3.35923e+06, F:2147483647, total time: 6.93709
Search time: 5.733s
Total number of leader states: 2.15796e+07
Total number of follower subproblems: 1.36722e+07
Pareto-frontier size: 1
Pareto-frontier: (5,2147483647) 
	 fix ops costs: 5, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_switch t0 s4 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s38 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s45 blaststepdone
				 fix_switch t2 s44 blaststepdone
				 fix_switch t2 s18 blaststepdone
				 fix_switch t2 s11 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_switch t3 s31 blaststepdone
				 fix_switch t3 s17 blaststepdone
				 fix_next-step t3 t4 blaststepdone
				 fix_last-step t4 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 135
Solved by optimal solver: 135
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 135
Solved follower subproblems: 135
Optimal solver time: 4.295s
Cost-bounded solver time: 0s
Follower search time: 4.295s
Total time: 6.94481s
Optimal engine:
Peak memory: 575732 KB
@@@T7819@@@
Done!
real 8.13
user 7.43
sys 0.44
