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/Marnet_3.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/Marnet_3.pddl
Parsing...
Parsing: [0.010s CPU, 0.057s 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.012s wall-clock]
Preparing model... [0.010s CPU, 0.008s wall-clock]
Generated 173 rules.
Computing model... [0.030s CPU, 0.034s wall-clock]
510 relevant atoms
995 auxiliary atoms
1505 final queue length
1795 total queue pushes
Completing instantiation... [0.020s CPU, 0.018s wall-clock]
Instantiating: [0.070s CPU, 0.075s 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...
49 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.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.020s CPU, 0.023s 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.004s wall-clock]
Translator variables: 51
Translator derived variables: 0
Translator facts: 114
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 17
Translator operators: 278
Translator axioms: 0
Translator task size: 1631
Translator peak memory: 18320 KB
Writing output... [0.000s CPU, 0.005s wall-clock]
Done! [0.120s CPU, 0.176s 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.
51 variables of 51 necessary
0 of 3 mutex groups necessary.
278 of 278 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 114 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=2601, notReached=10207, spurious=188
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=12078, notReached=730, spurious=188
4 operators are spurious because were not triggered
H^2 mutexes added fw: 730, unreachable: 0
0 of 274 operators detected as spurious
Total mutex and disambiguation time: 0.010563 iterations: 2
365 of 365 mutex groups necessary.
274 of 278 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 274
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 51
365 of 365 mutex groups necessary.
274 of 274 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
51 variables of 51 of 51 necessary
The causal graph is not acyclic.
51 variables of 51 necessary
365 of 365 mutex groups necessary.
274 of 274 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 51
Preprocessor facts: 114
Preprocessor derived variables: 0
Preprocessor operators: 274
Preprocessor mutex groups: 365
Preprocessor task size: 2323
Writing output...
Preprocessor time: 0.0229847s
Preprocessor peak memory: 2908 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.000321936s]
Simplifying transitions... done!
done reading input! [t=0.0087869s]
building causal graph...done! [t=0.00912219s]
packing state variables...Variables: 51
Bytes per state: 8
done! [t=0.00914124s]
done initalizing global data [t=0.00914806s]
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() = 36
leader_vars_follower_preconditioned.size() = 35
follower_operators.size() = 239
leader_operators.size() = 35
Initializing Symbolic Variables
Sym variable order: 1 7 23 39 31 5 15 27 19 16 24 20 6 42 32 28 9 11 2 26 36 14 4 30 18 22 17 21 13 3 25 33 29 10 12 8 34 43 37 50 40 0 41 46 35 49 44 38 47 45 48 
Num variables: 51 => 57
Initialize Symbolic Manager(114, 140350, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 82 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.613695
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.613721
 opt: 0 reg: 0 solved: 1 total time: 0.615137
 opt: 0 reg: 0 solved: 1 total time: 0.615934
 opt: 0 reg: 0 solved: 1 total time: 0.616881
 opt: 0 reg: 0 solved: 1 total time: 0.617671
 opt: 0.001 reg: 0 solved: 2 total time: 0.619645
L = 1, leader states: 32, follower subproblems: 32, F:100000, total time: 0.619693
 opt: 0.001 solved: 2147483647 total time: 0.622276
L = 2, leader states: 162, follower subproblems: 162, F:2147483647, total time: 0.623592
Search time: 0.012s
Total number of leader states: 962
Total number of follower subproblems: 609
Pareto-frontier size: 1
Pareto-frontier: (2,2147483647) 
	 fix ops costs: 2, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s71 blaststepdone
				 fix_switch t1 s53 blaststepdone
				 fix_switch t1 s35 blaststepdone
				 fix_switch t1 s17 blaststepdone
				 fix_last-step t1 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 7
Solved by optimal solver: 7
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 7
Solved follower subproblems: 7
Optimal solver time: 0.003s
Cost-bounded solver time: 0s
Follower search time: 0.003s
Total time: 0.625085s
Optimal engine:
Peak memory: 511708 KB
@@@T990@@@
Done!
real 1.16
user 0.67
sys 0.34
