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/Sanet_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/Sanet_1.pddl
Parsing...
Parsing: [0.020s 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.007s wall-clock]
Generated 173 rules.
Computing model... [0.030s CPU, 0.037s wall-clock]
610 relevant atoms
1189 auxiliary atoms
1799 final queue length
2168 total queue pushes
Completing instantiation... [0.020s CPU, 0.021s wall-clock]
Instantiating: [0.070s CPU, 0.078s 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...
57 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.009s 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.002s wall-clock]
Translating task: [0.030s CPU, 0.027s 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.004s wall-clock]
Translator variables: 59
Translator derived variables: 0
Translator facts: 132
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 19
Translator operators: 354
Translator axioms: 0
Translator task size: 2068
Translator peak memory: 18572 KB
Writing output... [0.000s CPU, 0.005s wall-clock]
Done! [0.140s CPU, 0.136s 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.
59 variables of 59 necessary
0 of 3 mutex groups necessary.
354 of 354 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 132 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=3481, notReached=13713, spurious=230
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=16392, notReached=802, spurious=230
2 operators are spurious because were not triggered
H^2 mutexes added fw: 802, unreachable: 0
0 of 352 operators detected as spurious
Total mutex and disambiguation time: 0.017276 iterations: 2
401 of 401 mutex groups necessary.
352 of 354 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 352
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 59
401 of 401 mutex groups necessary.
352 of 352 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
59 variables of 59 of 59 necessary
The causal graph is not acyclic.
59 variables of 59 necessary
401 of 401 mutex groups necessary.
352 of 352 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 59
Preprocessor facts: 132
Preprocessor derived variables: 0
Preprocessor operators: 352
Preprocessor mutex groups: 401
Preprocessor task size: 2841
Writing output...
Preprocessor time: 0.0328103s
Preprocessor peak memory: 3056 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.000302053s]
Simplifying transitions... done!
done reading input! [t=0.0113821s]
building causal graph...done! [t=0.0118202s]
packing state variables...Variables: 59
Bytes per state: 12
done! [t=0.0118764s]
done initalizing global data [t=0.0118805s]
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() = 41
leader_vars_follower_preconditioned.size() = 40
follower_operators.size() = 311
leader_operators.size() = 41
Initializing Symbolic Variables
Sym variable order: 1 10 13 8 37 33 29 6 49 21 17 25 16 20 28 24 5 32 36 45 9 2 12 15 23 19 31 4 35 41 27 11 34 38 14 3 30 18 26 22 7 42 46 50 56 43 58 47 40 0 54 39 57 55 52 51 44 48 53 
Num variables: 59 => 65
Initialize Symbolic Manager(130, 123076, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 40 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.003s
Starting Stackelberg bounded search...
 opt: 0.001 reg: 0 solved: 1 total time: 0.572952
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.57298
 opt: 0 reg: 0 solved: 1 total time: 0.574399
 opt: 0 reg: 0 solved: 1 total time: 0.575432
 opt: 0.001 reg: 0 solved: 1 total time: 0.576508
 opt: 0 reg: 0 solved: 1 total time: 0.577397
 opt: 0.002 reg: 0 solved: 2 total time: 0.579868
L = 1, leader states: 32, follower subproblems: 32, F:100000, total time: 0.57991
 opt: 0.003 reg: 0 solved: 2 total time: 0.584393
 opt: 0.002 reg: 0 solved: 2 total time: 0.58681
L = 2, leader states: 162, follower subproblems: 162, F:100000, total time: 0.586853
 opt: 0.003 reg: 0 solved: 3 total time: 0.591393
 opt: 0.002 reg: 0 solved: 2 total time: 0.593923
 opt: 0.003 reg: 0 solved: 4 total time: 0.598479
 opt: 0.003 reg: 0.002 solved: 4 total time: 0.604296
 opt: 0.003 reg: 0.004 solved: 3 total time: 0.61196
 opt: 0.005 reg: 0.006 solved: 4 total time: 0.623669
 opt: 0.006 reg: 0.004 solved: 4 total time: 0.63422
 opt: 0.005 reg: 0.002 solved: 4 total time: 0.642092
L = 3, leader states: 512, follower subproblems: 512, F:100000, total time: 0.642163
 opt: 0.004 reg: 0.011 solved: 4 total time: 0.65941
 opt: 0.005 reg: 0.011 solved: 4 total time: 0.676077
 opt: 0.005 reg: 0.002 solved: 4 total time: 0.684018
 opt: 0.002 reg: 0.001 solved: 2 total time: 0.687961
 opt: 0.003 reg: 0.002 solved: 3 total time: 0.69407
 opt: 0.005 reg: 0.006 solved: 4 total time: 0.706117
 opt: 0.006 reg: 0.007 solved: 4 total time: 0.719605
 opt: 0.006 reg: 0.004 solved: 4 total time: 0.731313
 opt: 0.004 reg: 0.004 solved: 4 total time: 0.740733
 opt: 0.004 reg: 0.006 solved: 4 total time: 0.751959
 opt: 0.004 reg: 0.005 solved: 4 total time: 0.761833
 opt: 0.004 reg: 0.003 solved: 4 total time: 0.770214
 opt: 0.006 reg: 0.003 solved: 4 total time: 0.780283
 opt: 0.004 reg: 0.004 solved: 4 total time: 0.789876
 opt: 0.005 reg: 0.003 solved: 4 total time: 0.798576
 opt: 0.005 reg: 0.003 solved: 4 total time: 0.807779
 opt: 0.004 reg: 0.004 solved: 4 total time: 0.816656
 opt: 0.005 reg: 0.003 solved: 4 total time: 0.825951
L = 4, leader states: 1250, follower subproblems: 1250, F:100000, total time: 0.826028
 opt: 0.005 reg: 0.006 solved: 4 total time: 0.839217
 opt: 0.004 reg: 0.019 solved: 4 total time: 0.863732
 opt: 0.003 reg: 0.012 solved: 3 total time: 0.880285
 opt: 0.005 reg: 0.002 solved: 4 total time: 0.889015
 opt: 0.002 reg: 0.001 solved: 2 total time: 0.893858
 opt: 0.006 reg: 0.004 solved: 4 total time: 0.904637
 opt: 0.006 reg: 0.005 solved: 4 total time: 0.916102
 opt: 0.005 reg: 0.004 solved: 4 total time: 0.925542
 opt: 0.006 reg: 0.003 solved: 4 total time: 0.93591
 opt: 0.008 reg: 0.005 solved: 4 total time: 0.950342
 opt: 0.004 reg: 0.013 solved: 5 total time: 0.968655
 opt: 0.003 solved: 2147483647 total time: 0.972362
L = 5, leader states: 2592, follower subproblems: 2592, F:2147483647, total time: 0.97542
Search time: 0.405s
Total number of leader states: 11751
Total number of follower subproblems: 7076
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 s5 blaststepdone
				 fix_switch t1 s38 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s7 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_switch t3 s6 blaststepdone
				 fix_next-step t3 t4 blaststepdone
				 fix_last-step t4 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 46
Solved by optimal solver: 46
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 46
Solved follower subproblems: 46
Optimal solver time: 0.177s
Cost-bounded solver time: 0s
Follower search time: 0.177s
Total time: 0.977016s
Optimal engine:
Peak memory: 421060 KB
@@@T1296@@@
Done!
real 1.45
user 1.09
sys 0.27
