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/KentmanJul2005_4.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/KentmanJul2005_4.pddl
Parsing...
Parsing: [0.010s CPU, 0.053s wall-clock]
Normalizing task... [0.000s CPU, 0.000s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.011s wall-clock]
Preparing model... [0.000s CPU, 0.008s wall-clock]
Generated 173 rules.
Computing model... [0.110s CPU, 0.107s wall-clock]
1924 relevant atoms
3477 auxiliary atoms
5401 final queue length
6860 total queue pushes
Completing instantiation... [0.090s CPU, 0.087s wall-clock]
Instantiating: [0.220s CPU, 0.218s 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...
134 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.012s wall-clock]
Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock]
Building dictionary for full mutex groups... [0.000s 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.008s wall-clock]
Translating task: [0.110s CPU, 0.109s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.020s CPU, 0.016s wall-clock]
Translator variables: 136
Translator derived variables: 0
Translator facts: 298
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 31
Translator operators: 1393
Translator axioms: 0
Translator task size: 7910
Translator peak memory: 23788 KB
Writing output... [0.020s CPU, 0.019s wall-clock]
Done! [0.390s CPU, 0.433s 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.
136 variables of 136 necessary
0 of 3 mutex groups necessary.
1393 of 1393 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 298 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=18496, notReached=69728, spurious=580
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=84632, notReached=3592, spurious=580
8 operators are spurious because were not triggered
H^2 mutexes added fw: 3592, unreachable: 0
0 of 1385 operators detected as spurious
Total mutex and disambiguation time: 0.134298 iterations: 2
1796 of 1796 mutex groups necessary.
1385 of 1393 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 1385
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 136
1796 of 1796 mutex groups necessary.
1385 of 1385 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
136 variables of 136 of 136 necessary
The causal graph is not acyclic.
136 variables of 136 necessary
1796 of 1796 mutex groups necessary.
1385 of 1385 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 136
Preprocessor facts: 298
Preprocessor derived variables: 0
Preprocessor operators: 1385
Preprocessor mutex groups: 1796
Preprocessor task size: 11430
Writing output...
Preprocessor time: 0.201205s
Preprocessor peak memory: 5868 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.000359282s]
Simplifying transitions... done!
done reading input! [t=0.0388576s]
building causal graph...done! [t=0.0400963s]
packing state variables...Variables: 136
Bytes per state: 20
done! [t=0.040208s]
done initalizing global data [t=0.0402126s]
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() = 1276
leader_operators.size() = 109
Initializing Symbolic Variables
Sym variable order: 1 18 14 87 71 105 79 31 55 4 63 47 23 95 39 123 45 69 77 61 10 85 37 53 29 101 93 49 111 57 25 41 73 6 89 65 97 81 33 52 28 44 76 120 9 100 84 92 36 68 60 13 21 20 2 51 83 59 35 91 8 43 99 117 75 27 67 66 114 58 42 74 7 90 34 98 50 26 82 15 16 56 108 72 80 32 48 5 40 88 96 24 64 17 54 70 38 46 22 30 3 62 94 86 78 102 19 12 11 129 128 133 130 131 113 122 107 119 134 116 126 132 104 110 127 125 0 109 103 106 135 115 112 118 121 124 
Num variables: 136 => 145
Initialize Symbolic Manager(290, 55172, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 204 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.029s
Starting Stackelberg bounded search...
 opt: 0.001 reg: 0 solved: 1 total time: 1.02025
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 1.02028
 opt: 0.001 reg: 0 solved: 1 total time: 1.025
 opt: 0 reg: 0 solved: 1 total time: 1.02599
 opt: 0.002 reg: 0 solved: 1 total time: 1.02904
 opt: 0.001 reg: 0 solved: 1 total time: 1.03101
 opt: 0.003 reg: 0 solved: 1 total time: 1.03452
 opt: 0.002 reg: 0 solved: 1 total time: 1.03717
 opt: 0.002 reg: 0 solved: 1 total time: 1.03963
 opt: 0.002 reg: 0 solved: 1 total time: 1.04196
 opt: 0.004 reg: 0 solved: 2 total time: 1.04706
L = 1, leader states: 512, follower subproblems: 512, F:100000, total time: 1.04712
 opt: 0.009 reg: 0 solved: 2 total time: 1.06155
 opt: 0.011 reg: 0 solved: 2 total time: 1.0732
L = 2, leader states: 13122, follower subproblems: 13122, F:100000, total time: 1.07328
 opt: 0.009 reg: 0 solved: 2 total time: 1.08763
 opt: 0.009 reg: 0 solved: 3 total time: 1.09728
 opt: 0.011 reg: 0.001 solved: 5 total time: 1.11037
 opt: 0.014 reg: 0.002 solved: 5 total time: 1.12733
 opt: 0.018 reg: 0.001 solved: 3 total time: 1.14748
 opt: 0.01 reg: 0.002 solved: 4 total time: 1.15956
 opt: 0.012 reg: 0.003 solved: 6 total time: 1.17593
 opt: 0.016 reg: 0.005 solved: 6 total time: 1.19842
 opt: 0.016 reg: 0.002 solved: 3 total time: 1.21746
 opt: 0.02 reg: 0.003 solved: 4 total time: 1.24177
 opt: 0.008 reg: 0.01 solved: 7 total time: 1.26082
 opt: 0.013 reg: 0.014 solved: 8 total time: 1.28903
 opt: 0.032 reg: 0.014 solved: 7 total time: 1.3355
 opt: 0.017 reg: 0.015 solved: 8 total time: 1.36819
 opt: 0.009 reg: 0.027 solved: 9 total time: 1.40518
 opt: 0.039 reg: 0.029 solved: 9 total time: 1.47402
 opt: 0.005 solved: 2147483647 total time: 1.47997
L = 3, leader states: 131072, follower subproblems: 131072, F:2147483647, total time: 1.48716
Search time: 0.474s
Total number of leader states: 1.31658e+06
Total number of follower subproblems: 853603
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 s84 blaststepdone
				 fix_switch t1 s68 blaststepdone
				 fix_switch t1 s52 blaststepdone
				 fix_switch t1 s4 blaststepdone
				 fix_switch t1 s36 blaststepdone
				 fix_switch t1 s20 blaststepdone
				 fix_switch t1 s116 blaststepdone
				 fix_switch t1 s100 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 29
Solved by optimal solver: 29
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 29
Solved follower subproblems: 29
Optimal solver time: 0.296s
Cost-bounded solver time: 0s
Follower search time: 0.296s
Total time: 1.49316s
Optimal engine:
Peak memory: 454380 KB
@@@T2284@@@
Done!
real 2.54
user 2.06
sys 0.26
