YES Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: 0) /\ (arg2 > ~(1)), par{arg1 -> (arg2 - 1), arg3 -> 0, arg4 -> undef4}> 0) /\ (undef7 > arg3) /\ (arg3 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> undef7, arg4 -> undef8}> 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> 1, arg4 -> undef12}> 0), par{arg1 -> 0, arg2 -> arg3, arg4 -> 0}> 0) /\ (arg4 > 0) /\ (arg3 > 0) /\ (undef17 > arg1) /\ (arg2 > arg1) /\ (undef19 < arg3) /\ (undef20 < arg4) /\ (undef21 > arg1), par{arg1 -> undef17, arg3 -> undef19, arg4 -> undef20}> 0) /\ (undef26 > undef25) /\ (undef26 > ~(1)) /\ (arg2 = arg3), par{arg1 -> 1, arg2 -> undef23, arg3 -> undef24, arg4 -> undef25}> undef27, arg2 -> undef28, arg3 -> undef29, arg4 -> undef30}> Fresh variables: undef4, undef7, undef8, undef12, undef17, undef19, undef20, undef21, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, Undef variables: undef4, undef7, undef8, undef12, undef17, undef19, undef20, undef21, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef28 > ~(1))> 0) /\ (undef7 > arg3) /\ (arg3 > 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> undef7, arg4 -> undef8}> 0), par{arg1 -> (arg1 - 1), arg2 -> arg1, arg3 -> 1, arg4 -> undef12}> 0), par{arg1 -> 0, arg2 -> arg3, arg4 -> 0}> 0) /\ (arg4 > 0) /\ (arg3 > 0) /\ (undef17 > arg1) /\ (arg2 > arg1) /\ (undef19 < arg3) /\ (undef20 < arg4) /\ (undef21 > arg1), par{arg1 -> undef17, arg3 -> undef19, arg4 -> undef20}> 0) /\ (undef26 > undef25) /\ (undef26 > ~(1)) /\ (arg2 = arg3), par{arg1 -> 1, arg2 -> undef23, arg3 -> undef24, arg4 -> undef25}> Fresh variables: undef4, undef7, undef8, undef12, undef17, undef19, undef20, undef21, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, Undef variables: undef4, undef7, undef8, undef12, undef17, undef19, undef20, undef21, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg1, arg2 -> arg1, arg3 -> undef7, arg4 -> undef8, rest remain the same}> -1 + arg1, arg2 -> arg1, arg3 -> 1, arg4 -> undef12, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Graph 2: Transitions: undef17, arg3 -> undef19, arg4 -> undef20, rest remain the same}> 1, arg2 -> undef23, arg3 -> undef24, arg4 -> undef25, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Precedence: Graph 0 Graph 1 Graph 2 0, arg2 -> arg3, arg4 -> 0, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.006306 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000786s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003272s Trying to remove transition: -1 + arg1, arg2 -> arg1, arg3 -> 1, arg4 -> undef12, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008007s Time used: 0.007876 Trying to remove transition: -1 + arg1, arg2 -> arg1, arg3 -> undef7, arg4 -> undef8, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008171s Time used: 0.007699 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015448s Time used: 0.015003 LOG: SAT solveNonLinear - Elapsed time: 0.015448s Cost: 0; Total time: 0.015003 Termination implied by a set of invariant(s): Invariant at l2: arg2 <= 1 + arg1 [ 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, arg2 -> arg1, arg3 -> undef7, arg4 -> undef8, 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, arg4 -> undef12, 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, arg2 -> arg1, arg3 -> undef7, arg4 -> undef8, 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, arg4 -> undef12, rest remain the same}> Ranking function: arg1 New Graphs: INVARIANTS: 2: arg2 <= 1 + arg1 , Quasi-INVARIANTS to narrow Graph: 2: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.004045 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001354s Ranking function: -1 + arg3 New Graphs: Program Terminates