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/Peer1_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/Peer1_4.pddl
Parsing...
Parsing: [0.000s 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.010s CPU, 0.008s wall-clock]
Generated 173 rules.
Computing model... [0.100s CPU, 0.103s wall-clock]
1924 relevant atoms
3477 auxiliary atoms
5401 final queue length
6860 total queue pushes
Completing instantiation... [0.090s CPU, 0.082s wall-clock]
Instantiating: [0.210s CPU, 0.208s 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...
134 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.010s 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.009s wall-clock]
Translating task: [0.110s CPU, 0.114s 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.015s wall-clock]
Translator variables: 136
Translator derived variables: 0
Translator facts: 298
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 31
Translator operators: 1393
Translator axioms: 0
Translator task size: 7910
Translator peak memory: 23788 KB
Writing output... [0.010s CPU, 0.018s wall-clock]
Done! [0.370s CPU, 0.381s 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.
136 variables of 136 necessary
0 of 3 mutex groups necessary.
1393 of 1393 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 298 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=18496, notReached=69728, spurious=580
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=84632, notReached=3592, spurious=580
8 operators are spurious because were not triggered
H^2 mutexes added fw: 3592, unreachable: 0
0 of 1385 operators detected as spurious
Total mutex and disambiguation time: 0.162699 iterations: 2
1796 of 1796 mutex groups necessary.
1385 of 1393 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 1385
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 136
1796 of 1796 mutex groups necessary.
1385 of 1385 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
136 variables of 136 of 136 necessary
The causal graph is not acyclic.
136 variables of 136 necessary
1796 of 1796 mutex groups necessary.
1385 of 1385 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 136
Preprocessor facts: 298
Preprocessor derived variables: 0
Preprocessor operators: 1385
Preprocessor mutex groups: 1796
Preprocessor task size: 11430
Writing output...
Preprocessor time: 0.232905s
Preprocessor peak memory: 5868 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.000259457s]
Simplifying transitions... done!
done reading input! [t=0.0390789s]
building causal graph...done! [t=0.0401941s]
packing state variables...Variables: 136
Bytes per state: 20
done! [t=0.0403048s]
done initalizing global data [t=0.0403094s]
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() = 109
leader_vars_follower_preconditioned.size() = 108
follower_operators.size() = 1276
leader_operators.size() = 109
Initializing Symbolic Variables
Sym variable order: 1 102 78 70 62 94 3 86 22 54 38 30 46 19 11 20 96 32 40 88 24 5 48 64 108 80 56 72 18 17 84 52 120 44 68 100 9 76 28 92 60 36 25 49 89 57 41 97 6 111 65 81 73 33 2 71 31 87 105 55 4 23 47 95 39 63 79 37 93 61 53 29 123 10 85 69 77 45 101 15 26 90 98 82 74 7 34 58 114 66 50 42 51 59 83 99 27 91 8 43 67 117 35 75 21 16 14 12 13 103 124 112 118 121 135 109 106 115 0 125 126 113 119 131 129 116 134 110 107 104 122 130 132 133 127 128 
Num variables: 136 => 145
Initialize Symbolic Manager(290, 55172, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 204 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.031s
Starting Stackelberg bounded search...
 opt: 0.003 reg: 0 solved: 1 total time: 1.0773
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 1.07733
 opt: 0.001 reg: 0 solved: 1 total time: 1.08211
 opt: 0 reg: 0 solved: 1 total time: 1.08295
 opt: 0.001 reg: 0 solved: 1 total time: 1.08497
 opt: 0.001 reg: 0 solved: 1 total time: 1.08688
 opt: 0.002 reg: 0 solved: 1 total time: 1.08903
 opt: 0.001 reg: 0 solved: 1 total time: 1.09096
 opt: 0.001 reg: 0 solved: 1 total time: 1.09275
 opt: 0.001 reg: 0 solved: 1 total time: 1.09444
 opt: 0.004 reg: 0 solved: 2 total time: 1.09868
L = 1, leader states: 512, follower subproblems: 512, F:100000, total time: 1.09874
 opt: 0.011 reg: 0 solved: 2 total time: 1.11464
 opt: 0.008 reg: 0 solved: 2 total time: 1.12305
L = 2, leader states: 13122, follower subproblems: 13122, F:100000, total time: 1.12311
 opt: 0.007 reg: 0 solved: 3 total time: 1.13579
 opt: 0.005 reg: 0 solved: 2 total time: 1.14211
 opt: 0.016 reg: 0 solved: 3 total time: 1.15939
 opt: 0.008 reg: 0 solved: 4 total time: 1.16888
 opt: 0.014 reg: 0 solved: 3 total time: 1.18424
 opt: 0.007 reg: 0.002 solved: 5 total time: 1.1949
 opt: 0.013 reg: 0.003 solved: 4 total time: 1.21166
 opt: 0.01 reg: 0.009 solved: 6 total time: 1.23183
 opt: 0.015 reg: 0.011 solved: 6 total time: 1.25903
 opt: 0.011 reg: 0.03 solved: 7 total time: 1.30073
 opt: 0.024 reg: 0.022 solved: 5 total time: 1.34833
 opt: 0.008 reg: 0.011 solved: 8 total time: 1.3682
 opt: 0.036 reg: 0.004 solved: 8 total time: 1.40892
 opt: 0.018 reg: 0.006 solved: 7 total time: 1.43412
 opt: 0.003 solved: 2147483647 total time: 1.43795
L = 3, leader states: 131072, follower subproblems: 131072, F:2147483647, total time: 1.44547
Search time: 0.377s
Total number of leader states: 1.31658e+06
Total number of follower subproblems: 853603
Pareto-frontier size: 1
Pareto-frontier: (3,2147483647) 
	 fix ops costs: 3, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s95 blaststepdone
				 fix_switch t1 s81 blaststepdone
				 fix_switch t1 s67 blaststepdone
				 fix_switch t1 s53 blaststepdone
				 fix_switch t1 s39 blaststepdone
				 fix_switch t1 s25 blaststepdone
				 fix_switch t1 s11 blaststepdone
				 fix_switch t1 s109 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 27
Solved by optimal solver: 27
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 27
Solved follower subproblems: 27
Optimal solver time: 0.229s
Cost-bounded solver time: 0s
Follower search time: 0.229s
Total time: 1.45096s
Optimal engine:
Peak memory: 447892 KB
@@@T2211@@@
Done!
real 2.60
user 1.97
sys 0.31
