INFO Running translator.
INFO translator inputs: ['domain.pddl', 'problem.pddl']
INFO translator arguments: []
Parsing...
Parsing: [0.010s CPU, 0.005s 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.013s wall-clock]
375 relevant atoms
528 auxiliary atoms
903 final queue length
1060 total queue pushes
Completing instantiation... [0.000s CPU, 0.007s wall-clock]
Instantiating: [0.020s CPU, 0.030s wall-clock]
Computing fact groups...
Finding invariants...
7 initial candidates
Finding invariants: [0.020s CPU, 0.009s 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.020s CPU, 0.013s 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: 43676 KB
Writing output... [0.000s CPU, 0.001s wall-clock]
Done! [0.060s CPU, 0.059s wall-clock]
INFO Running preprocessor.
INFO preprocessor input: output.sas
INFO preprocessor arguments: ['--h2_time_limit', '10']
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.005943 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_agl_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.74
remaining time: 1799.74
config 0: relative time 30, remaining 300
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)', '--internal-plan-file', 'sas_plan']
timeout: 179.97 -> (180, 181)
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.000947978s]
done reading input! [t=0.00160709s]
building causal graph...done! [t=0.000121214s]
factoring time 0.000143277s
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 170, remaining 270
args: ['/planner/driver/../fast-downward-conjunctions/builds/release64clangpgonative/bin/downward', '--heuristic', 'hcff=cff(seed=42, cache_estimates=false, cost_type=ONE)', '--heuristic', 'hn=novelty(cache_estimates=false)', '--heuristic', 'tmp=novelty_linker(hcff, [hn])', '--heuristic', 'hlm=lmcount(lm_rhw(reasonable_orders=true, lm_cost_type=ONE), cost_type=ONE)', '--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=100), 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) ], continue_on_solve=false, continue_on_fail=true, delete_after_phase_heuristics=[hn, tmp], delete_after_phase_phases=[1, 1])', '--internal-plan-file', 'sas_plan']
timeout: 1133.16 -> (1134, 1135)
reading input... [t=0.00168923s]
done reading input! [t=0.00258922s]
packing state variables...done! [t=0.00259988s]
Variables: 21
FactPairs: 61
Bytes per state: 4
Building successor generator...done! [t=0.00264933s]
done initalizing global data [t=0.0026534s]
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.000177308s
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.000656725s
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.000116216s]
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.00514539s]
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.000802704s [t=0.00524306s]
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 = 100)
Conducting enforced hill-climbing search with explicit conjunctions, (real) bound = 2147483646
Using preferred operators for pruning
Breadth first search depth bound: 2147483647
Always reevaluate the local minimum neighborhood after adding a conjunction: 0
Cache the heuristic results of known states: 1
conjunctions per iteration: 1
check relaxed plan: 1
growth bound in the number of conjunctions (including singletons): 1
growth bound in the number of counters: 1.79769e+308
learning time bound: 60
|C| = 61 (including 61 singletons)
Total number of counters: 179
Conjunction growth ratio: 1
Counter growth ratio: 1
Counter size growth ratio: 1
Finished initialization, t = 3.8324e-05s
Learning phases: 0
Learning time: 5.41e-07s
Max learning time: 5.41e-07s
Counter growth: 1
Counter size growth: 1
Counter group growth: 1
Counter group size growth: 1
New conjunctions: 0
Unregressable conjunctions: 0
Unreachable conjunctions: 0
Evaluations per second: 0
EHC Phases: 0
Average expansions per EHC phase: 0
Dead ends during learning: 0
Dead ends during learning or backjumping: 0
No better state after learning: 0
Max learning stagnation count: 0
Average learning stagnation count: 0
Evaluations saved by buffering: 0
Exhausted search space: 0
Average dead end backjump length: 0
Total time spent on evaluating novelty: 0
Initial heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 17
New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 17
New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 16
New best heuristic value for novelty(cache_estimates = false): 0
New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 13
New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 12
New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 11
New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 10
New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 9
New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 8
New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 7
New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 6
New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 5
New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 4
New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 3
New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 2
New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 1
New best heuristic value for cff(seed = 42, cache_estimates = false, cost_type = one): 0
Solution found!
Actual search time: 0.00109348s [t=0.00667635s]
move player-01 pos-6-4 pos-6-3 dir-up (0)
move player-01 pos-6-3 pos-6-2 dir-up (0)
move player-01 pos-6-2 pos-5-2 dir-left (0)
move player-01 pos-5-2 pos-4-2 dir-left (0)
move player-01 pos-4-2 pos-3-2 dir-left (0)
move player-01 pos-3-2 pos-2-2 dir-left (0)
move player-01 pos-2-2 pos-2-3 dir-down (0)
move player-01 pos-2-3 pos-2-4 dir-down (0)
move player-01 pos-2-4 pos-3-4 dir-right (0)
move player-01 pos-3-4 pos-3-5 dir-down (0)
move player-01 pos-3-5 pos-4-5 dir-right (0)
push-to-nongoal player-01 stone-01 pos-4-5 pos-4-4 pos-4-3 dir-up (1)
move player-01 pos-4-4 pos-3-4 dir-left (0)
move player-01 pos-3-4 pos-2-4 dir-left (0)
move player-01 pos-2-4 pos-2-3 dir-up (0)
move player-01 pos-2-3 pos-2-2 dir-up (0)
move player-01 pos-2-2 pos-3-2 dir-right (0)
move player-01 pos-3-2 pos-4-2 dir-right (0)
move player-01 pos-4-2 pos-5-2 dir-right (0)
move player-01 pos-5-2 pos-6-2 dir-right (0)
move player-01 pos-6-2 pos-6-3 dir-down (0)
move player-01 pos-6-3 pos-6-4 dir-down (0)
push-to-nongoal player-01 stone-02 pos-6-4 pos-5-4 pos-4-4 dir-left (1)
push-to-nongoal player-01 stone-02 pos-5-4 pos-4-4 pos-3-4 dir-left (1)
push-to-goal player-01 stone-02 pos-4-4 pos-3-4 pos-2-4 dir-left (1)
move player-01 pos-3-4 pos-3-5 dir-down (0)
move player-01 pos-3-5 pos-2-5 dir-left (0)
push-to-nongoal player-01 stone-02 pos-2-5 pos-2-4 pos-2-3 dir-up (1)
move player-01 pos-2-4 pos-3-4 dir-right (0)
move player-01 pos-3-4 pos-4-4 dir-right (0)
move player-01 pos-4-4 pos-5-4 dir-right (0)
move player-01 pos-5-4 pos-6-4 dir-right (0)
move player-01 pos-6-4 pos-6-3 dir-up (0)
move player-01 pos-6-3 pos-6-2 dir-up (0)
move player-01 pos-6-2 pos-5-2 dir-left (0)
move player-01 pos-5-2 pos-4-2 dir-left (0)
push-to-nongoal player-01 stone-01 pos-4-2 pos-4-3 pos-4-4 dir-down (1)
move player-01 pos-4-3 pos-4-2 dir-up (0)
move player-01 pos-4-2 pos-3-2 dir-left (0)
move player-01 pos-3-2 pos-2-2 dir-left (0)
push-to-goal player-01 stone-02 pos-2-2 pos-2-3 pos-2-4 dir-down (1)
move player-01 pos-2-3 pos-2-2 dir-up (0)
move player-01 pos-2-2 pos-3-2 dir-right (0)
move player-01 pos-3-2 pos-4-2 dir-right (0)
move player-01 pos-4-2 pos-5-2 dir-right (0)
move player-01 pos-5-2 pos-6-2 dir-right (0)
move player-01 pos-6-2 pos-6-3 dir-down (0)
move player-01 pos-6-3 pos-6-4 dir-down (0)
move player-01 pos-6-4 pos-5-4 dir-left (0)
push-to-nongoal player-01 stone-01 pos-5-4 pos-4-4 pos-3-4 dir-left (1)
move player-01 pos-4-4 pos-4-5 dir-down (0)
move player-01 pos-4-5 pos-3-5 dir-left (0)
move player-01 pos-3-5 pos-2-5 dir-left (0)
push-to-nongoal player-01 stone-02 pos-2-5 pos-2-4 pos-2-3 dir-up (1)
push-to-nongoal player-01 stone-01 pos-2-4 pos-3-4 pos-4-4 dir-right (1)
push-to-goal player-01 stone-01 pos-3-4 pos-4-4 pos-5-4 dir-right (1)
move player-01 pos-4-4 pos-4-3 dir-up (0)
move player-01 pos-4-3 pos-4-2 dir-up (0)
move player-01 pos-4-2 pos-3-2 dir-left (0)
move player-01 pos-3-2 pos-2-2 dir-left (0)
push-to-goal player-01 stone-02 pos-2-2 pos-2-3 pos-2-4 dir-down (1)
Plan length: 61 step(s).
Plan cost: 12
Expanded 75 state(s).
Reopened 0 state(s).
Evaluated 0 state(s).
Evaluations: 146
Generated 102 state(s).
Dead ends: 0 state(s).
Learning phases: 0
Learning time: 7.031e-06s
Max learning time: 5.48e-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: 104600
EHC Phases: 15
Average expansions per EHC phase: 5
Dead ends during learning: 0
Dead ends during learning or backjumping: 0
No better state after learning: 0
Max learning stagnation count: 0
Average learning stagnation count: 0
Evaluations saved by buffering: 9
Exhausted search space: 0
Average dead end backjump length: 0
Total time spent on evaluating novelty: 8.5705e-05
EHC phases: 15
Average expansions per EHC phase: 5
EHC phases of depth 1: 6 - Avg. Expansions: 1.16667
EHC phases of depth 2: 3 - Avg. Expansions: 3
EHC phases of depth 4: 1 - Avg. Expansions: 7
EHC phases of depth 6: 2 - Avg. Expansions: 8.5
EHC phases of depth 8: 1 - Avg. Expansions: 10
EHC phases of depth 12: 1 - Avg. Expansions: 12
EHC phases of depth 13: 1 - Avg. Expansions: 13
Best solution cost so far: 12
Solution found - stop searching
Actual search time: 0.00257507s [t=0.00699449s]
Cumulative statistics:
Expanded 75 state(s).
Reopened 0 state(s).
Evaluated 0 state(s).
Evaluations: 146
Generated 102 state(s).
Dead ends: 0 state(s).
Search time: 0.00258024s
Total time: 0.00699762s
Solution found.
Peak memory: 5380 KB
returncode: 0
Exit codes: [5, 0]
Checking plan: /home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmpgDhYnh/sas_plan
Plan executed successfully - checking goal
Plan valid
Final value: 12
Successful plans:
Value: 12
/home/linuxbuildslave/buildslaves/ailinux/ipc-build-singularity-linux/build/tmpgDhYnh/sas_plan 12