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/Biznet_1.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/Biznet_1.pddl
Parsing...
Parsing: [0.010s CPU, 0.010s wall-clock]
Normalizing task... [0.000s CPU, 0.001s wall-clock]
Instantiating...
Generating Datalog program... [0.010s CPU, 0.002s wall-clock]
Normalizing Datalog program...
Normalizing Datalog program: [0.010s CPU, 0.012s wall-clock]
Preparing model... [0.000s CPU, 0.007s wall-clock]
Generated 173 rules.
Computing model... [0.040s CPU, 0.037s wall-clock]
611 relevant atoms
1189 auxiliary atoms
1800 final queue length
2169 total queue pushes
Completing instantiation... [0.020s CPU, 0.021s wall-clock]
Instantiating: [0.080s CPU, 0.081s 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...
57 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.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.030s CPU, 0.028s 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.004s wall-clock]
Translator variables: 59
Translator derived variables: 0
Translator facts: 132
Translator goal facts: 1
Translator mutex groups: 3
Translator total mutex groups size: 19
Translator operators: 355
Translator axioms: 0
Translator task size: 2072
Translator peak memory: 18576 KB
Writing output... [0.010s CPU, 0.005s wall-clock]
Done! [0.140s CPU, 0.139s 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.
59 variables of 59 necessary
0 of 3 mutex groups necessary.
355 of 355 operators necessary.
0 of 0 axiom rules necessary.
Initializing mutex computation...
Mutex computation initialized with 132 fluents.
iteration for mutex detection and operator pruning
Initialize m_index fw
Initialized mvalues forward: reached=3481, notReached=13713, spurious=230
Initialize m_ops fw
Computing mutexes...
Mutex computation finished with reached=16378, notReached=816, spurious=230
4 operators are spurious because were not triggered
H^2 mutexes added fw: 816, unreachable: 0
0 of 351 operators detected as spurious
Total mutex and disambiguation time: 0.014314 iterations: 2
408 of 408 mutex groups necessary.
351 of 355 operators necessary.
0 of 0 axiom rules necessary.
Change id of operators: 351
Change id of mutexes
Change id of goals
Change id of initial state
Remove unreachable facts from variables: 59
408 of 408 mutex groups necessary.
351 of 351 operators necessary.
0 of 0 axiom rules necessary.
Updating causal graph and pruning unnecessary facts
59 variables of 59 of 59 necessary
The causal graph is not acyclic.
59 variables of 59 necessary
408 of 408 mutex groups necessary.
351 of 351 operators necessary.
0 of 0 axiom rules necessary.
Building domain transition graphs...
solveable in poly time 0
Building successor generator...
Preprocessor variables: 59
Preprocessor facts: 132
Preprocessor derived variables: 0
Preprocessor operators: 351
Preprocessor mutex groups: 408
Preprocessor task size: 2849
Writing output...
Preprocessor time: 0.0287966s
Preprocessor peak memory: 3056 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.000314478s]
Simplifying transitions... done!
done reading input! [t=0.0119363s]
building causal graph...done! [t=0.0123654s]
packing state variables...Variables: 59
Bytes per state: 12
done! [t=0.012422s]
done initalizing global data [t=0.0124264s]
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() = 41
leader_vars_follower_preconditioned.size() = 40
follower_operators.size() = 310
leader_operators.size() = 41
Initializing Symbolic Variables
Sym variable order: 1 10 9 8 22 14 34 26 3 18 30 38 17 25 49 6 37 29 33 21 12 2 45 24 32 36 5 16 20 28 13 23 41 35 19 4 27 15 31 7 11 56 47 51 44 43 54 57 55 48 0 52 40 58 53 42 39 50 46 
Num variables: 59 => 65
Initialize Symbolic Manager(130, 123076, 16000000, 0)
Generating binary variables
Symbolic Variables... Done.
Mutex initialized bw. Total mutex added: 46 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 reg: 0 solved: 1 total time: 0.54645
L = 0, leader states: 1, follower subproblems: 1, F:100000, total time: 0.546483
 opt: 0 reg: 0 solved: 1 total time: 0.547844
 opt: 0 reg: 0 solved: 1 total time: 0.548747
 opt: 0 reg: 0 solved: 1 total time: 0.549745
 opt: 0 reg: 0 solved: 1 total time: 0.550698
 opt: 0.001 reg: 0 solved: 2 total time: 0.552763
L = 1, leader states: 32, follower subproblems: 32, F:100000, total time: 0.552796
 opt: 0.002 reg: 0 solved: 2 total time: 0.556614
 opt: 0.002 reg: 0 solved: 2 total time: 0.559497
L = 2, leader states: 162, follower subproblems: 162, F:100000, total time: 0.559544
 opt: 0.002 reg: 0 solved: 2 total time: 0.563582
 opt: 0.003 reg: 0 solved: 3 total time: 0.567288
 opt: 0.003 reg: 0 solved: 3 total time: 0.57099
 opt: 0.004 reg: 0 solved: 4 total time: 0.57606
 opt: 0.004 reg: 0.001 solved: 4 total time: 0.581911
 opt: 0.006 reg: 0 solved: 4 total time: 0.589121
L = 3, leader states: 512, follower subproblems: 512, F:100000, total time: 0.589186
 opt: 0.003 reg: 0.001 solved: 3 total time: 0.596066
 opt: 0.003 reg: 0.002 solved: 2 total time: 0.601705
 opt: 0.005 reg: 0.004 solved: 4 total time: 0.612202
 opt: 0.005 reg: 0.006 solved: 4 total time: 0.624717
 opt: 0.006 reg: 0.005 solved: 4 total time: 0.636768
 opt: 0.004 reg: 0.011 solved: 4 total time: 0.652758
 opt: 0.005 reg: 0.011 solved: 4 total time: 0.670183
 opt: 0.004 reg: 0.014 solved: 4 total time: 0.68878
 opt: 0.007 reg: 0.005 solved: 4 total time: 0.701849
 opt: 0.004 reg: 0.003 solved: 4 total time: 0.710393
 opt: 0.005 reg: 0.004 solved: 4 total time: 0.720143
 opt: 0.006 reg: 0.001 solved: 4 total time: 0.728651
 opt: 0.004 reg: 0.002 solved: 4 total time: 0.735281
 opt: 0.005 reg: 0.002 solved: 4 total time: 0.74383
 opt: 0.004 reg: 0.002 solved: 4 total time: 0.750746
 opt: 0.005 reg: 0.001 solved: 4 total time: 0.758331
 opt: 0.004 reg: 0.001 solved: 4 total time: 0.764504
 opt: 0.005 reg: 0.002 solved: 4 total time: 0.772556
 opt: 0.004 reg: 0.002 solved: 4 total time: 0.779511
 opt: 0.005 reg: 0.001 solved: 4 total time: 0.786545
L = 4, leader states: 1250, follower subproblems: 1250, F:100000, total time: 0.786619
 opt: 0.003 reg: 0.002 solved: 2 total time: 0.793909
 opt: 0.005 reg: 0.003 solved: 4 total time: 0.80294
 opt: 0.004 reg: 0.011 solved: 3 total time: 0.8188
 opt: 0.005 reg: 0.006 solved: 4 total time: 0.830714
 opt: 0.006 reg: 0.007 solved: 4 total time: 0.844651
 opt: 0.006 reg: 0.009 solved: 4 total time: 0.860668
 opt: 0.005 reg: 0.013 solved: 4 total time: 0.88026
 opt: 0.006 reg: 0.017 solved: 4 total time: 0.904855
 opt: 0.005 reg: 0.015 solved: 4 total time: 0.925943
 opt: 0.005 reg: 0.003 solved: 4 total time: 0.935722
 opt: 0.005 reg: 0.002 solved: 4 total time: 0.944411
 opt: 0.006 reg: 0.002 solved: 4 total time: 0.953471
 opt: 0.005 reg: 0.003 solved: 4 total time: 0.962632
 opt: 0.005 reg: 0.002 solved: 4 total time: 0.970562
 opt: 0.005 reg: 0.002 solved: 4 total time: 0.978984
 opt: 0.005 reg: 0.002 solved: 4 total time: 0.986531
 opt: 0.004 reg: 0.004 solved: 4 total time: 0.995348
 opt: 0.006 reg: 0.003 solved: 4 total time: 1.00517
 opt: 0.005 reg: 0.003 solved: 4 total time: 1.01402
 opt: 0.005 reg: 0.002 solved: 4 total time: 1.02241
 opt: 0.005 reg: 0.003 solved: 4 total time: 1.03112
 opt: 0.006 reg: 0.003 solved: 4 total time: 1.04082
 opt: 0.005 reg: 0.002 solved: 4 total time: 1.04851
 opt: 0.005 reg: 0.007 solved: 5 total time: 1.06073
 opt: 0.005 reg: 0.003 solved: 4 total time: 1.06971
 opt: 0.006 reg: 0.001 solved: 4 total time: 1.07827
 opt: 0.005 reg: 0.003 solved: 4 total time: 1.08735
 opt: 0.005 reg: 0.001 solved: 4 total time: 1.09416
 opt: 0.005 reg: 0.004 solved: 4 total time: 1.10387
 opt: 0.003 solved: 2147483647 total time: 1.1075
L = 5, leader states: 2592, follower subproblems: 2592, F:2147483647, total time: 1.11034
Search time: 0.566s
Total number of leader states: 11751
Total number of follower subproblems: 7076
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 s16 blaststepdone
				 fix_next-step t1 t2 blaststepdone
				 fix_switch t2 s23 blaststepdone
				 fix_switch t2 s12 blaststepdone
				 fix_next-step t2 t3 blaststepdone
				 fix_switch t3 s11 blaststepdone
				 fix_next-step t3 t4 blaststepdone
				 fix_last-step t4 blaststepdone
	 attacker plan: 
		 <unsolvable>
END Pareto-frontier
Total follower searches: 64
Solved by optimal solver: 64
Solved by cost bounded solver: 0
Optimally solved follower subproblems: 64
Solved follower subproblems: 64
Optimal solver time: 0.271s
Cost-bounded solver time: 0s
Follower search time: 0.271s
Total time: 1.11178s
Optimal engine:
Peak memory: 425388 KB
@@@T1419@@@
Done!
real 1.62
user 1.22
sys 0.26
