NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg2 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (arg1 > 0)> ~(1)) /\ (arg2 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (arg1 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0), par{arg1 -> (0 - undef8), arg2 -> undef7}> ~(1)) /\ (arg2 > 1) /\ ((undef14 - (2 * undef15)) = 1) /\ (undef14 > ~(1)) /\ (arg1 > 0)> ~(1)) /\ (arg2 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (arg1 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0), par{arg1 -> undef16, arg2 -> undef17}> 0, arg2 -> undef21}> 0) /\ (arg1 < 6), par{arg1 -> (arg1 - 1), arg2 -> undef23}> ~(6)), par{arg2 -> undef25}> ~(1)), par{arg2 -> undef27}> (arg1 + 1), arg2 -> undef29}> undef30, arg2 -> undef31}> Fresh variables: undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef29, undef30, undef31, Undef variables: undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef29, undef30, undef31, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef31 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (undef30 > 0) /\ (undef8 > ~(1)) /\ (undef31 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (undef30 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0) /\ ((0 - undef8) < 1) /\ ((0 - undef8) < 6) /\ ((0 - undef8) > ~(6)), par{arg1 -> (0 - undef8)}> ~(1)) /\ (undef31 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (undef30 > 0) /\ (undef16 > ~(1)) /\ (undef31 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (undef30 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0) /\ (0 = undef16), par{arg1 -> 0}> ~(1)) /\ (undef31 > 1) /\ ((undef4 - (2 * undef5)) = 0) /\ (undef4 > ~(1)) /\ (undef30 > 0) /\ (undef16 > ~(1)) /\ (undef31 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (undef30 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0) /\ (undef16 > 0) /\ (undef16 < 6), par{arg1 -> (undef16 - 1)}> ~(1)) /\ (undef31 > 1) /\ ((undef14 - (2 * undef15)) = 1) /\ (undef14 > ~(1)) /\ (undef30 > 0) /\ (undef8 > ~(1)) /\ (undef31 > 1) /\ ((undef9 - (2 * undef10)) = 0) /\ (undef9 > ~(1)) /\ (undef30 > 0) /\ ((undef9 - (2 * undef10)) < 2) /\ ((undef9 - (2 * undef10)) >= 0) /\ ((0 - undef8) < 1) /\ ((0 - undef8) < 6) /\ ((0 - undef8) > ~(6)), par{arg1 -> (0 - undef8)}> ~(1)) /\ (undef31 > 1) /\ ((undef14 - (2 * undef15)) = 1) /\ (undef14 > ~(1)) /\ (undef30 > 0) /\ (undef16 > ~(1)) /\ (undef31 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (undef30 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0) /\ (0 = undef16), par{arg1 -> 0}> ~(1)) /\ (undef31 > 1) /\ ((undef14 - (2 * undef15)) = 1) /\ (undef14 > ~(1)) /\ (undef30 > 0) /\ (undef16 > ~(1)) /\ (undef31 > 1) /\ ((undef18 - (2 * undef19)) = 1) /\ (undef18 > ~(1)) /\ (undef30 > 0) /\ ((undef18 - (2 * undef19)) < 2) /\ ((undef18 - (2 * undef19)) >= 0) /\ (undef16 > 0) /\ (undef16 < 6), par{arg1 -> (undef16 - 1)}> ~(1)) /\ (0 = arg1), par{arg1 -> 0}> ~(1)) /\ (arg1 > 0) /\ (arg1 < 6), par{arg1 -> (arg1 - 1)}> ~(6)), par{arg1 -> (arg1 + 1)}> Fresh variables: undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef29, undef30, undef31, Undef variables: undef3, undef4, undef5, undef7, undef8, undef9, undef10, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef21, undef23, undef25, undef27, undef29, undef30, undef31, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 0, rest remain the same}> -1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> Variables: arg1 Precedence: Graph 0 Graph 1 -undef8, rest remain the same}> 0, rest remain the same}> -1 + undef16, rest remain the same}> -undef8, rest remain the same}> 0, rest remain the same}> -1 + undef16, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 5 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.007466 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001091s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014429s Trying to remove transition: 1 + arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007858s Time used: 0.007622 LOG: SAT solveNonLinear - Elapsed time: 0.007858s Cost: 0; Total time: 0.007622 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l5: arg1 <= 0 Ranking function: -arg1 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: 0, rest remain the same}> -1 + arg1, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000881s Ranking function: -1 + arg1 New Graphs: Transitions: 0, rest remain the same}> Variables: arg1 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000349s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000881s Trying to remove transition: 0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.002449s Time used: 0.002333 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.064850s Time used: 0.064614 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.746068s Time used: 0.745369 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004939s Time used: 1.00066 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015294s Time used: 0.008277 Termination failed. Trying to show unreachability... Proving unreachability of entry: -undef8, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: -undef8, rest remain the same}> * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001240s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001391s Cannot prove unreachability Proving non-termination of subgraph 1 Transitions: 0, rest remain the same}> -1 + arg1, rest remain the same}> 1 + arg1, rest remain the same}> Variables: arg1 Checking conditional non-termination of SCC {l5}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011481s Time used: 0.011183 Improving Solution with cost 3 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021332s Time used: 0.021326 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018126s Time used: 0.01812 LOG: SAT solveNonLinear - Elapsed time: 0.050939s Cost: 1; Total time: 0.050629 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l5: arg1 <= 5 Strengthening and disabling EXIT transitions... Closed exits from l5: 1 Strengthening exit transition (result): Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, rest remain the same}> Checking conditional non-termination of SCC {l5}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009671s Time used: 0.009373 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017275s Time used: 0.017269 LOG: SAT solveNonLinear - Elapsed time: 0.026947s Cost: 0; Total time: 0.026642 Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l5: 0 <= 5 + arg1 Strengthening and disabling EXIT transitions... Closed exits from l5: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg1, rest remain the same}> Calling reachability with... Transition: Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: Conditions: arg1 <= 5, 0 <= 5 + arg1, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: -undef8, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: 0, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -1 + undef16, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -undef8, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: 0, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -1 + undef16, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -undef8, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: 0, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -1 + undef16, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -undef8, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: 0, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -1 + undef16, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -undef8, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: 0, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -1 + undef16, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -undef8, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: 0, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -1 + undef16, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -undef8, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: 0, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -1 + undef16, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -undef8, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: 0, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -1 + undef16, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -undef8, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: 0, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -1 + undef16, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -undef8, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: 0, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -1 + undef16, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -undef8, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: 0, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -1 + undef16, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -undef8, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: 0, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, Transition: -1 + undef16, rest remain the same}> Conditions: arg1 <= 5, 0 <= 5 + arg1, OPEN EXITS: -undef8, rest remain the same}> 0, rest remain the same}> -1 + undef16, rest remain the same}> -undef8, rest remain the same}> 0, rest remain the same}> -1 + undef16, rest remain the same}> -undef8, rest remain the same}> 0, rest remain the same}> -1 + undef16, rest remain the same}> -undef8, rest remain the same}> 0, rest remain the same}> -1 + undef16, rest remain the same}> -undef8, rest remain the same}> 0, rest remain the same}> -1 + undef16, rest remain the same}> -undef8, rest remain the same}> 0, rest remain the same}> -1 + undef16, rest remain the same}> -undef8, rest remain the same}> 0, rest remain the same}> -1 + undef16, rest remain the same}> -undef8, rest remain the same}> 0, rest remain the same}> -1 + undef16, rest remain the same}> -undef8, rest remain the same}> 0, rest remain the same}> -1 + undef16, rest remain the same}> -undef8, rest remain the same}> 0, rest remain the same}> -1 + undef16, rest remain the same}> -undef8, rest remain the same}> 0, rest remain the same}> -1 + undef16, rest remain the same}> -undef8, rest remain the same}> 0, rest remain the same}> -1 + undef16, rest remain the same}> > Conditions are reachable! Program does NOT terminate