YES Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3}> ~(1)) /\ (arg2 > 0) /\ (undef4 <= arg1) /\ (arg1 > 0) /\ (undef4 > 0) /\ (undef5 > 3), par{arg1 -> undef4, arg2 -> undef5, arg3 -> 0}> ~(1)) /\ (arg2 > 0) /\ (arg1 >= undef8) /\ (arg1 >= (undef9 - 1)) /\ (arg1 > 0) /\ (undef8 > 0) /\ (undef9 > 1), par{arg1 -> undef8, arg2 -> undef9, arg3 -> 0}> ~(1)) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef13, arg3 -> undef14}> 0) /\ ((undef16 + 2) <= arg2) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef15 > 1) /\ (undef16 > ~(1)) /\ (0 = arg3), par{arg1 -> undef15, arg2 -> undef16, arg3 -> 0}> 2) /\ (arg2 > 0) /\ (undef19 > 0) /\ (undef20 > ~(1)) /\ ((undef21 + 4) <= arg1) /\ ((arg3 + 2) <= arg1) /\ ((undef21 + 2) <= arg2), par{arg1 -> undef19, arg2 -> undef20, arg3 -> undef21}> 0) /\ (undef22 <= arg2) /\ ((undef23 + 3) <= arg1) /\ ((undef23 + 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef22 > 0) /\ (undef23 > ~(1)) /\ ((undef24 + 4) <= arg1) /\ ((arg3 + 2) <= arg1) /\ ((undef24 + 2) <= arg2), par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24}> 2) /\ (arg2 > 0) /\ (undef25 > 2) /\ (undef26 > 0) /\ (0 = arg3), par{arg1 -> undef25, arg2 -> undef26, arg3 -> 1}> undef28, arg2 -> undef29, arg3 -> undef30}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef9, undef11, undef13, undef14, undef15, undef16, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef28, undef29, undef30, Undef variables: undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef9, undef11, undef13, undef14, undef15, undef16, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef28, undef29, undef30, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef29 > 0) /\ (undef28 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3}> ~(1)) /\ (undef29 > 0) /\ (undef4 <= undef28) /\ (undef28 > 0) /\ (undef4 > 0) /\ (undef5 > 3) /\ (undef15 <= undef5) /\ (undef18 > 0) /\ ((undef16 + 2) <= undef5) /\ (undef4 > 0) /\ (undef5 > 1) /\ (undef15 > 1) /\ (undef16 > ~(1)) /\ (0 = 0), par{arg1 -> undef15, arg2 -> undef16, arg3 -> 0}> ~(1)) /\ (undef29 > 0) /\ (undef28 >= undef8) /\ (undef28 >= (undef9 - 1)) /\ (undef28 > 0) /\ (undef8 > 0) /\ (undef9 > 1) /\ (undef15 <= undef9) /\ (undef18 > 0) /\ ((undef16 + 2) <= undef9) /\ (undef8 > 0) /\ (undef9 > 1) /\ (undef15 > 1) /\ (undef16 > ~(1)) /\ (0 = 0), par{arg1 -> undef15, arg2 -> undef16, arg3 -> 0}> ~(1)) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef13, arg3 -> undef14}> 2) /\ (arg2 > 0) /\ (undef19 > 0) /\ (undef20 > ~(1)) /\ ((undef21 + 4) <= arg1) /\ ((arg3 + 2) <= arg1) /\ ((undef21 + 2) <= arg2), par{arg1 -> undef19, arg2 -> undef20, arg3 -> undef21}> 0) /\ (undef22 <= arg2) /\ ((undef23 + 3) <= arg1) /\ ((undef23 + 1) <= arg2) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef22 > 0) /\ (undef23 > ~(1)) /\ ((undef24 + 4) <= arg1) /\ ((arg3 + 2) <= arg1) /\ ((undef24 + 2) <= arg2), par{arg1 -> undef22, arg2 -> undef23, arg3 -> undef24}> 2) /\ (arg2 > 0) /\ (undef25 > 2) /\ (undef26 > 0) /\ (0 = arg3), par{arg1 -> undef25, arg2 -> undef26, arg3 -> 1}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef9, undef11, undef13, undef14, undef15, undef16, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef28, undef29, undef30, Undef variables: undef1, undef2, undef3, undef4, undef5, undef7, undef8, undef9, undef11, undef13, undef14, undef15, undef16, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef28, undef29, undef30, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef19, arg2 -> undef20, arg3 -> undef21, rest remain the same}> undef22, arg2 -> undef23, arg3 -> undef24, rest remain the same}> undef25, arg2 -> undef26, arg3 -> 1, rest remain the same}> Variables: arg1, arg2, arg3 Graph 2: Transitions: -1 + arg1, arg2 -> undef13, arg3 -> undef14, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 undef15, arg2 -> undef16, arg3 -> 0, rest remain the same}> undef15, arg2 -> undef16, arg3 -> 0, rest remain the same}> Graph 2 undef1, arg2 -> undef2, arg3 -> undef3, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 2 ) ( 4 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.016791 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007260s Ranking function: (~(4) / 3) + (1 / 3)*arg1 + (1 / 3)*arg2 New Graphs: Transitions: undef25, arg2 -> undef26, arg3 -> 1, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001464s Ranking function: -arg3 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.001902 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001268s Ranking function: arg1 New Graphs: Program Terminates