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/Savvis_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/Savvis_2.pddl
Parsing...
Parsing: [0.010s CPU, 0.011s 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.070s CPU, 0.072s wall-clock]
1160 relevant atoms
2192 auxiliary atoms
3352 final queue length
4159 total queue pushes
Completing instantiation... [0.050s CPU, 0.051s wall-clock]
Instantiating: [0.140s CPU, 0.148s wall-clock]
Computing fact groups...
Finding invariants...
26 initial candidates
Finding invariants: [0.010s CPU, 0.008s 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...
96 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.011s 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.005s wall-clock]
Translating task: [0.070s CPU, 0.065s 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.010s wall-clock]
Translator variables: 98
Translator derived variables: 0
Translator facts: 216
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 25
Translator operators: 771
Translator axioms: 0
Translator task size: 4433
Translator peak memory: 20688 KB
Writing output... [0.010s CPU, 0.011s wall-clock]
Done! [0.250s CPU, 0.260s 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.
98 variables of 98 necessary
0 of 3 mutex groups necessary.
771 of 771 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 216 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=9604, notReached=36658, spurious=394
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=44394, notReached=1868, spurious=394
7 operators are spurious because were not triggered
H^2 mutexes added fw: 1868, unreachable: 0
0 of 764 operators detected as spurious
Total mutex and disambiguation time: 0.053629 iterations: 2
934 of 934 mutex groups necessary.
764 of 771 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 764
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 98
934 of 934 mutex groups necessary.
764 of 764 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
98 variables of 98 of 98 necessary
The causal graph is not acyclic.
98 variables of 98 necessary
934 of 934 mutex groups necessary.
764 of 764 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 98
Preprocessor facts: 216
Preprocessor derived variables: 0
Preprocessor operators: 764
Preprocessor mutex groups: 934
Preprocessor task size: 6240
Writing output...
Preprocessor time: 0.0885316s
Preprocessor peak memory: 4068 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.000334351s]
Simplifying transitions... done!
done reading input! [t=0.0227442s]
building causal graph...done! [t=0.023569s]
packing state variables...Variables: 98
Bytes per state: 16
done! [t=0.0236553s]
done initalizing global data [t=0.0236617s]
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() = 71
leader_vars_follower_preconditioned.size() = 70
follower_operators.size() = 693
leader_operators.size() = 71
Initializing Symbolic Variables
Sym variable order: 1 14 9 11 15 43 31 19 49 61 4 55 37 70 25 28 40 82 58 52 7 64 46 22 34 17 35 29 23 53 86 8 41 65 47 59 2 20 50 74 32 5 26 44 38 62 56 36 42 24 30 60 3 66 48 54 18 16 10 13 39 33 45 63 6 78 57 51 21 27 12 91 89 68 85 72 76 92 95 93 96 77 88 81 73 0 90 69 97 80 84 94 79 75 87 83 71 67 
Num variables: 98 => 106
Initialize Symbolic Manager(212, 75471, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 89 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.013s
Starting Stackelberg bounded search...
 opt: 0.001 reg: 0 solved: 1 total time: 0.894634
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.894665
 opt: 0.001 reg: 0 solved: 1 total time: 0.897759
 opt: 0.001 reg: 0 solved: 1 total time: 0.899167
 opt: 0.001 reg: 0 solved: 1 total time: 0.900393
 opt: 0.002 reg: 0 solved: 1 total time: 0.902725
 opt: 0.001 reg: 0 solved: 1 total time: 0.904772
 opt: 0.004 reg: 0 solved: 2 total time: 0.909247
L = 1, leader states: 128, follower subproblems: 128, F:100000, total time: 0.909312
 opt: 0.007 reg: 0 solved: 2 total time: 0.919074
 opt: 0.005 reg: 0 solved: 2 total time: 0.924256
L = 2, leader states: 1458, follower subproblems: 1458, F:100000, total time: 0.924316
 opt: 0.003 reg: 0 solved: 1 total time: 0.930146
 opt: 0.005 reg: 0 solved: 2 total time: 0.935447
 opt: 0.007 reg: 0 solved: 3 total time: 0.943668
 opt: 0.008 reg: 0 solved: 4 total time: 0.953099
 opt: 0.014 reg: 0.001 solved: 4 total time: 0.969191
 opt: 0.007 reg: 0.002 solved: 3 total time: 0.979102
 opt: 0.01 reg: 0.001 solved: 3 total time: 0.991764
 opt: 0.015 reg: 0.001 solved: 4 total time: 1.00928
L = 3, leader states: 8192, follower subproblems: 8192, F:100000, total time: 1.00939
 opt: 0.012 reg: 0.001 solved: 4 total time: 1.02619
 opt: 0.007 reg: 0.002 solved: 2 total time: 1.03558
 opt: 0.007 reg: 0.005 solved: 3 total time: 1.04854
 opt: 0.012 reg: 0.013 solved: 4 total time: 1.07417
 opt: 0.012 reg: 0.012 solved: 4 total time: 1.09932
 opt: 0.011 reg: 0.02 solved: 4 total time: 1.13134
 opt: 0.013 reg: 0.007 solved: 5 total time: 1.15234
 opt: 0.017 reg: 0.003 solved: 4 total time: 1.17395
 opt: 0.012 reg: 0.007 solved: 5 total time: 1.19382
 opt: 0.011 reg: 0.006 solved: 4 total time: 1.21182
 opt: 0.012 reg: 0.021 solved: 6 total time: 1.24566
 opt: 0.012 reg: 0.003 solved: 5 total time: 1.26142
 opt: 0.011 reg: 0.002 solved: 4 total time: 1.2752
 opt: 0.016 reg: 0.002 solved: 4 total time: 1.29429
 opt: 0.018 reg: 0.005 solved: 5 total time: 1.31898
 opt: 0.012 reg: 0.016 solved: 6 total time: 1.34859
 opt: 0.01 reg: 0.016 solved: 5 total time: 1.37568
 opt: 0.011 reg: 0.022 solved: 6 total time: 1.40972
 opt: 0.013 reg: 0.001 solved: 4 total time: 1.42541
 opt: 0.015 reg: 0.002 solved: 5 total time: 1.44338
 opt: 0.009 reg: 0.003 solved: 5 total time: 1.45583
 opt: 0.011 reg: 0.006 solved: 6 total time: 1.47403
 opt: 0.017 reg: 0.009 solved: 6 total time: 1.50178
 opt: 0.02 reg: 0.008 solved: 5 total time: 1.53011
 opt: 0.012 reg: 0.009 solved: 5 total time: 1.55166
 opt: 0.011 reg: 0.018 solved: 5 total time: 1.58168
 opt: 0.019 reg: 0.006 solved: 4 total time: 1.60841
 opt: 0.011 reg: 0.01 solved: 6 total time: 1.6309
 opt: 0.015 reg: 0.01 solved: 5 total time: 1.65654
 opt: 0.018 reg: 0.018 solved: 6 total time: 1.69369
 opt: 0.01 reg: 0.028 solved: 6 total time: 1.73376
 opt: 0.02 reg: 0.024 solved: 6 total time: 1.77886
 opt: 0.022 reg: 0.017 solved: 6 total time: 1.81884
 opt: 0.012 reg: 0.03 solved: 5 total time: 1.86211
 opt: 0.018 reg: 0.011 solved: 4 total time: 1.89223
 opt: 0.018 reg: 0.02 solved: 6 total time: 1.93166
 opt: 0.024 reg: 0.016 solved: 6 total time: 1.97271
 opt: 0.021 reg: 0.017 solved: 5 total time: 2.01182
 opt: 0.012 reg: 0.018 solved: 5 total time: 2.04317
 opt: 0.019 reg: 0.009 solved: 5 total time: 2.07222
 opt: 0.018 reg: 0.015 solved: 6 total time: 2.10561
 opt: 0.02 reg: 0.01 solved: 6 total time: 2.13716
 opt: 0.021 reg: 0.011 solved: 6 total time: 2.17068
 opt: 0.021 reg: 0.013 solved: 6 total time: 2.20573
 opt: 0.02 reg: 0.011 solved: 6 total time: 2.2373
 opt: 0.018 reg: 0.009 solved: 6 total time: 2.26529
 opt: 0.023 reg: 0.009 solved: 6 total time: 2.29886
L = 4, leader states: 31250, follower subproblems: 31250, F:100000, total time: 2.29903
 opt: 0.006 reg: 0.016 solved: 2 total time: 2.32564
 opt: 0.018 reg: 0.02 solved: 4 total time: 2.3641
 opt: 0.016 reg: 0 solved: 4 total time: 2.38161
 opt: 0.015 reg: 0 solved: 4 total time: 2.39789
 opt: 0.013 reg: 0.002 solved: 4 total time: 2.41384
 opt: 0.011 reg: 0.001 solved: 3 total time: 2.42719
 opt: 0.015 reg: 0.001 solved: 4 total time: 2.44467
 opt: 0.017 reg: 0.001 solved: 4 total time: 2.46388
 opt: 0.014 reg: 0.003 solved: 4 total time: 2.48126
 opt: 0.013 reg: 0.013 solved: 5 total time: 2.50785
 opt: 0.019 reg: 0.013 solved: 4 total time: 2.54065
 opt: 0.014 reg: 0.013 solved: 4 total time: 2.56877
 opt: 0.016 reg: 0.026 solved: 5 total time: 2.6123
 opt: 0.022 reg: 0.008 solved: 5 total time: 2.64402
 opt: 0.023 reg: 0.011 solved: 5 total time: 2.67894
 opt: 0.015 reg: 0.009 solved: 4 total time: 2.70398
 opt: 0.02 reg: 0.014 solved: 5 total time: 2.73876
 opt: 0.02 reg: 0.01 solved: 4 total time: 2.76962
 opt: 0.016 reg: 0.024 solved: 4 total time: 2.81056
 opt: 0.016 reg: 0.041 solved: 6 total time: 2.86933
 opt: 0.023 reg: 0.008 solved: 6 total time: 2.90206
 opt: 0.016 solved: 2147483647 total time: 2.91906
L = 5, leader states: 93312, follower subproblems: 93312, F:2147483647, total time: 2.92924
Search time: 2.042s
Total number of leader states: 487287
Total number of follower subproblems: 302468
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_switch t1 s25 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s27 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_switch t3 s6 blaststepdone
				 fix_switch t3 s37 blaststepdone
				 fix_switch t3 s18 blaststepdone
				 fix_next-step t3 t4 blaststepdone
				 fix_last-step t4 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 86
Solved by optimal solver: 86
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 86
Solved follower subproblems: 86
Optimal solver time: 1.154s
Cost-bounded solver time: 0s
Follower search time: 1.154s
Total time: 2.93422s
Optimal engine:
Peak memory: 555020 KB
@@@T3461@@@
Done!
real 3.74
user 3.16
sys 0.38
