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/Pern_1.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/Pern_1.pddl
Parsing...
Parsing: [0.010s CPU, 0.011s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.011s wall-clock]
Preparing model... [0.010s CPU, 0.007s wall-clock]
Generated 173 rules.
Computing model... [0.030s CPU, 0.025s wall-clock]
416 relevant atoms
821 auxiliary atoms
1237 final queue length
1460 total queue pushes
Completing instantiation... [0.010s CPU, 0.014s wall-clock]
Instantiating: [0.060s CPU, 0.060s 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...
42 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.000s wall-clock]
Computing fact groups: [0.010s CPU, 0.009s 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.000s CPU, 0.001s wall-clock]
Translating task: [0.020s CPU, 0.018s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.000s CPU, 0.003s wall-clock]
Translator variables: 44
Translator derived variables: 0
Translator facts: 99
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 16
Translator operators: 217
Translator axioms: 0
Translator task size: 1286
Translator peak memory: 17908 KB
Writing output... [0.000s CPU, 0.003s wall-clock]
Done! [0.100s CPU, 0.105s 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.
44 variables of 44 necessary
0 of 3 mutex groups necessary.
217 of 217 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 99 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=1936, notReached=7699, spurious=166
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=9143, notReached=492, spurious=166
2 operators are spurious because were not triggered
H^2 mutexes added fw: 492, unreachable: 0
0 of 215 operators detected as spurious
Total mutex and disambiguation time: 0.008632 iterations: 2
246 of 246 mutex groups necessary.
215 of 217 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 215
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 44
246 of 246 mutex groups necessary.
215 of 215 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
44 variables of 44 of 44 necessary
The causal graph is not acyclic.
44 variables of 44 necessary
246 of 246 mutex groups necessary.
215 of 215 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 44
Preprocessor facts: 99
Preprocessor derived variables: 0
Preprocessor operators: 215
Preprocessor mutex groups: 246
Preprocessor task size: 1752
Writing output...
Preprocessor time: 0.0199505s
Preprocessor peak memory: 2640 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.000247988s]
Simplifying transitions... done!
done reading input! [t=0.00736399s]
building causal graph...done! [t=0.00785512s]
packing state variables...Variables: 44
Bytes per state: 8
done! [t=0.00788511s]
done initalizing global data [t=0.00789151s]
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() = 29
leader_vars_follower_preconditioned.size() = 28
follower_operators.size() = 186
leader_operators.size() = 29
Initializing Symbolic Variables
Sym variable order: 1 31 16 25 4 22 13 19 14 20 23 5 26 35 17 2 10 7 9 27 24 12 3 15 18 21 11 6 8 41 29 33 38 39 42 30 37 0 40 43 34 36 28 32 
Num variables: 44 => 49
Initialize Symbolic Manager(98, 163265, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 32 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.001s
Starting Stackelberg bounded search...
 opt: 0 reg: 0 solved: 1 total time: 0.566435
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.566459
 opt: 0 reg: 0 solved: 1 total time: 0.56738
 opt: 0 reg: 0 solved: 1 total time: 0.567944
 opt: 0.001 reg: 0 solved: 2 total time: 0.569747
 opt: 0 reg: 0 solved: 1 total time: 0.570397
L = 1, leader states: 16, follower subproblems: 16, F:100000, total time: 0.570428
 opt: 0.002 reg: 0 solved: 2 total time: 0.573665
 opt: 0.001 reg: 0 solved: 2 total time: 0.575522
L = 2, leader states: 54, follower subproblems: 54, F:100000, total time: 0.575558
 opt: 0.002 reg: 0 solved: 3 total time: 0.578761
 opt: 0.002 reg: 0 solved: 2 total time: 0.581185
 opt: 0.002 reg: 0 solved: 4 total time: 0.584678
 opt: 0.003 reg: 0 solved: 4 total time: 0.589212
 opt: 0.002 reg: 0 solved: 3 total time: 0.592971
 opt: 0.003 reg: 0.001 solved: 4 total time: 0.59778
 opt: 0.002 reg: 0 solved: 4 total time: 0.60155
L = 3, leader states: 128, follower subproblems: 128, F:100000, total time: 0.601599
 opt: 0.001 reg: 0 solved: 2 total time: 0.605207
 opt: 0.003 reg: 0.002 solved: 4 total time: 0.611766
 opt: 0.002 reg: 0.004 solved: 3 total time: 0.618884
 opt: 0.003 reg: 0.01 solved: 4 total time: 0.632
 opt: 0.002 solved: 2147483647 total time: 0.634361
L = 4, leader states: 250, follower subproblems: 250, F:2147483647, total time: 0.635685
Search time: 0.07s
Total number of leader states: 1096
Total number of follower subproblems: 656
Pareto-frontier size: 1
Pareto-frontier: (4,2147483647) 
	 fix ops costs: 4, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s60 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s59 blaststepdone
				 fix_switch t2 s126 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 19
Solved by optimal solver: 19
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 19
Solved follower subproblems: 19
Optimal solver time: 0.031s
Cost-bounded solver time: 0s
Follower search time: 0.031s
Total time: 0.63677s
Optimal engine:
Peak memory: 480560 KB
@@@T908@@@
Done!
real 1.22
user 0.72
sys 0.25
