5.29/5.38 NO 5.29/5.38 5.29/5.38 Solver Timeout: 4 5.29/5.38 Global Timeout: 300 5.29/5.38 No parsing errors! 5.29/5.38 Init Location: 0 5.29/5.38 Transitions: 5.29/5.38 5.29/5.38 5.29/5.38 5.29/5.38 undef7}> 5.29/5.38 ((0 + x^0) + y^0)}> 5.29/5.38 5.29/5.38 5.29/5.38 5.29/5.38 Fresh variables: 5.29/5.38 undef7, 5.29/5.38 5.29/5.38 Undef variables: 5.29/5.38 undef7, 5.29/5.38 5.29/5.38 Abstraction variables: 5.29/5.38 5.29/5.38 Exit nodes: 5.29/5.38 5.29/5.38 Accepting locations: 5.29/5.38 5.29/5.38 Asserts: 5.29/5.38 5.29/5.38 Preprocessed LLVMGraph 5.29/5.38 Init Location: 0 5.29/5.38 Transitions: 5.29/5.38 5.29/5.38 undef7, x^0 -> ((0 + x^0) + y^0)}> 5.29/5.38 5.29/5.38 Fresh variables: 5.29/5.38 undef7, 5.29/5.38 5.29/5.38 Undef variables: 5.29/5.38 undef7, 5.29/5.38 5.29/5.38 Abstraction variables: 5.29/5.38 5.29/5.38 Exit nodes: 5.29/5.38 5.29/5.38 Accepting locations: 5.29/5.38 5.29/5.38 Asserts: 5.29/5.38 5.29/5.38 ************************************************************* 5.29/5.38 ******************************************************************************************* 5.29/5.38 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 5.29/5.38 ******************************************************************************************* 5.29/5.38 5.29/5.38 Init Location: 0 5.29/5.38 Graph 0: 5.29/5.38 Transitions: 5.29/5.38 Variables: 5.29/5.38 5.29/5.38 Graph 1: 5.29/5.38 Transitions: 5.29/5.38 undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 Variables: 5.29/5.38 __disjvr_0^0, x^0, y^0 5.29/5.38 5.29/5.38 Precedence: 5.29/5.38 Graph 0 5.29/5.38 5.29/5.38 Graph 1 5.29/5.38 5.29/5.38 5.29/5.38 Map Locations to Subgraph: 5.29/5.38 ( 0 , 0 ) 5.29/5.38 ( 2 , 1 ) 5.29/5.38 5.29/5.38 ******************************************************************************************* 5.29/5.38 ******************************** CHECKING ASSERTIONS ******************************** 5.29/5.38 ******************************************************************************************* 5.29/5.38 5.29/5.38 Proving termination of subgraph 0 5.29/5.38 Proving termination of subgraph 1 5.29/5.38 Checking unfeasibility... 5.29/5.38 Time used: 0.00231 5.29/5.38 5.29/5.38 Checking conditional termination of SCC {l2}... 5.29/5.38 5.29/5.38 LOG: CALL solveLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear - Elapsed time: 0.000603s 5.29/5.38 5.29/5.38 LOG: CALL solveLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear - Elapsed time: 0.001978s 5.29/5.38 Trying to remove transition: undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 Solving with 1 template(s). 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006600s 5.29/5.38 Time used: 0.006434 5.29/5.38 Solving with 1 template(s). 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008512s 5.29/5.38 Time used: 0.008017 5.29/5.38 Improving Solution with cost 1 ... 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetNextSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015387s 5.29/5.38 Time used: 0.015257 5.29/5.38 5.29/5.38 LOG: SAT solveNonLinear - Elapsed time: 0.023899s 5.29/5.38 Cost: 1; Total time: 0.023274 5.29/5.38 Failed at location 2: x^0 <= 0 5.29/5.38 Before Improving: 5.29/5.38 Quasi-invariant at l2: x^0 <= 0 5.29/5.38 Optimizing invariants... 5.29/5.38 5.29/5.38 LOG: CALL solveLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear - Elapsed time: 0.002181s 5.29/5.38 Remaining time after improvement: 0.999052 5.29/5.38 Termination implied by a set of quasi-invariant(s): 5.29/5.38 Quasi-invariant at l2: x^0 <= 0 5.29/5.38 [ Invariant Graph ] 5.29/5.38 Strengthening and disabling transitions... 5.29/5.38 5.29/5.38 LOG: CALL solverLinear in Graph for feasibility 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear in Graph for feasibility 5.29/5.38 It's unfeasible. Removing transition: 5.29/5.38 undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 [ Termination Graph ] 5.29/5.38 Strengthening and disabling transitions... 5.29/5.38 5.29/5.38 LOG: CALL solverLinear in Graph for feasibility 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear in Graph for feasibility 5.29/5.38 It's unfeasible. Removing transition: 5.29/5.38 undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 New Graphs: 5.29/5.38 Calling Safety with literal x^0 <= 0 and entry 5.29/5.38 5.29/5.38 LOG: CALL check - Post:x^0 <= 0 - Process 1 5.29/5.38 * Exit transition: 5.29/5.38 * Postcondition : x^0 <= 0 5.29/5.38 5.29/5.38 LOG: CALL solveLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear - Elapsed time: 0.000335s 5.29/5.38 > Postcondition is not implied! 5.29/5.38 5.29/5.38 LOG: RETURN check - Elapsed time: 0.000396s 5.29/5.38 INVARIANTS: 5.29/5.38 2: 5.29/5.38 Quasi-INVARIANTS to narrow Graph: 5.29/5.38 2: x^0 <= 0 , 5.29/5.38 Narrowing transition: 5.29/5.38 undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 5.29/5.38 LOG: Narrow transition size 1 5.29/5.38 invGraph after Narrowing: 5.29/5.38 Transitions: 5.29/5.38 undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 Variables: 5.29/5.38 __disjvr_0^0, x^0, y^0 5.29/5.38 Checking conditional termination of SCC {l2}... 5.29/5.38 5.29/5.38 LOG: CALL solveLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear - Elapsed time: 0.000551s 5.29/5.38 5.29/5.38 LOG: CALL solveLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear - Elapsed time: 0.001942s 5.29/5.38 Trying to remove transition: undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 Solving with 1 template(s). 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005596s 5.29/5.38 Time used: 0.005452 5.29/5.38 Solving with 1 template(s). 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008723s 5.29/5.38 Time used: 0.008189 5.29/5.38 Improving Solution with cost 1 ... 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetNextSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014227s 5.29/5.38 Time used: 0.014222 5.29/5.38 5.29/5.38 LOG: SAT solveNonLinear - Elapsed time: 0.022950s 5.29/5.38 Cost: 1; Total time: 0.022411 5.29/5.38 Failed at location 2: x^0 + y^0 <= 0 5.29/5.38 Before Improving: 5.29/5.38 Quasi-invariant at l2: x^0 + y^0 <= 0 5.29/5.38 Optimizing invariants... 5.29/5.38 5.29/5.38 LOG: CALL solveLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear - Elapsed time: 0.002265s 5.29/5.38 Remaining time after improvement: 0.998854 5.29/5.38 Termination implied by a set of quasi-invariant(s): 5.29/5.38 Quasi-invariant at l2: x^0 + y^0 <= 0 5.29/5.38 [ Invariant Graph ] 5.29/5.38 Strengthening and disabling transitions... 5.29/5.38 5.29/5.38 LOG: CALL solverLinear in Graph for feasibility 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear in Graph for feasibility 5.29/5.38 Strengthening transition (result): 5.29/5.38 undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 [ Termination Graph ] 5.29/5.38 Strengthening and disabling transitions... 5.29/5.38 5.29/5.38 LOG: CALL solverLinear in Graph for feasibility 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear in Graph for feasibility 5.29/5.38 Strengthening transition (result): 5.29/5.38 undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 Ranking function: x^0 5.29/5.38 New Graphs: 5.29/5.38 Calling Safety with literal x^0 + y^0 <= 0 and entry 5.29/5.38 5.29/5.38 LOG: CALL check - Post:x^0 + y^0 <= 0 - Process 2 5.29/5.38 * Exit transition: 5.29/5.38 * Postcondition : x^0 + y^0 <= 0 5.29/5.38 5.29/5.38 LOG: CALL solveLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear - Elapsed time: 0.000316s 5.29/5.38 > Postcondition is not implied! 5.29/5.38 5.29/5.38 LOG: RETURN check - Elapsed time: 0.000390s 5.29/5.38 INVARIANTS: 5.29/5.38 2: 5.29/5.38 Quasi-INVARIANTS to narrow Graph: 5.29/5.38 2: x^0 + y^0 <= 0 , 5.29/5.38 Narrowing transition: 5.29/5.38 undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 5.29/5.38 LOG: Narrow transition size 1 5.29/5.38 invGraph after Narrowing: 5.29/5.38 Transitions: 5.29/5.38 undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 Variables: 5.29/5.38 __disjvr_0^0, x^0, y^0 5.29/5.38 Checking conditional termination of SCC {l2}... 5.29/5.38 5.29/5.38 LOG: CALL solveLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear - Elapsed time: 0.000622s 5.29/5.38 5.29/5.38 LOG: CALL solveLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear - Elapsed time: 0.002332s 5.29/5.38 Trying to remove transition: undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 Solving with 1 template(s). 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005741s 5.29/5.38 Time used: 0.005576 5.29/5.38 Solving with 1 template(s). 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010431s 5.29/5.38 Time used: 0.009885 5.29/5.38 Improving Solution with cost 1 ... 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetNextSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015893s 5.29/5.38 Time used: 0.015887 5.29/5.38 5.29/5.38 LOG: SAT solveNonLinear - Elapsed time: 0.026324s 5.29/5.38 Cost: 1; Total time: 0.025772 5.29/5.38 Failed at location 2: 1 + y^0 <= 0 5.29/5.38 Before Improving: 5.29/5.38 Quasi-invariant at l2: 1 + y^0 <= 0 5.29/5.38 Optimizing invariants... 5.29/5.38 5.29/5.38 LOG: CALL solveLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear - Elapsed time: 0.002398s 5.29/5.38 Remaining time after improvement: 0.998813 5.29/5.38 Termination implied by a set of quasi-invariant(s): 5.29/5.38 Quasi-invariant at l2: 1 + y^0 <= 0 5.29/5.38 [ Invariant Graph ] 5.29/5.38 Strengthening and disabling transitions... 5.29/5.38 5.29/5.38 LOG: CALL solverLinear in Graph for feasibility 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear in Graph for feasibility 5.29/5.38 Strengthening transition (result): 5.29/5.38 undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 [ Termination Graph ] 5.29/5.38 Strengthening and disabling transitions... 5.29/5.38 5.29/5.38 LOG: CALL solverLinear in Graph for feasibility 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear in Graph for feasibility 5.29/5.38 Strengthening transition (result): 5.29/5.38 undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 Ranking function: x^0 5.29/5.38 New Graphs: 5.29/5.38 Calling Safety with literal 1 + y^0 <= 0 and entry 5.29/5.38 5.29/5.38 LOG: CALL check - Post:1 + y^0 <= 0 - Process 3 5.29/5.38 * Exit transition: 5.29/5.38 * Postcondition : 1 + y^0 <= 0 5.29/5.38 5.29/5.38 LOG: CALL solveLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear - Elapsed time: 0.000379s 5.29/5.38 > Postcondition is not implied! 5.29/5.38 5.29/5.38 LOG: RETURN check - Elapsed time: 0.000459s 5.29/5.38 INVARIANTS: 5.29/5.38 2: 5.29/5.38 Quasi-INVARIANTS to narrow Graph: 5.29/5.38 2: 1 + y^0 <= 0 , 5.29/5.38 Narrowing transition: 5.29/5.38 undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 5.29/5.38 LOG: Narrow transition size 1 5.29/5.38 invGraph after Narrowing: 5.29/5.38 Transitions: 5.29/5.38 undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 Variables: 5.29/5.38 __disjvr_0^0, x^0, y^0 5.29/5.38 Checking conditional termination of SCC {l2}... 5.29/5.38 5.29/5.38 LOG: CALL solveLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear - Elapsed time: 0.000694s 5.29/5.38 5.29/5.38 LOG: CALL solveLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear - Elapsed time: 0.002587s 5.29/5.38 Trying to remove transition: undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 Solving with 1 template(s). 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005771s 5.29/5.38 Time used: 0.005602 5.29/5.38 Solving with 1 template(s). 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010279s 5.29/5.38 Time used: 0.009837 5.29/5.38 Solving with 2 template(s). 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001379s 5.29/5.38 Time used: 4.00038 5.29/5.38 Solving with 3 template(s). 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003211s 5.29/5.38 Time used: 1.00012 5.29/5.38 Solving with 1 template(s). 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014545s 5.29/5.38 Time used: 0.007323 5.29/5.38 5.29/5.38 Proving non-termination of subgraph 1 5.29/5.38 Transitions: 5.29/5.38 undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 Variables: 5.29/5.38 __disjvr_0^0, x^0, y^0 5.29/5.38 5.29/5.38 Checking that every undef value has an assignment... 5.29/5.38 5.29/5.38 LOG: CALL solveLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear - Elapsed time: 0.001083s 5.29/5.38 Checking conditional non-termination of SCC {l2}... 5.29/5.38 EXIT TRANSITIONS: 5.29/5.38 5.29/5.38 5.29/5.38 5.29/5.38 5.29/5.38 Solving with 1 template(s). 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020350s 5.29/5.38 Time used: 0.020048 5.29/5.38 Improving Solution with cost 3 ... 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetNextSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.072038s 5.29/5.38 Time used: 0.072027 5.29/5.38 5.29/5.38 LOG: SAT solveNonLinear - Elapsed time: 0.092387s 5.29/5.38 Cost: 3; Total time: 0.092075 5.29/5.38 Failed at location 2: 1 <= x^0 5.29/5.38 Before Improving: 5.29/5.38 Quasi-invariant at l2: 1 <= x^0 5.29/5.38 Optimizing invariants... 5.29/5.38 5.29/5.38 LOG: CALL solveLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear - Elapsed time: 0.009975s 5.29/5.38 Remaining time after improvement: 0.998022 5.29/5.38 Minimizing number of undef constraints... 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinear - Elapsed time: 0.003520s 5.29/5.38 Number of undef constraints reduced! 5.29/5.38 5.29/5.38 Non-termination implied by a set of quasi-invariant(s): 5.29/5.38 Quasi-invariant at l2: 1 <= x^0 5.29/5.38 5.29/5.38 Strengthening and disabling EXIT transitions... 5.29/5.38 Closed exits from l2: 2 5.29/5.38 Strengthening exit transition (result): 5.29/5.38 5.29/5.38 5.29/5.38 Strengthening and disabling transitions... 5.29/5.38 5.29/5.38 LOG: CALL solverLinear in Graph for feasibility 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear in Graph for feasibility 5.29/5.38 Strengthening transition (result): 5.29/5.38 undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 5.29/5.38 Checking conditional non-termination of SCC {l2}... 5.29/5.38 EXIT TRANSITIONS: 5.29/5.38 5.29/5.38 5.29/5.38 Solving with 1 template(s). 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetFirstSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019898s 5.29/5.38 Time used: 0.019617 5.29/5.38 Improving Solution with cost 1 ... 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinearGetNextSolution 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.025047s 5.29/5.38 Time used: 0.025039 5.29/5.38 5.29/5.38 LOG: SAT solveNonLinear - Elapsed time: 0.044945s 5.29/5.38 Cost: 1; Total time: 0.044656 5.29/5.38 Failed at location 2: 0 <= y^0 5.29/5.38 Before Improving: 5.29/5.38 Quasi-invariant at l2: 0 <= y^0 5.29/5.38 Optimizing invariants... 5.29/5.38 5.29/5.38 LOG: CALL solveLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear - Elapsed time: 0.008692s 5.29/5.38 Remaining time after improvement: 0.998153 5.29/5.38 Minimizing number of undef constraints... 5.29/5.38 5.29/5.38 LOG: CALL solveNonLinear 5.29/5.38 5.29/5.38 LOG: RETURN solveNonLinear - Elapsed time: 0.003039s 5.29/5.38 Number of undef constraints reduced! 5.29/5.38 5.29/5.38 Non-termination implied by a set of quasi-invariant(s): 5.29/5.38 Quasi-invariant at l2: 0 <= y^0 5.29/5.38 5.29/5.38 Strengthening and disabling EXIT transitions... 5.29/5.38 Closed exits from l2: 1 5.29/5.38 5.29/5.38 Strengthening and disabling transitions... 5.29/5.38 5.29/5.38 LOG: CALL solverLinear in Graph for feasibility 5.29/5.38 5.29/5.38 LOG: RETURN solveLinear in Graph for feasibility 5.29/5.38 Strengthening transition (result): 5.29/5.38 undef7, x^0 -> x^0 + y^0, rest remain the same}> 5.29/5.38 5.29/5.38 Calling reachability with... 5.29/5.38 Transition: 5.29/5.38 Conditions: 1 <= x^0, 0 <= y^0, 5.29/5.38 OPEN EXITS: 5.29/5.38 (condsUp: 0 <= y^0) 5.29/5.38 5.29/5.38 --- Reachability graph --- 5.29/5.38 > Graph without transitions. 5.29/5.38 5.29/5.38 Calling reachability with... 5.29/5.38 Transition: 5.29/5.38 Conditions: 1 <= x^0, 0 <= y^0, 5.29/5.38 OPEN EXITS: 5.29/5.38 5.29/5.38 5.29/5.38 > Conditions are reachable! 5.29/5.38 5.29/5.38 Program does NOT terminate 5.29/5.38 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 5.29/5.38 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 5.29/5.38 EOF