INFO Running translator. INFO translator input: ['domain.pddl', 'problem.pddl'] INFO translator arguments: [] INFO translator time limit: 1799.97s INFO translator memory limit: 8192 MB INFO callstring: /usr/bin/python /planner/builds/release64/bin/translate/translate.py domain.pddl problem.pddl time limit 1799.97 -> (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.010s CPU, 0.003s wall-clock] Preparing model... [0.000s CPU, 0.002s wall-clock] Generated 38 rules. Computing model... [0.000s CPU, 0.010s wall-clock] 375 relevant atoms 528 auxiliary atoms 903 final queue length 1060 total queue pushes Completing instantiation... [0.000s CPU, 0.005s wall-clock] Instantiating: [0.020s CPU, 0.021s wall-clock] Computing fact groups... Finding invariants... 7 initial candidates Finding invariants: [0.010s CPU, 0.006s 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.009s wall-clock] Building STRIPS to SAS dictionary... [0.000s CPU, 0.000s wall-clock] Building dictionary for full mutex groups... [0.000s CPU, 0.000s wall-clock] Building mutex information... Building mutex information: [0.000s CPU, 0.000s wall-clock] Translating task... Processing axioms... Simplifying axioms... [0.000s CPU, 0.000s wall-clock] Processing axioms: [0.000s CPU, 0.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.000s CPU, 0.003s wall-clock] Reordering and filtering variables... 21 of 21 variables necessary. 16 of 19 mutex groups necessary. 78 of 78 operators necessary. 0 of 0 axiom rules necessary. Reordering and filtering variables: [0.010s CPU, 0.001s wall-clock] Translator variables: 21 Translator derived variables: 0 Translator facts: 80 Translator goal facts: 2 Translator mutex groups: 16 Translator total mutex groups size: 60 Translator operators: 78 Translator axioms: 0 Translator task size: 751 Translator peak memory: 25308 KB Writing output... [0.000s CPU, 0.001s wall-clock] Done! [0.040s CPU, 0.045s wall-clock] INFO Run task transformation (preprocess). INFO Absolute path: /planner/builds/release64/bin/preprocess INFO callstring: /planner/builds/release64/bin/preprocess < output.sas Building causal graph... The causal graph is not acyclic. 21 variables of 21 necessary 16 of 16 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.005742 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 (release64). INFO search input: output.sas INFO search arguments: ['--if-unit-cost', '--heuristic', 'hrb=RB(dag=greedy_level, extract_plan=true)', '--heuristic', 'hn=novelty(eval=hrb)', '--heuristic', 'hlm=lmcount(lm_rhw(reasonable_orders=true,lm_cost_type=ONE))', '--search', 'lazy(open=alt([tiebreaking([hn, hrb]), single(hrb,pref_only=true), single(hlm), single(hlm,pref_only=true)], boost=1000), preferred=[hrb,hlm])', '--if-non-unit-cost', '--heuristic', 'hrb1=RB(dag=greedy_level, extract_plan=true, transform=adapt_costs(one))', '--heuristic', 'hn=novelty(eval=hrb1)', '--heuristic', 'hlm1=lmcount(lm_rhw(reasonable_orders=true,lm_cost_type=one),transform=adapt_costs(one))', '--search', 'lazy(open=alt([tiebreaking([hn, hrb1]), single(hrb1,pref_only=true), single(hlm1), single(hlm1,pref_only=true)], boost=1000), preferred=[hrb1,hlm1], cost_type=one,reopen_closed=false)', '--always'] INFO search time limit: 1799.86s INFO search memory limit: 8192 MB INFO search executable: /planner/builds/release64/bin/downward INFO callstring: /planner/builds/release64/bin/downward --if-unit-cost --heuristic 'hrb=RB(dag=greedy_level, extract_plan=true)' --heuristic 'hn=novelty(eval=hrb)' --heuristic 'hlm=lmcount(lm_rhw(reasonable_orders=true,lm_cost_type=ONE))' --search 'lazy(open=alt([tiebreaking([hn, hrb]), single(hrb,pref_only=true), single(hlm), single(hlm,pref_only=true)], boost=1000), preferred=[hrb,hlm])' --if-non-unit-cost --heuristic 'hrb1=RB(dag=greedy_level, extract_plan=true, transform=adapt_costs(one))' --heuristic 'hn=novelty(eval=hrb1)' --heuristic 'hlm1=lmcount(lm_rhw(reasonable_orders=true,lm_cost_type=one),transform=adapt_costs(one))' --search 'lazy(open=alt([tiebreaking([hn, hrb1]), single(hrb1,pref_only=true), single(hlm1), single(hlm1,pref_only=true)], boost=1000), preferred=[hrb1,hlm1], cost_type=one,reopen_closed=false)' --always --internal-plan-file sas_plan < output.sas time limit 1799.86 -> (1800, 1801) reading input... [t=2.8253e-05s] done reading input! [t=0.000887118s] packing state variables...done! [t=0.0008966s] Variables: 21 FactPairs: 61 Bytes per state: 4 Building successor generator...done! [t=0.00097567s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.6467e-05s done initializing global data [t=0.00100842s] Simplifying 179 unary operators... done! [179 unary operators] Initializing additive heuristic... Initializing FF heuristic... Initializing extended DTGs Initializing Red-Black Fact Following heuristic... Initializing novelty 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.000788199s Discovered 34 landmarks, of which 0 are disjunctive and 0 are conjunctive 141 edges Conducting lazy best first search, (real) bound = 2147483647 18 initial landmarks, 2 goal landmarks Attempting to extract plan from the heuristic Running A* instead of Dijkstra. Using the distances ignoring outside conditions for heuristic estimates. Initializing Red-Black task... Initializing Red-Black task core... Adding 51 operators to extended DTGs Checking invertibility... Done checking invertibility Number of invertible variables is 11 Checking connectivity... Done checking connectivity Finished initializing Red-Black task core at time step [t=0.00259517s] Total number of invertible variables is 11 building causal graph...done! [t=0.000153185s] Invertible variables connection status: 1 Invertible variables without leafs connection status: 1 Invertible variables with one directional connection status: 0 Setting black variables... Use connected is set to False --------------------------------------------------------------------------------------- { Atom clear(pos-6-3), NegatedAtom clear(pos-6-3) } is invertible, marked black [3 side effects] { Atom clear(pos-6-2), NegatedAtom clear(pos-6-2) } is invertible, marked red [3 side effects] { Atom clear(pos-5-2), NegatedAtom clear(pos-5-2) } is invertible, marked black [3 side effects] { Atom clear(pos-3-2), NegatedAtom clear(pos-3-2) } is invertible, marked black [3 side effects] { Atom clear(pos-2-3), NegatedAtom clear(pos-2-3) } is not invertible, marked red [6 side effects] { Atom clear(pos-2-2), NegatedAtom clear(pos-2-2) } is invertible, marked red [6 side effects] { Atom clear(pos-4-3), NegatedAtom clear(pos-4-3) } is not invertible, marked red [6 side effects] { Atom clear(pos-2-5), NegatedAtom clear(pos-2-5) } is invertible, marked black [6 side effects] { Atom clear(pos-4-5), NegatedAtom clear(pos-4-5) } is invertible, marked black [6 side effects] { Atom clear(pos-3-5), NegatedAtom clear(pos-3-5) } is invertible, marked red [4 side effects] { Atom clear(pos-4-2), NegatedAtom clear(pos-4-2) } is invertible, marked red [7 side effects] { Atom clear(pos-6-4), NegatedAtom clear(pos-6-4) } is invertible, marked red [8 side effects] { Atom at(stone-01, pos-3-4), Atom at(stone-01, pos-4-3), Atom at(stone-01, pos-4-4), Atom at(stone-01, pos-5-4) } is not invertible, marked red [10 side effects] { Atom at(stone-02, pos-2-3), Atom at(stone-02, pos-2-4), Atom at(stone-02, pos-3-4), Atom at(stone-02, pos-4-4), Atom at(stone-02, pos-5-4) } is not invertible, marked red [10 side effects] { Atom clear(pos-5-4), NegatedAtom clear(pos-5-4) } is not invertible, marked red [8 side effects] { Atom clear(pos-3-4), NegatedAtom clear(pos-3-4) } is not invertible, marked red [9 side effects] { Atom clear(pos-2-4), NegatedAtom clear(pos-2-4) } is not invertible, marked red [10 side effects] { Atom at(player-01, pos-2-2), Atom at(player-01, pos-2-3), Atom at(player-01, pos-2-4), Atom at(player-01, pos-2-5), Atom at(player-01, pos-3-2), Atom at(player-01, pos-3-4), Atom at(player-01, pos-3-5), Atom at(player-01, pos-4-2), Atom at(player-01, pos-4-3), Atom at(player-01, pos-4-4), Atom at(player-01, pos-4-5), Atom at(player-01, pos-5-2), Atom at(player-01, pos-5-4), Atom at(player-01, pos-6-2), Atom at(player-01, pos-6-3), Atom at(player-01, pos-6-4) } is invertible, marked red [20 side effects] { Atom clear(pos-4-4), NegatedAtom clear(pos-4-4) } is not invertible, marked red [12 side effects] { Atom at-goal(stone-02), NegatedAtom at-goal(stone-02) } is not invertible, marked red [10 side effects] { Atom at-goal(stone-01), NegatedAtom at-goal(stone-01) } is not invertible, marked red [10 side effects] --------------------------------------------------------------------------------------- Total number of black variables is 5 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 Finished initializing Red-Black task at time step [t=0.00290211s] Counting red preconditions.. Preparing for red fact following.. Setting use black reachable for black variables.. 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 Plan extraction: 1 Finished initializing Red-Black Fact Following heuristic at time step [t=0.00298687s] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), transform = adapt_costs(one)): 16 New best heuristic value for rb(dag = greedy_level, extract_plan = true, transform = adapt_costs(one)): 16 New best heuristic value for novelty(eval = hrb1): 0 [g=0, 1 evaluated, 0 expanded, t=0.00303797s, 5032 KB] Initial heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), transform = adapt_costs(one)): 16 Initial heuristic value for rb(dag = greedy_level, extract_plan = true, transform = adapt_costs(one)): 16 Initial heuristic value for novelty(eval = hrb1): 0 New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), transform = adapt_costs(one)): 15 [g=2, 3 evaluated, 2 expanded, t=0.00313419s, 5032 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), transform = adapt_costs(one)): 14 [g=3, 4 evaluated, 3 expanded, t=0.00319269s, 5032 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), transform = adapt_costs(one)): 13 [g=4, 5 evaluated, 4 expanded, t=0.00324997s, 5032 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), transform = adapt_costs(one)): 12 [g=5, 6 evaluated, 5 expanded, t=0.00330408s, 5032 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), transform = adapt_costs(one)): 11 [g=6, 7 evaluated, 6 expanded, t=0.00335737s, 5032 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), transform = adapt_costs(one)): 10 [g=7, 9 evaluated, 8 expanded, t=0.0034335s, 5032 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), transform = adapt_costs(one)): 9 [g=8, 10 evaluated, 9 expanded, t=0.00348806s, 5032 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), transform = adapt_costs(one)): 8 [g=9, 12 evaluated, 11 expanded, t=0.00356087s, 5032 KB] New best heuristic value for rb(dag = greedy_level, extract_plan = true, transform = adapt_costs(one)): 12 [g=10, 13 evaluated, 12 expanded, t=0.00361421s, 5032 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), transform = adapt_costs(one)): 7 New best heuristic value for rb(dag = greedy_level, extract_plan = true, transform = adapt_costs(one)): 11 [g=11, 14 evaluated, 13 expanded, t=0.00366603s, 5032 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), transform = adapt_costs(one)): 6 [g=13, 16 evaluated, 15 expanded, t=0.00374199s, 5032 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), transform = adapt_costs(one)): 5 [g=13, 18 evaluated, 17 expanded, t=0.00381592s, 5032 KB] New best heuristic value for rb(dag = greedy_level, extract_plan = true, transform = adapt_costs(one)): 10 [g=18, 24 evaluated, 23 expanded, t=0.00395867s, 5032 KB] New best heuristic value for rb(dag = greedy_level, extract_plan = true, transform = adapt_costs(one)): 9 [g=21, 27 evaluated, 26 expanded, t=0.00404697s, 5032 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), transform = adapt_costs(one)): 4 [g=24, 30 evaluated, 29 expanded, t=0.00413293s, 5032 KB] New best heuristic value for rb(dag = greedy_level, extract_plan = true, transform = adapt_costs(one)): 8 [g=24, 32 evaluated, 31 expanded, t=0.00420077s, 5032 KB] New best heuristic value for lmcount(lm_rhw(reasonable_orders = true, lm_cost_type = one), transform = adapt_costs(one)): 2 [g=25, 35 evaluated, 34 expanded, t=0.00428634s, 5032 KB] New best heuristic value for rb(dag = greedy_level, extract_plan = true, transform = adapt_costs(one)): 5 [g=31, 53 evaluated, 52 expanded, t=0.00464073s, 5032 KB] New best heuristic value for rb(dag = greedy_level, extract_plan = true, transform = adapt_costs(one)): 4 [g=32, 54 evaluated, 53 expanded, t=0.00468843s, 5032 KB] New best heuristic value for rb(dag = greedy_level, extract_plan = true, transform = adapt_costs(one)): 3 [g=43, 70 evaluated, 69 expanded, t=0.00497537s, 5032 KB] Cost to: 8, cost from: 2 the total is: 10 Solution found! Actual search time: 0.0026916s [t=0.00509777s] 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 74 state(s). Reopened 0 state(s). Evaluated 75 state(s). Evaluations: 150 Generated 160 state(s). Dead ends: 0 state(s). Number of registered states: 75 Search time: 0.00270867s Total time: 0.00510048s Solution found. Peak memory: 5032 KB ['/planner/fast-downward.py', '--build', 'release64', '--plan-file', 'sas_plan', '--transform-task', 'preprocess', 'domain.pddl', 'problem.pddl', '--if-unit-cost', '--heuristic', 'hrb=RB(dag=greedy_level, extract_plan=true)', '--heuristic', 'hn=novelty(eval=hrb)', '--heuristic', 'hlm=lmcount(lm_rhw(reasonable_orders=true,lm_cost_type=ONE))', '--search', 'lazy(open=alt([tiebreaking([hn, hrb]), single(hrb,pref_only=true), single(hlm), single(hlm,pref_only=true)], boost=1000), preferred=[hrb,hlm])', '--if-non-unit-cost', '--heuristic', 'hrb1=RB(dag=greedy_level, extract_plan=true, transform=adapt_costs(one))', '--heuristic', 'hn=novelty(eval=hrb1)', '--heuristic', 'hlm1=lmcount(lm_rhw(reasonable_orders=true,lm_cost_type=one),transform=adapt_costs(one))', '--search', 'lazy(open=alt([tiebreaking([hn, hrb1]), single(hrb1,pref_only=true), single(hlm1), single(hlm1,pref_only=true)], boost=1000), preferred=[hrb1,hlm1], cost_type=one,reopen_closed=false)', '--always'] Checking plan: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmphtk1ki/sas_plan Plan executed successfully - checking goal Plan valid Final value: 10 Successful plans: Value: 10 /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmphtk1ki/sas_plan 10