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/Renater2006_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/Renater2006_2.pddl
Parsing...
Parsing: [0.010s CPU, 0.013s 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.012s wall-clock]
Preparing model... [0.010s CPU, 0.007s wall-clock]
Generated 173 rules.
Computing model... [0.040s CPU, 0.038s wall-clock]
602 relevant atoms
1165 auxiliary atoms
1767 final queue length
2130 total queue pushes
Completing instantiation... [0.020s CPU, 0.022s wall-clock]
Instantiating: [0.080s CPU, 0.082s 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...
54 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.002s wall-clock]
Translating task: [0.030s CPU, 0.030s 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.004s wall-clock]
Translator variables: 56
Translator derived variables: 0
Translator facts: 126
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 19
Translator operators: 349
Translator axioms: 0
Translator task size: 2030
Translator peak memory: 18588 KB
Writing output... [0.010s CPU, 0.005s wall-clock]
Done! [0.140s CPU, 0.146s 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.
56 variables of 56 necessary
0 of 3 mutex groups necessary.
349 of 349 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 126 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=3136, notReached=12516, spurious=224
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=14816, notReached=836, spurious=224
4 operators are spurious because were not triggered
H^2 mutexes added fw: 836, unreachable: 0
0 of 345 operators detected as spurious
Total mutex and disambiguation time: 0.014045 iterations: 2
418 of 418 mutex groups necessary.
345 of 349 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 345
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 56
418 of 418 mutex groups necessary.
345 of 345 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
56 variables of 56 of 56 necessary
The causal graph is not acyclic.
56 variables of 56 necessary
418 of 418 mutex groups necessary.
345 of 345 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 56
Preprocessor facts: 126
Preprocessor derived variables: 0
Preprocessor operators: 345
Preprocessor mutex groups: 418
Preprocessor task size: 2826
Writing output...
Preprocessor time: 0.0308739s
Preprocessor peak memory: 2912 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.000366049s]
Simplifying transitions... done!
done reading input! [t=0.0114654s]
building causal graph...done! [t=0.0118503s]
packing state variables...Variables: 56
Bytes per state: 8
done! [t=0.011901s]
done initalizing global data [t=0.0119056s]
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() = 41
leader_vars_follower_preconditioned.size() = 40
follower_operators.size() = 304
leader_operators.size() = 41
Initializing Symbolic Variables
Sym variable order: 1 12 13 21 25 47 37 6 29 17 33 26 38 18 14 3 22 30 34 11 2 28 16 20 5 36 44 24 32 23 31 35 19 4 15 41 27 8 9 10 7 48 42 39 55 45 0 43 51 49 54 46 40 53 50 52 
Num variables: 56 => 62
Initialize Symbolic Manager(124, 129032, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 62 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.003s
Starting Stackelberg bounded search...
 opt: 0 reg: 0 solved: 1 total time: 0.608211
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.608237
 opt: 0 reg: 0 solved: 1 total time: 0.609488
 opt: 0 reg: 0 solved: 1 total time: 0.610147
 opt: 0 reg: 0 solved: 1 total time: 0.610973
 opt: 0 reg: 0 solved: 1 total time: 0.611688
 opt: 0.001 reg: 0 solved: 2 total time: 0.613315
L = 1, leader states: 32, follower subproblems: 32, F:100000, total time: 0.613351
 opt: 0.002 reg: 0 solved: 3 total time: 0.616893
 opt: 0.002 reg: 0 solved: 2 total time: 0.619224
 opt: 0.003 reg: 0 solved: 3 total time: 0.622755
L = 2, leader states: 162, follower subproblems: 162, F:100000, total time: 0.622795
 opt: 0.002 reg: 0 solved: 2 total time: 0.626575
 opt: 0.002 reg: 0 solved: 3 total time: 0.630108
 opt: 0.004 reg: 0 solved: 3 total time: 0.634885
 opt: 0.001 solved: 2147483647 total time: 0.636294
L = 3, leader states: 512, follower subproblems: 512, F:2147483647, total time: 0.638088
Search time: 0.032s
Total number of leader states: 2581
Total number of follower subproblems: 1603
Pareto-frontier size: 1
Pareto-frontier: (3,2147483647) 
	 fix ops costs: 3, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_switch t0 s21 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s54 blaststepdone
				 fix_switch t1 s53 blaststepdone
				 fix_switch t1 s20 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 13
Solved by optimal solver: 13
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 13
Solved follower subproblems: 13
Optimal solver time: 0.017s
Cost-bounded solver time: 0s
Follower search time: 0.017s
Total time: 0.639577s
Optimal engine:
Peak memory: 405332 KB
@@@T974@@@
Done!
real 1.28
user 0.73
sys 0.32
