YES Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg2 > ~(1)) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> (undef1 + undef2)}> 0) /\ (arg2 < arg1), par{arg1 -> (arg1 - 1), arg3 -> ((arg1 - 1) + arg2)}> 0) /\ (arg2 > arg1), par{arg2 -> (arg2 - 1), arg3 -> (arg1 + (arg2 - 1))}> 0) /\ (arg1 = arg2), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> ((arg1 - 1) + arg1)}> undef13, arg2 -> undef14, arg3 -> undef15}> Fresh variables: undef1, undef2, undef13, undef14, undef15, Undef variables: undef1, undef2, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef14 > ~(1)) /\ (undef1 > ~(1)) /\ (undef13 > 0)> 0) /\ (arg2 < arg1), par{arg1 -> (arg1 - 1), arg3 -> ((arg1 - 1) + arg2)}> 0) /\ (arg2 > arg1), par{arg2 -> (arg2 - 1), arg3 -> (arg1 + (arg2 - 1))}> 0) /\ (arg1 = arg2), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> ((arg1 - 1) + arg1)}> Fresh variables: undef1, undef2, undef13, undef14, undef15, Undef variables: undef1, undef2, undef13, undef14, undef15, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg1, arg3 -> -1 + arg1 + arg2, rest remain the same}> -1 + arg2, arg3 -> -1 + arg1 + arg2, rest remain the same}> -1 + arg1, arg2 -> arg1, arg3 -> -1 + 2*arg1, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.018529 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001930s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.111359s Trying to remove transition: -1 + arg1, arg2 -> arg1, arg3 -> -1 + 2*arg1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.118527s Time used: 0.118034 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.073181s Time used: 0.071474 Trying to remove transition: -1 + arg1, arg3 -> -1 + arg1 + arg2, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.077718s Time used: 0.075899 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.053625s Time used: 0.051828 LOG: SAT solveNonLinear - Elapsed time: 0.053625s Cost: 0; Total time: 0.051828 Termination implied by a set of invariant(s): Invariant at l2: arg3 <= arg1 + arg2 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, 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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> arg1, arg3 -> -1 + 2*arg1, 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 + arg1, 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, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> arg1, arg3 -> -1 + 2*arg1, rest remain the same}> Ranking function: 1 + arg1 New Graphs: Transitions: -1 + arg2, arg3 -> -1 + arg1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001021s Ranking function: -1 - arg1 + arg2 New Graphs: INVARIANTS: 2: arg3 <= arg1 + arg2 , Quasi-INVARIANTS to narrow Graph: 2: Program Terminates