INFO Running translator. INFO translator inputs: ['domain.pddl', 'problem.pddl'] INFO translator arguments: [] Parsing... Parsing: [0.000s CPU, 0.006s 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.010s CPU, 0.005s wall-clock] Preparing model... [0.000s CPU, 0.003s wall-clock] Generated 38 rules. Computing model... [0.010s CPU, 0.015s wall-clock] 375 relevant atoms 528 auxiliary atoms 903 final queue length 1060 total queue pushes Completing instantiation... [0.010s CPU, 0.007s wall-clock] Instantiating: [0.030s CPU, 0.031s wall-clock] Computing fact groups... Finding invariants... 7 initial candidates Finding invariants: [0.010s CPU, 0.010s 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.010s CPU, 0.000s wall-clock] Computing fact groups: [0.020s CPU, 0.014s 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.000s CPU, 0.006s 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.010s 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: 43680 KB Writing output... [0.000s CPU, 0.001s wall-clock] Done! [0.060s CPU, 0.063s wall-clock] INFO Running preprocessor. INFO preprocessor input: output.sas INFO preprocessor arguments: ['--h2_time_limit', '30'] 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.009631 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. INFO search input: output INFO search portfolio: /planner/driver/portfolios/seq_sat_saarplan.py External time limits: 1800, 1805 Internal time limit: 1800 External memory limits: 8589934592, 8589934592 Internal memory limit: 8000000000 remaining time at start: 1799.75 remaining time: 1799.75 config 0: relative time 100, remaining 1800 g bound: infinity next plan number: 1 args: ['/planner/driver/../fast-downward-decoupled/search/downward-release', '--decoupling', 'fork(search_type=sat, pruning=cost_frontier(irrelevance=TRANSITIONS), max_leaf_size=1000000)', '--heuristic', 'hff=ff(cost_type=one)', '--search', 'lazy_greedy(hff, preferred=hff, cost_type=one, bound=infinity)', '--internal-previous-portfolio-plans', '0', '--internal-plan-file', 'sas_plan'] timeout: 99.99 -> (100, 101) using frontier pruning method performing irrelevance analysis in leaf factors performing decoupled satisficing search maximum leaf factor size 1000000 using fork factoring profile reading input... [t=0.00125374s] done reading input! [t=0.0021192s] building causal graph...done! [t=0.000164152s] factoring time 0.00019415s Error while factoring planning task! No factoring found! Search stopped without finding a solution. Peak memory: 3600 KB returncode: 5 remaining time: 1799.72 config 1: relative time 600, remaining 1700 g bound: infinity next plan number: 1 args: ['/planner/driver/../fast-downward-decoupled/search/downward-release', '--decoupling', 'portfolio(fallback_on_abstain=true, overwrite_options=true, choose_max_leaves=true, factorings=[fork(search_type=sat, max_leaf_size=1000000), ifork(search_type=sat, max_leaf_size=1000000), incarcs(search_type=sat, max_leaf_size=100000)])', '--heuristic', 'hff=ff(cost_type=one)', '--search', 'lazy_greedy(hff, preferred=hff, cost_type=one, bound=infinity, symmetry=symmetry_state_pruning(lex_prices=false, lex_num_states=false, lex_goal_cost=false))', '--internal-previous-portfolio-plans', '0', '--internal-plan-file', 'sas_plan'] timeout: 635.20 -> (636, 637) performing decoupled satisficing search maximum leaf factor size 1000000 using default pruning method: BasicPruning using fork factoring profile performing decoupled satisficing search maximum leaf factor size 1000000 using default pruning method: BasicPruning using inverted-fork factoring profile performing decoupled satisficing search maximum leaf factor size 100000 using default pruning method: BasicPruning using incident-arcs factoring profile performing Star Decoupled A* search using default pruning method: BasicPruning using factoring portfolio reading input... [t=0.00026254s] done reading input! [t=0.00111744s] building causal graph...done! [t=0.000161972s] factoring time 0.000300095s No factoring found, falling back to standard search. Variables: 21 Bytes per state: 4 Building successor generator...done! [t=0.00151236s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 3.1272e-05s done! [t=0.00155453s] done initalizing global data [t=0.00155927s] Creating symmetry graph stabilizing goal only and using orbit search. Initializing symmetry Using Bliss to find group generators Got 0 group generators, time step: [t=0.00182618s] Number of generators: 0 done initializing symmetries [t=0.00183433s] Conducting lazy best first search, (real) bound = 2147483647 Initializing FF heuristic... Initializing additive heuristic... Simplifying 179 unary operators... done! [179 unary operators] Best heuristic value: 17 [g=0, 1 evaluated, 0 expanded, t=0.00202107s, 3732 KB] Best heuristic value: 16 [g=9, 11 evaluated, 10 expanded, t=0.0021399s, 3732 KB] Best heuristic value: 12 [g=10, 12 evaluated, 11 expanded, t=0.00218431s, 3732 KB] Best heuristic value: 11 [g=11, 13 evaluated, 12 expanded, t=0.00222466s, 3732 KB] Best heuristic value: 10 [g=18, 20 evaluated, 19 expanded, t=0.00230441s, 3732 KB] Best heuristic value: 9 [g=22, 25 evaluated, 24 expanded, t=0.00239239s, 3732 KB] Best heuristic value: 5 [g=29, 38 evaluated, 37 expanded, t=0.00252276s, 3732 KB] Best heuristic value: 4 [g=30, 39 evaluated, 38 expanded, t=0.0025643s, 3732 KB] Best heuristic value: 3 [g=39, 50 evaluated, 49 expanded, t=0.00265978s, 3732 KB] Best heuristic value: 2 [g=49, 61 evaluated, 60 expanded, t=0.00275798s, 3732 KB] Best heuristic value: 1 [g=50, 62 evaluated, 61 expanded, t=0.00279568s, 3732 KB] Solution found! Actual search time: 0.000988299s [t=0.00283664s] 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 Initial state h value: 17. Expanded 62 state(s). Reopened 0 state(s). Evaluated 63 state(s). Evaluations: 63 Generated 135 state(s). Dead ends: 0 state(s). Number of registered states: 63 Search time: 0.00112413s Total time: 0.00284034s Solution found. Peak memory: 3732 KB returncode: 0 plan manager: found new plan with cost 10 Switch to real costs and repeat last run. remaining time: 1799.71 config 1: relative time 600, remaining 1700 g bound: 10 next plan number: 2 args: ['/planner/driver/../fast-downward-decoupled/search/downward-release', '--decoupling', 'portfolio(fallback_on_abstain=true, overwrite_options=true, choose_max_leaves=true, factorings=[fork(search_type=sat, max_leaf_size=1000000), ifork(search_type=sat, max_leaf_size=1000000), incarcs(search_type=sat, max_leaf_size=100000)])', '--heuristic', 'hff=ff(cost_type=plusone)', '--search', 'lazy_greedy(hff, preferred=hff, cost_type=normal, bound=10, symmetry=symmetry_state_pruning(lex_prices=false, lex_num_states=false, lex_goal_cost=false))', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] timeout: 635.19 -> (636, 637) performing decoupled satisficing search maximum leaf factor size 1000000 using default pruning method: BasicPruning using fork factoring profile performing decoupled satisficing search maximum leaf factor size 1000000 using default pruning method: BasicPruning using inverted-fork factoring profile performing decoupled satisficing search maximum leaf factor size 100000 using default pruning method: BasicPruning using incident-arcs factoring profile performing Star Decoupled A* search using default pruning method: BasicPruning using factoring portfolio reading input... [t=0.00025154s] done reading input! [t=0.00110722s] building causal graph...done! [t=0.000162637s] factoring time 0.000300132s No factoring found, falling back to standard search. Variables: 21 Bytes per state: 4 Building successor generator...done! [t=0.00150046s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 3.0498e-05s done! [t=0.00154285s] done initalizing global data [t=0.00154753s] Creating symmetry graph stabilizing goal only and using orbit search. Initializing symmetry Using Bliss to find group generators Got 0 group generators, time step: [t=0.00180888s] Number of generators: 0 done initializing symmetries [t=0.00181729s] Conducting lazy best first search, (real) bound = 10 Initializing FF heuristic... Initializing additive heuristic... Simplifying 179 unary operators... done! [179 unary operators] Best heuristic value: 20 [g=0, 1 evaluated, 0 expanded, t=0.00200114s, 3732 KB] Best heuristic value: 19 [g=0, 11 evaluated, 10 expanded, t=0.00212094s, 3732 KB] Best heuristic value: 15 [g=0, 12 evaluated, 11 expanded, t=0.00216606s, 3732 KB] Best heuristic value: 13 [g=1, 20 evaluated, 19 expanded, t=0.00225409s, 3732 KB] Best heuristic value: 12 [g=1, 25 evaluated, 24 expanded, t=0.00232521s, 3732 KB] Best heuristic value: 11 [g=4, 29 evaluated, 28 expanded, t=0.00238932s, 3732 KB] Best heuristic value: 7 [g=4, 35 evaluated, 34 expanded, t=0.00246194s, 3732 KB] Best heuristic value: 6 [g=4, 36 evaluated, 35 expanded, t=0.00250196s, 3732 KB] Best heuristic value: 5 [g=9, 54 evaluated, 53 expanded, t=0.00264453s, 3732 KB] Best heuristic value: 4 [g=9, 55 evaluated, 54 expanded, t=0.00268904s, 3732 KB] Best heuristic value: 3 [g=9, 56 evaluated, 55 expanded, t=0.0027277s, 3732 KB] Best heuristic value: 2 [g=9, 57 evaluated, 56 expanded, t=0.00276416s, 3732 KB] Completely explored state space -- no solution! Actual search time: 0.00167166s [t=0.00350358s] Initial state h value: 20. Expanded 155 state(s). Reopened 0 state(s). Evaluated 155 state(s). Evaluations: 155 Generated 333 state(s). Dead ends: 0 state(s). Number of registered states: 155 Search time: 0.00180526s Total time: 0.00350747s Search stopped without finding a solution. Peak memory: 3732 KB returncode: 5 remaining time: 1799.71 config 2: relative time 1100, remaining 1100 g bound: 9 next plan number: 2 args: ['/planner/driver/../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([grey_initial_state_search(grey_painting=all_prefer_inv, cost_type=PLUSONE), ehc_cn(hcff_normalcost, preferred=hcff_normalcost, novelty=hn_normalcost, seed=42, max_growth=8, max_time=500), 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=[1, 1], continue_on_fail=true, bound=9)', '--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([grey_initial_state_search(grey_painting=all_prefer_inv, cost_type=ONE), ehc_cn(hcff, preferred=hcff, novelty=hn, seed=42, cost_type=ONE, max_growth=8, max_time=500), 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=100), 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)) ], decision_point=1, skip_if_solved=[2], skip_if_failed=[3], delete_after_phase_heuristics=[hn, tmp, hcff, hlm, hn_normalcost, tmp_normalcost], delete_after_phase_phases=[1, 1, 2, 2, 3, 3], continue_on_fail=true, bound=9)', '--always', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] timeout: 1799.71 -> (1800, 1801) reading input... [t=0.00169916s] done reading input! [t=0.002601s] packing state variables...done! [t=0.00261144s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.0026668s] done initalizing global data [t=0.00267096s] 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.000179376s 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.00016162s 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.000677037s 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.000608653s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Starting search: grey_initial_state_search(grey_painting = all_prefer_inv, cost_type = one) Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing Red-Black Relaxation heuristic... Using following red facts method for relaxed plan serialization Using level heuristic method for black variable selection Running A* instead of Dijkstra. Using the distances ignoring outside conditions for heuristic estimates. Preferred operators (if used) are set from relaxed plan Conflict costs are estimated Initializing extended DTGs Adding 51 operators to extended DTGs Checking invertibility... Done checking invertibility Checking connectivity... Done checking connectivity Total number of invertible variables is 11 building causal graph...done! [t=0.000115289s] Invertible variables without leafs connection status: 1 Invertible variables with one directional connection status: 0 Setting black variables... Variables order is set Painting procedure time (in milliseconds): 0 --------------------------------------------------------------------------------------- 0 is invertible, marked black [3 side effects] 1 is invertible, marked red [3 side effects] 2 is invertible, marked red [3 side effects] 3 is invertible, marked black [3 side effects] 4 is not invertible, marked red [6 side effects] 5 is invertible, marked red [6 side effects] 6 is not invertible, marked red [6 side effects] 7 is invertible, marked black [6 side effects] 8 is invertible, marked black [6 side effects] 9 is invertible, marked red [4 side effects] 10 is invertible, marked red [7 side effects] 11 is invertible, marked red [8 side effects] 12 is not invertible, marked red [10 side effects] 13 is not invertible, marked red [10 side effects] 14 is not invertible, marked red [8 side effects] 15 is not invertible, marked red [9 side effects] 16 is not invertible, marked red [10 side effects] 17 is invertible, marked red [20 side effects] 18 is not invertible, marked red [12 side effects] 19 is not invertible, marked red [10 side effects] 20 is not invertible, marked red [10 side effects] --------------------------------------------------------------------------------------- Total number of black variables is 4 Total number of non-invertible black variables is 0 Total number of black root variables is 0 Total number of variables is 21 Total number of variables with all pairs of values connected is 0 Total number of variables with all values connected to goal is 0 Total number of black variables with strongly connected parents only is 0 Maximal number of side effects for black variable is 6 --------------------------------------------------------------------------------------- Black DAG usage status: 0 Removing unnecessary black data for red variable 1 Removing unnecessary black data for red variable 2 Removing unnecessary black data for red variable 4 Removing unnecessary black data for red variable 5 Removing unnecessary black data for red variable 6 Removing unnecessary black data for red variable 9 Removing unnecessary black data for red variable 10 Removing unnecessary black data for red variable 11 Removing unnecessary black data for red variable 12 Removing unnecessary black data for red variable 13 Removing unnecessary black data for red variable 14 Removing unnecessary black data for red variable 15 Removing unnecessary black data for red variable 16 Removing unnecessary black data for red variable 17 Removing unnecessary black data for red variable 18 Removing unnecessary black data for red variable 19 Removing unnecessary black data for red variable 20 Keeping achieving operators for red facts.. Initializing black variables... Adding edges to forward graph, for the later calculation of missing values Precalculating all pair shortest paths Storing shortest paths costs ignoring external preconditions for variable 0 =================> Calculating shortest paths in advance for variable 0 (var19) with domain size 2 Storing shortest paths costs ignoring external preconditions for variable 3 =================> Calculating shortest paths in advance for variable 3 (var9) with domain size 2 Storing shortest paths costs ignoring external preconditions for variable 7 =================> Calculating shortest paths in advance for variable 7 (var8) with domain size 2 Storing shortest paths costs ignoring external preconditions for variable 8 =================> Calculating shortest paths in advance for variable 8 (var15) with domain size 2 Finished initializing Red-Black Relaxation heuristic at time step [t=0.00663467s] Removing unnecessary black data for red variable 0 =================> Freeing solution for variable 0 [var19] Removing unnecessary black data for red variable 1 Removing unnecessary black data for red variable 2 Removing unnecessary black data for red variable 3 =================> Freeing solution for variable 3 [var9] Removing unnecessary black data for red variable 4 Removing unnecessary black data for red variable 5 Removing unnecessary black data for red variable 6 Removing unnecessary black data for red variable 7 =================> Freeing solution for variable 7 [var8] Removing unnecessary black data for red variable 8 =================> Freeing solution for variable 8 [var15] Removing unnecessary black data for red variable 9 Removing unnecessary black data for red variable 10 Removing unnecessary black data for red variable 11 Removing unnecessary black data for red variable 12 Removing unnecessary black data for red variable 13 Removing unnecessary black data for red variable 14 Removing unnecessary black data for red variable 15 Removing unnecessary black data for red variable 16 Removing unnecessary black data for red variable 17 Removing unnecessary black data for red variable 18 Removing unnecessary black data for red variable 19 Removing unnecessary black data for red variable 20 Actual search time: 0.000778471s [t=0.00673167s] Bytes per state: 4 No solution found - keep searching 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 = 500) Conducting enforced hill-climbing search with explicit conjunctions, (real) bound = 9 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 = 4.0861e-05s Learning phases: 0 Learning time: 5.25e-07s Max learning time: 5.25e-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 Actual search time: 0.0268176s [t=0.0338854s] Expanded 1354 state(s). Reopened 0 state(s). Evaluated 0 state(s). Evaluations: 2663 Generated 2207 state(s). Dead ends: 0 state(s). Learning phases: 36 Learning time: 0.00270071s Max learning time: 8.3635e-05s Counter growth: 1.86592 Counter size growth: 3.49565 Counter group growth: 3.54902 Counter group size growth: 3.49565 New conjunctions: 59 Unregressable conjunctions: 0 Unreachable conjunctions: 0 Evaluations per second: 99029.9 EHC Phases: 182 Average expansions per EHC phase: 7.43956 Dead ends during learning: 0 Dead ends during learning or backjumping: 0 No better state after learning: 6 Max learning stagnation count: 2 Average learning stagnation count: 4.5 Evaluations saved by buffering: 262 Exhausted search space: 8 Average dead end backjump length: 0 Total time spent on evaluating novelty: 0.00189161 EHC phases: 182 Average expansions per EHC phase: 7.43956 EHC phases of depth 1: 64 - Avg. Expansions: 1.125 EHC phases of depth 2: 20 - Avg. Expansions: 2.75 EHC phases of depth 3: 7 - Avg. Expansions: 4.42857 EHC phases of depth 4: 11 - Avg. Expansions: 6.81818 EHC phases of depth 5: 5 - Avg. Expansions: 8.6 EHC phases of depth 6: 5 - Avg. Expansions: 7.8 EHC phases of depth 7: 3 - Avg. Expansions: 8.66667 EHC phases of depth 8: 4 - Avg. Expansions: 13 EHC phases of depth 9: 6 - Avg. Expansions: 11.6667 EHC phases of depth 10: 4 - Avg. Expansions: 18.25 EHC phases of depth 11: 7 - Avg. Expansions: 12.7143 EHC phases of depth 12: 6 - Avg. Expansions: 17.1667 EHC phases of depth 13: 3 - Avg. Expansions: 15.3333 EHC phases of depth 15: 1 - Avg. Expansions: 26 No solution found - keep searching Initialized conflict extraction with ranking sequence [PRIORITY, FEWEST_COUNTERS] Starting search: lazy_greedy_c(list(hcff, hlm), preferred = list(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) Conducting lazy best first search with online learning of conjunctions, (real) bound = 9 18 initial landmarks, 2 goal landmarks |C| = 96 (including 61 singletons) Total number of counters: 266 Conjunction growth ratio: 1.57377 Counter growth ratio: 1.48603 Counter size growth ratio: 2.72174 Learning phases: 0 Learning time: 5.5623e-05s Max learning time: 5.5623e-05s Counter growth: 1.48603 Counter size growth: 2.72174 Counter group growth: 2.4902 Counter group size growth: 3.86957 New conjunctions: 35 Unregressable conjunctions: 0 Unreachable conjunctions: 0 Evaluations per second: 0 Finished initialization, t = 9.8097e-05s Initial heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 17 New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), cost_type = one): 16 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 17 [g=0, 1 evaluated, 0 expanded, t=0.034288s, 5772 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), cost_type = one): 15 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 16 [g=2, 3 evaluated, 2 expanded, t=0.0344112s, 5772 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), cost_type = one): 14 [g=3, 4 evaluated, 3 expanded, t=0.0344735s, 5772 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), cost_type = one): 13 [g=4, 5 evaluated, 4 expanded, t=0.0345318s, 5772 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), cost_type = one): 12 [g=5, 6 evaluated, 5 expanded, t=0.0346195s, 5772 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), cost_type = one): 11 [g=6, 7 evaluated, 6 expanded, t=0.0346798s, 5772 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), cost_type = one): 10 [g=7, 8 evaluated, 7 expanded, t=0.0347372s, 5772 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), cost_type = one): 9 [g=8, 9 evaluated, 8 expanded, t=0.0347919s, 5772 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), cost_type = one): 8 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 12 [g=9, 10 evaluated, 9 expanded, t=0.034848s, 5772 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), cost_type = one): 7 New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 11 [g=11, 12 evaluated, 11 expanded, t=0.0349272s, 5772 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), cost_type = one): 5 [g=13, 14 evaluated, 13 expanded, t=0.0350112s, 5772 KB] New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 10 [g=18, 19 evaluated, 18 expanded, t=0.035153s, 5772 KB] New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 9 [g=21, 23 evaluated, 22 expanded, t=0.035277s, 5772 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), cost_type = one): 4 [g=24, 26 evaluated, 25 expanded, t=0.0353791s, 5772 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), cost_type = one): 3 [g=33, 35 evaluated, 34 expanded, t=0.0356316s, 5772 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), cost_type = one): 2 [g=25, 37 evaluated, 36 expanded, t=0.0357089s, 5772 KB] New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 8 [g=27, 40 evaluated, 39 expanded, t=0.0358013s, 5772 KB] New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 5 [g=29, 48 evaluated, 47 expanded, t=0.0360088s, 5772 KB] New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 4 [g=30, 49 evaluated, 48 expanded, t=0.0360613s, 5772 KB] New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 3 [g=39, 58 evaluated, 57 expanded, t=0.0362582s, 5772 KB] Completely explored state space -- no solution! Actual search time: 0.00390395s [t=0.0381524s] Expanded 145 state(s). Reopened 0 state(s). Evaluated 145 state(s). Evaluations: 290 Generated 307 state(s). Dead ends: 0 state(s). Learning phases: 0 Learning time: 0.000242147s Max learning time: 5.5623e-05s Counter growth: 1.52514 Counter size growth: 2.81739 Counter group growth: 2.60784 Counter group size growth: 3.8087 New conjunctions: 38 Unregressable conjunctions: 0 Unreachable conjunctions: 0 Evaluations per second: 73621 Number of registered states: 145 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 = 9 18 initial landmarks, 2 goal landmarks |C| = 92 (including 61 singletons) Total number of counters: 269 Conjunction growth ratio: 1.5082 Counter growth ratio: 1.50279 Counter size growth ratio: 2.50435 Learning phases: 0 Learning time: 0.00172756s Max learning time: 0.00172756s Counter growth: 1.50279 Counter size growth: 2.50435 Counter group growth: 2.4902 Counter group size growth: 2.50435 New conjunctions: 31 Unregressable conjunctions: 0 Unreachable conjunctions: 0 Evaluations per second: 17349.3 Finished initialization, t = 0.00177352s 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.0402373s, 5772 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, 34 evaluated, 33 expanded, t=0.0410794s, 5772 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true)): 1 [g=5, 42 evaluated, 41 expanded, t=0.0412758s, 5772 KB] New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = plusone): 1 [g=9, 60 evaluated, 59 expanded, t=0.0416502s, 5772 KB] Completely explored state space -- no solution! Actual search time: 0.00377371s [t=0.043973s] Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 359 Generated 351 state(s). Dead ends: 0 state(s). Learning phases: 0 Learning time: 0.0019546s Max learning time: 0.00172756s Counter growth: 1.53073 Counter size growth: 2.5913 Counter group growth: 2.4902 Counter group size growth: 2.5913 New conjunctions: 29 Unregressable conjunctions: 0 Unreachable conjunctions: 0 Evaluations per second: 94283.4 Number of registered states: 165 No solution found - keep searching Actual search time: 0.03808s [t=0.0440105s] Cumulative statistics: Expanded 1663 state(s). Reopened 0 state(s). Evaluated 309 state(s). Evaluations: 3312 Generated 2865 state(s). Dead ends: 0 state(s). Search time: 0.0380843s Total time: 0.0440132s Search stopped without finding a solution. Peak memory: 5772 KB returncode: 5 remaining time: 1799.64 config 0: relative time 600, remaining 600 g bound: 10 next plan number: 2 args: ['/planner/driver/../fast-downward-decoupled/search/downward-release', '--decoupling', 'portfolio(fallback_on_abstain=true, overwrite_options=true, choose_max_leaves=true, factorings=[fork(search_type=sat, max_leaf_size=1000000), ifork(search_type=sat, max_leaf_size=1000000), incarcs(search_type=sat, max_leaf_size=100000)])', '--heuristic', 'hff=ff(cost_type=plusone)', '--search', 'lazy_greedy(hff, preferred=hff, cost_type=normal, bound=10, symmetry=symmetry_state_pruning(lex_prices=false, lex_num_states=false, lex_goal_cost=false))', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] timeout: 1799.64 -> (1800, 1801) performing decoupled satisficing search maximum leaf factor size 1000000 using default pruning method: BasicPruning using fork factoring profile performing decoupled satisficing search maximum leaf factor size 1000000 using default pruning method: BasicPruning using inverted-fork factoring profile performing decoupled satisficing search maximum leaf factor size 100000 using default pruning method: BasicPruning using incident-arcs factoring profile performing Star Decoupled A* search using default pruning method: BasicPruning using factoring portfolio reading input... [t=0.000218922s] done reading input! [t=0.000891249s] building causal graph...done! [t=0.000127375s] factoring time 0.00023908s No factoring found, falling back to standard search. Variables: 21 Bytes per state: 4 Building successor generator...done! [t=0.00120988s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.7125e-05s done! [t=0.00124277s] done initalizing global data [t=0.00124717s] Creating symmetry graph stabilizing goal only and using orbit search. Initializing symmetry Using Bliss to find group generators Got 0 group generators, time step: [t=0.00149505s] Number of generators: 0 done initializing symmetries [t=0.00150151s] Conducting lazy best first search, (real) bound = 10 Initializing FF heuristic... Initializing additive heuristic... Simplifying 179 unary operators... done! [179 unary operators] Best heuristic value: 20 [g=0, 1 evaluated, 0 expanded, t=0.00165139s, 3732 KB] Best heuristic value: 19 [g=0, 11 evaluated, 10 expanded, t=0.00174736s, 3732 KB] Best heuristic value: 15 [g=0, 12 evaluated, 11 expanded, t=0.00178186s, 3732 KB] Best heuristic value: 13 [g=1, 20 evaluated, 19 expanded, t=0.00185088s, 3732 KB] Best heuristic value: 12 [g=1, 25 evaluated, 24 expanded, t=0.00190641s, 3732 KB] Best heuristic value: 11 [g=4, 29 evaluated, 28 expanded, t=0.00195612s, 3732 KB] Best heuristic value: 7 [g=4, 35 evaluated, 34 expanded, t=0.00201228s, 3732 KB] Best heuristic value: 6 [g=4, 36 evaluated, 35 expanded, t=0.00204295s, 3732 KB] Best heuristic value: 5 [g=9, 54 evaluated, 53 expanded, t=0.00215466s, 3732 KB] Best heuristic value: 4 [g=9, 55 evaluated, 54 expanded, t=0.00218549s, 3732 KB] Best heuristic value: 3 [g=9, 56 evaluated, 55 expanded, t=0.00221444s, 3732 KB] Best heuristic value: 2 [g=9, 57 evaluated, 56 expanded, t=0.00224247s, 3732 KB] Completely explored state space -- no solution! Actual search time: 0.0012801s [t=0.00279334s] Initial state h value: 20. Expanded 155 state(s). Reopened 0 state(s). Evaluated 155 state(s). Evaluations: 155 Generated 333 state(s). Dead ends: 0 state(s). Number of registered states: 155 Search time: 0.00138935s Total time: 0.00279646s Search stopped without finding a solution. Peak memory: 3732 KB returncode: 5 Exit codes: [5, 0, 5, 5, 5] Checking plan: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmpjCPWez/sas_plan.1 Plan executed successfully - checking goal Plan valid Final value: 10 Successful plans: Value: 10 /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmpjCPWez/sas_plan.1 10