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/Aarnet_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/Aarnet_2.pddl
Parsing...
Parsing: [0.010s 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.008s wall-clock]
Generated 173 rules.
Computing model... [0.080s CPU, 0.074s wall-clock]
1160 relevant atoms
2192 auxiliary atoms
3352 final queue length
4159 total queue pushes
Completing instantiation... [0.050s CPU, 0.050s wall-clock]
Instantiating: [0.150s CPU, 0.147s 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...
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.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.005s wall-clock]
Translating task: [0.070s CPU, 0.066s 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.012s wall-clock]
Done! [0.260s CPU, 0.261s 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=44294, notReached=1968, spurious=394
7 operators are spurious because were not triggered
H^2 mutexes added fw: 1968, unreachable: 0
0 of 764 operators detected as spurious
Total mutex and disambiguation time: 0.04983 iterations: 2
984 of 984 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
984 of 984 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
984 of 984 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: 984
Preprocessor task size: 6340
Writing output...
Preprocessor time: 0.0864023s
Preprocessor peak memory: 4064 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.000320845s]
Simplifying transitions... done!
done reading input! [t=0.0230331s]
building causal graph...done! [t=0.0238545s]
packing state variables...Variables: 98
Bytes per state: 16
done! [t=0.0239512s]
done initalizing global data [t=0.0239572s]
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 92 88 84 68 80 69 91 95 90 96 89 76 85 81 0 94 72 97 73 77 93 83 87 75 79 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: 123 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.88401
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.884036
 opt: 0 reg: 0 solved: 1 total time: 0.8868
 opt: 0.001 reg: 0 solved: 1 total time: 0.887989
 opt: 0.001 reg: 0 solved: 1 total time: 0.889249
 opt: 0.002 reg: 0 solved: 1 total time: 0.891728
 opt: 0.001 reg: 0 solved: 1 total time: 0.89372
 opt: 0.004 reg: 0 solved: 2 total time: 0.898253
L = 1, leader states: 128, follower subproblems: 128, F:100000, total time: 0.89831
 opt: 0.005 reg: 0 solved: 2 total time: 0.906156
 opt: 0.006 reg: 0 solved: 2 total time: 0.912591
L = 2, leader states: 1458, follower subproblems: 1458, F:100000, total time: 0.912642
 opt: 0.003 reg: 0 solved: 1 total time: 0.919025
 opt: 0.005 reg: 0 solved: 2 total time: 0.92445
 opt: 0.007 reg: 0 solved: 3 total time: 0.93238
 opt: 0.008 reg: 0 solved: 4 total time: 0.941528
 opt: 0.016 reg: 0 solved: 4 total time: 0.959069
 opt: 0.008 reg: 0.001 solved: 4 total time: 0.968789
 opt: 0.014 reg: 0.002 solved: 4 total time: 0.985377
 opt: 0.012 reg: 0.013 solved: 5 total time: 1.01096
 opt: 0.011 reg: 0.019 solved: 6 total time: 1.04157
 opt: 0.013 reg: 0.003 solved: 4 total time: 1.05937
 opt: 0.011 reg: 0.006 solved: 5 total time: 1.07824
 opt: 0.011 reg: 0.014 solved: 5 total time: 1.10449
 opt: 0.018 reg: 0.022 solved: 6 total time: 1.1456
 opt: 0.019 reg: 0.014 solved: 5 total time: 1.17955
L = 3, leader states: 8192, follower subproblems: 8192, F:100000, total time: 1.1797
 opt: 0.016 reg: 0.017 solved: 4 total time: 1.21611
 opt: 0.006 reg: 0.012 solved: 2 total time: 1.23552
 opt: 0.011 reg: 0.018 solved: 6 total time: 1.26603
 opt: 0.013 reg: 0.012 solved: 6 total time: 1.2919
 opt: 0.013 reg: 0.003 solved: 4 total time: 1.30966
 opt: 0.01 reg: 0.005 solved: 4 total time: 1.32602
 opt: 0.013 reg: 0.009 solved: 4 total time: 1.34863
 opt: 0.012 reg: 0.013 solved: 5 total time: 1.37565
 opt: 0.012 reg: 0.003 solved: 4 total time: 1.39267
 opt: 0.012 reg: 0.004 solved: 5 total time: 1.40945
 opt: 0.015 reg: 0.004 solved: 4 total time: 1.42947
 opt: 0.02 reg: 0.003 solved: 6 total time: 1.45375
 opt: 0.018 reg: 0.008 solved: 5 total time: 1.48142
 opt: 0.019 reg: 0.011 solved: 6 total time: 1.51309
 opt: 0.015 reg: 0.01 solved: 5 total time: 1.53851
 opt: 0.019 reg: 0.005 solved: 5 total time: 1.56356
 opt: 0.009 reg: 0.016 solved: 5 total time: 1.58973
 opt: 0.017 reg: 0.031 solved: 4 total time: 1.63879
 opt: 0.02 reg: 0.006 solved: 5 total time: 1.66493
 opt: 0.012 reg: 0.007 solved: 4 total time: 1.68565
 opt: 0.008 reg: 0.006 solved: 4 total time: 1.70125
 opt: 0.011 reg: 0.006 solved: 5 total time: 1.71932
 opt: 0.018 reg: 0.024 solved: 6 total time: 1.76194
 opt: 0.018 reg: 0.001 solved: 6 total time: 1.78284
 opt: 0.007 reg: 0.001 solved: 4 total time: 1.79222
 opt: 0.015 reg: 0.003 solved: 5 total time: 1.81165
 opt: 0.018 reg: 0.005 solved: 4 total time: 1.83516
 opt: 0.019 reg: 0.01 solved: 6 total time: 1.8648
 opt: 0.018 reg: 0.007 solved: 6 total time: 1.89048
 opt: 0.021 reg: 0.006 solved: 6 total time: 1.91919
 opt: 0.016 reg: 0.008 solved: 6 total time: 1.94389
 opt: 0.018 reg: 0.008 solved: 6 total time: 1.97105
 opt: 0.019 reg: 0.006 solved: 6 total time: 1.99718
 opt: 0.014 reg: 0.021 solved: 6 total time: 2.0332
 opt: 0.018 reg: 0.005 solved: 5 total time: 2.0565
 opt: 0.023 reg: 0.004 solved: 6 total time: 2.08518
 opt: 0.019 reg: 0.003 solved: 5 total time: 2.10819
 opt: 0.017 reg: 0.003 solved: 5 total time: 2.12931
 opt: 0.018 reg: 0.005 solved: 6 total time: 2.15367
 opt: 0.019 reg: 0.004 solved: 5 total time: 2.17835
 opt: 0.023 reg: 0.005 solved: 6 total time: 2.20723
 opt: 0.013 reg: 0.015 solved: 7 total time: 2.23645
 opt: 0.018 reg: 0.018 solved: 5 total time: 2.2741
 opt: 0.015 reg: 0.028 solved: 6 total time: 2.31783
 opt: 0.021 reg: 0.029 solved: 6 total time: 2.3692
 opt: 0.011 reg: 0.026 solved: 6 total time: 2.40802
 opt: 0.019 reg: 0.036 solved: 6 total time: 2.46386
 opt: 0.02 reg: 0.009 solved: 6 total time: 2.49373
 opt: 0.018 reg: 0.005 solved: 5 total time: 2.51803
 opt: 0.018 reg: 0.007 solved: 6 total time: 2.54394
 opt: 0.018 reg: 0.006 solved: 6 total time: 2.56973
 opt: 0.019 reg: 0.006 solved: 6 total time: 2.59565
 opt: 0.009 reg: 0.007 solved: 5 total time: 2.61326
 opt: 0.021 reg: 0.008 solved: 6 total time: 2.64362
 opt: 0.018 reg: 0.006 solved: 6 total time: 2.66876
 opt: 0.019 reg: 0.005 solved: 6 total time: 2.69438
 opt: 0.018 reg: 0.006 solved: 6 total time: 2.71964
 opt: 0.017 reg: 0.006 solved: 5 total time: 2.7435
 opt: 0.022 reg: 0.004 solved: 5 total time: 2.77011
 opt: 0.013 reg: 0.007 solved: 6 total time: 2.79122
 opt: 0.012 reg: 0.007 solved: 6 total time: 2.81081
 opt: 0.018 reg: 0.006 solved: 6 total time: 2.83583
 opt: 0.018 reg: 0.006 solved: 6 total time: 2.86041
 opt: 0.015 solved: 2147483647 total time: 2.87575
L = 4, leader states: 31250, follower subproblems: 31250, F:2147483647, total time: 2.88299
Search time: 2.005s
Total number of leader states: 180996
Total number of follower subproblems: 113826
Pareto-frontier size: 1
Pareto-frontier: (4,2147483647) 
	 fix ops costs: 4, attacker cost: 2147483647: 
	 fix action sequences: 
			 sequence 0:
				 fix_next-step t0 t1 blaststepdone
				 fix_switch t1 s25 blaststepdone
				 fix_switch t1 s14 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s6 blaststepdone
				 fix_switch t2 s33 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_switch t3 s32 blaststepdone
				 fix_switch t3 s13 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 87
Solved by optimal solver: 87
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 87
Solved follower subproblems: 87
Optimal solver time: 1.206s
Cost-bounded solver time: 0s
Follower search time: 1.206s
Total time: 2.88622s
Optimal engine:
Peak memory: 544828 KB
@@@T3404@@@
Done!
real 3.79
user 3.08
sys 0.39
