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/Claranet_4.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/Claranet_4.pddl
Parsing...
Parsing: [0.010s CPU, 0.010s 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.000s CPU, 0.008s wall-clock]
Generated 173 rules.
Computing model... [0.100s CPU, 0.093s wall-clock]
1688 relevant atoms
3099 auxiliary atoms
4787 final queue length
6037 total queue pushes
Completing instantiation... [0.070s CPU, 0.072s wall-clock]
Instantiating: [0.180s CPU, 0.187s 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...
125 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.012s 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.008s wall-clock]
Translating task: [0.100s CPU, 0.095s 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.014s wall-clock]
Translator variables: 127
Translator derived variables: 0
Translator facts: 278
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 29
Translator operators: 1190
Translator axioms: 0
Translator task size: 6779
Translator peak memory: 22632 KB
Writing output... [0.010s CPU, 0.016s wall-clock]
Done! [0.330s CPU, 0.339s 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.
127 variables of 127 necessary
0 of 3 mutex groups necessary.
1190 of 1190 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 278 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=16129, notReached=60635, spurious=520
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=73426, notReached=3338, spurious=520
8 operators are spurious because were not triggered
H^2 mutexes added fw: 3338, unreachable: 0
0 of 1182 operators detected as spurious
Total mutex and disambiguation time: 0.122504 iterations: 2
1669 of 1669 mutex groups necessary.
1182 of 1190 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 1182
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 127
1669 of 1669 mutex groups necessary.
1182 of 1182 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
127 variables of 127 of 127 necessary
The causal graph is not acyclic.
127 variables of 127 necessary
1669 of 1669 mutex groups necessary.
1182 of 1182 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 127
Preprocessor facts: 278
Preprocessor derived variables: 0
Preprocessor operators: 1182
Preprocessor mutex groups: 1669
Preprocessor task size: 10047
Writing output...
Preprocessor time: 0.188227s
Preprocessor peak memory: 5484 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.000372527s]
Simplifying transitions... done!
done reading input! [t=0.0363247s]
building causal graph...done! [t=0.0373478s]
packing state variables...Variables: 127
Bytes per state: 20
done! [t=0.0374436s]
done initalizing global data [t=0.0374484s]
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() = 100
leader_vars_follower_preconditioned.size() = 99
follower_operators.size() = 1083
leader_operators.size() = 99
Initializing Symbolic Variables
Sym variable order: 1 17 80 48 32 72 88 6 102 24 40 56 64 18 51 43 35 27 111 9 59 67 83 75 91 12 42 34 66 108 58 8 26 82 90 50 74 11 57 73 65 89 41 7 25 33 49 81 105 16 2 46 70 30 78 38 4 62 22 54 86 96 79 23 63 39 71 5 99 31 47 55 87 19 45 21 69 29 93 3 85 53 37 77 61 44 92 28 52 68 10 114 76 84 36 60 13 15 14 20 124 122 123 120 118 98 107 104 113 125 95 117 119 116 101 121 110 0 94 109 112 126 106 100 97 103 115 
Num variables: 127 => 136
Initialize Symbolic Manager(272, 58823, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 276 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.028s
Starting Stackelberg bounded search...
 opt: 0.002 reg: 0 solved: 1 total time: 1.0393
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 1.03933
 opt: 0.001 reg: 0 solved: 1 total time: 1.04478
 opt: 0.001 reg: 0 solved: 1 total time: 1.04592
 opt: 0.003 reg: 0 solved: 1 total time: 1.04957
 opt: 0.002 reg: 0 solved: 1 total time: 1.05219
 opt: 0.004 reg: 0 solved: 1 total time: 1.05633
 opt: 0.003 reg: 0 solved: 1 total time: 1.05988
 opt: 0.002 reg: 0 solved: 1 total time: 1.06266
 opt: 0.002 reg: 0 solved: 1 total time: 1.06567
 opt: 0.004 reg: 0 solved: 2 total time: 1.0708
L = 1, leader states: 512, follower subproblems: 512, F:100000, total time: 1.07086
 opt: 0.013 reg: 0 solved: 3 total time: 1.08957
 opt: 0.01 reg: 0 solved: 2 total time: 1.10025
 opt: 0.021 reg: 0 solved: 3 total time: 1.12211
 opt: 0.01 reg: 0 solved: 4 total time: 1.13274
 opt: 0.011 reg: 0 solved: 6 total time: 1.14534
 opt: 0.01 reg: 0 solved: 5 total time: 1.15668
 opt: 0.013 reg: 0.001 solved: 9 total time: 1.17237
 opt: 0.013 reg: 0.002 solved: 7 total time: 1.18922
 opt: 0.014 reg: 0.003 solved: 8 total time: 1.20802
 opt: 0.006 solved: 2147483647 total time: 1.21476
L = 2, leader states: 13122, follower subproblems: 13122, F:2147483647, total time: 1.22186
Search time: 0.19s
Total number of leader states: 210242
Total number of follower subproblems: 137889
Pareto-frontier size: 1
Pareto-frontier: (2,2147483647) 
	 fix ops costs: 2, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s97 blaststepdone
				 fix_switch t1 s82 blaststepdone
				 fix_switch t1 s7 blaststepdone
				 fix_switch t1 s67 blaststepdone
				 fix_switch t1 s52 blaststepdone
				 fix_switch t1 s37 blaststepdone
				 fix_switch t1 s22 blaststepdone
				 fix_switch t1 s112 blaststepdone
				 fix_last-step t1 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 20
Solved by optimal solver: 20
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 20
Solved follower subproblems: 20
Optimal solver time: 0.145s
Cost-bounded solver time: 0s
Follower search time: 0.145s
Total time: 1.22737s
Optimal engine:
Peak memory: 431108 KB
@@@T1908@@@
Done!
real 2.18
user 1.66
sys 0.31
