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/Ans_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/Ans_1.pddl
Parsing...
Parsing: [0.010s CPU, 0.046s 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.010s wall-clock]
Preparing model... [0.010s CPU, 0.006s wall-clock]
Generated 173 rules.
Computing model... [0.020s CPU, 0.023s wall-clock]
417 relevant atoms
816 auxiliary atoms
1233 final queue length
1458 total queue pushes
Completing instantiation... [0.020s CPU, 0.012s wall-clock]
Instantiating: [0.060s CPU, 0.054s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.000s 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...
41 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.000s 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.010s 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.002s wall-clock]
Translator variables: 43
Translator derived variables: 0
Translator facts: 97
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 16
Translator operators: 218
Translator axioms: 0
Translator task size: 1291
Translator peak memory: 17900 KB
Writing output... [0.010s CPU, 0.003s wall-clock]
Done! [0.100s CPU, 0.131s 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.
43 variables of 43 necessary
0 of 3 mutex groups necessary.
218 of 218 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 97 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=1849, notReached=7396, spurious=164
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=8785, notReached=460, spurious=164
3 operators are spurious because were not triggered
H^2 mutexes added fw: 460, unreachable: 0
0 of 215 operators detected as spurious
Total mutex and disambiguation time: 0.008257 iterations: 2
230 of 230 mutex groups necessary.
215 of 218 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 215
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 43
230 of 230 mutex groups necessary.
215 of 215 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
43 variables of 43 of 43 necessary
The causal graph is not acyclic.
43 variables of 43 necessary
230 of 230 mutex groups necessary.
215 of 215 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 43
Preprocessor facts: 97
Preprocessor derived variables: 0
Preprocessor operators: 215
Preprocessor mutex groups: 230
Preprocessor task size: 1719
Writing output...
Preprocessor time: 0.0183737s
Preprocessor peak memory: 2632 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.000308327s]
Simplifying transitions... done!
done reading input! [t=0.00862262s]
building causal graph...done! [t=0.0090016s]
packing state variables...Variables: 43
Bytes per state: 8
done! [t=0.00902177s]
done initalizing global data [t=0.00902739s]
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() = 186
leader_operators.size() = 29
Initializing Symbolic Variables
Sym variable order: 1 11 10 8 23 20 26 5 35 14 17 9 7 6 2 25 31 22 4 16 13 19 15 24 18 3 21 27 12 28 32 30 38 37 0 42 36 41 29 40 33 39 34 
Num variables: 43 => 48
Initialize Symbolic Manager(96, 166666, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 23 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.507566
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.507591
 opt: 0 reg: 0 solved: 1 total time: 0.508453
 opt: 0 reg: 0 solved: 1 total time: 0.508985
 opt: 0.001 reg: 0 solved: 2 total time: 0.510379
L = 1, leader states: 16, follower subproblems: 16, F:100000, total time: 0.510422
 opt: 0.001 reg: 0 solved: 2 total time: 0.512535
 opt: 0 reg: 0 solved: 1 total time: 0.513268
 opt: 0.001 reg: 0 solved: 2 total time: 0.51452
L = 2, leader states: 54, follower subproblems: 54, F:100000, total time: 0.514565
 opt: 0.002 reg: 0 solved: 3 total time: 0.517475
 opt: 0.001 reg: 0 solved: 2 total time: 0.519004
 opt: 0.001 reg: 0 solved: 3 total time: 0.521437
 opt: 0.002 reg: 0.001 solved: 4 total time: 0.525141
 opt: 0.002 reg: 0.001 solved: 4 total time: 0.529452
 opt: 0.001 reg: 0.001 solved: 3 total time: 0.532416
L = 3, leader states: 128, follower subproblems: 128, F:100000, total time: 0.532459
 opt: 0.002 reg: 0.003 solved: 4 total time: 0.538866
 opt: 0.001 reg: 0.003 solved: 2 total time: 0.543349
 opt: 0.001 reg: 0.005 solved: 3 total time: 0.550789
 opt: 0.002 reg: 0.015 solved: 4 total time: 0.569428
 opt: 0.002 reg: 0.01 solved: 3 total time: 0.582618
 opt: 0.002 reg: 0.002 solved: 3 total time: 0.587499
L = 4, leader states: 250, follower subproblems: 250, F:100000, total time: 0.587549
 opt: 0.001 reg: 0.002 solved: 2 total time: 0.591985
 opt: 0.002 solved: 2147483647 total time: 0.594093
L = 5, leader states: 432, follower subproblems: 432, F:2147483647, total time: 0.595819
Search time: 0.089s
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 s3 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s17 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_switch t3 s8 blaststepdone
				 fix_next-step t3 t4 blaststepdone
				 fix_last-step t4 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 21
Solved by optimal solver: 21
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 21
Solved follower subproblems: 21
Optimal solver time: 0.025s
Cost-bounded solver time: 0s
Follower search time: 0.025s
Total time: 0.596791s
Optimal engine:
Peak memory: 477064 KB
@@@T889@@@
Done!
real 1.56
user 0.62
sys 0.30
