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/Palmetto_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/Palmetto_2.pddl
Parsing...
Parsing: [0.000s CPU, 0.010s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.002s 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.080s CPU, 0.081s wall-clock]
1139 relevant atoms
2139 auxiliary atoms
3278 final queue length
4072 total queue pushes
Completing instantiation... [0.050s CPU, 0.047s wall-clock]
Instantiating: [0.160s CPU, 0.153s 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...
90 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.061s 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: 92
Translator derived variables: 0
Translator facts: 204
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 25
Translator operators: 758
Translator axioms: 0
Translator task size: 4342
Translator peak memory: 20692 KB
Writing output... [0.010s CPU, 0.010s wall-clock]
Done! [0.250s CPU, 0.258s 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.
92 variables of 92 necessary
0 of 3 mutex groups necessary.
758 of 758 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 204 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=8464, notReached=32770, spurious=382
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=39330, notReached=1904, spurious=382
5 operators are spurious because were not triggered
H^2 mutexes added fw: 1904, unreachable: 0
0 of 753 operators detected as spurious
Total mutex and disambiguation time: 0.049436 iterations: 2
952 of 952 mutex groups necessary.
753 of 758 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 753
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 92
952 of 952 mutex groups necessary.
753 of 753 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
92 variables of 92 of 92 necessary
The causal graph is not acyclic.
92 variables of 92 necessary
952 of 952 mutex groups necessary.
753 of 753 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 92
Preprocessor facts: 204
Preprocessor derived variables: 0
Preprocessor operators: 753
Preprocessor mutex groups: 952
Preprocessor task size: 6196
Writing output...
Preprocessor time: 0.0867707s
Preprocessor peak memory: 3920 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.000361211s]
Simplifying transitions... done!
done reading input! [t=0.0222252s]
building causal graph...done! [t=0.0229605s]
packing state variables...Variables: 92
Bytes per state: 16
done! [t=0.0230331s]
done initalizing global data [t=0.0230488s]
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() = 682
leader_operators.size() = 71
Initializing Symbolic Variables
Sym variable order: 1 13 15 10 12 18 30 42 54 3 48 60 36 24 66 46 22 28 40 34 7 78 64 58 52 16 44 72 62 56 38 5 20 32 50 26 2 63 39 45 21 6 75 57 33 27 51 31 55 49 61 4 19 43 25 69 37 65 81 53 47 35 8 41 23 59 29 9 14 11 17 76 73 67 82 91 70 79 0 83 89 80 85 71 90 74 77 68 87 88 84 86 
Num variables: 92 => 100
Initialize Symbolic Manager(200, 80000, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 123 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.013s
Starting Stackelberg bounded search...
 opt: 0.001 reg: 0 solved: 1 total time: 0.776427
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.776454
 opt: 0 reg: 0 solved: 1 total time: 0.779151
 opt: 0.001 reg: 0 solved: 1 total time: 0.780222
 opt: 0 reg: 0 solved: 1 total time: 0.781171
 opt: 0.001 reg: 0 solved: 1 total time: 0.782716
 opt: 0.001 reg: 0 solved: 1 total time: 0.78426
 opt: 0.003 reg: 0 solved: 2 total time: 0.787658
L = 1, leader states: 128, follower subproblems: 128, F:100000, total time: 0.787701
 opt: 0.005 reg: 0 solved: 3 total time: 0.795744
 opt: 0.001 reg: 0 solved: 1 total time: 0.797452
 opt: 0.003 reg: 0 solved: 2 total time: 0.801664
 opt: 0.005 reg: 0 solved: 3 total time: 0.807483
 opt: 0.008 reg: 0 solved: 3 total time: 0.816233
L = 2, leader states: 1458, follower subproblems: 1458, F:100000, total time: 0.816319
 opt: 0.004 reg: 0.001 solved: 6 total time: 0.825053
 opt: 0.003 reg: 0.003 solved: 4 total time: 0.832983
 opt: 0.003 reg: 0.01 solved: 5 total time: 0.847283
 opt: 0.004 reg: 0.006 solved: 2 total time: 0.857532
 opt: 0.007 reg: 0.006 solved: 3 total time: 0.87148
 opt: 0.012 reg: 0.016 solved: 6 total time: 0.900679
 opt: 0.011 reg: 0.015 solved: 6 total time: 0.927589
 opt: 0.009 reg: 0.009 solved: 3 total time: 0.946823
 opt: 0.013 reg: 0.014 solved: 6 total time: 0.975275
 opt: 0.004 reg: 0.009 solved: 7 total time: 0.989554
 opt: 0.003 solved: 2147483647 total time: 0.992732
L = 3, leader states: 8192, follower subproblems: 8192, F:2147483647, total time: 0.997078
Search time: 0.225s
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_switch t0 s82 blaststepdone
				 fix_switch t0 s37 blaststepdone
				 fix_switch t0 s24 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s69 blaststepdone
				 fix_switch t1 s50 blaststepdone
				 fix_switch t1 s5 blaststepdone
				 fix_next-step t1 t2 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.102s
Cost-bounded solver time: 0s
Follower search time: 0.102s
Total time: 1.00019s
Optimal engine:
Peak memory: 491764 KB
@@@T1502@@@
Done!
real 1.74
user 1.29
sys 0.29
