YES Solver Timeout: 4 Global Timeout: 300 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg2 -> 0, arg3 -> arg2, arg4 -> undef4}> = arg2) /\ (arg3 > ~(1)) /\ (undef5 <= arg1) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg3 -> 0, arg4 -> arg3}> arg4) /\ (arg4 > ~(1)) /\ (arg1 >= undef9) /\ (arg1 > 0) /\ (undef9 > 0), par{arg1 -> undef9, arg2 -> (arg2 + 1), arg3 -> arg4, arg4 -> undef12}> = arg2) /\ (arg4 >= arg3) /\ (arg1 > 0), par{arg1 -> arg3, arg3 -> undef15, arg4 -> undef16}> ~(1)) /\ (arg4 >= arg3) /\ (undef17 <= arg1) /\ (arg1 > 0) /\ (undef17 > 0) /\ (0 = arg2), par{arg1 -> undef17, arg2 -> 0, arg3 -> (arg3 + 1)}> = arg2) /\ (arg4 > ~(1)) /\ (undef21 <= arg1) /\ (arg1 > 0) /\ (undef21 > 0) /\ (0 = arg3), par{arg1 -> undef21, arg3 -> 1}> ~(1)) /\ (arg1 > 0) /\ (undef25 > 0), par{arg1 -> undef25, arg3 -> (arg3 + 1)}> = arg2) /\ (arg4 >= arg3) /\ (arg4 > ~(1)) /\ (undef29 <= arg1) /\ (arg1 > 0) /\ (undef29 > 0), par{arg1 -> undef29, arg3 -> (arg3 + 1)}> 0) /\ (arg2 < arg1) /\ (arg1 > 1), par{arg1 -> arg2, arg3 -> undef35, arg4 -> undef36}> 0) /\ (arg2 >= arg1) /\ (arg1 > 0), par{arg2 -> (arg2 - arg1), arg3 -> undef39, arg4 -> undef40}> 0) /\ (arg1 > 0) /\ ((arg2 - arg1) = 0) /\ (arg2 >= arg1), par{arg3 -> (arg1 - 1), arg4 -> undef44}> 0), par{arg1 -> arg2, arg2 -> arg1, arg3 -> (arg2 - 1), arg4 -> undef48}> 0) /\ (arg2 >= arg1) /\ (arg1 > 0), par{arg3 -> (arg1 - 1), arg4 -> undef52}> 0) /\ (arg1 > 0) /\ (undef57 > 0) /\ (arg3 < arg1), par{arg1 -> arg3, arg3 -> undef55, arg4 -> undef56}> 0) /\ (arg1 > 1) /\ (arg2 >= arg1) /\ ((arg1 - 1) < arg1) /\ (undef62 > 0), par{arg1 -> (arg1 - 1), arg3 -> undef60, arg4 -> undef61}> undef63, arg2 -> undef64, arg3 -> undef65, arg4 -> undef66}> Fresh variables: undef1, undef4, undef5, undef9, undef12, undef15, undef16, undef17, undef21, undef25, undef29, undef35, undef36, undef39, undef40, undef44, undef48, undef52, undef55, undef56, undef57, undef60, undef61, undef62, undef63, undef64, undef65, undef66, Undef variables: undef1, undef4, undef5, undef9, undef12, undef15, undef16, undef17, undef21, undef25, undef29, undef35, undef36, undef39, undef40, undef44, undef48, undef52, undef55, undef56, undef57, undef60, undef61, undef62, undef63, undef64, undef65, undef66, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef63 > 0) /\ (undef1 > 0) /\ (undef64 >= 0) /\ (undef64 > ~(1)) /\ (undef5 <= undef1) /\ (undef1 > 0) /\ (undef5 > 0)> arg4) /\ (arg4 > ~(1)) /\ (arg1 >= undef9) /\ (arg1 > 0) /\ (undef9 > 0) /\ (arg4 >= (arg2 + 1)) /\ (arg4 > ~(1)) /\ (undef5 <= undef9) /\ (undef9 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> (arg2 + 1), arg3 -> 0, arg4 -> arg4}> = arg2) /\ (arg4 >= arg3) /\ (arg1 > 0), par{arg1 -> arg3, arg3 -> undef15, arg4 -> undef16}> ~(1)) /\ (arg4 >= arg3) /\ (undef17 <= arg1) /\ (arg1 > 0) /\ (undef17 > 0) /\ (0 = arg2), par{arg1 -> undef17, arg2 -> 0, arg3 -> (arg3 + 1)}> = arg2) /\ (arg4 > ~(1)) /\ (undef21 <= arg1) /\ (arg1 > 0) /\ (undef21 > 0) /\ (0 = arg3), par{arg1 -> undef21, arg3 -> 1}> = arg2) /\ (arg4 >= arg3) /\ (arg4 > ~(1)) /\ (undef29 <= arg1) /\ (arg1 > 0) /\ (undef29 > 0), par{arg1 -> undef29, arg3 -> (arg3 + 1)}> 0) /\ (arg2 < arg1) /\ (arg1 > 1), par{arg1 -> arg2, arg3 -> undef35, arg4 -> undef36}> 0) /\ (arg2 >= arg1) /\ (arg1 > 0), par{arg2 -> (arg2 - arg1), arg3 -> undef39, arg4 -> undef40}> 0) /\ (arg1 > 0) /\ ((arg2 - arg1) = 0) /\ (arg2 >= arg1) /\ (arg2 > 0) /\ (arg1 > 0) /\ (undef57 > 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg3 -> undef55, arg4 -> undef56}> 0) /\ (arg2 >= arg1) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg1 > 0) /\ (undef57 > 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg3 -> undef55, arg4 -> undef56}> 0) /\ (arg1 > 1) /\ (arg2 >= arg1) /\ ((arg1 - 1) < arg1) /\ (undef62 > 0), par{arg1 -> (arg1 - 1), arg3 -> undef60, arg4 -> undef61}> Fresh variables: undef1, undef4, undef5, undef9, undef12, undef15, undef16, undef17, undef21, undef25, undef29, undef35, undef36, undef39, undef40, undef44, undef48, undef52, undef55, undef56, undef57, undef60, undef61, undef62, undef63, undef64, undef65, undef66, Undef variables: undef1, undef4, undef5, undef9, undef12, undef15, undef16, undef17, undef21, undef25, undef29, undef35, undef36, undef39, undef40, undef44, undef48, undef52, undef55, undef56, undef57, undef60, undef61, undef62, undef63, undef64, undef65, undef66, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef5, arg2 -> 1 + arg2, arg3 -> 0, rest remain the same}> undef17, arg2 -> 0, arg3 -> 1 + arg3, rest remain the same}> undef21, arg3 -> 1, rest remain the same}> undef29, arg3 -> 1 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Graph 2: Transitions: arg2, arg3 -> undef35, arg4 -> undef36, rest remain the same}> -arg1 + arg2, arg3 -> undef39, arg4 -> undef40, rest remain the same}> -1 + arg1, arg3 -> undef55, arg4 -> undef56, rest remain the same}> -1 + arg1, arg3 -> undef55, arg4 -> undef56, rest remain the same}> -1 + arg1, arg3 -> undef60, arg4 -> undef61, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Precedence: Graph 0 Graph 1 Graph 2 arg3, arg3 -> undef15, arg4 -> undef16, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ( 4 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.010208 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002285s Ranking function: -3 - 3*arg2 + 3*arg4 New Graphs: Transitions: undef17, arg2 -> 0, arg3 -> 1 + arg3, rest remain the same}> undef21, arg3 -> 1, rest remain the same}> undef29, arg3 -> 1 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001332s Ranking function: -4*arg2 - arg3 + arg4 New Graphs: Transitions: undef21, arg3 -> 1, rest remain the same}> undef29, arg3 -> 1 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000974s Ranking function: -4*arg3 New Graphs: Transitions: undef29, arg3 -> 1 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000561s Ranking function: -arg3 + arg4 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.005977 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001920s Ranking function: -1 + arg2 New Graphs: Transitions: arg2, arg3 -> undef35, arg4 -> undef36, rest remain the same}> -1 + arg1, arg3 -> undef55, arg4 -> undef56, rest remain the same}> -1 + arg1, arg3 -> undef55, arg4 -> undef56, rest remain the same}> -1 + arg1, arg3 -> undef60, arg4 -> undef61, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001256s Ranking function: 3*arg1 - 3*arg2 New Graphs: Transitions: -1 + arg1, arg3 -> undef55, arg4 -> undef56, rest remain the same}> -1 + arg1, arg3 -> undef60, arg4 -> undef61, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000828s Ranking function: -8 + arg1 + 3*arg2 New Graphs: Transitions: -1 + arg1, arg3 -> undef55, arg4 -> undef56, rest remain the same}> Variables: arg1, arg2, arg3, arg4 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000517s Ranking function: -1 + arg1 New Graphs: Program Terminates