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/Ibm_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/Ibm_2.pddl
Parsing...
Parsing: [0.010s CPU, 0.010s wall-clock]
Normalizing task... [0.000s CPU, 0.000s 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.007s wall-clock]
Generated 173 rules.
Computing model... [0.100s CPU, 0.102s wall-clock]
1945 relevant atoms
3528 auxiliary atoms
5473 final queue length
6948 total queue pushes
Completing instantiation... [0.090s CPU, 0.084s wall-clock]
Instantiating: [0.210s CPU, 0.208s 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...
140 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.012s 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.008s wall-clock]
Translating task: [0.110s CPU, 0.110s wall-clock]
0 effect conditions simplified
0 implied preconditions added
Detecting unreachable propositions...
0 operators removed
4 propositions removed
Detecting unreachable propositions: [0.020s CPU, 0.016s wall-clock]
Translator variables: 142
Translator derived variables: 0
Translator facts: 310
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 31
Translator operators: 1407
Translator axioms: 0
Translator task size: 8009
Translator peak memory: 23820 KB
Writing output... [0.020s CPU, 0.019s wall-clock]
Done! [0.380s CPU, 0.379s 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.
142 variables of 142 necessary
0 of 3 mutex groups necessary.
1407 of 1407 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 310 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=20164, notReached=75344, spurious=592
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=91948, notReached=3560, spurious=592
8 operators are spurious because were not triggered
H^2 mutexes added fw: 3560, unreachable: 0
0 of 1399 operators detected as spurious
Total mutex and disambiguation time: 0.145249 iterations: 2
1780 of 1780 mutex groups necessary.
1399 of 1407 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 1399
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 142
1780 of 1780 mutex groups necessary.
1399 of 1399 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
142 variables of 142 of 142 necessary
The causal graph is not acyclic.
142 variables of 142 necessary
1780 of 1780 mutex groups necessary.
1399 of 1399 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 142
Preprocessor facts: 310
Preprocessor derived variables: 0
Preprocessor operators: 1399
Preprocessor mutex groups: 1780
Preprocessor task size: 11496
Writing output...
Preprocessor time: 0.215048s
Preprocessor peak memory: 6008 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.000353692s]
Simplifying transitions... done!
done reading input! [t=0.0378112s]
building causal graph...done! [t=0.0389091s]
packing state variables...Variables: 142
Bytes per state: 20
done! [t=0.039024s]
done initalizing global data [t=0.0390286s]
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() = 109
leader_vars_follower_preconditioned.size() = 108
follower_operators.size() = 1290
leader_operators.size() = 109
Initializing Symbolic Variables
Sym variable order: 1 19 18 17 21 68 76 52 84 28 9 60 124 100 92 44 36 101 85 69 29 45 37 10 61 93 128 77 53 38 70 94 62 30 3 102 86 22 54 78 46 15 89 33 57 81 49 113 6 73 97 65 41 25 2 40 48 88 32 72 56 5 96 80 109 24 64 12 91 120 59 43 35 67 8 99 83 51 75 27 13 20 14 98 58 82 26 34 50 7 66 90 42 74 116 11 16 95 79 105 39 47 4 71 55 87 63 23 31 133 137 108 119 127 123 111 112 130 138 135 134 140 114 115 103 118 0 136 107 122 141 126 139 104 131 132 106 121 125 117 129 110 
Num variables: 142 => 151
Initialize Symbolic Manager(302, 52980, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 144 Invariant groups: 0
Mutex initialized fw. Total mutex added: 0 Invariant groups: 0
Initializing SymbolicStackelberg...
Search initialized: 0.031s
Starting Stackelberg bounded search...
 opt: 0.001 reg: 0 solved: 1 total time: 1.11803
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 1.11806
 opt: 0.001 reg: 0 solved: 1 total time: 1.12312
 opt: 0.001 reg: 0 solved: 1 total time: 1.12449
 opt: 0.003 reg: 0 solved: 1 total time: 1.12781
 opt: 0.002 reg: 0 solved: 1 total time: 1.13075
 opt: 0.004 reg: 0 solved: 1 total time: 1.1351
 opt: 0.003 reg: 0 solved: 1 total time: 1.1388
 opt: 0.002 reg: 0 solved: 1 total time: 1.14152
 opt: 0.003 reg: 0 solved: 1 total time: 1.14482
 opt: 0.006 reg: 0 solved: 2 total time: 1.15195
L = 1, leader states: 512, follower subproblems: 512, F:100000, total time: 1.15201
 opt: 0.013 reg: 0 solved: 3 total time: 1.17053
 opt: 0.012 reg: 0 solved: 2 total time: 1.18279
 opt: 0.019 reg: 0 solved: 3 total time: 1.20228
 opt: 0.009 reg: 0 solved: 3 total time: 1.21197
 opt: 0.015 reg: 0 solved: 4 total time: 1.22878
 opt: 0.026 reg: 0 solved: 4 total time: 1.25618
 opt: 0.024 reg: 0 solved: 4 total time: 1.28146
L = 2, leader states: 13122, follower subproblems: 13122, F:100000, total time: 1.28164
 opt: 0.017 reg: 0 solved: 4 total time: 1.30442
 opt: 0.03 reg: 0 solved: 4 total time: 1.33561
 opt: 0.014 reg: 0.001 solved: 4 total time: 1.35214
 opt: 0.015 reg: 0.003 solved: 4 total time: 1.37094
 opt: 0.014 reg: 0.003 solved: 3 total time: 1.38987
 opt: 0.03 reg: 0.005 solved: 4 total time: 1.42552
 opt: 0.027 reg: 0.005 solved: 4 total time: 1.45816
 opt: 0.026 reg: 0.002 solved: 4 total time: 1.48774
 opt: 0.016 reg: 0.003 solved: 4 total time: 1.5076
 opt: 0.021 reg: 0.004 solved: 3 total time: 1.53396
 opt: 0.033 reg: 0.003 solved: 4 total time: 1.5707
 opt: 0.023 reg: 0.002 solved: 4 total time: 1.59676
 opt: 0.024 reg: 0.002 solved: 4 total time: 1.62407
 opt: 0.023 reg: 0.001 solved: 4 total time: 1.64977
L = 3, leader states: 131072, follower subproblems: 131072, F:100000, total time: 1.64993
 opt: 0.017 reg: 0.007 solved: 4 total time: 1.68038
 opt: 0.032 reg: 0.012 solved: 4 total time: 1.72613
 opt: 0.018 reg: 0.007 solved: 4 total time: 1.75179
 opt: 0.014 reg: 0.017 solved: 3 total time: 1.78374
 opt: 0.023 reg: 0.006 solved: 4 total time: 1.81364
 opt: 0.016 reg: 0.006 solved: 4 total time: 1.83673
 opt: 0.03 reg: 0.005 solved: 4 total time: 1.87282
 opt: 0.032 reg: 0.003 solved: 4 total time: 1.90917
 opt: 0.036 reg: 0.003 solved: 4 total time: 1.94945
 opt: 0.042 reg: 0.003 solved: 4 total time: 1.99582
 opt: 0.03 reg: 0.005 solved: 4 total time: 2.0321
 opt: 0.014 reg: 0.003 solved: 4 total time: 2.05091
 opt: 0.03 reg: 0.003 solved: 4 total time: 2.08538
 opt: 0.014 reg: 0.005 solved: 4 total time: 2.10616
 opt: 0.021 reg: 0.007 solved: 4 total time: 2.1343
 opt: 0.028 reg: 0.004 solved: 4 total time: 2.16828
 opt: 0.031 reg: 0.003 solved: 4 total time: 2.20356
 opt: 0.022 reg: 0.009 solved: 3 total time: 2.23495
 opt: 0.031 reg: 0.007 solved: 4 total time: 2.27408
 opt: 0.034 reg: 0.005 solved: 4 total time: 2.31396
 opt: 0.027 reg: 0.004 solved: 4 total time: 2.34658
 opt: 0.019 reg: 0.013 solved: 5 total time: 2.37919
 opt: 0.022 reg: 0.013 solved: 4 total time: 2.41546
 opt: 0.025 reg: 0.03 solved: 6 total time: 2.4717
 opt: 0.017 reg: 0.007 solved: 5 total time: 2.4969
 opt: 0.032 reg: 0.004 solved: 6 total time: 2.53385
 opt: 0.026 reg: 0.008 solved: 6 total time: 2.56909
 opt: 0.044 reg: 0.02 solved: 6 total time: 2.63416
 opt: 0.042 reg: 0.019 solved: 6 total time: 2.69582
 opt: 0.052 reg: 0.022 solved: 6 total time: 2.77073
 opt: 0.026 reg: 0.027 solved: 6 total time: 2.82442
 opt: 0.025 reg: 0.005 solved: 6 total time: 2.85617
 opt: 0.031 reg: 0.005 solved: 7 total time: 2.8936
 opt: 0.024 reg: 0.02 solved: 5 total time: 2.93878
 opt: 0.024 reg: 0.024 solved: 6 total time: 2.98838
 opt: 0.043 reg: 0.003 solved: 6 total time: 3.0353
 opt: 0.046 reg: 0.008 solved: 6 total time: 3.09064
 opt: 0.036 reg: 0.008 solved: 5 total time: 3.13657
 opt: 0.04 reg: 0.017 solved: 6 total time: 3.19427
 opt: 0.044 reg: 0.016 solved: 6 total time: 3.25517
 opt: 0.054 reg: 0.012 solved: 6 total time: 3.32226
 opt: 0.025 reg: 0.036 solved: 7 total time: 3.38413
 opt: 0.04 reg: 0.032 solved: 6 total time: 3.45769
 opt: 0.025 reg: 0.035 solved: 6 total time: 3.51868
 opt: 0.043 reg: 0.038 solved: 5 total time: 3.60114
 opt: 0.027 reg: 0.043 solved: 6 total time: 3.67271
 opt: 0.02 reg: 0.008 solved: 6 total time: 3.70138
 opt: 0.021 solved: 2147483647 total time: 3.7232
L = 4, leader states: 781250, follower subproblems: 781250, F:2147483647, total time: 3.74085
Search time: 2.633s
Total number of leader states: 5.9648e+06
Total number of follower subproblems: 3.82221e+06
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 s35 blaststepdone
				 fix_switch t1 s17 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s9 blaststepdone
				 fix_switch t2 s27 blaststepdone
				 fix_switch t2 s20 blaststepdone
				 fix_switch t2 s2 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_switch t3 s29 blaststepdone
				 fix_switch t3 s11 blaststepdone
				 fix_last-step t3 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 79
Solved by optimal solver: 79
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 79
Solved follower subproblems: 79
Optimal solver time: 1.872s
Cost-bounded solver time: 0s
Follower search time: 1.872s
Total time: 3.74785s
Optimal engine:
Peak memory: 505292 KB
@@@T4497@@@
Done!
real 4.72
user 4.17
sys 0.40
