INFO Running translator. INFO translator inputs: ['domain.pddl', 'problem.pddl'] INFO translator arguments: [] Parsing... Parsing: [0.010s 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.000s CPU, 0.005s wall-clock] Preparing model... [0.000s CPU, 0.003s wall-clock] Generated 38 rules. Computing model... [0.020s 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.032s 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.000s CPU, 0.000s wall-clock] Computing fact groups: [0.010s 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.010s 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] 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: 43676 KB Writing output... [0.000s CPU, 0.001s wall-clock] Done! [0.060s CPU, 0.065s 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.005788 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_cbo_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.76 remaining time: 1799.76 config 0: relative time 100, remaining 1800 set cost bound to 21 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=21)', '--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.000931149s] done reading input! [t=0.00156912s] building causal graph...done! [t=0.000120776s] factoring time 0.000142972s Error while factoring planning task! No factoring found! Search stopped without finding a solution. Peak memory: 3600 KB returncode: 5 remaining time: 1799.73 config 1: relative time 600, remaining 1700 set cost bound to 21 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=21, symmetry=symmetry_state_pruning(lex_prices=false, lex_num_states=false, lex_goal_cost=false))', '--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.000194521s] done reading input! [t=0.000824484s] building causal graph...done! [t=0.000119358s] factoring time 0.000220825s No factoring found, falling back to standard search. Variables: 21 Bytes per state: 4 Building successor generator...done! [t=0.00111448s] peak memory difference for root successor generator creation: 0 KB time for root successor generation creation: 2.2808e-05s done! [t=0.00114502s] done initalizing global data [t=0.00114862s] 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.00134643s] Number of generators: 0 done initializing symmetries [t=0.00135245s] Conducting lazy best first search, (real) bound = 21 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.0014888s, 3732 KB] Best heuristic value: 16 [g=9, 11 evaluated, 10 expanded, t=0.00157895s, 3732 KB] Best heuristic value: 12 [g=10, 12 evaluated, 11 expanded, t=0.00161199s, 3732 KB] Best heuristic value: 11 [g=11, 13 evaluated, 12 expanded, t=0.00164255s, 3732 KB] Best heuristic value: 10 [g=18, 20 evaluated, 19 expanded, t=0.00170245s, 3732 KB] Best heuristic value: 9 [g=22, 25 evaluated, 24 expanded, t=0.00175483s, 3732 KB] Best heuristic value: 5 [g=29, 38 evaluated, 37 expanded, t=0.00184281s, 3732 KB] Best heuristic value: 4 [g=30, 39 evaluated, 38 expanded, t=0.00187336s, 3732 KB] Best heuristic value: 3 [g=39, 50 evaluated, 49 expanded, t=0.00195421s, 3732 KB] Best heuristic value: 2 [g=49, 61 evaluated, 60 expanded, t=0.00203736s, 3732 KB] Best heuristic value: 1 [g=50, 62 evaluated, 61 expanded, t=0.00206492s, 3732 KB] Solution found! Actual search time: 0.000732697s [t=0.00209524s] 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.000833311s Total time: 0.00209796s Solution found. Peak memory: 3732 KB returncode: 0 Exit codes: [5, 0] Checking plan: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmphKcBSw/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/tmphKcBSw/sas_plan 10