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/Belnet2004_2.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/Belnet2004_2.pddl
Parsing...
Parsing: [0.010s CPU, 0.027s wall-clock]
Normalizing task... [0.010s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.000s CPU, 0.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.020s CPU, 0.017s wall-clock]
Preparing model... [0.000s CPU, 0.008s wall-clock]
Generated 173 rules.
Computing model... [0.070s CPU, 0.064s wall-clock]
996 relevant atoms
1894 auxiliary atoms
2890 final queue length
3564 total queue pushes
Completing instantiation... [0.040s CPU, 0.039s wall-clock]
Instantiating: [0.130s CPU, 0.133s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.000s 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...
85 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.010s 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.004s wall-clock]
Translating task: [0.050s CPU, 0.048s 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.007s wall-clock]
Translator variables: 87
Translator derived variables: 0
Translator facts: 192
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 23
Translator operators: 638
Translator axioms: 0
Translator task size: 3684
Translator peak memory: 20180 KB
Writing output... [0.000s CPU, 0.009s wall-clock]
Done! [0.220s CPU, 0.238s 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.
87 variables of 87 necessary
0 of 3 mutex groups necessary.
638 of 638 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 192 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=7569, notReached=28957, spurious=338
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=35116, notReached=1410, spurious=338
8 operators are spurious because were not triggered
H^2 mutexes added fw: 1410, unreachable: 0
0 of 630 operators detected as spurious
Total mutex and disambiguation time: 0.035344 iterations: 2
705 of 705 mutex groups necessary.
630 of 638 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 630
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 87
705 of 705 mutex groups necessary.
630 of 630 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
87 variables of 87 of 87 necessary
The causal graph is not acyclic.
87 variables of 87 necessary
705 of 705 mutex groups necessary.
630 of 630 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 87
Preprocessor facts: 192
Preprocessor derived variables: 0
Preprocessor operators: 630
Preprocessor mutex groups: 705
Preprocessor task size: 5029
Writing output...
Preprocessor time: 0.0650431s
Preprocessor peak memory: 3640 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.000255058s]
Simplifying transitions... done!
done reading input! [t=0.0190878s]
building causal graph...done! [t=0.0198008s]
packing state variables...Variables: 87
Bytes per state: 12
done! [t=0.0198732s]
done initalizing global data [t=0.0198774s]
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() = 64
leader_vars_follower_preconditioned.size() = 63
follower_operators.size() = 567
leader_operators.size() = 63
Initializing Symbolic Variables
Sym variable order: 1 16 15 20 38 50 56 6 26 32 69 44 10 13 52 76 22 40 8 46 28 58 34 24 36 48 54 4 63 18 42 30 2 12 35 17 23 59 3 29 41 53 47 55 25 43 19 5 49 66 37 31 11 45 51 57 73 7 33 21 39 27 14 9 70 60 84 77 74 82 86 72 67 62 79 0 85 65 80 78 68 75 61 64 71 81 83 
Num variables: 87 => 94
Initialize Symbolic Manager(188, 85106, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 57 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.009s
Starting Stackelberg bounded search...
 opt: 0.001 reg: 0 solved: 1 total time: 0.811265
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.811294
 opt: 0 reg: 0 solved: 1 total time: 0.813727
 opt: 0.001 reg: 0 solved: 1 total time: 0.814803
 opt: 0 reg: 0 solved: 1 total time: 0.815815
 opt: 0.001 reg: 0 solved: 1 total time: 0.817604
 opt: 0.001 reg: 0 solved: 1 total time: 0.819042
 opt: 0.007 reg: 0 solved: 3 total time: 0.826314
L = 1, leader states: 128, follower subproblems: 128, F:100000, total time: 0.826411
 opt: 0.006 reg: 0 solved: 3 total time: 0.836517
 opt: 0.006 reg: 0 solved: 4 total time: 0.84389
 opt: 0.006 reg: 0 solved: 3 total time: 0.850349
 opt: 0.011 reg: 0 solved: 4 total time: 0.862427
 opt: 0.002 reg: 0 solved: 1 total time: 0.864901
 opt: 0.009 reg: 0 solved: 4 total time: 0.87452
 opt: 0.011 reg: 0 solved: 4 total time: 0.885981
L = 2, leader states: 1458, follower subproblems: 1458, F:100000, total time: 0.886072
 opt: 0.01 reg: 0.002 solved: 6 total time: 0.900736
 opt: 0.009 reg: 0.005 solved: 5 total time: 0.915383
 opt: 0.006 reg: 0.007 solved: 3 total time: 0.929195
 opt: 0.006 reg: 0.005 solved: 3 total time: 0.941902
 opt: 0.006 reg: 0.011 solved: 4 total time: 0.960138
 opt: 0.016 reg: 0.017 solved: 5 total time: 0.993555
 opt: 0.005 reg: 0.014 solved: 4 total time: 1.01363
 opt: 0.014 reg: 0.001 solved: 6 total time: 1.02992
 opt: 0.011 reg: 0.001 solved: 6 total time: 1.04291
 opt: 0.013 reg: 0.003 solved: 4 total time: 1.05984
 opt: 0.009 reg: 0.003 solved: 6 total time: 1.07358
 opt: 0.01 reg: 0.013 solved: 6 total time: 1.09737
 opt: 0.006 reg: 0.014 solved: 4 total time: 1.11858
 opt: 0.008 reg: 0.006 solved: 6 total time: 1.13384
 opt: 0.018 reg: 0.008 solved: 6 total time: 1.16144
 opt: 0.017 reg: 0.008 solved: 6 total time: 1.18797
 opt: 0.01 reg: 0.011 solved: 6 total time: 1.2105
 opt: 0.009 reg: 0.01 solved: 6 total time: 1.2309
 opt: 0.008 reg: 0.01 solved: 6 total time: 1.25055
 opt: 0.008 reg: 0.012 solved: 6 total time: 1.27144
 opt: 0.015 reg: 0.007 solved: 6 total time: 1.29449
 opt: 0.011 reg: 0.021 solved: 4 total time: 1.32813
 opt: 0.016 reg: 0.029 solved: 6 total time: 1.37453
 opt: 0.018 reg: 0.02 solved: 6 total time: 1.41353
 opt: 0.008 reg: 0.019 solved: 6 total time: 1.44181
 opt: 0.006 reg: 0.024 solved: 4 total time: 1.473
 opt: 0.009 solved: 2147483647 total time: 1.48301
L = 3, leader states: 8192, follower subproblems: 8192, F:2147483647, total time: 1.4882
Search time: 0.681s
Total number of leader states: 56653
Total number of follower subproblems: 36139
Pareto-frontier size: 1
Pareto-frontier: (3,2147483647) 
	 fix ops costs: 3, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_switch t0 s30 blaststepdone
				 fix_switch t0 s14 blaststepdone
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s7 blaststepdone
				 fix_switch t1 s26 blaststepdone
				 fix_switch t1 s23 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s10 blaststepdone
				 fix_last-step t2 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 41
Solved by optimal solver: 41
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 41
Solved follower subproblems: 41
Optimal solver time: 0.344s
Cost-bounded solver time: 0s
Follower search time: 0.344s
Total time: 1.49099s
Optimal engine:
Peak memory: 487412 KB
@@@T2060@@@
Done!
real 2.66
user 1.70
sys 0.32
