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/Digex_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/Digex_2.pddl
Parsing...
Parsing: [0.010s CPU, 0.012s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.010s wall-clock]
Preparing model... [0.000s CPU, 0.007s wall-clock]
Generated 173 rules.
Computing model... [0.060s CPU, 0.065s wall-clock]
1156 relevant atoms
2176 auxiliary atoms
3332 final queue length
4139 total queue pushes
Completing instantiation... [0.050s CPU, 0.046s wall-clock]
Instantiating: [0.130s CPU, 0.133s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.007s 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...
94 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.010s 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.005s wall-clock]
Translating task: [0.060s CPU, 0.060s 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.009s wall-clock]
Translator variables: 96
Translator derived variables: 0
Translator facts: 212
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 25
Translator operators: 769
Translator axioms: 0
Translator task size: 4419
Translator peak memory: 20688 KB
Writing output... [0.010s CPU, 0.011s wall-clock]
Done! [0.230s CPU, 0.239s 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.
96 variables of 96 necessary
0 of 3 mutex groups necessary.
769 of 769 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 212 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=9216, notReached=35338, spurious=390
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=42698, notReached=1856, spurious=390
8 operators are spurious because were not triggered
H^2 mutexes added fw: 1856, unreachable: 0
0 of 761 operators detected as spurious
Total mutex and disambiguation time: 0.049309 iterations: 2
928 of 928 mutex groups necessary.
761 of 769 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 761
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 96
928 of 928 mutex groups necessary.
761 of 761 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
96 variables of 96 of 96 necessary
The causal graph is not acyclic.
96 variables of 96 necessary
928 of 928 mutex groups necessary.
761 of 761 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 96
Preprocessor facts: 212
Preprocessor derived variables: 0
Preprocessor operators: 761
Preprocessor mutex groups: 928
Preprocessor task size: 6208
Writing output...
Preprocessor time: 0.0818513s
Preprocessor peak memory: 4068 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.000268043s]
Simplifying transitions... done!
done reading input! [t=0.0210249s]
building causal graph...done! [t=0.0218365s]
packing state variables...Variables: 96
Bytes per state: 16
done! [t=0.021915s]
done initalizing global data [t=0.0219207s]
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() = 71
leader_vars_follower_preconditioned.size() = 70
follower_operators.size() = 690
leader_operators.size() = 71
Initializing Symbolic Variables
Sym variable order: 1 14 17 55 31 19 43 4 37 49 61 70 25 9 53 29 59 23 41 8 65 47 84 35 64 46 22 81 7 34 40 52 28 58 15 10 2 20 32 50 44 5 26 62 38 73 56 12 16 18 30 54 24 60 3 42 66 48 36 39 27 57 45 6 63 77 21 51 33 11 13 85 78 74 67 89 86 83 95 93 71 75 0 80 69 88 94 91 87 76 82 79 68 72 90 92 
Num variables: 96 => 104
Initialize Symbolic Manager(208, 76923, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 87 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.014s
Starting Stackelberg bounded search...
 opt: 0.002 reg: 0 solved: 1 total time: 0.855199
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.855228
 opt: 0.001 reg: 0 solved: 1 total time: 0.858446
 opt: 0.001 reg: 0 solved: 1 total time: 0.85992
 opt: 0.001 reg: 0 solved: 1 total time: 0.861258
 opt: 0.002 reg: 0 solved: 1 total time: 0.863919
 opt: 0.002 reg: 0 solved: 1 total time: 0.866116
 opt: 0.005 reg: 0 solved: 2 total time: 0.871563
L = 1, leader states: 128, follower subproblems: 128, F:100000, total time: 0.871612
 opt: 0.005 reg: 0 solved: 2 total time: 0.880291
 opt: 0.003 reg: 0 solved: 1 total time: 0.883763
 opt: 0.005 reg: 0 solved: 2 total time: 0.889407
L = 2, leader states: 1458, follower subproblems: 1458, F:100000, total time: 0.889473
 opt: 0.008 reg: 0 solved: 3 total time: 0.900768
 opt: 0.005 reg: 0 solved: 2 total time: 0.906749
 opt: 0.008 reg: 0.001 solved: 4 total time: 0.916109
 opt: 0.009 reg: 0.005 solved: 6 total time: 0.930935
 opt: 0.016 reg: 0.006 solved: 4 total time: 0.954064
 opt: 0.013 reg: 0.005 solved: 4 total time: 0.973332
 opt: 0.016 reg: 0.008 solved: 4 total time: 0.997937
 opt: 0.011 reg: 0.019 solved: 5 total time: 1.02906
 opt: 0.016 reg: 0.001 solved: 6 total time: 1.04731
 opt: 0.017 reg: 0.002 solved: 6 total time: 1.06784
 opt: 0.012 reg: 0.004 solved: 4 total time: 1.08479
 opt: 0.011 reg: 0.014 solved: 6 total time: 1.11132
 opt: 0.008 solved: 2147483647 total time: 1.12035
L = 3, leader states: 8192, follower subproblems: 8192, F:2147483647, total time: 1.12575
Search time: 0.275s
Total number of leader states: 56653
Total number of follower subproblems: 36139
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 s59 blaststepdone
				 fix_switch t1 s43 blaststepdone
				 fix_switch t1 s29 blaststepdone
				 fix_switch t1 s13 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s55 blaststepdone
				 fix_switch t2 s25 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 23
Solved by optimal solver: 23
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 23
Solved follower subproblems: 23
Optimal solver time: 0.177s
Cost-bounded solver time: 0s
Follower search time: 0.177s
Total time: 1.12898s
Optimal engine:
Peak memory: 503944 KB
@@@T1601@@@
Done!
real 1.90
user 1.33
sys 0.34
