/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 > ~(1)) /\ (undef1 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> undef1, arg4 -> undef2, arg5 -> undef1}> 0) /\ (arg4 > 0) /\ (arg3 = arg5), par{arg3 -> (arg3 - 1), arg4 -> (arg4 - 1), arg5 -> (arg3 - 1)}> 0) /\ (0 = arg4) /\ (arg3 = arg5), par{arg2 -> (arg2 + 1), arg3 -> arg1, arg4 -> (arg2 + 1), arg5 -> arg1}> undef16, arg2 -> undef17, arg3 -> undef18, arg4 -> undef19, arg5 -> undef20}> Fresh variables: undef1, undef2, undef16, undef17, undef18, undef19, undef20, Undef variables: undef1, undef2, undef16, undef17, undef18, undef19, undef20, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef17 > ~(1)) /\ (undef1 > ~(1)) /\ (undef16 > 0)> 0) /\ (arg4 > 0) /\ (arg3 = arg5), par{arg3 -> (arg3 - 1), arg4 -> (arg4 - 1), arg5 -> (arg3 - 1)}> 0) /\ (0 = arg4) /\ (arg3 = arg5), par{arg2 -> (arg2 + 1), arg3 -> arg1, arg4 -> (arg2 + 1), arg5 -> arg1}> Fresh variables: undef1, undef2, undef16, undef17, undef18, undef19, undef20, Undef variables: undef1, undef2, undef16, undef17, undef18, undef19, undef20, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg3, arg4 -> -1 + arg4, arg5 -> -1 + arg3, rest remain the same}> 1 + arg2, arg3 -> arg1, arg4 -> 1 + arg2, arg5 -> arg1, rest remain the same}> Variables: arg3, arg4, arg5, arg1, arg2 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.009784 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001464s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005469s [58324 : 58325] [58324 : 58326] Successful child: 58325 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg3, arg4 -> -1 + arg4, arg5 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, arg3 -> arg1, arg4 -> 1 + arg2, arg5 -> arg1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg3, arg4 -> -1 + arg4, arg5 -> -1 + arg3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + arg2, arg3 -> arg1, arg4 -> 1 + arg2, arg5 -> arg1, rest remain the same}> Ranking function: 2*arg1 - 2*arg2 + arg4 - arg5 New Graphs: Transitions: -1 + arg3, arg4 -> -1 + arg4, arg5 -> -1 + arg3, rest remain the same}> Variables: arg1, arg2, arg3, arg4, arg5 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001199s Ranking function: -1 + arg3 New Graphs: INVARIANTS: 2: arg2 + arg3 <= arg1 + arg4 , Quasi-INVARIANTS to narrow Graph: 2: Program Terminates