INFO Running translator. INFO translator input: ['domain.pddl', 'problem.pddl'] INFO translator arguments: [] INFO translator time limit: 1799.89s INFO translator memory limit: 8192 MB INFO callstring: /usr/bin/python /planner/fast-downward-conjunctions/builds/release64clangpgonative/bin/translate/translate.py domain.pddl problem.pddl time limit 1799.89 -> (1800, 1801) Parsing... Parsing: [0.000s CPU, 0.004s wall-clock] Normalizing task... [0.000s CPU, 0.000s wall-clock] Instantiating... Generating Datalog program... [0.000s CPU, 0.001s wall-clock] Normalizing Datalog program... Normalizing Datalog program: [0.000s CPU, 0.004s wall-clock] Preparing model... [0.000s CPU, 0.002s wall-clock] Generated 38 rules. Computing model... [0.010s CPU, 0.011s wall-clock] 375 relevant atoms 528 auxiliary atoms 903 final queue length 1060 total queue pushes Completing instantiation... [0.010s CPU, 0.005s wall-clock] Instantiating: [0.020s CPU, 0.023s wall-clock] Computing fact groups... Finding invariants... 7 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.002s wall-clock] Collecting mutex groups... [0.000s CPU, 0.000s wall-clock] Choosing groups... 20 uncovered facts Choosing groups: [0.000s CPU, 0.000s wall-clock] Building translation key... [0.000s CPU, 0.000s 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.000s CPU, 0.000s wall-clock] Translating task: [0.010s CPU, 0.005s wall-clock] 112 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 0 axioms removed 7 propositions removed Detecting unreachable propositions: [0.000s CPU, 0.003s wall-clock] Translator variables: 21 Translator derived variables: 0 Translator facts: 80 Translator goal facts: 2 Translator mutex groups: 19 Translator total mutex groups size: 104 Translator operators: 78 Translator axioms: 0 Translator task size: 795 Translator peak memory: 43672 KB Writing output... [0.000s CPU, 0.001s wall-clock] Done! [0.040s CPU, 0.048s wall-clock] INFO Running preprocessor (release64clangpgonative). INFO preprocessor input: output.sas INFO preprocessor arguments: [] INFO preprocessor time limit: 1799.81s INFO preprocessor memory limit: 8192 MB INFO callstring: /planner/fast-downward-conjunctions/builds/release64clangpgonative/bin/preprocess < output.sas time limit 1799.81 -> (1800, 1801) Building causal graph... The causal graph is not acyclic. 21 variables of 21 necessary 16 of 19 mutex groups necessary. 78 of 78 operators necessary. 0 of 0 axiom rules necessary. Initializing mutex computation... Mutex computation initialized with 80 fluents. iteration for mutex detection and operator pruning Initialize m_index fw Initialized mvalues forward: reached=441, notReached=5147, spurious=812 Initialize m_ops fw Computing mutexes... Mutex computation finished with reached=5294, notReached=294, spurious=812 0 operators are spurious because were not triggered H^2 mutexes added fw: 294, unreachable: 0 0 of 78 operators detected as spurious iteration for mutex detection and operator pruning Initialize m_index bw Init values regression Initialized mvalues backward: reached=2427, notReached=2867, spurious=1106 Initialize m_ops bw Computing mutexes... Mutex computation finished with reached=3439, notReached=1855, spurious=1106 24 operators are spurious because were not triggered Unreachable proposition: Atom at(stone-01, pos-2-2) Unreachable proposition: Atom at(stone-01, pos-2-3) Unreachable proposition: Atom at(stone-01, pos-2-5) Unreachable proposition: Atom at(stone-01, pos-3-2) Unreachable proposition: Atom at(stone-01, pos-4-2) Unreachable proposition: Atom at(stone-01, pos-4-5) Unreachable proposition: Atom at(stone-01, pos-5-2) Unreachable proposition: Atom at(stone-01, pos-6-2) Unreachable proposition: Atom at(stone-01, pos-6-4) Unreachable proposition: Atom at(stone-02, pos-2-2) Unreachable proposition: Atom at(stone-02, pos-2-5) Unreachable proposition: Atom at(stone-02, pos-3-2) Unreachable proposition: Atom at(stone-02, pos-4-2) Unreachable proposition: Atom at(stone-02, pos-4-5) Unreachable proposition: Atom at(stone-02, pos-5-2) Unreachable proposition: Atom at(stone-02, pos-6-2) Unreachable proposition: Atom at(stone-02, pos-6-4) H^2 mutexes added bw: 4, unreachable: 17 3 of 54 operators detected as spurious iteration for mutex detection and operator pruning Initialize m_index fw Initialized mvalues forward: reached=441, notReached=2998, spurious=2961 Initialize m_ops fw Computing mutexes... Mutex computation finished with reached=2909, notReached=530, spurious=2961 0 operators are spurious because were not triggered Unreachable proposition: Atom at(stone-01, pos-2-4) Unreachable proposition: Atom at(stone-02, pos-4-3) H^2 mutexes added fw: 336, unreachable: 2 0 of 51 operators detected as spurious iteration for mutex detection and operator pruning Initialize m_index bw Init values regression Initialized mvalues backward: reached=1856, notReached=1053, spurious=3491 Initialize m_ops bw Computing mutexes... Mutex computation finished with reached=2909, notReached=0, spurious=3491 0 operators are spurious because were not triggered H^2 mutexes added bw: 0, unreachable: 0 0 of 51 operators detected as spurious Total mutex and disambiguation time: 0.005565 iterations: 4 333 of 333 mutex groups necessary. 51 of 78 operators necessary. 0 of 0 axiom rules necessary. Change id of operators: 51 Change id of mutexes Change id of goals Change id of initial state Remove unreachable facts from variables: 21 231 of 333 mutex groups necessary. 51 of 51 operators necessary. 0 of 0 axiom rules necessary. Updating causal graph and pruning unnecessary facts 21 variables of 21 of 21 necessary The causal graph is not acyclic. 21 variables of 21 necessary 231 of 231 mutex groups necessary. 51 of 51 operators necessary. 0 of 0 axiom rules necessary. Preprocessor variables: 21 Preprocessor facts: 61 Preprocessor derived variables: 0 Preprocessor operators: 51 Preprocessor mutex groups: 231 Preprocessor task size: 900 Writing output... done INFO Running search (release64clangpgonative). INFO search input: output INFO search arguments: ['--if-unit-cost', '--heuristic', 'hcff_normalcost=cff(seed=42, cache_estimates=false, cost_type=PLUSONE)', '--heuristic', 'hn_normalcost=novelty(cache_estimates=false)', '--heuristic', 'tmp_normalcost=novelty_linker(hcff_normalcost, [hn_normalcost])', '--heuristic', 'hlm_normalcost=lmcount(lm_rhw(reasonable_orders=true))', '--search', 'ipc18_iterated([ehc_cn(hcff_normalcost, preferred=hcff_normalcost, novelty=hn_normalcost, seed=42, max_growth=8, max_time=1200), lazy_iterated_weights_c([hcff_normalcost, hlm_normalcost], preferred=[hcff_normalcost], conjunctions_heuristic=hcff_normalcost, strategy=maintain_fixed_size_probabilistic(initial_removal_mode=UNTIL_BOUND, base_probability=0.02, target_growth_ratio=1.50))], delete_after_phase_heuristics=[hn_normalcost, tmp_normalcost], delete_after_phase_phases=[0, 0], continue_on_fail=true)', '--if-non-unit-cost', '--heuristic', 'hcff=cff(seed=42, cache_estimates=false, cost_type=ONE)', '--heuristic', 'hn=novelty(cache_estimates=false)', '--heuristic', 'tmp=novelty_linker(hcff, [hn])', '--heuristic', 'hcff_normalcost=cff(seed=42, cache_estimates=false, cost_type=PLUSONE)', '--heuristic', 'hn_normalcost=novelty(cache_estimates=false)', '--heuristic', 'tmp_normalcost=novelty_linker(hcff_normalcost, [hn_normalcost])', '--heuristic', 'hlm=lmcount(lm_rhw(reasonable_orders=true, lm_cost_type=ONE), cost_type=ONE)', '--heuristic', 'hlm_normalcost=lmcount(lm_rhw(reasonable_orders=true))', '--search', 'ipc18_iterated([ehc_cn(hcff, preferred=hcff, novelty=hn, seed=42, cost_type=ONE, max_growth=8, max_time=1200), lazy_greedy_c([hcff, hlm], preferred=[hcff], conjunctions_heuristic=hcff, strategy=maintain_fixed_size_probabilistic(initial_removal_mode=UNTIL_BOUND, base_probability=0.02, target_growth_ratio=1.50), cost_type=ONE), ehc_cn(hcff_normalcost, preferred=hcff_normalcost, novelty=hn_normalcost, seed=42, max_growth=8, max_time=1200), lazy_iterated_weights_c([hcff_normalcost, hlm_normalcost], preferred=[hcff_normalcost], conjunctions_heuristic=hcff_normalcost, strategy=maintain_fixed_size_probabilistic(generate_initially=true, initial_removal_mode=UNTIL_BOUND, base_probability=0.02, target_growth_ratio=1.50))], skip_if_solved=[1], skip_if_failed=[2], delete_after_phase_heuristics=[hn, tmp, hcff, hlm, hn_normalcost, tmp_normalcost], delete_after_phase_phases=[0, 0, 1, 1, 2, 2], continue_on_fail=true)'] INFO search time limit: 1799.79s INFO search memory limit: 8192 MB INFO search executable: /planner/fast-downward-conjunctions/builds/release64clangpgonative/bin/downward INFO callstring: /planner/fast-downward-conjunctions/builds/release64clangpgonative/bin/downward --if-unit-cost --heuristic 'hcff_normalcost=cff(seed=42, cache_estimates=false, cost_type=PLUSONE)' --heuristic 'hn_normalcost=novelty(cache_estimates=false)' --heuristic 'tmp_normalcost=novelty_linker(hcff_normalcost, [hn_normalcost])' --heuristic 'hlm_normalcost=lmcount(lm_rhw(reasonable_orders=true))' --search 'ipc18_iterated([ehc_cn(hcff_normalcost, preferred=hcff_normalcost, novelty=hn_normalcost, seed=42, max_growth=8, max_time=1200), lazy_iterated_weights_c([hcff_normalcost, hlm_normalcost], preferred=[hcff_normalcost], conjunctions_heuristic=hcff_normalcost, strategy=maintain_fixed_size_probabilistic(initial_removal_mode=UNTIL_BOUND, base_probability=0.02, target_growth_ratio=1.50))], delete_after_phase_heuristics=[hn_normalcost, tmp_normalcost], delete_after_phase_phases=[0, 0], continue_on_fail=true)' --if-non-unit-cost --heuristic 'hcff=cff(seed=42, cache_estimates=false, cost_type=ONE)' --heuristic 'hn=novelty(cache_estimates=false)' --heuristic 'tmp=novelty_linker(hcff, [hn])' --heuristic 'hcff_normalcost=cff(seed=42, cache_estimates=false, cost_type=PLUSONE)' --heuristic 'hn_normalcost=novelty(cache_estimates=false)' --heuristic 'tmp_normalcost=novelty_linker(hcff_normalcost, [hn_normalcost])' --heuristic 'hlm=lmcount(lm_rhw(reasonable_orders=true, lm_cost_type=ONE), cost_type=ONE)' --heuristic 'hlm_normalcost=lmcount(lm_rhw(reasonable_orders=true))' --search 'ipc18_iterated([ehc_cn(hcff, preferred=hcff, novelty=hn, seed=42, cost_type=ONE, max_growth=8, max_time=1200), lazy_greedy_c([hcff, hlm], preferred=[hcff], conjunctions_heuristic=hcff, strategy=maintain_fixed_size_probabilistic(initial_removal_mode=UNTIL_BOUND, base_probability=0.02, target_growth_ratio=1.50), cost_type=ONE), ehc_cn(hcff_normalcost, preferred=hcff_normalcost, novelty=hn_normalcost, seed=42, max_growth=8, max_time=1200), lazy_iterated_weights_c([hcff_normalcost, hlm_normalcost], preferred=[hcff_normalcost], conjunctions_heuristic=hcff_normalcost, strategy=maintain_fixed_size_probabilistic(generate_initially=true, initial_removal_mode=UNTIL_BOUND, base_probability=0.02, target_growth_ratio=1.50))], skip_if_solved=[1], skip_if_failed=[2], delete_after_phase_heuristics=[hn, tmp, hcff, hlm, hn_normalcost, tmp_normalcost], delete_after_phase_phases=[0, 0, 1, 1, 2, 2], continue_on_fail=true)' --internal-plan-file sas_plan < output time limit 1799.79 -> (1800, 1801) reading input... [t=0.00147791s] done reading input! [t=0.00226757s] packing state variables...done! [t=0.00227677s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00231905s] done initalizing global data [t=0.00232242s] cross context: 1 best supporter function: h^Cadd no relaxed plan extraction: 0 tie breaking: RANDOM Initializing CFF heuristic... The original task would have 179 counters. Finished hcff initialization, t = 0.000156114s Initializing novelty heuristic... Linking novelty heuristics to the conjunctions heuristic... cross context: 1 best supporter function: h^Cadd no relaxed plan extraction: 0 tie breaking: RANDOM Initializing CFF heuristic... The original task would have 179 counters. Finished hcff initialization, t = 0.000137161s Initializing novelty heuristic... Linking novelty heuristics to the conjunctions heuristic... Initializing Exploration... Initializing landmarks count heuristic... Generating landmarks using the RPG/SAS+ approach approx. reasonable orders approx. obedient reasonable orders Removed 0 reasonable or obedient reasonable orders Landmarks generation time: 0.000556074s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Initializing Exploration... Initializing landmarks count heuristic... Generating landmarks using the RPG/SAS+ approach approx. reasonable orders approx. obedient reasonable orders Removed 0 reasonable or obedient reasonable orders Landmarks generation time: 0.000540992s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Initialized conflict extraction with ranking sequence [PRIORITY, FEWEST_COUNTERS] Starting search: ehc_cn(hcff, preferred = hcff, novelty = hn, seed = 42, cost_type = one, max_growth = 8, max_time = 1200) Conducting enforced hill-climbing search with explicit conjunctions, (real) bound = 2147483646 Using preferred operators for pruning Breadth first search depth bound: 2147483647 Always reevaluate the local minimum neighborhood after adding a conjunction: 0 Cache the heuristic results of known states: 1 conjunctions per iteration: 1 check relaxed plan: 1 growth bound in the number of conjunctions (including singletons): 1 growth bound in the number of counters: 1.79769e+308 learning time bound: 60 |C| = 61 (including 61 singletons) Total number of counters: 179 Conjunction growth ratio: 1 Counter growth ratio: 1 Counter size growth ratio: 1 Finished initialization, t = 3.2461e-05s Learning phases: 0 Learning time: 5.12e-07s Max learning time: 5.12e-07s Counter growth: 1 Counter size growth: 1 Counter group growth: 1 Counter group size growth: 1 New conjunctions: 0 Unregressable conjunctions: 0 Unreachable conjunctions: 0 Evaluations per second: 0 EHC Phases: 0 Average expansions per EHC phase: 0 Dead ends during learning: 0 Dead ends during learning or backjumping: 0 No better state after learning: 0 Max learning stagnation count: 0 Average learning stagnation count: 0 Evaluations saved by buffering: 0 Exhausted search space: 0 Average dead end backjump length: 0 Total time spent on evaluating novelty: 0 Initial heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 17 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 17 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 16 New best heuristic value for novelty(cache_estimates = false): 0 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 13 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 12 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 11 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 10 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 9 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 8 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 7 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 6 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 5 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 4 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 3 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 2 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 1 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 0 Solution found! Actual search time: 0.000944322s [t=0.00629961s] move player-01 pos-6-4 pos-6-3 dir-up (0) move player-01 pos-6-3 pos-6-2 dir-up (0) move player-01 pos-6-2 pos-5-2 dir-left (0) move player-01 pos-5-2 pos-4-2 dir-left (0) move player-01 pos-4-2 pos-3-2 dir-left (0) move player-01 pos-3-2 pos-2-2 dir-left (0) move player-01 pos-2-2 pos-2-3 dir-down (0) move player-01 pos-2-3 pos-2-4 dir-down (0) move player-01 pos-2-4 pos-3-4 dir-right (0) move player-01 pos-3-4 pos-3-5 dir-down (0) move player-01 pos-3-5 pos-4-5 dir-right (0) push-to-nongoal player-01 stone-01 pos-4-5 pos-4-4 pos-4-3 dir-up (1) move player-01 pos-4-4 pos-3-4 dir-left (0) move player-01 pos-3-4 pos-2-4 dir-left (0) move player-01 pos-2-4 pos-2-3 dir-up (0) move player-01 pos-2-3 pos-2-2 dir-up (0) move player-01 pos-2-2 pos-3-2 dir-right (0) move player-01 pos-3-2 pos-4-2 dir-right (0) move player-01 pos-4-2 pos-5-2 dir-right (0) move player-01 pos-5-2 pos-6-2 dir-right (0) move player-01 pos-6-2 pos-6-3 dir-down (0) move player-01 pos-6-3 pos-6-4 dir-down (0) push-to-nongoal player-01 stone-02 pos-6-4 pos-5-4 pos-4-4 dir-left (1) push-to-nongoal player-01 stone-02 pos-5-4 pos-4-4 pos-3-4 dir-left (1) push-to-goal player-01 stone-02 pos-4-4 pos-3-4 pos-2-4 dir-left (1) move player-01 pos-3-4 pos-3-5 dir-down (0) move player-01 pos-3-5 pos-2-5 dir-left (0) push-to-nongoal player-01 stone-02 pos-2-5 pos-2-4 pos-2-3 dir-up (1) move player-01 pos-2-4 pos-3-4 dir-right (0) move player-01 pos-3-4 pos-4-4 dir-right (0) move player-01 pos-4-4 pos-5-4 dir-right (0) move player-01 pos-5-4 pos-6-4 dir-right (0) move player-01 pos-6-4 pos-6-3 dir-up (0) move player-01 pos-6-3 pos-6-2 dir-up (0) move player-01 pos-6-2 pos-5-2 dir-left (0) move player-01 pos-5-2 pos-4-2 dir-left (0) push-to-nongoal player-01 stone-01 pos-4-2 pos-4-3 pos-4-4 dir-down (1) move player-01 pos-4-3 pos-4-2 dir-up (0) move player-01 pos-4-2 pos-3-2 dir-left (0) move player-01 pos-3-2 pos-2-2 dir-left (0) push-to-goal player-01 stone-02 pos-2-2 pos-2-3 pos-2-4 dir-down (1) move player-01 pos-2-3 pos-2-2 dir-up (0) move player-01 pos-2-2 pos-3-2 dir-right (0) move player-01 pos-3-2 pos-4-2 dir-right (0) move player-01 pos-4-2 pos-5-2 dir-right (0) move player-01 pos-5-2 pos-6-2 dir-right (0) move player-01 pos-6-2 pos-6-3 dir-down (0) move player-01 pos-6-3 pos-6-4 dir-down (0) move player-01 pos-6-4 pos-5-4 dir-left (0) push-to-nongoal player-01 stone-01 pos-5-4 pos-4-4 pos-3-4 dir-left (1) move player-01 pos-4-4 pos-4-5 dir-down (0) move player-01 pos-4-5 pos-3-5 dir-left (0) move player-01 pos-3-5 pos-2-5 dir-left (0) push-to-nongoal player-01 stone-02 pos-2-5 pos-2-4 pos-2-3 dir-up (1) push-to-nongoal player-01 stone-01 pos-2-4 pos-3-4 pos-4-4 dir-right (1) push-to-goal player-01 stone-01 pos-3-4 pos-4-4 pos-5-4 dir-right (1) move player-01 pos-4-4 pos-4-3 dir-up (0) move player-01 pos-4-3 pos-4-2 dir-up (0) move player-01 pos-4-2 pos-3-2 dir-left (0) move player-01 pos-3-2 pos-2-2 dir-left (0) push-to-goal player-01 stone-02 pos-2-2 pos-2-3 pos-2-4 dir-down (1) Plan length: 61 step(s). Plan cost: 12 Expanded 75 state(s). Reopened 0 state(s). Evaluated 0 state(s). Evaluations: 146 Generated 102 state(s). Dead ends: 0 state(s). Learning phases: 0 Learning time: 5.892e-06s Max learning time: 5.12e-07s Counter growth: 1 Counter size growth: 1 Counter group growth: 1 Counter group size growth: 1 New conjunctions: 0 Unregressable conjunctions: 0 Unreachable conjunctions: 0 Evaluations per second: 121532 EHC Phases: 15 Average expansions per EHC phase: 5 Dead ends during learning: 0 Dead ends during learning or backjumping: 0 No better state after learning: 0 Max learning stagnation count: 0 Average learning stagnation count: 0 Evaluations saved by buffering: 9 Exhausted search space: 0 Average dead end backjump length: 0 Total time spent on evaluating novelty: 7.8299e-05 EHC phases: 15 Average expansions per EHC phase: 5 EHC phases of depth 1: 6 - Avg. Expansions: 1.16667 EHC phases of depth 2: 3 - Avg. Expansions: 3 EHC phases of depth 4: 1 - Avg. Expansions: 7 EHC phases of depth 6: 2 - Avg. Expansions: 8.5 EHC phases of depth 8: 1 - Avg. Expansions: 10 EHC phases of depth 12: 1 - Avg. Expansions: 12 EHC phases of depth 13: 1 - Avg. Expansions: 13 Best solution cost so far: 12 Solution found - keep searching Initialized conflict extraction with ranking sequence [PRIORITY, FEWEST_COUNTERS] Starting search: ehc_cn(hcff_normalcost, preferred = hcff_normalcost, novelty = hn_normalcost, seed = 42, max_growth = 8, max_time = 1200) Conducting enforced hill-climbing search with explicit conjunctions, (real) bound = 11 Using preferred operators for pruning Breadth first search depth bound: 2147483647 Always reevaluate the local minimum neighborhood after adding a conjunction: 0 Cache the heuristic results of known states: 1 conjunctions per iteration: 1 check relaxed plan: 1 growth bound in the number of conjunctions (including singletons): 1 growth bound in the number of counters: 1.79769e+308 learning time bound: 60 |C| = 61 (including 61 singletons) Total number of counters: 179 Conjunction growth ratio: 1 Counter growth ratio: 1 Counter size growth ratio: 1 Finished initialization, t = 3.0044e-05s Learning phases: 0 Learning time: 4.34e-07s Max learning time: 4.34e-07s Counter growth: 1 Counter size growth: 1 Counter group growth: 1 Counter group size growth: 1 New conjunctions: 0 Unregressable conjunctions: 0 Unreachable conjunctions: 0 Evaluations per second: 0 EHC Phases: 0 Average expansions per EHC phase: 0 Dead ends during learning: 0 Dead ends during learning or backjumping: 0 No better state after learning: 0 Max learning stagnation count: 0 Average learning stagnation count: 0 Evaluations saved by buffering: 0 Exhausted search space: 0 Average dead end backjump length: 0 Total time spent on evaluating novelty: 0 Initial heuristic value for cff(seed = 42, cache_estimates = false, cost_type = plusone): 3 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = plusone): 3 New best heuristic value for novelty(cache_estimates = false): 0 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = plusone): 2 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = plusone): 1 Actual search time: 0.156027s [t=0.162888s] Expanded 2011 state(s). Reopened 0 state(s). Evaluated 0 state(s). Evaluations: 4390 Generated 3601 state(s). Dead ends: 0 state(s). Learning phases: 43 Learning time: 0.0437543s Max learning time: 0.000315665s Counter growth: 6.10615 Counter size growth: 14.5478 Counter group growth: 16 Counter group size growth: 14.5478 New conjunctions: 346 Unregressable conjunctions: 0 Unreachable conjunctions: 0 Evaluations per second: 28124.6 EHC Phases: 63 Average expansions per EHC phase: 31.9206 Dead ends during learning: 0 Dead ends during learning or backjumping: 0 No better state after learning: 28 Max learning stagnation count: 24 Average learning stagnation count: 0.140523 Evaluations saved by buffering: 144 Exhausted search space: 2 Average dead end backjump length: 0 Total time spent on evaluating novelty: 0.00874796 EHC phases: 63 Average expansions per EHC phase: 31.9206 EHC phases of depth 1: 11 - Avg. Expansions: 3.45455 EHC phases of depth 3: 1 - Avg. Expansions: 33 EHC phases of depth 4: 6 - Avg. Expansions: 34.5 EHC phases of depth 5: 2 - Avg. Expansions: 38.5 Best solution cost so far: 12 No solution found - keep searching Initialized conflict extraction with ranking sequence [PRIORITY, FEWEST_COUNTERS] Starting search: lazy_iterated_weights_c(list(hcff_normalcost, hlm_normalcost), preferred = list(hcff_normalcost), conjunctions_heuristic = hcff_normalcost, strategy = maintain_fixed_size_probabilistic(generate_initially = true, initial_removal_mode = until_bound, base_probability = 0.02, target_growth_ratio = 1.50)) Conducting lazy best first search with online learning of conjunctions, (real) bound = 11 18 initial landmarks, 2 goal landmarks |C| = 92 (including 61 singletons) Total number of counters: 270 Conjunction growth ratio: 1.5082 Counter growth ratio: 1.50838 Counter size growth ratio: 4.15652 Learning phases: 0 Learning time: 0.0017208s Max learning time: 0.0017208s Counter growth: 1.50838 Counter size growth: 4.15652 Counter group growth: 2.66667 Counter group size growth: 21.9652 New conjunctions: 31 Unregressable conjunctions: 0 Unreachable conjunctions: 0 Evaluations per second: 1122.11 Finished initialization, t = 0.00176978s Initial heuristic value for cff(seed = 42, cache_estimates = false, cost_type = plusone): 3 New best heuristic value for lmcount(lm_rhw(reasonable_orders = true)): 3 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = plusone): 3 [g=0, 1 evaluated, 0 expanded, t=0.164932s, 6164 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true)): 2 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = plusone): 2 [g=4, 32 evaluated, 31 expanded, t=0.165784s, 6164 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true)): 1 [g=5, 43 evaluated, 42 expanded, t=0.166058s, 6164 KB] New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = plusone): 1 [g=9, 63 evaluated, 62 expanded, t=0.166495s, 6164 KB] Solution found! Actual search time: 0.0017048s [t=0.1666s] move player-01 pos-6-4 pos-6-3 dir-up (0) move player-01 pos-6-3 pos-6-2 dir-up (0) move player-01 pos-6-2 pos-5-2 dir-left (0) move player-01 pos-5-2 pos-4-2 dir-left (0) move player-01 pos-4-2 pos-3-2 dir-left (0) move player-01 pos-3-2 pos-2-2 dir-left (0) move player-01 pos-2-2 pos-2-3 dir-down (0) move player-01 pos-2-3 pos-2-4 dir-down (0) move player-01 pos-2-4 pos-3-4 dir-right (0) move player-01 pos-3-4 pos-3-5 dir-down (0) move player-01 pos-3-5 pos-4-5 dir-right (0) push-to-nongoal player-01 stone-01 pos-4-5 pos-4-4 pos-4-3 dir-up (1) move player-01 pos-4-4 pos-3-4 dir-left (0) move player-01 pos-3-4 pos-2-4 dir-left (0) move player-01 pos-2-4 pos-2-3 dir-up (0) move player-01 pos-2-3 pos-2-2 dir-up (0) move player-01 pos-2-2 pos-3-2 dir-right (0) move player-01 pos-3-2 pos-4-2 dir-right (0) move player-01 pos-4-2 pos-5-2 dir-right (0) move player-01 pos-5-2 pos-6-2 dir-right (0) move player-01 pos-6-2 pos-6-3 dir-down (0) move player-01 pos-6-3 pos-6-4 dir-down (0) push-to-nongoal player-01 stone-02 pos-6-4 pos-5-4 pos-4-4 dir-left (1) push-to-nongoal player-01 stone-02 pos-5-4 pos-4-4 pos-3-4 dir-left (1) push-to-goal player-01 stone-02 pos-4-4 pos-3-4 pos-2-4 dir-left (1) move player-01 pos-3-4 pos-4-4 dir-right (0) move player-01 pos-4-4 pos-5-4 dir-right (0) move player-01 pos-5-4 pos-6-4 dir-right (0) move player-01 pos-6-4 pos-6-3 dir-up (0) move player-01 pos-6-3 pos-6-2 dir-up (0) move player-01 pos-6-2 pos-5-2 dir-left (0) move player-01 pos-5-2 pos-4-2 dir-left (0) push-to-nongoal player-01 stone-01 pos-4-2 pos-4-3 pos-4-4 dir-down (1) move player-01 pos-4-3 pos-4-2 dir-up (0) move player-01 pos-4-2 pos-5-2 dir-right (0) move player-01 pos-5-2 pos-6-2 dir-right (0) move player-01 pos-6-2 pos-6-3 dir-down (0) move player-01 pos-6-3 pos-6-4 dir-down (0) move player-01 pos-6-4 pos-5-4 dir-left (0) push-to-nongoal player-01 stone-01 pos-5-4 pos-4-4 pos-3-4 dir-left (1) move player-01 pos-4-4 pos-4-5 dir-down (0) move player-01 pos-4-5 pos-3-5 dir-left (0) move player-01 pos-3-5 pos-2-5 dir-left (0) push-to-nongoal player-01 stone-02 pos-2-5 pos-2-4 pos-2-3 dir-up (1) push-to-nongoal player-01 stone-01 pos-2-4 pos-3-4 pos-4-4 dir-right (1) push-to-goal player-01 stone-01 pos-3-4 pos-4-4 pos-5-4 dir-right (1) move player-01 pos-4-4 pos-4-3 dir-up (0) move player-01 pos-4-3 pos-4-2 dir-up (0) move player-01 pos-4-2 pos-3-2 dir-left (0) move player-01 pos-3-2 pos-2-2 dir-left (0) push-to-goal player-01 stone-02 pos-2-2 pos-2-3 pos-2-4 dir-down (1) Plan length: 51 step(s). Plan cost: 10 Expanded 67 state(s). Reopened 0 state(s). Evaluated 68 state(s). Evaluations: 138 Generated 150 state(s). Dead ends: 0 state(s). Learning phases: 0 Learning time: 0.00181779s Max learning time: 0.0017208s Counter growth: 1.53631 Counter size growth: 4.23478 Counter group growth: 2.7451 Counter group size growth: 21.9304 New conjunctions: 33 Unregressable conjunctions: 0 Unreachable conjunctions: 0 Evaluations per second: 73145.2 Number of registered states: 68 Best solution cost so far: 10 Solution found - keep searching 18 initial landmarks, 2 goal landmarks Initial heuristic value for cff(seed = 42, cache_estimates = false, cost_type = plusone): 3 Completely explored state space -- no solution! Actual search time: 0.00264572s [t=0.169449s] Expanded 231 state(s). Reopened 0 state(s). Evaluated 232 state(s). Evaluations: 398 Generated 501 state(s). Dead ends: 0 state(s). Learning phases: 0 Learning time: 0.00192534s Max learning time: 0.0017208s Counter growth: 1.52514 Counter size growth: 4.15652 Counter group growth: 2.72549 Counter group size growth: 21.8609 New conjunctions: 32 Unregressable conjunctions: 0 Unreachable conjunctions: 0 Evaluations per second: 148566 Number of registered states: 165 Best solution cost so far: 10 No solution found - keep searching Actual search time: 0.164405s [t=0.169487s] Cumulative statistics: Expanded 2384 state(s). Reopened 0 state(s). Evaluated 300 state(s). Evaluations: 5072 Generated 4354 state(s). Dead ends: 0 state(s). Search time: 0.164409s Total time: 0.16949s Solution found. Peak memory: 6164 KB Checking plan: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmpcaUi4v/sas_plan.2 Plan executed successfully - checking goal Plan valid Final value: 10 Successful plans: Value: 10 /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmpcaUi4v/sas_plan.2 10 Checking plan: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmpcaUi4v/sas_plan.1 Plan executed successfully - checking goal Plan valid Final value: 12 Successful plans: Value: 12 /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmpcaUi4v/sas_plan.1 12