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/BtNorthAmerica_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/BtNorthAmerica_1.pddl
Parsing...
Parsing: [0.010s CPU, 0.009s 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.011s wall-clock]
Preparing model... [0.010s CPU, 0.007s wall-clock]
Generated 173 rules.
Computing model... [0.020s CPU, 0.025s wall-clock]
419 relevant atoms
824 auxiliary atoms
1243 final queue length
1468 total queue pushes
Completing instantiation... [0.020s CPU, 0.013s wall-clock]
Instantiating: [0.070s CPU, 0.058s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.000s CPU, 0.006s 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.010s CPU, 0.000s wall-clock]
Computing fact groups: [0.010s CPU, 0.008s 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.010s CPU, 0.017s 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.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: 219
Translator axioms: 0
Translator task size: 1298
Translator peak memory: 17908 KB
Writing output... [0.000s CPU, 0.003s wall-clock]
Done! [0.110s CPU, 0.100s 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.
219 of 219 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
3 operators are spurious because were not triggered
H^2 mutexes added fw: 492, unreachable: 0
0 of 216 operators detected as spurious
Total mutex and disambiguation time: 0.007942 iterations: 2
246 of 246 mutex groups necessary.
216 of 219 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 216
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.
216 of 216 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.
216 of 216 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: 216
Preprocessor mutex groups: 246
Preprocessor task size: 1758
Writing output...
Preprocessor time: 0.0202953s
Preprocessor peak memory: 2636 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.000292839s]
Simplifying transitions... done!
done reading input! [t=0.006973s]
building causal graph...done! [t=0.00734511s]
packing state variables...Variables: 44
Bytes per state: 8
done! [t=0.00736693s]
done initalizing global data [t=0.00737471s]
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() = 187
leader_operators.size() = 29
Initializing Symbolic Variables
Sym variable order: 1 26 23 14 5 17 20 35 24 18 21 3 12 27 15 2 9 31 13 16 4 25 22 19 7 8 10 11 6 38 40 33 41 29 42 37 43 0 30 39 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.520735
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.520759
 opt: 0 reg: 0 solved: 1 total time: 0.521689
 opt: 0 reg: 0 solved: 1 total time: 0.522293
 opt: 0.001 reg: 0 solved: 2 total time: 0.523861
L = 1, leader states: 16, follower subproblems: 16, F:100000, total time: 0.52389
 opt: 0.001 reg: 0 solved: 2 total time: 0.526327
 opt: 0 reg: 0 solved: 1 total time: 0.527249
 opt: 0.001 reg: 0 solved: 2 total time: 0.529153
L = 2, leader states: 54, follower subproblems: 54, F:100000, total time: 0.529185
 opt: 0.002 reg: 0 solved: 2 total time: 0.532024
 opt: 0.002 reg: 0 solved: 3 total time: 0.53465
 opt: 0.002 reg: 0 solved: 3 total time: 0.537213
 opt: 0.002 reg: 0 solved: 4 total time: 0.540724
 opt: 0.002 reg: 0 solved: 4 total time: 0.54461
 opt: 0.002 reg: 0 solved: 3 total time: 0.548037
L = 3, leader states: 128, follower subproblems: 128, F:100000, total time: 0.548081
 opt: 0.001 reg: 0.001 solved: 2 total time: 0.551969
 opt: 0.002 reg: 0.001 solved: 3 total time: 0.556283
 opt: 0.002 reg: 0 solved: 3 total time: 0.559556
 opt: 0.003 reg: 0.001 solved: 4 total time: 0.564308
 opt: 0.002 reg: 0.001 solved: 3 total time: 0.567416
 opt: 0.002 reg: 0.001 solved: 4 total time: 0.57203
 opt: 0.003 reg: 0.002 solved: 4 total time: 0.577398
 opt: 0.002 reg: 0.003 solved: 4 total time: 0.583459
 opt: 0.002 reg: 0.001 solved: 4 total time: 0.587752
 opt: 0.002 reg: 0.006 solved: 4 total time: 0.597111
 opt: 0.003 reg: 0.01 solved: 4 total time: 0.610695
 opt: 0.002 reg: 0.011 solved: 3 total time: 0.625125
L = 4, leader states: 250, follower subproblems: 250, F:100000, total time: 0.625233
 opt: 0.003 reg: 0.01 solved: 3 total time: 0.63953
 opt: 0.001 reg: 0.009 solved: 2 total time: 0.651219
 opt: 0.002 reg: 0.002 solved: 3 total time: 0.655895
 opt: 0.002 solved: 2147483647 total time: 0.658343
L = 5, leader states: 432, follower subproblems: 432, F:2147483647, total time: 0.659963
Search time: 0.14s
Total number of leader states: 1566
Total number of follower subproblems: 1126
Pareto-frontier size: 1
Pareto-frontier: (5,2147483647) 
	 fix ops costs: 5, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s5 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s7 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_switch t3 s21 blaststepdone
				 fix_next-step t3 t4 blaststepdone
				 fix_last-step t4 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.049s
Cost-bounded solver time: 0s
Follower search time: 0.049s
Total time: 0.661024s
Optimal engine:
Peak memory: 482616 KB
@@@T945@@@
Done!
real 1.10
user 0.69
sys 0.32
