YES Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (undef6 <= (200 * arg2)) /\ (arg1 > 0), par{arg3 -> undef3, arg4 -> undef4, arg5 -> undef5}> ~(1)) /\ (undef8 <= (200 * arg2)) /\ (arg1 > 0) /\ (((200 * arg2) - (13 * undef8)) < 13) /\ (((200 * arg2) - (13 * undef8)) >= 0), par{arg1 -> (100 * arg2), arg2 -> undef8, arg3 -> ((100 * arg2) + undef8), arg4 -> arg2, arg5 -> 0}> 0) /\ (arg4 > ~(1)) /\ ((arg2 - 1) < arg2) /\ (arg5 >= arg4), par{arg2 -> (arg2 - 1), arg3 -> (arg1 + (arg2 - 1))}> 1) /\ ((arg5 + 1) < arg4) /\ (arg3 > 0) /\ (arg5 > ~(1)) /\ (undef22 > ~(1)) /\ (undef23 > ~(1)) /\ ((undef22 * undef23) <= 9) /\ ((arg5 + 2) <= arg4) /\ ((arg2 - 1) < arg2), par{arg2 -> (arg2 - 1), arg3 -> (arg1 + (arg2 - 1)), arg5 -> (arg5 + 2)}> 1) /\ ((arg5 + 1) < arg4) /\ (arg3 > 0) /\ (arg5 > ~(1)) /\ (undef29 > ~(1)) /\ (undef30 > ~(1)) /\ ((undef29 * undef30) > 9) /\ ((arg5 + 2) <= arg4) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg3 -> ((arg1 - 1) + arg2), arg5 -> (arg5 + 2)}> undef31, arg2 -> undef32, arg3 -> undef33, arg4 -> undef34, arg5 -> undef35}> Fresh variables: undef3, undef4, undef5, undef6, undef8, undef22, undef23, undef29, undef30, undef31, undef32, undef33, undef34, undef35, Undef variables: undef3, undef4, undef5, undef6, undef8, undef22, undef23, undef29, undef30, undef31, undef32, undef33, undef34, undef35, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef6 <= (200 * undef32)) /\ (undef31 > 0) /\ (undef32 > ~(1)) /\ (undef8 <= (200 * undef32)) /\ (undef31 > 0) /\ (((200 * undef32) - (13 * undef8)) < 13) /\ (((200 * undef32) - (13 * undef8)) >= 0)> 0) /\ (arg4 > ~(1)) /\ ((arg2 - 1) < arg2) /\ (arg5 >= arg4), par{arg2 -> (arg2 - 1), arg3 -> (arg1 + (arg2 - 1))}> 1) /\ ((arg5 + 1) < arg4) /\ (arg3 > 0) /\ (arg5 > ~(1)) /\ (undef22 > ~(1)) /\ (undef23 > ~(1)) /\ ((arg5 + 2) <= arg4) /\ ((arg2 - 1) < arg2), par{arg2 -> (arg2 - 1), arg3 -> (arg1 + (arg2 - 1)), arg5 -> (arg5 + 2)}> 1) /\ ((arg5 + 1) < arg4) /\ (arg3 > 0) /\ (arg5 > ~(1)) /\ (undef29 > ~(1)) /\ (undef30 > ~(1)) /\ ((arg5 + 2) <= arg4) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg3 -> ((arg1 - 1) + arg2), arg5 -> (arg5 + 2)}> Fresh variables: undef3, undef4, undef5, undef6, undef8, undef22, undef23, undef29, undef30, undef31, undef32, undef33, undef34, undef35, Undef variables: undef3, undef4, undef5, undef6, undef8, undef22, undef23, undef29, undef30, undef31, undef32, undef33, undef34, undef35, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg2, arg3 -> -1 + arg1 + arg2, rest remain the same}> -1 + arg2, arg3 -> -1 + arg1 + arg2, arg5 -> 2 + arg5, rest remain the same}> -1 + arg1, arg3 -> -1 + arg1 + arg2, arg5 -> 2 + arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Detected abstraction incompatible with non-termination check. Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.016839 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001710s Ranking function: arg4 - arg5 New Graphs: Transitions: -1 + arg2, arg3 -> -1 + arg1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000332s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001285s Trying to remove transition: -1 + arg2, arg3 -> -1 + arg1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004572s Time used: 0.00446 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016803s Time used: 0.016462 LOG: SAT solveNonLinear - Elapsed time: 0.016803s Cost: 0; Total time: 0.016462 Termination implied by a set of invariant(s): Invariant at l3: arg3 <= arg1 + arg2 + arg5 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg2, arg3 -> -1 + arg1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg2, arg3 -> -1 + arg1 + arg2, arg5 -> 2 + arg5, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg3 -> -1 + arg1 + arg2, arg5 -> 2 + arg5, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg2, arg3 -> -1 + arg1 + arg2, rest remain the same}> Ranking function: arg1 + arg2 + arg5 New Graphs: INVARIANTS: 3: arg3 <= arg1 + arg2 + arg5 , Quasi-INVARIANTS to narrow Graph: 3: Program Terminates