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/Geant2009_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/Geant2009_1.pddl
Parsing...
Parsing: [0.010s CPU, 0.009s wall-clock]
Normalizing task... [0.000s CPU, 0.000s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.011s wall-clock]
Preparing model... [0.000s CPU, 0.008s wall-clock]
Generated 173 rules.
Computing model... [0.050s CPU, 0.051s wall-clock]
851 relevant atoms
1627 auxiliary atoms
2478 final queue length
3037 total queue pushes
Completing instantiation... [0.040s CPU, 0.034s wall-clock]
Instantiating: [0.110s CPU, 0.107s 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...
73 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.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.003s wall-clock]
Translating task: [0.040s CPU, 0.042s 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.006s wall-clock]
Translator variables: 75
Translator derived variables: 0
Translator facts: 167
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 22
Translator operators: 534
Translator axioms: 0
Translator task size: 3085
Translator peak memory: 19616 KB
Writing output... [0.010s CPU, 0.007s wall-clock]
Done! [0.190s CPU, 0.184s 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.
75 variables of 75 necessary
0 of 3 mutex groups necessary.
534 of 534 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 167 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=5625, notReached=21962, spurious=302
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=26299, notReached=1288, spurious=302
6 operators are spurious because were not triggered
H^2 mutexes added fw: 1288, unreachable: 0
0 of 528 operators detected as spurious
Total mutex and disambiguation time: 0.027668 iterations: 2
644 of 644 mutex groups necessary.
528 of 534 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 528
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 75
644 of 644 mutex groups necessary.
528 of 528 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
75 variables of 75 of 75 necessary
The causal graph is not acyclic.
75 variables of 75 necessary
644 of 644 mutex groups necessary.
528 of 528 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 75
Preprocessor facts: 167
Preprocessor derived variables: 0
Preprocessor operators: 528
Preprocessor mutex groups: 644
Preprocessor task size: 4320
Writing output...
Preprocessor time: 0.0492316s
Preprocessor peak memory: 3536 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.000299055s]
Simplifying transitions... done!
done reading input! [t=0.0143883s]
building causal graph...done! [t=0.0149499s]
packing state variables...Variables: 75
Bytes per state: 12
done! [t=0.015011s]
done initalizing global data [t=0.015015s]
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() = 55
leader_vars_follower_preconditioned.size() = 54
follower_operators.size() = 473
leader_operators.size() = 55
Initializing Symbolic Variables
Sym variable order: 1 45 20 30 65 7 25 35 40 50 42 47 32 17 4 54 37 22 27 31 51 36 21 3 46 26 16 41 2 14 12 13 43 48 23 33 5 58 38 18 28 15 9 24 49 29 61 6 44 34 19 39 11 8 10 62 59 55 52 74 70 57 67 0 64 71 66 73 63 56 53 72 60 68 69 
Num variables: 75 => 82
Initialize Symbolic Manager(164, 97560, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 70 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.007s
Starting Stackelberg bounded search...
 opt: 0.001 reg: 0 solved: 1 total time: 0.677343
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.677373
 opt: 0 reg: 0 solved: 1 total time: 0.679202
 opt: 0.001 reg: 0 solved: 1 total time: 0.680361
 opt: 0 reg: 0 solved: 1 total time: 0.681227
 opt: 0 reg: 0 solved: 1 total time: 0.682205
 opt: 0.001 reg: 0 solved: 1 total time: 0.683531
 opt: 0.005 reg: 0 solved: 3 total time: 0.689037
L = 1, leader states: 64, follower subproblems: 64, F:100000, total time: 0.689097
 opt: 0.004 reg: 0 solved: 3 total time: 0.695167
 opt: 0.004 reg: 0 solved: 3 total time: 0.700284
 opt: 0.006 reg: 0 solved: 3 total time: 0.707092
 opt: 0.007 reg: 0 solved: 3 total time: 0.714783
 opt: 0.004 reg: 0 solved: 4 total time: 0.720047
 opt: 0.006 reg: 0.001 solved: 4 total time: 0.728122
 opt: 0.006 reg: 0 solved: 3 total time: 0.735836
L = 2, leader states: 486, follower subproblems: 486, F:100000, total time: 0.73591
 opt: 0.007 reg: 0 solved: 4 total time: 0.746428
 opt: 0.006 reg: 0 solved: 4 total time: 0.753694
 opt: 0.008 reg: 0 solved: 4 total time: 0.763331
 opt: 0.004 reg: 0.001 solved: 3 total time: 0.768972
 opt: 0.007 reg: 0.002 solved: 4 total time: 0.779259
 opt: 0.008 reg: 0.001 solved: 4 total time: 0.789381
 opt: 0.007 reg: 0.002 solved: 3 total time: 0.798637
 opt: 0.003 reg: 0.003 solved: 4 total time: 0.805986
 opt: 0.007 reg: 0.005 solved: 4 total time: 0.81931
L = 3, leader states: 2048, follower subproblems: 2048, F:100000, total time: 0.819447
 opt: 0.009 reg: 0.005 solved: 4 total time: 0.836615
 opt: 0.004 solved: 2147483647 total time: 0.840939
L = 4, leader states: 6250, follower subproblems: 6250, F:2147483647, total time: 0.845331
Search time: 0.171s
Total number of leader states: 32176
Total number of follower subproblems: 19976
Pareto-frontier size: 1
Pareto-frontier: (4,2147483647) 
	 fix ops costs: 4, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_switch t0 s4 blaststepdone
				 fix_switch t0 s14 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s15 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s20 blaststepdone
				 fix_switch t2 s2 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 25
Solved by optimal solver: 25
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 25
Solved follower subproblems: 25
Optimal solver time: 0.115s
Cost-bounded solver time: 0s
Follower search time: 0.115s
Total time: 0.848003s
Optimal engine:
Peak memory: 450704 KB
@@@T1223@@@
Done!
real 1.45
user 1.02
sys 0.28
