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/Atmnet_1.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/Atmnet_1.pddl
Parsing...
Parsing: [0.010s CPU, 0.026s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.003s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
Preparing model... [0.010s CPU, 0.008s wall-clock]
Generated 173 rules.
Computing model... [0.040s CPU, 0.033s wall-clock]
419 relevant atoms
824 auxiliary atoms
1243 final queue length
1468 total queue pushes
Completing instantiation... [0.010s CPU, 0.017s wall-clock]
Instantiating: [0.070s CPU, 0.074s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.006s 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...
42 uncovered facts
Choosing groups: [0.000s CPU, 0.000s wall-clock]
Building translation key... [0.000s CPU, 0.000s wall-clock]
Computing fact groups: [0.010s CPU, 0.007s 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.001s wall-clock]
Translating task: [0.020s CPU, 0.016s 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.003s wall-clock]
Translator variables: 44
Translator derived variables: 0
Translator facts: 99
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 16
Translator operators: 219
Translator axioms: 0
Translator task size: 1298
Translator peak memory: 17900 KB
Writing output... [0.000s CPU, 0.003s wall-clock]
Done! [0.110s CPU, 0.133s 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.
44 variables of 44 necessary
0 of 3 mutex groups necessary.
219 of 219 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 99 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=1936, notReached=7699, spurious=166
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=9143, notReached=492, spurious=166
3 operators are spurious because were not triggered
H^2 mutexes added fw: 492, unreachable: 0
0 of 216 operators detected as spurious
Total mutex and disambiguation time: 0.007544 iterations: 2
246 of 246 mutex groups necessary.
216 of 219 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 216
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 44
246 of 246 mutex groups necessary.
216 of 216 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
44 variables of 44 of 44 necessary
The causal graph is not acyclic.
44 variables of 44 necessary
246 of 246 mutex groups necessary.
216 of 216 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 44
Preprocessor facts: 99
Preprocessor derived variables: 0
Preprocessor operators: 216
Preprocessor mutex groups: 246
Preprocessor task size: 1758
Writing output...
Preprocessor time: 0.0193343s
Preprocessor peak memory: 2636 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.000237515s]
Simplifying transitions... done!
done reading input! [t=0.00570333s]
building causal graph...done! [t=0.0060127s]
packing state variables...Variables: 44
Bytes per state: 8
done! [t=0.00603353s]
done initalizing global data [t=0.00603905s]
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() = 29
leader_vars_follower_preconditioned.size() = 28
follower_operators.size() = 187
leader_operators.size() = 29
Initializing Symbolic Variables
Sym variable order: 1 26 23 14 5 17 20 35 24 18 21 3 12 27 15 2 9 31 13 16 4 25 22 19 7 8 10 11 6 29 40 37 41 38 42 33 43 0 34 39 30 32 28 36 
Num variables: 44 => 49
Initialize Symbolic Manager(98, 163265, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 32 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.001s
Starting Stackelberg bounded search...
 opt: 0 reg: 0 solved: 1 total time: 0.554082
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.554114
 opt: 0 reg: 0 solved: 1 total time: 0.55506
 opt: 0 reg: 0 solved: 1 total time: 0.555498
 opt: 0.001 reg: 0 solved: 2 total time: 0.557209
L = 1, leader states: 16, follower subproblems: 16, F:100000, total time: 0.557271
 opt: 0.001 reg: 0 solved: 2 total time: 0.559808
 opt: 0 reg: 0 solved: 1 total time: 0.56069
 opt: 0.001 reg: 0 solved: 2 total time: 0.562363
L = 2, leader states: 54, follower subproblems: 54, F:100000, total time: 0.562401
 opt: 0.002 reg: 0 solved: 3 total time: 0.565737
 opt: 0.001 reg: 0 solved: 2 total time: 0.567704
 opt: 0.002 reg: 0 solved: 3 total time: 0.570339
 opt: 0.003 reg: 0 solved: 3 total time: 0.57389
 opt: 0.002 reg: 0.001 solved: 4 total time: 0.577696
 opt: 0.002 reg: 0.001 solved: 4 total time: 0.581767
L = 3, leader states: 128, follower subproblems: 128, F:100000, total time: 0.581817
 opt: 0.002 reg: 0.003 solved: 4 total time: 0.58835
 opt: 0.001 reg: 0.003 solved: 2 total time: 0.594061
 opt: 0.002 reg: 0.005 solved: 3 total time: 0.601607
 opt: 0.002 reg: 0.005 solved: 3 total time: 0.609999
 opt: 0.002 reg: 0.004 solved: 3 total time: 0.616802
 opt: 0.002 reg: 0.007 solved: 3 total time: 0.627368
 opt: 0.003 reg: 0.011 solved: 4 total time: 0.642376
L = 4, leader states: 250, follower subproblems: 250, F:100000, total time: 0.642459
 opt: 0.003 reg: 0.01 solved: 4 total time: 0.657505
 opt: 0.003 reg: 0.014 solved: 4 total time: 0.675165
 opt: 0.002 reg: 0.014 solved: 2 total time: 0.691729
 opt: 0.003 reg: 0.003 solved: 3 total time: 0.698526
 opt: 0.003 reg: 0.004 solved: 4 total time: 0.707012
 opt: 0.003 reg: 0.008 solved: 3 total time: 0.718882
 opt: 0.003 reg: 0.011 solved: 4 total time: 0.734608
 opt: 0.003 reg: 0.008 solved: 3 total time: 0.746726
 opt: 0.003 reg: 0.011 solved: 4 total time: 0.761808
 opt: 0.003 reg: 0.013 solved: 4 total time: 0.778862
 opt: 0.003 reg: 0.004 solved: 4 total time: 0.786891
 opt: 0.002 reg: 0.004 solved: 3 total time: 0.794343
 opt: 0.003 reg: 0.006 solved: 3 total time: 0.804589
 opt: 0.003 reg: 0.007 solved: 4 total time: 0.81529
 opt: 0.003 reg: 0.003 solved: 4 total time: 0.821744
 opt: 0.002 solved: 2147483647 total time: 0.824113
L = 5, leader states: 432, follower subproblems: 432, F:2147483647, total time: 0.825778
Search time: 0.273s
Total number of leader states: 1566
Total number of follower subproblems: 1126
Pareto-frontier size: 1
Pareto-frontier: (5,2147483647) 
	 fix ops costs: 5, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s8 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s12 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_switch t3 s11 blaststepdone
				 fix_next-step t3 t4 blaststepdone
				 fix_last-step t4 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 36
Solved by optimal solver: 36
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 36
Solved follower subproblems: 36
Optimal solver time: 0.074s
Cost-bounded solver time: 0s
Follower search time: 0.074s
Total time: 0.826865s
Optimal engine:
Peak memory: 485020 KB
@@@T1171@@@
Done!
real 2.24
user 0.84
sys 0.35
