9.32/9.37 NO 9.32/9.37 9.32/9.38 Solver Timeout: 4 9.32/9.38 Global Timeout: 300 9.32/9.38 No parsing errors! 9.32/9.38 Init Location: 0 9.32/9.38 Transitions: 9.32/9.38 9.32/9.38 ~(1)) /\ (arg2 > 1) /\ (undef1 > ~(1)) /\ (undef4 > undef2) /\ (undef4 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}> 9.32/9.38 ~(1)) /\ (arg2 > 1) /\ (undef6 < 1) /\ (undef5 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef5, arg2 -> undef6}> 9.32/9.38 0), par{arg2 -> 0}> 9.32/9.38 1}> 9.32/9.38 0) /\ (undef15 < arg2) /\ (undef15 > 0) /\ (arg1 >= undef16)> 9.32/9.38 0) /\ (undef20 < arg2) /\ (arg1 >= undef17) /\ (undef20 > 0) /\ ((arg1 - (2 * undef19)) >= 0) /\ ((arg1 - (2 * undef19)) < 2) /\ ((arg1 - (2 * undef17)) < 2) /\ ((arg1 - (2 * undef17)) >= 0), par{arg1 -> undef17, arg2 -> 0}> 9.32/9.38 0) /\ (undef24 < arg2) /\ (undef24 > 0) /\ (arg1 >= undef25)> 9.32/9.38 0) /\ (undef29 < arg2) /\ (arg1 >= undef26) /\ (undef29 > 0) /\ ((arg1 - (2 * undef28)) >= 0) /\ ((arg1 - (2 * undef28)) < 2) /\ ((arg1 - (2 * undef26)) < 2) /\ ((arg1 - (2 * undef26)) >= 0), par{arg1 -> undef26, arg2 -> 1}> 9.32/9.38 0) /\ (undef33 < arg2) /\ (arg1 >= undef34)> 9.32/9.38 0) /\ (arg1 >= undef35) /\ (undef38 < arg2) /\ ((arg1 - (2 * undef37)) >= 0) /\ ((arg1 - (2 * undef37)) < 2) /\ ((arg1 - (2 * undef35)) < 2) /\ ((arg1 - (2 * undef35)) >= 0), par{arg1 -> undef35, arg2 -> 1}> 9.32/9.38 0) /\ (undef42 < arg2) /\ (arg1 >= undef43)> 9.32/9.38 0) /\ (arg1 >= undef44) /\ (undef47 < arg2) /\ ((arg1 - (2 * undef46)) >= 0) /\ ((arg1 - (2 * undef46)) < 2) /\ ((arg1 - (2 * undef44)) < 2) /\ ((arg1 - (2 * undef44)) >= 0), par{arg1 -> undef44, arg2 -> 1}> 9.32/9.38 ~(1)) /\ (arg2 > 1) /\ (undef51 > ~(1)) /\ (arg1 > 0), par{arg1 -> (undef51 - 1), arg2 -> undef49}> 9.32/9.38 0), par{arg1 -> (arg1 - 1), arg2 -> undef53}> 9.32/9.38 undef54, arg2 -> undef55}> 9.32/9.38 9.32/9.38 Fresh variables: 9.32/9.38 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef14, undef15, undef16, undef17, undef19, undef20, undef23, undef24, undef25, undef26, undef28, undef29, undef32, undef33, undef34, undef35, undef37, undef38, undef41, undef42, undef43, undef44, undef46, undef47, undef49, undef50, undef51, undef53, undef54, undef55, 9.32/9.38 9.32/9.38 Undef variables: 9.32/9.38 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef14, undef15, undef16, undef17, undef19, undef20, undef23, undef24, undef25, undef26, undef28, undef29, undef32, undef33, undef34, undef35, undef37, undef38, undef41, undef42, undef43, undef44, undef46, undef47, undef49, undef50, undef51, undef53, undef54, undef55, 9.32/9.38 9.32/9.38 Abstraction variables: 9.32/9.38 9.32/9.38 Exit nodes: 9.32/9.38 9.32/9.38 Accepting locations: 9.32/9.38 9.32/9.38 Asserts: 9.32/9.38 9.32/9.38 Preprocessed LLVMGraph 9.32/9.38 Init Location: 0 9.32/9.38 Transitions: 9.32/9.38 ~(1)) /\ (undef55 > 1) /\ (undef1 > ~(1)) /\ (undef4 > undef2) /\ (undef4 > ~(1)) /\ (undef54 > 0) /\ (undef2 > 0), par{arg1 -> undef1, arg2 -> 0}> 9.32/9.38 ~(1)) /\ (undef55 > 1) /\ (undef1 > ~(1)) /\ (undef4 > undef2) /\ (undef4 > ~(1)) /\ (undef54 > 0), par{arg1 -> undef1, arg2 -> 1}> 9.32/9.38 ~(1)) /\ (undef55 > 1) /\ (undef6 < 1) /\ (undef5 > ~(1)) /\ (undef54 > 0), par{arg1 -> undef5, arg2 -> 1}> 9.32/9.38 ~(1)) /\ (undef55 > 1) /\ (undef51 > ~(1)) /\ (undef54 > 0), par{arg1 -> (undef51 - 1), arg2 -> undef49}> 9.32/9.38 0) /\ (undef15 < arg2) /\ (undef15 > 0) /\ (arg1 >= undef16) /\ ((arg1 - (2 * undef19)) = 0) /\ (arg2 > 0) /\ (undef20 < arg2) /\ (arg1 >= undef17) /\ (undef20 > 0) /\ ((arg1 - (2 * undef19)) >= 0) /\ ((arg1 - (2 * undef19)) < 2) /\ ((arg1 - (2 * undef17)) < 2) /\ ((arg1 - (2 * undef17)) >= 0), par{arg1 -> undef17, arg2 -> 0}> 9.32/9.38 0) /\ (undef15 < arg2) /\ (undef15 > 0) /\ (arg1 >= undef16) /\ ((arg1 - (2 * undef46)) = 0) /\ (arg2 > 0) /\ (arg1 >= undef44) /\ (undef47 < arg2) /\ ((arg1 - (2 * undef46)) >= 0) /\ ((arg1 - (2 * undef46)) < 2) /\ ((arg1 - (2 * undef44)) < 2) /\ ((arg1 - (2 * undef44)) >= 0), par{arg1 -> undef44, arg2 -> 1}> 9.32/9.38 0) /\ (undef24 < arg2) /\ (undef24 > 0) /\ (arg1 >= undef25) /\ ((arg1 - (2 * undef28)) = 1) /\ (arg2 > 0) /\ (undef29 < arg2) /\ (arg1 >= undef26) /\ (undef29 > 0) /\ ((arg1 - (2 * undef28)) >= 0) /\ ((arg1 - (2 * undef28)) < 2) /\ ((arg1 - (2 * undef26)) < 2) /\ ((arg1 - (2 * undef26)) >= 0), par{arg1 -> undef26, arg2 -> 1}> 9.32/9.38 0) /\ (undef24 < arg2) /\ (undef24 > 0) /\ (arg1 >= undef25) /\ ((arg1 - (2 * undef37)) = 1) /\ (arg2 > 0) /\ (arg1 >= undef35) /\ (undef38 < arg2) /\ ((arg1 - (2 * undef37)) >= 0) /\ ((arg1 - (2 * undef37)) < 2) /\ ((arg1 - (2 * undef35)) < 2) /\ ((arg1 - (2 * undef35)) >= 0), par{arg1 -> undef35, arg2 -> 1}> 9.32/9.38 0) /\ (undef33 < arg2) /\ (arg1 >= undef34) /\ ((arg1 - (2 * undef28)) = 1) /\ (arg2 > 0) /\ (undef29 < arg2) /\ (arg1 >= undef26) /\ (undef29 > 0) /\ ((arg1 - (2 * undef28)) >= 0) /\ ((arg1 - (2 * undef28)) < 2) /\ ((arg1 - (2 * undef26)) < 2) /\ ((arg1 - (2 * undef26)) >= 0), par{arg1 -> undef26, arg2 -> 1}> 9.32/9.38 0) /\ (undef33 < arg2) /\ (arg1 >= undef34) /\ ((arg1 - (2 * undef37)) = 1) /\ (arg2 > 0) /\ (arg1 >= undef35) /\ (undef38 < arg2) /\ ((arg1 - (2 * undef37)) >= 0) /\ ((arg1 - (2 * undef37)) < 2) /\ ((arg1 - (2 * undef35)) < 2) /\ ((arg1 - (2 * undef35)) >= 0), par{arg1 -> undef35, arg2 -> 1}> 9.32/9.38 0) /\ (undef42 < arg2) /\ (arg1 >= undef43) /\ ((arg1 - (2 * undef19)) = 0) /\ (arg2 > 0) /\ (undef20 < arg2) /\ (arg1 >= undef17) /\ (undef20 > 0) /\ ((arg1 - (2 * undef19)) >= 0) /\ ((arg1 - (2 * undef19)) < 2) /\ ((arg1 - (2 * undef17)) < 2) /\ ((arg1 - (2 * undef17)) >= 0), par{arg1 -> undef17, arg2 -> 0}> 9.32/9.38 0) /\ (undef42 < arg2) /\ (arg1 >= undef43) /\ ((arg1 - (2 * undef46)) = 0) /\ (arg2 > 0) /\ (arg1 >= undef44) /\ (undef47 < arg2) /\ ((arg1 - (2 * undef46)) >= 0) /\ ((arg1 - (2 * undef46)) < 2) /\ ((arg1 - (2 * undef44)) < 2) /\ ((arg1 - (2 * undef44)) >= 0), par{arg1 -> undef44, arg2 -> 1}> 9.32/9.38 0), par{arg1 -> (arg1 - 1), arg2 -> undef53}> 9.32/9.38 9.32/9.38 Fresh variables: 9.32/9.38 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef14, undef15, undef16, undef17, undef19, undef20, undef23, undef24, undef25, undef26, undef28, undef29, undef32, undef33, undef34, undef35, undef37, undef38, undef41, undef42, undef43, undef44, undef46, undef47, undef49, undef50, undef51, undef53, undef54, undef55, 9.32/9.38 9.32/9.38 Undef variables: 9.32/9.38 undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef14, undef15, undef16, undef17, undef19, undef20, undef23, undef24, undef25, undef26, undef28, undef29, undef32, undef33, undef34, undef35, undef37, undef38, undef41, undef42, undef43, undef44, undef46, undef47, undef49, undef50, undef51, undef53, undef54, undef55, 9.32/9.38 9.32/9.38 Abstraction variables: 9.32/9.38 9.32/9.38 Exit nodes: 9.32/9.38 9.32/9.38 Accepting locations: 9.32/9.38 9.32/9.38 Asserts: 9.32/9.38 9.32/9.38 ************************************************************* 9.32/9.38 ******************************************************************************************* 9.32/9.38 *********************** WORKING TRANSITION SYSTEM (DAG) *********************** 9.32/9.38 ******************************************************************************************* 9.32/9.38 9.32/9.38 Init Location: 0 9.32/9.38 Graph 0: 9.32/9.38 Transitions: 9.32/9.38 Variables: 9.32/9.38 9.32/9.38 Graph 1: 9.32/9.38 Transitions: 9.32/9.38 -1 + arg1, arg2 -> undef53, rest remain the same}> 9.32/9.38 Variables: 9.32/9.38 arg1, arg2 9.32/9.38 9.32/9.38 Graph 2: 9.32/9.38 Transitions: 9.32/9.38 undef17, arg2 -> 0, rest remain the same}> 9.32/9.38 undef44, arg2 -> 1, rest remain the same}> 9.32/9.38 undef26, arg2 -> 1, rest remain the same}> 9.32/9.38 undef35, arg2 -> 1, rest remain the same}> 9.32/9.38 undef26, arg2 -> 1, rest remain the same}> 9.32/9.38 undef35, arg2 -> 1, rest remain the same}> 9.32/9.38 undef17, arg2 -> 0, rest remain the same}> 9.32/9.38 undef44, arg2 -> 1, rest remain the same}> 9.32/9.38 Variables: 9.32/9.38 arg1, arg2 9.32/9.38 9.32/9.38 Precedence: 9.32/9.38 Graph 0 9.32/9.38 9.32/9.38 Graph 1 9.32/9.38 -1 + undef51, arg2 -> undef49, rest remain the same}> 9.32/9.38 9.32/9.38 Graph 2 9.32/9.38 undef1, arg2 -> 0, rest remain the same}> 9.32/9.38 undef1, arg2 -> 1, rest remain the same}> 9.32/9.38 undef5, arg2 -> 1, rest remain the same}> 9.32/9.38 9.32/9.38 Map Locations to Subgraph: 9.32/9.38 ( 0 , 0 ) 9.32/9.38 ( 3 , 2 ) 9.32/9.38 ( 5 , 1 ) 9.32/9.38 9.32/9.38 ******************************************************************************************* 9.32/9.38 ******************************** CHECKING ASSERTIONS ******************************** 9.32/9.38 ******************************************************************************************* 9.32/9.38 9.32/9.38 Proving termination of subgraph 0 9.32/9.38 Proving termination of subgraph 1 9.32/9.38 Checking unfeasibility... 9.32/9.38 Time used: 0.002231 9.32/9.38 9.32/9.38 Checking conditional termination of SCC {l5}... 9.32/9.38 9.32/9.38 LOG: CALL solveLinear 9.32/9.38 9.32/9.38 LOG: RETURN solveLinear - Elapsed time: 0.000665s 9.32/9.38 Ranking function: -1 + arg1 9.32/9.38 New Graphs: 9.32/9.38 Proving termination of subgraph 2 9.32/9.38 Checking unfeasibility... 9.32/9.38 Time used: 0.030539 9.32/9.38 Some transition disabled by a set of invariant(s): 9.32/9.38 Invariant at l3: arg2 <= 1 9.32/9.38 9.32/9.38 Strengthening and disabling transitions... 9.32/9.38 > It's unfeasible. Removing transition: 9.32/9.38 undef44, arg2 -> 1, rest remain the same}> 9.32/9.38 9.32/9.38 LOG: CALL solverLinear in Graph for feasibility 9.32/9.38 9.32/9.38 LOG: RETURN solveLinear in Graph for feasibility 9.32/9.38 It's unfeasible. Removing transition: 9.32/9.38 undef17, arg2 -> 0, rest remain the same}> 9.32/9.38 9.32/9.38 LOG: CALL solverLinear in Graph for feasibility 9.32/9.38 9.32/9.38 LOG: RETURN solveLinear in Graph for feasibility 9.32/9.38 It's unfeasible. Removing transition: 9.32/9.38 undef26, arg2 -> 1, rest remain the same}> 9.32/9.38 9.32/9.38 LOG: CALL solverLinear in Graph for feasibility 9.32/9.38 9.32/9.38 LOG: RETURN solveLinear in Graph for feasibility 9.32/9.38 It's unfeasible. Removing transition: 9.32/9.38 undef35, arg2 -> 1, rest remain the same}> 9.32/9.38 9.32/9.38 LOG: CALL solverLinear in Graph for feasibility 9.32/9.38 9.32/9.38 LOG: RETURN solveLinear in Graph for feasibility 9.32/9.38 It's unfeasible. Removing transition: 9.32/9.38 undef26, arg2 -> 1, rest remain the same}> 9.32/9.38 9.32/9.38 LOG: CALL solverLinear in Graph for feasibility 9.32/9.38 9.32/9.38 LOG: RETURN solveLinear in Graph for feasibility 9.32/9.38 Strengthening transition (result): 9.32/9.38 undef35, arg2 -> 1, rest remain the same}> 9.32/9.38 9.32/9.38 LOG: CALL solverLinear in Graph for feasibility 9.32/9.38 9.32/9.38 LOG: RETURN solveLinear in Graph for feasibility 9.32/9.38 It's unfeasible. Removing transition: 9.32/9.38 undef17, arg2 -> 0, rest remain the same}> 9.32/9.38 9.32/9.38 LOG: CALL solverLinear in Graph for feasibility 9.32/9.38 9.32/9.38 LOG: RETURN solveLinear in Graph for feasibility 9.32/9.38 Strengthening transition (result): 9.32/9.38 undef44, arg2 -> 1, rest remain the same}> 9.32/9.38 Checking unfeasibility... 9.32/9.38 Time used: 0.005467 9.32/9.38 9.32/9.38 Checking conditional termination of SCC {l3}... 9.32/9.38 9.32/9.38 LOG: CALL solveLinear 9.32/9.38 9.32/9.38 LOG: RETURN solveLinear - Elapsed time: 0.002294s 9.32/9.38 9.32/9.38 LOG: CALL solveLinear 9.32/9.38 9.32/9.38 LOG: RETURN solveLinear - Elapsed time: 0.009739s 9.32/9.38 Trying to remove transition: undef44, arg2 -> 1, rest remain the same}> 9.32/9.38 Solving with 1 template(s). 9.32/9.38 9.32/9.38 LOG: CALL solveNonLinearGetFirstSolution 9.32/9.38 9.32/9.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009295s 9.32/9.38 Time used: 0.008667 9.32/9.38 Trying to remove transition: undef35, arg2 -> 1, rest remain the same}> 9.32/9.38 Solving with 1 template(s). 9.32/9.38 9.32/9.38 LOG: CALL solveNonLinearGetFirstSolution 9.32/9.38 9.32/9.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009421s 9.32/9.38 Time used: 0.008763 9.32/9.38 Solving with 1 template(s). 9.32/9.38 9.32/9.38 LOG: CALL solveNonLinearGetFirstSolution 9.32/9.38 9.32/9.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020770s 9.32/9.38 Time used: 0.019825 9.32/9.38 Improving Solution with cost 2 ... 9.32/9.38 9.32/9.38 LOG: CALL solveNonLinearGetNextSolution 9.32/9.38 9.32/9.38 LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.047244s 9.32/9.38 Time used: 0.047237 9.32/9.38 9.32/9.38 LOG: SAT solveNonLinear - Elapsed time: 0.068014s 9.32/9.38 Cost: 2; Total time: 0.067062 9.32/9.38 Failed at location 3: arg2 <= 0 9.32/9.38 Failed at location 3: arg2 <= 0 9.32/9.38 Before Improving: 9.32/9.38 Quasi-invariant at l3: arg2 <= 0 9.32/9.38 Optimizing invariants... 9.32/9.38 9.32/9.38 LOG: CALL solveLinear 9.32/9.38 9.32/9.38 LOG: RETURN solveLinear - Elapsed time: 0.008987s 9.32/9.38 Remaining time after improvement: 0.994969 9.32/9.38 Termination implied by a set of quasi-invariant(s): 9.32/9.38 Quasi-invariant at l3: arg2 <= 0 9.32/9.38 [ Invariant Graph ] 9.32/9.38 Strengthening and disabling transitions... 9.32/9.38 9.32/9.38 LOG: CALL solverLinear in Graph for feasibility 9.32/9.38 9.32/9.38 LOG: RETURN solveLinear in Graph for feasibility 9.32/9.38 It's unfeasible. Removing transition: 9.32/9.38 undef35, arg2 -> 1, rest remain the same}> 9.32/9.38 9.32/9.38 LOG: CALL solverLinear in Graph for feasibility 9.32/9.38 9.32/9.38 LOG: RETURN solveLinear in Graph for feasibility 9.32/9.38 It's unfeasible. Removing transition: 9.32/9.38 undef44, arg2 -> 1, rest remain the same}> 9.32/9.38 [ Termination Graph ] 9.32/9.38 Strengthening and disabling transitions... 9.32/9.38 > It's unfeasible. Removing transition: 9.32/9.38 undef44, arg2 -> 1, rest remain the same}> 9.32/9.38 9.32/9.38 LOG: CALL solverLinear in Graph for feasibility 9.32/9.38 9.32/9.38 LOG: RETURN solveLinear in Graph for feasibility 9.32/9.38 It's unfeasible. Removing transition: 9.32/9.38 undef35, arg2 -> 1, rest remain the same}> 9.32/9.38 New Graphs: 9.32/9.38 Calling Safety with literal arg2 <= 0 and entry undef1, arg2 -> 1, rest remain the same}> 9.32/9.38 9.32/9.38 LOG: CALL check - Post:arg2 <= 0 - Process 1 9.32/9.38 * Exit transition: undef1, arg2 -> 1, rest remain the same}> 9.32/9.38 * Postcondition : arg2 <= 0 9.32/9.38 9.32/9.38 LOG: CALL solveLinear 9.32/9.38 9.32/9.38 LOG: RETURN solveLinear - Elapsed time: 0.000903s 9.32/9.38 > Postcondition is not implied! 9.32/9.38 9.32/9.38 LOG: RETURN check - Elapsed time: 0.001027s 9.32/9.38 Calling Safety with literal arg2 <= 0 and entry undef5, arg2 -> 1, rest remain the same}> 9.32/9.38 9.32/9.38 LOG: CALL check - Post:arg2 <= 0 - Process 2 9.32/9.38 * Exit transition: undef5, arg2 -> 1, rest remain the same}> 9.32/9.38 * Postcondition : arg2 <= 0 9.32/9.38 9.32/9.38 LOG: CALL solveLinear 9.32/9.38 9.32/9.38 LOG: RETURN solveLinear - Elapsed time: 0.000765s 9.32/9.38 > Postcondition is not implied! 9.32/9.38 9.32/9.38 LOG: RETURN check - Elapsed time: 0.000871s 9.32/9.38 INVARIANTS: 9.32/9.38 3: 9.32/9.38 Quasi-INVARIANTS to narrow Graph: 9.32/9.38 3: arg2 <= 0 , 9.32/9.38 Narrowing transition: 9.32/9.38 undef35, arg2 -> 1, rest remain the same}> 9.32/9.38 9.32/9.38 LOG: Narrow transition size 1 9.32/9.38 Narrowing transition: 9.32/9.38 undef44, arg2 -> 1, rest remain the same}> 9.32/9.38 9.32/9.38 LOG: Narrow transition size 1 9.32/9.38 invGraph after Narrowing: 9.32/9.38 Transitions: 9.32/9.38 undef35, arg2 -> 1, rest remain the same}> 9.32/9.38 undef44, arg2 -> 1, rest remain the same}> 9.32/9.38 Variables: 9.32/9.38 arg1, arg2 9.32/9.38 Checking conditional termination of SCC {l3}... 9.32/9.38 9.32/9.38 LOG: CALL solveLinear 9.32/9.38 9.32/9.38 LOG: RETURN solveLinear - Elapsed time: 0.002074s 9.32/9.38 9.32/9.38 LOG: CALL solveLinear 9.32/9.38 9.32/9.38 LOG: RETURN solveLinear - Elapsed time: 0.009768s 9.32/9.38 Trying to remove transition: undef44, arg2 -> 1, rest remain the same}> 9.32/9.38 Solving with 1 template(s). 9.32/9.38 9.32/9.38 LOG: CALL solveNonLinearGetFirstSolution 9.32/9.38 9.32/9.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009382s 9.32/9.38 Time used: 0.008719 9.32/9.38 Trying to remove transition: undef35, arg2 -> 1, rest remain the same}> 9.32/9.38 Solving with 1 template(s). 9.32/9.38 9.32/9.38 LOG: CALL solveNonLinearGetFirstSolution 9.32/9.38 9.32/9.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009392s 9.32/9.38 Time used: 0.008705 9.32/9.38 Solving with 1 template(s). 9.32/9.38 9.32/9.38 LOG: CALL solveNonLinearGetFirstSolution 9.32/9.38 9.32/9.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003670s 9.32/9.38 Time used: 4.00236 9.32/9.38 Solving with 2 template(s). 9.32/9.38 9.32/9.38 LOG: CALL solveNonLinearGetFirstSolution 9.32/9.38 9.32/9.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010438s 9.32/9.38 Time used: 4.00118 9.32/9.38 Solving with 3 template(s). 9.32/9.38 9.32/9.38 LOG: CALL solveNonLinearGetFirstSolution 9.32/9.38 9.32/9.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.008868s 9.32/9.38 Time used: 1.00158 9.32/9.38 Solving with 1 template(s). 9.32/9.38 9.32/9.38 LOG: CALL solveNonLinearGetFirstSolution 9.32/9.38 9.32/9.38 LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025556s 9.32/9.38 Time used: 0.016832 9.32/9.38 9.32/9.38 Proving non-termination of subgraph 2 9.32/9.38 Transitions: 9.32/9.38 undef35, arg2 -> 1, rest remain the same}> 9.32/9.38 undef44, arg2 -> 1, rest remain the same}> 9.32/9.38 Variables: 9.32/9.38 arg1, arg2 9.32/9.38 9.32/9.38 Checking that every undef value has an assignment... 9.32/9.38 9.32/9.38 LOG: CALL solveLinear 9.32/9.38 9.32/9.38 LOG: RETURN solveLinear - Elapsed time: 0.002086s 9.32/9.38 Checking conditional non-termination of SCC {l3}... 9.32/9.38 > No assignment for some undef value. 9.32/9.38 > Checking if the negation of the conditions of every pending exit is quasi-invariant... YES 9.32/9.38 Calling reachability with... 9.32/9.38 Transition: 9.32/9.38 Conditions: 1 <= arg2, 9.32/9.38 Transition: 9.32/9.38 Conditions: 1 <= arg2, 9.32/9.38 Transition: 9.32/9.38 Conditions: 1 <= arg2, 9.32/9.38 OPEN EXITS: 9.32/9.38 9.32/9.38 9.32/9.38 9.32/9.38 9.32/9.38 --- Reachability graph --- 9.32/9.38 > Graph without transitions. 9.32/9.38 9.32/9.38 Calling reachability with... 9.32/9.38 Transition: undef1, arg2 -> 0, rest remain the same}> 9.32/9.38 Conditions: 1 <= arg2, 9.32/9.38 Transition: undef1, arg2 -> 1, rest remain the same}> 9.32/9.38 Conditions: 1 <= arg2, 9.32/9.38 Transition: undef5, arg2 -> 1, rest remain the same}> 9.32/9.38 Conditions: 1 <= arg2, 9.32/9.38 Transition: undef1, arg2 -> 0, rest remain the same}> 9.32/9.38 Conditions: 1 <= arg2, 9.32/9.38 Transition: undef1, arg2 -> 1, rest remain the same}> 9.32/9.38 Conditions: 1 <= arg2, 9.32/9.38 Transition: undef5, arg2 -> 1, rest remain the same}> 9.32/9.38 Conditions: 1 <= arg2, 9.32/9.38 Transition: undef1, arg2 -> 0, rest remain the same}> 9.32/9.38 Conditions: 1 <= arg2, 9.32/9.38 Transition: undef1, arg2 -> 1, rest remain the same}> 9.32/9.38 Conditions: 1 <= arg2, 9.32/9.38 Transition: undef5, arg2 -> 1, rest remain the same}> 9.32/9.38 Conditions: 1 <= arg2, 9.32/9.38 OPEN EXITS: 9.32/9.38 undef1, arg2 -> 1, rest remain the same}> 9.32/9.38 undef5, arg2 -> 1, rest remain the same}> 9.32/9.38 undef1, arg2 -> 1, rest remain the same}> 9.32/9.38 undef5, arg2 -> 1, rest remain the same}> 9.32/9.38 undef1, arg2 -> 1, rest remain the same}> 9.32/9.38 undef5, arg2 -> 1, rest remain the same}> 9.32/9.38 9.32/9.38 > Conditions are reachable! 9.32/9.38 9.32/9.38 Program does NOT terminate 9.32/9.38 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 26: delete: command not found 9.32/9.38 /export/starexec/sandbox/solver/bin/starexec_run_termcomp2019_ITS: line 27: edit: command not found 9.32/9.38 EOF