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/Aconet_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/Aconet_2.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.020s CPU, 0.012s wall-clock]
Preparing model... [0.010s CPU, 0.009s wall-clock]
Generated 173 rules.
Computing model... [0.070s CPU, 0.074s wall-clock]
1156 relevant atoms
2176 auxiliary atoms
3332 final queue length
4139 total queue pushes
Completing instantiation... [0.060s CPU, 0.052s wall-clock]
Instantiating: [0.160s CPU, 0.151s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.008s 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...
94 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.011s 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.005s wall-clock]
Translating task: [0.070s CPU, 0.066s 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.010s wall-clock]
Translator variables: 96
Translator derived variables: 0
Translator facts: 212
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 25
Translator operators: 769
Translator axioms: 0
Translator task size: 4419
Translator peak memory: 20688 KB
Writing output... [0.010s CPU, 0.012s wall-clock]
Done! [0.270s CPU, 0.265s 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.
96 variables of 96 necessary
0 of 3 mutex groups necessary.
769 of 769 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 212 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=9216, notReached=35338, spurious=390
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=42706, notReached=1848, spurious=390
6 operators are spurious because were not triggered
H^2 mutexes added fw: 1848, unreachable: 0
0 of 763 operators detected as spurious
Total mutex and disambiguation time: 0.052551 iterations: 2
924 of 924 mutex groups necessary.
763 of 769 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 763
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 96
924 of 924 mutex groups necessary.
763 of 763 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
96 variables of 96 of 96 necessary
The causal graph is not acyclic.
96 variables of 96 necessary
924 of 924 mutex groups necessary.
763 of 763 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 96
Preprocessor facts: 212
Preprocessor derived variables: 0
Preprocessor operators: 763
Preprocessor mutex groups: 924
Preprocessor task size: 6212
Writing output...
Preprocessor time: 0.0941389s
Preprocessor peak memory: 4068 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.000252075s]
Simplifying transitions... done!
done reading input! [t=0.0220154s]
building causal graph...done! [t=0.0228773s]
packing state variables...Variables: 96
Bytes per state: 16
done! [t=0.0229773s]
done initalizing global data [t=0.0229827s]
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() = 71
leader_vars_follower_preconditioned.size() = 70
follower_operators.size() = 692
leader_operators.size() = 71
Initializing Symbolic Variables
Sym variable order: 1 14 9 15 11 10 48 18 66 30 3 60 24 42 36 54 44 50 38 26 5 32 62 73 20 56 64 52 58 34 28 7 80 22 46 40 2 16 33 63 21 45 77 6 51 57 39 27 31 37 61 43 4 19 49 55 69 25 53 59 35 47 23 8 65 84 29 41 13 17 12 90 75 87 68 79 67 88 89 91 76 94 72 86 0 71 95 83 92 82 78 93 74 85 81 70 
Num variables: 96 => 104
Initialize Symbolic Manager(208, 76923, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 81 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.016s
Starting Stackelberg bounded search...
 opt: 0.001 reg: 0 solved: 1 total time: 0.889107
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.889137
 opt: 0 reg: 0 solved: 1 total time: 0.892191
 opt: 0.001 reg: 0 solved: 1 total time: 0.893528
 opt: 0.001 reg: 0 solved: 1 total time: 0.894797
 opt: 0.002 reg: 0 solved: 1 total time: 0.897339
 opt: 0.002 reg: 0 solved: 1 total time: 0.89963
 opt: 0.008 reg: 0 solved: 3 total time: 0.908244
 opt: 0.001 reg: 0 solved: 1 total time: 0.910094
L = 1, leader states: 128, follower subproblems: 128, F:100000, total time: 0.910133
 opt: 0.007 reg: 0 solved: 3 total time: 0.91993
 opt: 0.008 reg: 0 solved: 3 total time: 0.928282
 opt: 0.009 reg: 0 solved: 4 total time: 0.938593
 opt: 0.007 reg: 0 solved: 3 total time: 0.94649
 opt: 0.009 reg: 0 solved: 3 total time: 0.956536
 opt: 0.014 reg: 0 solved: 4 total time: 0.972085
L = 2, leader states: 1458, follower subproblems: 1458, F:100000, total time: 0.972172
 opt: 0.009 reg: 0.001 solved: 3 total time: 0.985232
 opt: 0.01 reg: 0.003 solved: 4 total time: 0.999423
 opt: 0.011 reg: 0.004 solved: 4 total time: 1.01567
 opt: 0.014 reg: 0.005 solved: 4 total time: 1.03566
 opt: 0.007 reg: 0.005 solved: 4 total time: 1.0492
 opt: 0.017 reg: 0.003 solved: 4 total time: 1.07059
 opt: 0.014 reg: 0.004 solved: 4 total time: 1.08932
 opt: 0.008 reg: 0.005 solved: 3 total time: 1.10305
 opt: 0.017 reg: 0.002 solved: 4 total time: 1.12335
L = 3, leader states: 8192, follower subproblems: 8192, F:100000, total time: 1.12348
 opt: 0.011 reg: 0.003 solved: 4 total time: 1.14101
 opt: 0.008 reg: 0.008 solved: 3 total time: 1.15789
 opt: 0.01 reg: 0.014 solved: 4 total time: 1.18292
 opt: 0.014 reg: 0.008 solved: 5 total time: 1.20646
 opt: 0.016 reg: 0.001 solved: 4 total time: 1.22534
 opt: 0.007 reg: 0.001 solved: 3 total time: 1.23511
 opt: 0.012 reg: 0.009 solved: 5 total time: 1.25696
 opt: 0.009 reg: 0.012 solved: 4 total time: 1.27941
 opt: 0.015 reg: 0.014 solved: 4 total time: 1.30961
 opt: 0.01 reg: 0.018 solved: 4 total time: 1.33949
 opt: 0.009 reg: 0.004 solved: 4 total time: 1.35377
 opt: 0.012 reg: 0.009 solved: 6 total time: 1.37571
 opt: 0.01 reg: 0.008 solved: 5 total time: 1.39523
 opt: 0.016 reg: 0.007 solved: 4 total time: 1.41979
 opt: 0.017 reg: 0.015 solved: 6 total time: 1.45354
 opt: 0.012 reg: 0.029 solved: 6 total time: 1.49573
 opt: 0.022 reg: 0.011 solved: 5 total time: 1.52977
 opt: 0.02 reg: 0.017 solved: 6 total time: 1.56694
 opt: 0.018 reg: 0.019 solved: 4 total time: 1.60457
 opt: 0.013 reg: 0.039 solved: 6 total time: 1.65729
 opt: 0.013 reg: 0.03 solved: 6 total time: 1.70124
 opt: 0.012 reg: 0.003 solved: 6 total time: 1.71736
 opt: 0.015 reg: 0.004 solved: 5 total time: 1.73772
 opt: 0.025 reg: 0.004 solved: 5 total time: 1.76786
 opt: 0.019 reg: 0.004 solved: 5 total time: 1.79232
 opt: 0.024 reg: 0.007 solved: 4 total time: 1.82362
 opt: 0.025 reg: 0.022 solved: 5 total time: 1.87257
 opt: 0.013 reg: 0.031 solved: 5 total time: 1.91714
 opt: 0.016 reg: 0.015 solved: 5 total time: 1.94912
 opt: 0.022 reg: 0.018 solved: 5 total time: 1.98978
 opt: 0.028 reg: 0.02 solved: 6 total time: 2.03906
 opt: 0.014 solved: 2147483647 total time: 2.05354
L = 4, leader states: 31250, follower subproblems: 31250, F:2147483647, total time: 2.06113
Search time: 1.178s
Total number of leader states: 180996
Total number of follower subproblems: 113826
Pareto-frontier size: 1
Pareto-frontier: (4,2147483647) 
	 fix ops costs: 4, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_switch t0 s3 blaststepdone
				 fix_switch t0 s18 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s29 blaststepdone
				 fix_switch t1 s14 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s2 blaststepdone
				 fix_switch t2 s17 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 55
Solved by optimal solver: 55
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 55
Solved follower subproblems: 55
Optimal solver time: 0.664s
Cost-bounded solver time: 0s
Follower search time: 0.664s
Total time: 2.06548s
Optimal engine:
Peak memory: 527740 KB
@@@T2587@@@
Done!
real 3.20
user 2.27
sys 0.39
