INFO Running translator. INFO translator inputs: ['domain.pddl', 'problem.pddl'] INFO translator arguments: [] Parsing... Parsing: [0.000s CPU, 0.002s 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.010s CPU, 0.002s wall-clock] Generated 38 rules. Computing model... [0.010s CPU, 0.012s wall-clock] 375 relevant atoms 528 auxiliary atoms 903 final queue length 1060 total queue pushes Completing instantiation... [0.000s CPU, 0.006s wall-clock] Instantiating: [0.020s CPU, 0.024s 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.010s 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.020s 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.000s CPU, 0.006s wall-clock] 112 effect conditions simplified 0 implied preconditions added Detecting unreachable propositions... 0 operators removed 7 propositions removed Detecting unreachable propositions: [0.000s CPU, 0.001s 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: 25544 KB Writing output... [0.000s CPU, 0.001s wall-clock] Done! [0.040s CPU, 0.047s 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.01109 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. Building domain transition graphs... solveable in poly time 0 Building successor generator... 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 executable: /planner/src/search/downward-release INFO search portfolio: /planner/src/driver/portfolios/seq_sat_ds.py External time limits: 1800, 1805 Internal time limit: 1800 External memory limits: 8589934592, 8589934592 Internal memory limit: 8000000000 remaining time at start: 1799.78 remaining time: 1799.78 config 0: relative time 100, remaining 1800 g bound: infinity next plan number: 1 args: ['/planner/src/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.01s] Simplifying transitions... done! done reading input! [t=0.01s] building causal graph...done! [t=0.01s] factoring time 0s Error while factoring planning task! No factoring found! Search stopped without finding a solution. Peak memory: 4528 KB returncode: 5 remaining time: 1799.74 config 1: relative time 1000, remaining 1700 g bound: infinity next plan number: 1 args: ['/planner/src/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: 1058.67 -> (1059, 1060) 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=0s] Simplifying transitions... done! done reading input! [t=0s] building causal graph...done! [t=0s] factoring time 0s No factoring found, falling back to standard search. Variables: 21 Bytes per state: 4 done! [t=0s] done initalizing global data [t=0s] 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=0s] Number of generators: 0 done initializing symmetries [t=0s] 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=0s, 4528 KB] Best heuristic value: 16 [g=9, 11 evaluated, 10 expanded, t=0s, 4528 KB] Best heuristic value: 12 [g=10, 12 evaluated, 11 expanded, t=0s, 4528 KB] Best heuristic value: 11 [g=11, 13 evaluated, 12 expanded, t=0s, 4528 KB] Best heuristic value: 10 [g=18, 20 evaluated, 19 expanded, t=0s, 4528 KB] Best heuristic value: 9 [g=22, 25 evaluated, 24 expanded, t=0s, 4528 KB] Best heuristic value: 5 [g=29, 37 evaluated, 36 expanded, t=0s, 4528 KB] Best heuristic value: 4 [g=30, 38 evaluated, 37 expanded, t=0s, 4528 KB] Best heuristic value: 3 [g=39, 49 evaluated, 48 expanded, t=0s, 4528 KB] Best heuristic value: 2 [g=49, 60 evaluated, 59 expanded, t=0s, 4528 KB] Best heuristic value: 1 [g=50, 61 evaluated, 60 expanded, t=0s, 4528 KB] Solution found! Actual search time: 0s [t=0s] 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 61 state(s). Reopened 0 state(s). Evaluated 62 state(s). Evaluations: 62 Generated 133 state(s). Dead ends: 0 state(s). Number of registered states: 62 Search time: 0s Total time: 0s Solution found. Peak memory: 4528 KB returncode: 0 plan manager: found new plan with cost 10 Switch to real costs and repeat last run. remaining time: 1799.73 config 1: relative time 1000, remaining 1700 g bound: 10 next plan number: 2 args: ['/planner/src/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: 1058.66 -> (1059, 1060) 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=0s] Simplifying transitions... done! done reading input! [t=0s] building causal graph...done! [t=0s] factoring time 0s No factoring found, falling back to standard search. Variables: 21 Bytes per state: 4 done! [t=0s] done initalizing global data [t=0s] 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=0s] Number of generators: 0 done initializing symmetries [t=0s] 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=0s, 4528 KB] Best heuristic value: 19 [g=0, 11 evaluated, 10 expanded, t=0s, 4528 KB] Best heuristic value: 15 [g=0, 12 evaluated, 11 expanded, t=0s, 4528 KB] Best heuristic value: 13 [g=1, 20 evaluated, 19 expanded, t=0s, 4528 KB] Best heuristic value: 12 [g=1, 25 evaluated, 24 expanded, t=0s, 4528 KB] Best heuristic value: 11 [g=4, 28 evaluated, 27 expanded, t=0s, 4528 KB] Best heuristic value: 7 [g=4, 34 evaluated, 33 expanded, t=0s, 4528 KB] Best heuristic value: 6 [g=4, 35 evaluated, 34 expanded, t=0s, 4528 KB] Best heuristic value: 5 [g=9, 52 evaluated, 51 expanded, t=0s, 4528 KB] Best heuristic value: 4 [g=9, 53 evaluated, 52 expanded, t=0s, 4528 KB] Best heuristic value: 3 [g=9, 54 evaluated, 53 expanded, t=0s, 4528 KB] Best heuristic value: 2 [g=9, 55 evaluated, 54 expanded, t=0s, 4528 KB] Completely explored state space -- no solution! Actual search time: 0s [t=0s] 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: 0s Total time: 0s Search stopped without finding a solution. Peak memory: 4528 KB returncode: 5 remaining time: 1799.73 config 2: relative time 700, remaining 700 g bound: 10 next plan number: 2 args: ['/planner/src/search/downward-release', '--heuristic', 'hlm1,hff1=lm_ff_syn(lm_rhw(reasonable_orders=true, lm_cost_type=plusone,cost_type=plusone))', '--search', 'lazy_greedy([hff1,hlm1],preferred=[hff1,hlm1], cost_type=normal, reopen_closed=false, bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] timeout: 1799.73 -> (1800, 1801) reading input... [t=0s] Simplifying transitions... done! done reading input! [t=0s] building causal graph...done! [t=0s] Variables: 21 Bytes per state: 4 done! [t=0s] done initalizing global data [t=0s] Initializing Exploration... 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.000924509s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Initializing LAMA-FF Synergy Object Initializing landmarks count heuristic... 18 initial landmarks, 2 goal landmarks Conducting lazy best first search, (real) bound = 10 Best heuristic value: 19/19 [g=0, 1 evaluated, 0 expanded, t=0s, 4784 KB] Best heuristic value: 18/19 [g=0, 3 evaluated, 2 expanded, t=0s, 4784 KB] Best heuristic value: 17/19 [g=0, 4 evaluated, 3 expanded, t=0s, 4784 KB] Best heuristic value: 16/19 [g=0, 5 evaluated, 4 expanded, t=0s, 4784 KB] Best heuristic value: 15/19 [g=0, 6 evaluated, 5 expanded, t=0s, 4784 KB] Best heuristic value: 14/19 [g=0, 7 evaluated, 6 expanded, t=0s, 4784 KB] Best heuristic value: 13/19 [g=0, 8 evaluated, 7 expanded, t=0s, 4784 KB] Best heuristic value: 12/19 [g=0, 9 evaluated, 8 expanded, t=0s, 4784 KB] Best heuristic value: 11/19 [g=0, 11 evaluated, 10 expanded, t=0s, 4784 KB] Best heuristic value: 11/16 [g=0, 12 evaluated, 11 expanded, t=0s, 4784 KB] Best heuristic value: 10/16 [g=0, 13 evaluated, 12 expanded, t=0s, 4784 KB] Best heuristic value: 9/16 [g=1, 14 evaluated, 13 expanded, t=0s, 4784 KB] Best heuristic value: 7/16 [g=1, 15 evaluated, 14 expanded, t=0s, 4784 KB] Best heuristic value: 7/13 [g=1, 20 evaluated, 19 expanded, t=0s, 4784 KB] Best heuristic value: 7/12 [g=1, 23 evaluated, 22 expanded, t=0s, 4784 KB] Best heuristic value: 6/12 [g=2, 26 evaluated, 25 expanded, t=0s, 4784 KB] Best heuristic value: 5/12 [g=3, 27 evaluated, 26 expanded, t=0s, 4784 KB] Best heuristic value: 3/11 [g=4, 28 evaluated, 27 expanded, t=0s, 4784 KB] Best heuristic value: 3/7 [g=4, 35 evaluated, 34 expanded, t=0s, 4784 KB] Best heuristic value: 3/6 [g=4, 36 evaluated, 35 expanded, t=0s, 4784 KB] Best heuristic value: 1/6 [g=9, 51 evaluated, 50 expanded, t=0s, 4784 KB] Best heuristic value: 1/5 [g=9, 52 evaluated, 51 expanded, t=0s, 4784 KB] Best heuristic value: 1/4 [g=9, 53 evaluated, 52 expanded, t=0s, 4784 KB] Best heuristic value: 1/3 [g=9, 54 evaluated, 53 expanded, t=0s, 4784 KB] Best heuristic value: 1/2 [g=9, 55 evaluated, 54 expanded, t=0s, 4784 KB] Completely explored state space -- no solution! Actual search time: 0s [t=0s] Initial state h value: 19/19. Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 328 Generated 351 state(s). Dead ends: 0 state(s). Number of registered states: 164 Search time: 0s Total time: 0s Search stopped without finding a solution. Peak memory: 4784 KB returncode: 5 Abort portfolio and run final config. remaining time: 1799.72 config 0: relative time 1, remaining 1 g bound: 10 next plan number: 2 args: ['/planner/src/search/downward-release', '--heuristic', 'hlm,hff=lm_ff_syn(lm_rhw(reasonable_orders=true, lm_cost_type=plusone,cost_type=plusone))', '--search', 'iterated([\n lazy_greedy([hff,hlm],preferred=[hff,hlm],\n cost_type=one,reopen_closed=false),\n lazy_greedy([hff,hlm],preferred=[hff,hlm],\n reopen_closed=false),\n lazy_wastar([hff,hlm],preferred=[hff,hlm],w=5),\n lazy_wastar([hff,hlm],preferred=[hff,hlm],w=3),\n lazy_wastar([hff,hlm],preferred=[hff,hlm],w=2),\n lazy_wastar([hff,hlm],preferred=[hff,hlm],w=1)\n ],repeat_last=true,continue_on_fail=true, bound=10)', '--internal-previous-portfolio-plans', '1', '--internal-plan-file', 'sas_plan'] timeout: 1799.72 -> (1800, 1801) reading input... [t=0s] Simplifying transitions... done! done reading input! [t=0s] building causal graph...done! [t=0s] Variables: 21 Bytes per state: 4 done! [t=0s] done initalizing global data [t=0s] Initializing Exploration... 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.00116306s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Initializing LAMA-FF Synergy Object Initializing landmarks count heuristic... 18 initial landmarks, 2 goal landmarks Starting search: lazy_greedy(list(hff, hlm), preferred = list(hff, hlm), cost_type = one, reopen_closed = false) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 19/19 [g=0, 1 evaluated, 0 expanded, t=0s, 4788 KB] Best heuristic value: 18/19 [g=2, 3 evaluated, 2 expanded, t=0s, 4788 KB] Best heuristic value: 17/19 [g=3, 4 evaluated, 3 expanded, t=0s, 4788 KB] Best heuristic value: 16/19 [g=4, 5 evaluated, 4 expanded, t=0s, 4788 KB] Best heuristic value: 15/19 [g=5, 6 evaluated, 5 expanded, t=0s, 4788 KB] Best heuristic value: 14/19 [g=6, 7 evaluated, 6 expanded, t=0s, 4788 KB] Best heuristic value: 13/19 [g=7, 8 evaluated, 7 expanded, t=0s, 4788 KB] Best heuristic value: 12/19 [g=8, 9 evaluated, 8 expanded, t=0s, 4788 KB] Best heuristic value: 11/19 [g=9, 11 evaluated, 10 expanded, t=0s, 4788 KB] Best heuristic value: 11/16 [g=10, 12 evaluated, 11 expanded, t=0s, 4788 KB] Best heuristic value: 10/16 [g=11, 13 evaluated, 12 expanded, t=0s, 4788 KB] Best heuristic value: 9/16 [g=12, 14 evaluated, 13 expanded, t=0s, 4788 KB] Best heuristic value: 7/16 [g=13, 15 evaluated, 14 expanded, t=0s, 4788 KB] Best heuristic value: 7/13 [g=18, 20 evaluated, 19 expanded, t=0s, 4788 KB] Best heuristic value: 7/12 [g=20, 23 evaluated, 22 expanded, t=0s, 4788 KB] Best heuristic value: 6/12 [g=23, 26 evaluated, 25 expanded, t=0s, 4788 KB] Best heuristic value: 5/12 [g=24, 27 evaluated, 26 expanded, t=0s, 4788 KB] Best heuristic value: 3/11 [g=25, 28 evaluated, 27 expanded, t=0s, 4788 KB] Best heuristic value: 3/7 [g=31, 35 evaluated, 34 expanded, t=0s, 4788 KB] Best heuristic value: 3/6 [g=32, 36 evaluated, 35 expanded, t=0s, 4788 KB] Best heuristic value: 1/6 [g=46, 51 evaluated, 50 expanded, t=0s, 4788 KB] Best heuristic value: 1/5 [g=47, 52 evaluated, 51 expanded, t=0s, 4788 KB] Best heuristic value: 1/4 [g=48, 53 evaluated, 52 expanded, t=0s, 4788 KB] Best heuristic value: 1/3 [g=49, 54 evaluated, 53 expanded, t=0s, 4788 KB] Best heuristic value: 1/2 [g=50, 55 evaluated, 54 expanded, t=0s, 4788 KB] Completely explored state space -- no solution! Actual search time: 0s [t=0s] Initial state h value: 19/19. Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 328 Generated 351 state(s). Dead ends: 0 state(s). Number of registered states: 164 No solution found - keep searching Starting search: lazy_greedy(list(hff, hlm), preferred = list(hff, hlm), reopen_closed = false) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 19/19 [g=0, 1 evaluated, 0 expanded, t=0s, 4788 KB] Best heuristic value: 18/19 [g=0, 3 evaluated, 2 expanded, t=0s, 4788 KB] Best heuristic value: 17/19 [g=0, 4 evaluated, 3 expanded, t=0s, 4788 KB] Best heuristic value: 16/19 [g=0, 5 evaluated, 4 expanded, t=0s, 4788 KB] Best heuristic value: 15/19 [g=0, 6 evaluated, 5 expanded, t=0s, 4788 KB] Best heuristic value: 14/19 [g=0, 7 evaluated, 6 expanded, t=0s, 4788 KB] Best heuristic value: 13/19 [g=0, 8 evaluated, 7 expanded, t=0s, 4788 KB] Best heuristic value: 12/19 [g=0, 9 evaluated, 8 expanded, t=0s, 4788 KB] Best heuristic value: 11/19 [g=0, 11 evaluated, 10 expanded, t=0s, 4788 KB] Best heuristic value: 11/16 [g=0, 12 evaluated, 11 expanded, t=0s, 4788 KB] Best heuristic value: 10/16 [g=0, 13 evaluated, 12 expanded, t=0s, 4788 KB] Best heuristic value: 9/16 [g=1, 14 evaluated, 13 expanded, t=0s, 4788 KB] Best heuristic value: 7/16 [g=1, 15 evaluated, 14 expanded, t=0s, 4788 KB] Best heuristic value: 7/13 [g=1, 20 evaluated, 19 expanded, t=0s, 4788 KB] Best heuristic value: 7/12 [g=1, 23 evaluated, 22 expanded, t=0.01s, 4788 KB] Best heuristic value: 6/12 [g=2, 26 evaluated, 25 expanded, t=0.01s, 4788 KB] Best heuristic value: 5/12 [g=3, 27 evaluated, 26 expanded, t=0.01s, 4788 KB] Best heuristic value: 3/11 [g=4, 28 evaluated, 27 expanded, t=0.01s, 4788 KB] Best heuristic value: 3/7 [g=4, 35 evaluated, 34 expanded, t=0.01s, 4788 KB] Best heuristic value: 3/6 [g=4, 36 evaluated, 35 expanded, t=0.01s, 4788 KB] Best heuristic value: 1/6 [g=9, 51 evaluated, 50 expanded, t=0.01s, 4788 KB] Best heuristic value: 1/5 [g=9, 52 evaluated, 51 expanded, t=0.01s, 4788 KB] Best heuristic value: 1/4 [g=9, 53 evaluated, 52 expanded, t=0.01s, 4788 KB] Best heuristic value: 1/3 [g=9, 54 evaluated, 53 expanded, t=0.01s, 4788 KB] Best heuristic value: 1/2 [g=9, 55 evaluated, 54 expanded, t=0.01s, 4788 KB] Completely explored state space -- no solution! Actual search time: 0.01s [t=0.01s] Initial state h value: 19/19. Expanded 164 state(s). Reopened 0 state(s). Evaluated 164 state(s). Evaluations: 328 Generated 351 state(s). Dead ends: 0 state(s). Number of registered states: 164 No solution found - keep searching Starting search: lazy_wastar(list(hff, hlm), preferred = list(hff, hlm), w = 5) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 19/19 [g=0, 1 evaluated, 0 expanded, t=0.01s, 4788 KB] Best heuristic value: 18/19 [g=0, 3 evaluated, 2 expanded, t=0.01s, 4788 KB] Best heuristic value: 17/19 [g=0, 4 evaluated, 3 expanded, t=0.01s, 4788 KB] Best heuristic value: 16/19 [g=0, 5 evaluated, 4 expanded, t=0.01s, 4788 KB] Best heuristic value: 15/19 [g=0, 6 evaluated, 5 expanded, t=0.01s, 4788 KB] Best heuristic value: 14/19 [g=0, 7 evaluated, 6 expanded, t=0.01s, 4788 KB] Best heuristic value: 13/19 [g=0, 8 evaluated, 7 expanded, t=0.01s, 4788 KB] Best heuristic value: 12/19 [g=0, 9 evaluated, 8 expanded, t=0.01s, 4788 KB] Best heuristic value: 11/19 [g=0, 11 evaluated, 10 expanded, t=0.01s, 4788 KB] Best heuristic value: 11/16 [g=0, 12 evaluated, 11 expanded, t=0.01s, 4788 KB] Best heuristic value: 10/16 [g=0, 13 evaluated, 12 expanded, t=0.01s, 4788 KB] Best heuristic value: 9/16 [g=1, 14 evaluated, 13 expanded, t=0.01s, 4788 KB] Best heuristic value: 7/16 [g=1, 15 evaluated, 14 expanded, t=0.01s, 4788 KB] Best heuristic value: 7/13 [g=1, 20 evaluated, 19 expanded, t=0.01s, 4788 KB] Best heuristic value: 7/12 [g=1, 22 evaluated, 21 expanded, t=0.01s, 4788 KB] Best heuristic value: 6/12 [g=2, 25 evaluated, 24 expanded, t=0.01s, 4788 KB] Best heuristic value: 5/12 [g=2, 26 evaluated, 25 expanded, t=0.01s, 4788 KB] Best heuristic value: 4/12 [g=2, 37 evaluated, 36 expanded, t=0.01s, 4788 KB] Best heuristic value: 4/8 [g=3, 42 evaluated, 41 expanded, t=0.01s, 4916 KB] Best heuristic value: 4/7 [g=3, 43 evaluated, 42 expanded, t=0.01s, 4916 KB] Best heuristic value: 4/6 [g=4, 52 evaluated, 51 expanded, t=0.01s, 4916 KB] Best heuristic value: 3/6 [g=4, 53 evaluated, 52 expanded, t=0.01s, 4916 KB] Best heuristic value: 1/6 [g=9, 76 evaluated, 75 expanded, t=0.01s, 4916 KB] Best heuristic value: 1/5 [g=9, 77 evaluated, 76 expanded, t=0.01s, 4916 KB] Best heuristic value: 1/4 [g=9, 78 evaluated, 77 expanded, t=0.01s, 4916 KB] Best heuristic value: 1/3 [g=9, 79 evaluated, 78 expanded, t=0.01s, 4916 KB] Best heuristic value: 1/2 [g=9, 80 evaluated, 79 expanded, t=0.01s, 4916 KB] Completely explored state space -- no solution! Actual search time: 0.01s [t=0.02s] Initial state h value: 19/19. Expanded 175 state(s). Reopened 11 state(s). Evaluated 175 state(s). Evaluations: 350 Generated 370 state(s). Dead ends: 0 state(s). Number of registered states: 164 No solution found - keep searching Starting search: lazy_wastar(list(hff, hlm), preferred = list(hff, hlm), w = 3) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 19/19 [g=0, 1 evaluated, 0 expanded, t=0.02s, 4916 KB] Best heuristic value: 18/19 [g=0, 3 evaluated, 2 expanded, t=0.02s, 4916 KB] Best heuristic value: 17/19 [g=0, 4 evaluated, 3 expanded, t=0.02s, 4916 KB] Best heuristic value: 16/19 [g=0, 5 evaluated, 4 expanded, t=0.02s, 4916 KB] Best heuristic value: 15/19 [g=0, 6 evaluated, 5 expanded, t=0.02s, 4916 KB] Best heuristic value: 14/19 [g=0, 7 evaluated, 6 expanded, t=0.02s, 4916 KB] Best heuristic value: 13/19 [g=0, 8 evaluated, 7 expanded, t=0.02s, 4916 KB] Best heuristic value: 12/19 [g=0, 9 evaluated, 8 expanded, t=0.02s, 4916 KB] Best heuristic value: 11/19 [g=0, 11 evaluated, 10 expanded, t=0.02s, 4916 KB] Best heuristic value: 11/16 [g=0, 12 evaluated, 11 expanded, t=0.02s, 4916 KB] Best heuristic value: 10/16 [g=0, 13 evaluated, 12 expanded, t=0.02s, 4916 KB] Best heuristic value: 9/16 [g=1, 14 evaluated, 13 expanded, t=0.02s, 4916 KB] Best heuristic value: 7/16 [g=1, 15 evaluated, 14 expanded, t=0.02s, 4916 KB] Best heuristic value: 7/13 [g=1, 20 evaluated, 19 expanded, t=0.02s, 4916 KB] Best heuristic value: 7/12 [g=1, 22 evaluated, 21 expanded, t=0.02s, 4916 KB] Best heuristic value: 6/12 [g=2, 25 evaluated, 24 expanded, t=0.02s, 4916 KB] Best heuristic value: 5/12 [g=2, 26 evaluated, 25 expanded, t=0.02s, 4916 KB] Best heuristic value: 4/12 [g=2, 37 evaluated, 36 expanded, t=0.02s, 4916 KB] Best heuristic value: 4/8 [g=3, 42 evaluated, 41 expanded, t=0.02s, 4916 KB] Best heuristic value: 4/7 [g=3, 43 evaluated, 42 expanded, t=0.02s, 4916 KB] Best heuristic value: 4/6 [g=4, 52 evaluated, 51 expanded, t=0.02s, 4916 KB] Best heuristic value: 3/6 [g=4, 53 evaluated, 52 expanded, t=0.02s, 4916 KB] Best heuristic value: 1/6 [g=9, 76 evaluated, 75 expanded, t=0.02s, 4916 KB] Best heuristic value: 1/5 [g=9, 77 evaluated, 76 expanded, t=0.02s, 4916 KB] Best heuristic value: 1/4 [g=9, 78 evaluated, 77 expanded, t=0.02s, 4916 KB] Best heuristic value: 1/3 [g=9, 79 evaluated, 78 expanded, t=0.02s, 4916 KB] Best heuristic value: 1/2 [g=9, 80 evaluated, 79 expanded, t=0.02s, 4916 KB] Completely explored state space -- no solution! Actual search time: 0s [t=0.02s] Initial state h value: 19/19. Expanded 174 state(s). Reopened 10 state(s). Evaluated 174 state(s). Evaluations: 348 Generated 368 state(s). Dead ends: 0 state(s). Number of registered states: 164 No solution found - keep searching Starting search: lazy_wastar(list(hff, hlm), preferred = list(hff, hlm), w = 2) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 19/19 [g=0, 1 evaluated, 0 expanded, t=0.02s, 4916 KB] Best heuristic value: 18/19 [g=0, 3 evaluated, 2 expanded, t=0.02s, 4916 KB] Best heuristic value: 17/19 [g=0, 4 evaluated, 3 expanded, t=0.02s, 4916 KB] Best heuristic value: 16/19 [g=0, 5 evaluated, 4 expanded, t=0.02s, 4916 KB] Best heuristic value: 15/19 [g=0, 6 evaluated, 5 expanded, t=0.02s, 4916 KB] Best heuristic value: 14/19 [g=0, 7 evaluated, 6 expanded, t=0.02s, 4916 KB] Best heuristic value: 13/19 [g=0, 8 evaluated, 7 expanded, t=0.02s, 4916 KB] Best heuristic value: 12/19 [g=0, 9 evaluated, 8 expanded, t=0.02s, 4916 KB] Best heuristic value: 11/19 [g=0, 11 evaluated, 10 expanded, t=0.02s, 4916 KB] Best heuristic value: 11/16 [g=0, 12 evaluated, 11 expanded, t=0.02s, 4916 KB] Best heuristic value: 10/16 [g=0, 13 evaluated, 12 expanded, t=0.02s, 4916 KB] Best heuristic value: 9/16 [g=1, 14 evaluated, 13 expanded, t=0.02s, 4916 KB] Best heuristic value: 7/16 [g=1, 15 evaluated, 14 expanded, t=0.02s, 4916 KB] Best heuristic value: 7/13 [g=1, 20 evaluated, 19 expanded, t=0.02s, 4916 KB] Best heuristic value: 7/12 [g=1, 22 evaluated, 21 expanded, t=0.02s, 4916 KB] Best heuristic value: 6/12 [g=2, 25 evaluated, 24 expanded, t=0.02s, 4916 KB] Best heuristic value: 5/12 [g=2, 26 evaluated, 25 expanded, t=0.02s, 4916 KB] Best heuristic value: 4/12 [g=2, 37 evaluated, 36 expanded, t=0.02s, 4916 KB] Best heuristic value: 4/8 [g=3, 42 evaluated, 41 expanded, t=0.02s, 4916 KB] Best heuristic value: 4/7 [g=3, 43 evaluated, 42 expanded, t=0.02s, 4916 KB] Best heuristic value: 4/6 [g=4, 52 evaluated, 51 expanded, t=0.02s, 4916 KB] Best heuristic value: 3/6 [g=4, 53 evaluated, 52 expanded, t=0.02s, 4916 KB] Best heuristic value: 1/6 [g=9, 76 evaluated, 75 expanded, t=0.02s, 4916 KB] Best heuristic value: 1/5 [g=9, 77 evaluated, 76 expanded, t=0.02s, 4916 KB] Best heuristic value: 1/4 [g=9, 78 evaluated, 77 expanded, t=0.02s, 4916 KB] Best heuristic value: 1/3 [g=9, 79 evaluated, 78 expanded, t=0.02s, 4916 KB] Best heuristic value: 1/2 [g=9, 80 evaluated, 79 expanded, t=0.02s, 4916 KB] Completely explored state space -- no solution! Actual search time: 0.01s [t=0.03s] Initial state h value: 19/19. Expanded 176 state(s). Reopened 12 state(s). Evaluated 176 state(s). Evaluations: 352 Generated 372 state(s). Dead ends: 0 state(s). Number of registered states: 164 No solution found - keep searching Starting search: lazy_wastar(list(hff, hlm), preferred = list(hff, hlm), w = 1) Conducting lazy best first search, (real) bound = 10 Best heuristic value: 19/19 [g=0, 1 evaluated, 0 expanded, t=0.03s, 4916 KB] Best heuristic value: 18/19 [g=0, 3 evaluated, 2 expanded, t=0.03s, 4916 KB] Best heuristic value: 17/19 [g=0, 4 evaluated, 3 expanded, t=0.03s, 4916 KB] Best heuristic value: 16/19 [g=0, 5 evaluated, 4 expanded, t=0.03s, 4916 KB] Best heuristic value: 15/19 [g=0, 6 evaluated, 5 expanded, t=0.03s, 4916 KB] Best heuristic value: 14/19 [g=0, 7 evaluated, 6 expanded, t=0.03s, 4916 KB] Best heuristic value: 13/19 [g=0, 8 evaluated, 7 expanded, t=0.03s, 4916 KB] Best heuristic value: 12/19 [g=0, 9 evaluated, 8 expanded, t=0.03s, 4916 KB] Best heuristic value: 11/19 [g=0, 11 evaluated, 10 expanded, t=0.03s, 4916 KB] Best heuristic value: 11/16 [g=0, 12 evaluated, 11 expanded, t=0.03s, 4916 KB] Best heuristic value: 10/16 [g=0, 13 evaluated, 12 expanded, t=0.03s, 4916 KB] Best heuristic value: 9/16 [g=1, 14 evaluated, 13 expanded, t=0.03s, 4916 KB] Best heuristic value: 7/16 [g=1, 15 evaluated, 14 expanded, t=0.03s, 4916 KB] Best heuristic value: 7/13 [g=1, 20 evaluated, 19 expanded, t=0.03s, 4916 KB] Best heuristic value: 7/12 [g=1, 22 evaluated, 21 expanded, t=0.03s, 4916 KB] Best heuristic value: 6/12 [g=2, 25 evaluated, 24 expanded, t=0.03s, 4916 KB] Best heuristic value: 5/12 [g=2, 26 evaluated, 25 expanded, t=0.03s, 4916 KB] Best heuristic value: 4/12 [g=2, 37 evaluated, 36 expanded, t=0.03s, 4916 KB] Best heuristic value: 4/8 [g=3, 42 evaluated, 41 expanded, t=0.03s, 4916 KB] Best heuristic value: 4/7 [g=3, 43 evaluated, 42 expanded, t=0.03s, 4916 KB] Best heuristic value: 3/7 [g=4, 47 evaluated, 46 expanded, t=0.03s, 4916 KB] Best heuristic value: 3/6 [g=4, 55 evaluated, 54 expanded, t=0.03s, 4916 KB] Best heuristic value: 1/6 [g=9, 81 evaluated, 80 expanded, t=0.03s, 4916 KB] Best heuristic value: 1/5 [g=9, 82 evaluated, 81 expanded, t=0.03s, 4916 KB] Best heuristic value: 1/4 [g=9, 83 evaluated, 82 expanded, t=0.03s, 4916 KB] Best heuristic value: 1/3 [g=9, 84 evaluated, 83 expanded, t=0.03s, 4916 KB] Best heuristic value: 1/2 [g=9, 85 evaluated, 84 expanded, t=0.03s, 4916 KB] Completely explored state space -- no solution! Actual search time: 0s [t=0.03s] Initial state h value: 19/19. Expanded 174 state(s). Reopened 10 state(s). Evaluated 174 state(s). Evaluations: 348 Generated 368 state(s). Dead ends: 0 state(s). Number of registered states: 164 No solution found - keep searching Actual search time: 0.03s [t=0.03s] Cumulative statistics: Expanded 1027 state(s). Reopened 43 state(s). Evaluated 1027 state(s). Evaluations: 2054 Generated 2180 state(s). Dead ends: 0 state(s). Search time: 0.03s Total time: 0.03s Search stopped without finding a solution. Peak memory: 4916 KB returncode: 5 Exit codes: [5, 0, 5, 5, 5] Checking plan: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmpzuC1lU/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/tmpzuC1lU/sas_plan.1 10