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/CrlNetworkServices_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/CrlNetworkServices_2.pddl
Parsing...
Parsing: [0.020s CPU, 0.014s 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.000s CPU, 0.008s wall-clock]
Generated 173 rules.
Computing model... [0.080s CPU, 0.078s wall-clock]
1160 relevant atoms
2192 auxiliary atoms
3352 final queue length
4159 total queue pushes
Completing instantiation... [0.060s CPU, 0.052s wall-clock]
Instantiating: [0.160s CPU, 0.154s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.000s 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...
96 uncovered facts
Choosing groups: [0.010s 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.068s 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: 98
Translator derived variables: 0
Translator facts: 216
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 25
Translator operators: 771
Translator axioms: 0
Translator task size: 4433
Translator peak memory: 20688 KB
Writing output... [0.010s CPU, 0.014s wall-clock]
Done! [0.280s CPU, 0.275s 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.
98 variables of 98 necessary
0 of 3 mutex groups necessary.
771 of 771 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 216 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=9604, notReached=36658, spurious=394
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=44394, notReached=1868, spurious=394
8 operators are spurious because were not triggered
H^2 mutexes added fw: 1868, unreachable: 0
0 of 763 operators detected as spurious
Total mutex and disambiguation time: 0.054565 iterations: 2
934 of 934 mutex groups necessary.
763 of 771 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: 98
934 of 934 mutex groups necessary.
763 of 763 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
98 variables of 98 of 98 necessary
The causal graph is not acyclic.
98 variables of 98 necessary
934 of 934 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: 98
Preprocessor facts: 216
Preprocessor derived variables: 0
Preprocessor operators: 763
Preprocessor mutex groups: 934
Preprocessor task size: 6234
Writing output...
Preprocessor time: 0.0941355s
Preprocessor peak memory: 4076 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.000229753s]
Simplifying transitions... done!
done reading input! [t=0.0217183s]
building causal graph...done! [t=0.0225749s]
packing state variables...Variables: 98
Bytes per state: 16
done! [t=0.0226788s]
done initalizing global data [t=0.0226833s]
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 11 15 43 31 19 49 61 4 55 37 70 25 28 40 82 58 52 7 64 46 22 34 17 35 29 23 53 86 8 41 65 47 59 2 20 50 74 32 5 26 44 38 62 56 36 42 24 30 60 3 66 48 54 18 16 10 13 39 33 45 63 6 78 57 51 21 27 12 93 95 88 80 76 68 72 73 94 96 92 77 85 69 0 90 81 89 97 84 91 79 75 87 83 71 67 
Num variables: 98 => 106
Initialize Symbolic Manager(212, 75471, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 89 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.013s
Starting Stackelberg bounded search...
 opt: 0.001 reg: 0 solved: 1 total time: 0.869409
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.86944
 opt: 0 reg: 0 solved: 1 total time: 0.872097
 opt: 0.001 reg: 0 solved: 1 total time: 0.873316
 opt: 0.001 reg: 0 solved: 1 total time: 0.874394
 opt: 0.002 reg: 0 solved: 1 total time: 0.87652
 opt: 0.001 reg: 0 solved: 1 total time: 0.878395
 opt: 0.004 reg: 0 solved: 2 total time: 0.882855
L = 1, leader states: 128, follower subproblems: 128, F:100000, total time: 0.882904
 opt: 0.006 reg: 0 solved: 2 total time: 0.892225
 opt: 0.005 reg: 0 solved: 2 total time: 0.898116
L = 2, leader states: 1458, follower subproblems: 1458, F:100000, total time: 0.898172
 opt: 0.003 reg: 0 solved: 1 total time: 0.903848
 opt: 0.006 reg: 0 solved: 2 total time: 0.910382
 opt: 0.006 reg: 0 solved: 3 total time: 0.917498
 opt: 0.01 reg: 0 solved: 4 total time: 0.928725
 opt: 0.005 reg: 0 solved: 3 total time: 0.935548
 opt: 0.009 reg: 0.001 solved: 4 total time: 0.946609
 opt: 0.009 reg: 0.001 solved: 4 total time: 0.958313
L = 3, leader states: 8192, follower subproblems: 8192, F:100000, total time: 0.958416
 opt: 0.013 reg: 0.004 solved: 5 total time: 0.978833
 opt: 0.009 reg: 0.011 solved: 4 total time: 0.999964
 opt: 0.01 reg: 0.017 solved: 4 total time: 1.02776
 opt: 0.008 reg: 0.019 solved: 3 total time: 1.05638
 opt: 0.009 reg: 0.007 solved: 4 total time: 1.07382
 opt: 0.015 reg: 0.005 solved: 4 total time: 1.09425
 opt: 0.009 reg: 0.004 solved: 4 total time: 1.10826
 opt: 0.011 reg: 0.011 solved: 5 total time: 1.13124
 opt: 0.01 reg: 0.004 solved: 4 total time: 1.14571
 opt: 0.013 reg: 0.008 solved: 6 total time: 1.16769
 opt: 0.011 reg: 0.027 solved: 6 total time: 1.20708
 opt: 0.009 reg: 0.003 solved: 4 total time: 1.21982
 opt: 0.008 reg: 0 solved: 2 total time: 1.22849
 opt: 0.019 reg: 0.007 solved: 6 total time: 1.2559
 opt: 0.011 reg: 0.002 solved: 4 total time: 1.26982
 opt: 0.01 reg: 0.006 solved: 6 total time: 1.28645
 opt: 0.012 reg: 0.01 solved: 6 total time: 1.309
 opt: 0.014 reg: 0.006 solved: 6 total time: 1.33087
 opt: 0.018 reg: 0.011 solved: 6 total time: 1.36066
 opt: 0.019 reg: 0.011 solved: 6 total time: 1.39152
 opt: 0.026 reg: 0.018 solved: 6 total time: 1.43597
 opt: 0.021 reg: 0.017 solved: 4 total time: 1.47579
 opt: 0.017 reg: 0.024 solved: 6 total time: 1.51794
 opt: 0.014 reg: 0.019 solved: 6 total time: 1.55155
 opt: 0.01 reg: 0.005 solved: 6 total time: 1.56753
 opt: 0.021 reg: 0.006 solved: 6 total time: 1.59577
 opt: 0.011 solved: 2147483647 total time: 1.60753
L = 4, leader states: 31250, follower subproblems: 31250, F:2147483647, total time: 1.61401
Search time: 0.75s
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_next-step t0 t1 blaststepdone
				 fix_switch t1 s46 blaststepdone
				 fix_switch t1 s13 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s52 blaststepdone
				 fix_switch t2 s48 blaststepdone
				 fix_switch t2 s19 blaststepdone
				 fix_switch t2 s15 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 43
Solved by optimal solver: 43
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 43
Solved follower subproblems: 43
Optimal solver time: 0.427s
Cost-bounded solver time: 0s
Follower search time: 0.427s
Total time: 1.61789s
Optimal engine:
Peak memory: 521308 KB
@@@T2150@@@
Done!
real 2.41
user 1.91
sys 0.31
