/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- YES Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: ~(1)) /\ (arg2 > 0) /\ (undef1 <= arg1) /\ (arg1 > 0) /\ (undef1 > 0) /\ (undef2 > 2), par{arg1 -> undef1, arg2 -> undef2}> ~(1)) /\ (arg2 > 0) /\ (undef4 <= arg1) /\ ((undef5 - 1) <= arg1) /\ (arg1 > 0) /\ (undef4 > 0) /\ (undef5 > 1), par{arg1 -> undef4, arg2 -> undef5}> 0) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef8 > 0), par{arg1 -> 0, arg2 -> undef8}> ~(1)) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> undef10, arg2 -> undef11}> 1) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef13}> 6) /\ (undef15 > ~(1)) /\ (0 = arg1), par{arg1 -> 1, arg2 -> undef15}> 0) /\ (undef17 > 2) /\ (1 = arg1), par{arg1 -> 2, arg2 -> undef17}> 0) /\ (undef19 > 4) /\ (2 = arg1), par{arg1 -> 0, arg2 -> undef19}> undef20, arg2 -> undef21}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef8, undef9, undef10, undef11, undef13, undef15, undef17, undef19, undef20, undef21, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef8, undef9, undef10, undef11, undef13, undef15, undef17, undef19, undef20, undef21, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef21 > 0) /\ (undef1 <= undef20) /\ (undef20 > 0) /\ (undef1 > 0) /\ (undef2 > 2) /\ (undef8 <= undef2) /\ (undef9 > 0) /\ (undef1 > 0) /\ (undef2 > 0) /\ (undef8 > 0), par{arg1 -> 0, arg2 -> undef8}> ~(1)) /\ (undef21 > 0) /\ (undef4 <= undef20) /\ ((undef5 - 1) <= undef20) /\ (undef20 > 0) /\ (undef4 > 0) /\ (undef5 > 1) /\ (undef8 <= undef5) /\ (undef9 > 0) /\ (undef4 > 0) /\ (undef5 > 0) /\ (undef8 > 0), par{arg1 -> 0, arg2 -> undef8}> ~(1)) /\ (undef21 > 0) /\ (undef20 > 0), par{arg1 -> undef10, arg2 -> undef11}> 6) /\ (undef15 > ~(1)) /\ (0 = arg1), par{arg1 -> 1, arg2 -> undef15}> 0) /\ (undef17 > 2) /\ (1 = arg1), par{arg1 -> 2, arg2 -> undef17}> 0) /\ (undef19 > 4) /\ (2 = arg1), par{arg1 -> 0, arg2 -> undef19}> 1) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef13}> Fresh variables: undef1, undef2, undef3, undef4, undef5, undef6, undef8, undef9, undef10, undef11, undef13, undef15, undef17, undef19, undef20, undef21, Undef variables: undef1, undef2, undef3, undef4, undef5, undef6, undef8, undef9, undef10, undef11, undef13, undef15, undef17, undef19, undef20, undef21, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg1, arg2 -> undef13, rest remain the same}> Variables: arg1, arg2 Graph 2: Transitions: 1, arg2 -> undef15, rest remain the same}> 2, arg2 -> undef17, rest remain the same}> 0, arg2 -> undef19, rest remain the same}> Variables: arg1, arg2 Precedence: Graph 0 Graph 1 undef10, arg2 -> undef11, rest remain the same}> Graph 2 0, arg2 -> undef8, rest remain the same}> 0, arg2 -> undef8, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 2 ) ( 4 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001975 Checking conditional termination of SCC {l4}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000613s Ranking function: -2 + arg1 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.024452 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002092s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015648s Piecewise ranking function: min(-122 + 132*arg1 + 19*arg2,66 - 47*arg1 + 19*arg2) New Graphs: Transitions: 2, arg2 -> undef17, rest remain the same}> 0, arg2 -> undef19, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001275s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007076s Piecewise ranking function: min(8 - 9*arg1 + arg2,-14 + 19*arg1 + arg2) New Graphs: Transitions: 0, arg2 -> undef19, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001055s Ranking function: -1 + (1 / 2)*arg1 New Graphs: Program Terminates