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/DeutscheTelekom_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/DeutscheTelekom_3.pddl
Parsing...
Parsing: [0.010s CPU, 0.013s 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.012s wall-clock]
Preparing model... [0.010s CPU, 0.008s wall-clock]
Generated 173 rules.
Computing model... [0.100s CPU, 0.105s wall-clock]
1924 relevant atoms
3477 auxiliary atoms
5401 final queue length
6860 total queue pushes
Completing instantiation... [0.100s CPU, 0.085s wall-clock]
Instantiating: [0.220s CPU, 0.217s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.000s CPU, 0.008s wall-clock]
Checking invariant weight... [0.000s CPU, 0.000s wall-clock]
Instantiating groups... [0.010s 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.009s wall-clock]
Translating task: [0.110s CPU, 0.113s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
1 operators removed
4 propositions removed
Detecting unreachable propositions: [0.020s CPU, 0.017s 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: 1392
Translator axioms: 0
Translator task size: 7904
Translator peak memory: 23784 KB
Writing output... [0.020s CPU, 0.018s wall-clock]
Done! [0.390s CPU, 0.396s 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.
1392 of 1392 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=84464, notReached=3760, spurious=580
7 operators are spurious because were not triggered
H^2 mutexes added fw: 3760, unreachable: 0
0 of 1385 operators detected as spurious
Total mutex and disambiguation time: 0.134285 iterations: 2
1880 of 1880 mutex groups necessary.
1385 of 1392 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
1880 of 1880 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
1880 of 1880 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: 1880
Preprocessor task size: 11598
Writing output...
Preprocessor time: 0.200895s
Preprocessor peak memory: 5980 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.000258891s]
Simplifying transitions... done!
done reading input! [t=0.0384592s]
building causal graph...done! [t=0.0396561s]
packing state variables...Variables: 136
Bytes per state: 20
done! [t=0.0397594s]
done initalizing global data [t=0.039764s]
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 11 14 70 46 86 30 94 3 78 54 102 62 22 38 12 18 89 73 57 65 97 6 41 33 111 25 81 49 68 36 60 52 44 92 9 84 120 28 100 76 13 19 95 63 47 105 23 39 4 31 79 71 87 55 2 15 16 45 69 123 29 37 10 77 85 53 101 61 93 21 99 91 59 75 35 83 8 43 27 67 117 51 48 80 108 96 56 72 5 32 88 24 40 64 74 114 98 58 26 7 66 90 42 82 50 34 20 17 133 129 127 132 130 107 119 125 110 134 116 126 128 104 122 131 113 0 121 112 106 135 109 103 115 118 124 
Num variables: 136 => 145
Initialize Symbolic Manager(290, 55172, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 244 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.032s
Starting Stackelberg bounded search...
 opt: 0.002 reg: 0 solved: 1 total time: 1.03499
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 1.03502
 opt: 0.001 reg: 0 solved: 1 total time: 1.04019
 opt: 0.001 reg: 0 solved: 1 total time: 1.04127
 opt: 0.003 reg: 0 solved: 1 total time: 1.04474
 opt: 0.002 reg: 0 solved: 1 total time: 1.04742
 opt: 0.003 reg: 0 solved: 1 total time: 1.05118
 opt: 0.003 reg: 0 solved: 1 total time: 1.0547
 opt: 0.002 reg: 0 solved: 1 total time: 1.05728
 opt: 0.002 reg: 0 solved: 1 total time: 1.06035
 opt: 0.005 reg: 0 solved: 2 total time: 1.06575
L = 1, leader states: 512, follower subproblems: 512, F:100000, total time: 1.06581
 opt: 0.011 reg: 0 solved: 2 total time: 1.08269
 opt: 0.009 reg: 0 solved: 2 total time: 1.09241
L = 2, leader states: 13122, follower subproblems: 13122, F:100000, total time: 1.0925
 opt: 0.01 reg: 0 solved: 6 total time: 1.1089
 opt: 0.009 reg: 0 solved: 2 total time: 1.11928
 opt: 0.011 reg: 0.001 solved: 4 total time: 1.13237
 opt: 0.011 reg: 0.001 solved: 3 total time: 1.14591
 opt: 0.011 reg: 0.003 solved: 5 total time: 1.16066
 opt: 0.013 reg: 0.008 solved: 8 total time: 1.18341
 opt: 0.015 reg: 0.012 solved: 7 total time: 1.21136
 opt: 0.024 reg: 0.011 solved: 6 total time: 1.24651
 opt: 0.029 reg: 0.006 solved: 6 total time: 1.28269
 opt: 0.029 reg: 0.006 solved: 6 total time: 1.31884
 opt: 0.018 reg: 0.012 solved: 8 total time: 1.34966
 opt: 0.027 reg: 0.015 solved: 8 total time: 1.39254
 opt: 0.017 reg: 0.009 solved: 4 total time: 1.41892
 opt: 0.019 reg: 0.005 solved: 4 total time: 1.44449
 opt: 0.024 reg: 0.01 solved: 8 total time: 1.47919
 opt: 0.03 reg: 0.01 solved: 6 total time: 1.52034
 opt: 0.018 reg: 0.009 solved: 8 total time: 1.54843
 opt: 0.014 reg: 0.033 solved: 9 total time: 1.59731
 opt: 0.031 reg: 0.034 solved: 8 total time: 1.66311
 opt: 0.007 solved: 2147483647 total time: 1.67055
L = 3, leader states: 131072, follower subproblems: 131072, F:2147483647, total time: 1.68239
Search time: 0.656s
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 s92 blaststepdone
				 fix_switch t1 s86 blaststepdone
				 fix_switch t1 s53 blaststepdone
				 fix_switch t1 s20 blaststepdone
				 fix_switch t1 s119 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s59 blaststepdone
				 fix_switch t2 s26 blaststepdone
				 fix_switch t2 s125 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 32
Solved by optimal solver: 32
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 32
Solved follower subproblems: 32
Optimal solver time: 0.411s
Cost-bounded solver time: 0s
Follower search time: 0.411s
Total time: 1.68873s
Optimal engine:
Peak memory: 454952 KB
@@@T2436@@@
Done!
real 2.81
user 2.20
sys 0.31
