/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: 0) /\ (undef1 > 2) /\ (undef2 > ~(1)), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4, arg5 -> undef5}> 2) /\ (undef6 > 2) /\ (undef7 > ~(1)) /\ ((arg2 + 2) <= arg1), par{arg1 -> undef6, arg2 -> undef7, arg3 -> undef8, arg4 -> undef9, arg5 -> undef10}> = (undef11 - 2)) /\ (arg1 >= (undef12 + 3)) /\ (arg2 >= (undef12 + 1)) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef11 > 2) /\ (undef12 > ~(1)), par{arg1 -> undef11, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15}> 0) /\ (undef18 > 0) /\ ((undef16 - 2) <= arg1) /\ ((undef17 - 2) <= arg1) /\ (arg1 > 0) /\ (undef16 > 2) /\ (undef17 > 2), par{arg1 -> undef16, arg2 -> undef17, arg3 -> undef18, arg4 -> arg2, arg5 -> 1}> 0) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (undef21 <= arg1) /\ ((undef22 + 2) <= arg2) /\ (arg1 > 2) /\ (arg2 > 2) /\ (undef21 > 2) /\ (undef22 > 0), par{arg1 -> undef21, arg2 -> undef22, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> ~(1)) /\ (undef31 > 0) /\ (arg3 > 0) /\ (arg5 < arg4) /\ (undef26 <= arg1) /\ ((undef27 + 2) <= arg2) /\ (arg1 > 2) /\ (arg2 > 2) /\ (undef26 > 2) /\ (undef27 > 0), par{arg1 -> undef26, arg2 -> undef27, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> ~(1)) /\ (undef37 > 0) /\ (arg3 > 0) /\ (arg5 < arg4) /\ (arg1 > 2) /\ (arg2 > 1) /\ (undef32 > 2) /\ (undef33 > 2), par{arg1 -> undef32, arg2 -> undef33, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> 0) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (arg1 > 2) /\ (arg2 > 1) /\ (undef38 > 2) /\ (undef39 > 2), par{arg1 -> undef38, arg2 -> undef39, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> 0) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ ((undef43 - 2) <= arg1) /\ ((undef43 - 2) <= arg2) /\ ((undef44 - 2) <= arg1) /\ ((undef44 - 2) <= arg2) /\ (arg1 > 2) /\ (arg2 > 2) /\ (undef43 > 4) /\ (undef44 > 4), par{arg1 -> undef43, arg2 -> undef44, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> ~(1)) /\ (undef53 > 0) /\ (arg3 > 0) /\ (arg5 < arg4) /\ ((undef48 - 2) <= arg1) /\ ((undef48 - 2) <= arg2) /\ ((undef49 - 2) <= arg1) /\ ((undef49 - 2) <= arg2) /\ (arg1 > 2) /\ (arg2 > 2) /\ (undef48 > 4) /\ (undef49 > 4), par{arg1 -> undef48, arg2 -> undef49, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> undef54, arg2 -> undef55, arg3 -> undef56, arg4 -> undef57, arg5 -> undef58}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef21, undef22, undef26, undef27, undef31, undef32, undef33, undef37, undef38, undef39, undef43, undef44, undef48, undef49, undef53, undef54, undef55, undef56, undef57, undef58, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef21, undef22, undef26, undef27, undef31, undef32, undef33, undef37, undef38, undef39, undef43, undef44, undef48, undef49, undef53, undef54, undef55, undef56, undef57, undef58, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef1 > 2) /\ (undef2 > ~(1)), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4, arg5 -> undef5}> 0) /\ (undef18 > 0) /\ ((undef16 - 2) <= undef54) /\ ((undef17 - 2) <= undef54) /\ (undef54 > 0) /\ (undef16 > 2) /\ (undef17 > 2), par{arg1 -> undef16, arg2 -> undef17, arg3 -> undef18, arg4 -> undef55, arg5 -> 1}> = (undef11 - 2)) /\ (arg1 >= (undef12 + 3)) /\ (arg2 >= (undef12 + 1)) /\ (arg1 > 2) /\ (arg2 > 0) /\ (undef11 > 2) /\ (undef12 > ~(1)), par{arg1 -> undef11, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15}> 0) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (undef21 <= arg1) /\ ((undef22 + 2) <= arg2) /\ (arg1 > 2) /\ (arg2 > 2) /\ (undef21 > 2) /\ (undef22 > 0), par{arg1 -> undef21, arg2 -> undef22, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> ~(1)) /\ (undef31 > 0) /\ (arg3 > 0) /\ (arg5 < arg4) /\ (undef26 <= arg1) /\ ((undef27 + 2) <= arg2) /\ (arg1 > 2) /\ (arg2 > 2) /\ (undef26 > 2) /\ (undef27 > 0), par{arg1 -> undef26, arg2 -> undef27, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> ~(1)) /\ (undef37 > 0) /\ (arg3 > 0) /\ (arg5 < arg4) /\ (arg1 > 2) /\ (arg2 > 1) /\ (undef32 > 2) /\ (undef33 > 2), par{arg1 -> undef32, arg2 -> undef33, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> 0) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ (arg1 > 2) /\ (arg2 > 1) /\ (undef38 > 2) /\ (undef39 > 2), par{arg1 -> undef38, arg2 -> undef39, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> 0) /\ (arg5 > ~(1)) /\ (arg5 < arg4) /\ ((undef43 - 2) <= arg1) /\ ((undef43 - 2) <= arg2) /\ ((undef44 - 2) <= arg1) /\ ((undef44 - 2) <= arg2) /\ (arg1 > 2) /\ (arg2 > 2) /\ (undef43 > 4) /\ (undef44 > 4), par{arg1 -> undef43, arg2 -> undef44, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> ~(1)) /\ (undef53 > 0) /\ (arg3 > 0) /\ (arg5 < arg4) /\ ((undef48 - 2) <= arg1) /\ ((undef48 - 2) <= arg2) /\ ((undef49 - 2) <= arg1) /\ ((undef49 - 2) <= arg2) /\ (arg1 > 2) /\ (arg2 > 2) /\ (undef48 > 4) /\ (undef49 > 4), par{arg1 -> undef48, arg2 -> undef49, arg3 -> (arg3 - 1), arg5 -> (arg5 + 1)}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef21, undef22, undef26, undef27, undef31, undef32, undef33, undef37, undef38, undef39, undef43, undef44, undef48, undef49, undef53, undef54, undef55, undef56, undef57, undef58, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef21, undef22, undef26, undef27, undef31, undef32, undef33, undef37, undef38, undef39, undef43, undef44, undef48, undef49, undef53, undef54, undef55, undef56, undef57, undef58, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef21, arg2 -> undef22, arg3 -> -1 + arg3, arg5 -> 1 + arg5, rest remain the same}> undef26, arg2 -> undef27, arg3 -> -1 + arg3, arg5 -> 1 + arg5, rest remain the same}> undef32, arg2 -> undef33, arg3 -> -1 + arg3, arg5 -> 1 + arg5, rest remain the same}> undef38, arg2 -> undef39, arg3 -> -1 + arg3, arg5 -> 1 + arg5, rest remain the same}> undef43, arg2 -> undef44, arg3 -> -1 + arg3, arg5 -> 1 + arg5, rest remain the same}> undef48, arg2 -> undef49, arg3 -> -1 + arg3, arg5 -> 1 + arg5, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Graph 2: Transitions: undef11, arg2 -> undef12, arg3 -> undef13, arg4 -> undef14, arg5 -> undef15, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Precedence: Graph 0 Graph 1 undef16, arg2 -> undef17, arg3 -> undef18, arg4 -> undef55, arg5 -> 1, rest remain the same}> Graph 2 undef1, arg2 -> undef2, arg3 -> undef3, arg4 -> undef4, arg5 -> undef5, 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.056771 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013342s Ranking function: -1 + arg3 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.003529 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001675s Ranking function: -1 + arg2 New Graphs: Program Terminates