YES Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: 0) /\ (undef4 > ~(1)) /\ (undef1 <= arg1) /\ ((undef2 - 5) <= arg1) /\ ((undef3 - 3) <= arg1) /\ (arg1 > 0) /\ (undef1 > 0) /\ (undef2 > 5) /\ (undef3 > 3), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4, arg5 -> 0}> 0) /\ (undef11 > arg5) /\ (undef12 > arg5) /\ (arg1 > 0) /\ (arg2 > 4) /\ (arg3 > 2) /\ (undef6 > 4), par{arg1 -> undef6, arg2 -> undef7, arg3 -> undef8, arg4 -> undef9, arg5 -> undef10}> 0) /\ (arg2 > 5) /\ (arg3 > 3) /\ (undef13 > 6), par{arg1 -> undef13, arg2 -> undef14, arg3 -> undef15, arg4 -> undef16, arg5 -> undef17}> arg5) /\ (arg5 > 0) /\ (arg4 > 1) /\ (undef18 <= arg1) /\ ((undef18 + 4) <= arg2) /\ ((undef18 + 2) <= arg3) /\ (arg1 > 0) /\ (arg2 > 4) /\ (arg3 > 2) /\ (undef18 > 0) /\ (undef19 > 4) /\ (undef20 > 2), par{arg1 -> undef18, arg2 -> undef19, arg3 -> undef20, arg4 -> (arg4 - 1), arg5 -> undef22}> 1) /\ ((undef23 + 5) <= arg2) /\ ((undef23 + 3) <= arg3) /\ ((undef24 - 7) <= arg1) /\ ((undef24 - 2) <= arg2) /\ ((undef24 - 4) <= arg3) /\ ((undef25 - 5) <= arg1) /\ (undef25 <= arg2) /\ ((undef25 - 2) <= arg3) /\ (arg1 > 0) /\ (arg2 > 5) /\ (arg3 > 3) /\ (undef23 > 0) /\ (undef24 > 7) /\ (undef25 > 5), par{arg1 -> undef23, arg2 -> undef24, arg3 -> undef25, arg4 -> (arg4 - 1), arg5 -> 1}> 1) /\ (undef29 > ~(1)) /\ ((undef28 + 1) <= arg1) /\ (arg1 > 4) /\ (undef28 > 3), par{arg1 -> undef28, arg2 -> undef29, arg3 -> 0, arg4 -> undef31, arg5 -> undef32}> arg3) /\ (arg3 > 0) /\ (arg2 > 1) /\ (arg1 > 2) /\ (undef33 > 2), par{arg1 -> undef33, arg2 -> (arg2 - 1), arg3 -> undef35, arg4 -> undef36, arg5 -> undef37}> 1) /\ (arg1 > 3) /\ (undef38 > 5), par{arg1 -> undef38, arg2 -> (arg2 - 1), arg3 -> 1, arg4 -> undef41, arg5 -> undef42}> 2) /\ (undef43 > 0), par{arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, arg5 -> undef47}> 0) /\ (undef48 > ~(1)), par{arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, arg5 -> undef52}> undef53, arg2 -> undef54, arg3 -> undef55, arg4 -> undef56, arg5 -> undef57}> Fresh variables: undef1, undef2, undef3, undef4, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef28, undef29, undef31, undef32, undef33, undef35, undef36, undef37, undef38, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, Undef variables: undef1, undef2, undef3, undef4, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef28, undef29, undef31, undef32, undef33, undef35, undef36, undef37, undef38, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef4 > ~(1)) /\ (undef1 <= undef53) /\ ((undef2 - 5) <= undef53) /\ ((undef3 - 3) <= undef53) /\ (undef53 > 0) /\ (undef1 > 0) /\ (undef2 > 5) /\ (undef3 > 3)> 0) /\ (undef11 > arg5) /\ (undef12 > arg5) /\ (arg1 > 0) /\ (arg2 > 4) /\ (arg3 > 2) /\ (undef6 > 4) /\ (undef7 > 1) /\ (undef29 > ~(1)) /\ ((undef28 + 1) <= undef6) /\ (undef6 > 4) /\ (undef28 > 3), par{arg1 -> undef28, arg2 -> undef29, arg3 -> 0, arg4 -> undef31, arg5 -> undef32}> 0) /\ (arg2 > 5) /\ (arg3 > 3) /\ (undef13 > 6) /\ (undef14 > 1) /\ (undef29 > ~(1)) /\ ((undef28 + 1) <= undef13) /\ (undef13 > 4) /\ (undef28 > 3), par{arg1 -> undef28, arg2 -> undef29, arg3 -> 0, arg4 -> undef31, arg5 -> undef32}> arg5) /\ (arg5 > 0) /\ (arg4 > 1) /\ (undef18 <= arg1) /\ ((undef18 + 4) <= arg2) /\ ((undef18 + 2) <= arg3) /\ (arg1 > 0) /\ (arg2 > 4) /\ (arg3 > 2) /\ (undef18 > 0) /\ (undef19 > 4) /\ (undef20 > 2), par{arg1 -> undef18, arg2 -> undef19, arg3 -> undef20, arg4 -> (arg4 - 1), arg5 -> undef22}> 1) /\ ((undef23 + 5) <= arg2) /\ ((undef23 + 3) <= arg3) /\ ((undef24 - 7) <= arg1) /\ ((undef24 - 2) <= arg2) /\ ((undef24 - 4) <= arg3) /\ ((undef25 - 5) <= arg1) /\ (undef25 <= arg2) /\ ((undef25 - 2) <= arg3) /\ (arg1 > 0) /\ (arg2 > 5) /\ (arg3 > 3) /\ (undef23 > 0) /\ (undef24 > 7) /\ (undef25 > 5), par{arg1 -> undef23, arg2 -> undef24, arg3 -> undef25, arg4 -> (arg4 - 1), arg5 -> 1}> arg3) /\ (arg3 > 0) /\ (arg2 > 1) /\ (arg1 > 2) /\ (undef33 > 2), par{arg1 -> undef33, arg2 -> (arg2 - 1), arg3 -> undef35, arg4 -> undef36, arg5 -> undef37}> 1) /\ (arg1 > 3) /\ (undef38 > 5), par{arg1 -> undef38, arg2 -> (arg2 - 1), arg3 -> 1, arg4 -> undef41, arg5 -> undef42}> 2) /\ (undef43 > 0), par{arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, arg5 -> undef47}> 0) /\ (undef48 > ~(1)), par{arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, arg5 -> undef52}> Fresh variables: undef1, undef2, undef3, undef4, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef28, undef29, undef31, undef32, undef33, undef35, undef36, undef37, undef38, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, Undef variables: undef1, undef2, undef3, undef4, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef22, undef23, undef24, undef25, undef28, undef29, undef31, undef32, undef33, undef35, undef36, undef37, undef38, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef18, arg2 -> undef19, arg3 -> undef20, arg4 -> -1 + arg4, arg5 -> undef22, rest remain the same}> undef23, arg2 -> undef24, arg3 -> undef25, arg4 -> -1 + arg4, arg5 -> 1, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Graph 2: Transitions: undef33, arg2 -> -1 + arg2, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37, rest remain the same}> undef38, arg2 -> -1 + arg2, arg3 -> 1, arg4 -> undef41, arg5 -> undef42, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Graph 3: Transitions: undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, arg5 -> undef52, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Precedence: Graph 0 Graph 1 Graph 2 undef28, arg2 -> undef29, arg3 -> 0, arg4 -> undef31, arg5 -> undef32, rest remain the same}> undef28, arg2 -> undef29, arg3 -> 0, arg4 -> undef31, arg5 -> undef32, rest remain the same}> Graph 3 undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, arg5 -> undef47, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 4 , 2 ) ( 5 , 3 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.00808 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002164s Ranking function: -2 + arg4 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.004639 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001136s Ranking function: -2 + arg2 New Graphs: Proving termination of subgraph 3 Checking unfeasibility... Time used: 0.001552 Checking conditional termination of SCC {l5}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000549s Ranking function: -1 + arg1 New Graphs: Program Terminates