/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: 0) /\ (0 = arg2), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> 0) /\ (undef7 > ~(1)) /\ (1 = arg2), par{arg1 -> 0, arg2 -> (0 - undef7), arg3 -> 0}> ~(1)) /\ (arg2 > 1) /\ (undef12 > ~(1)) /\ (arg1 > 0), par{arg1 -> (0 - undef12), arg2 -> (0 - undef11), arg3 -> (0 - undef12)}> arg2) /\ (arg1 < (arg2 + 1)) /\ (arg1 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 1), arg3 -> (arg1 + arg2)}> undef16, arg2 -> undef17, arg3 -> undef18}> Fresh variables: undef7, undef11, undef12, undef16, undef17, undef18, Undef variables: undef7, undef11, undef12, undef16, undef17, undef18, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (0 = undef17), par{arg1 -> 0, arg2 -> 0, arg3 -> 0}> 0) /\ (undef7 > ~(1)) /\ (1 = undef17), par{arg1 -> 0, arg2 -> (0 - undef7), arg3 -> 0}> ~(1)) /\ (undef17 > 1) /\ (undef12 > ~(1)) /\ (undef16 > 0), par{arg1 -> (0 - undef12), arg2 -> (0 - undef11), arg3 -> (0 - undef12)}> arg2) /\ (arg1 < (arg2 + 1)) /\ (arg1 = arg3), par{arg1 -> (arg1 + arg2), arg2 -> (arg2 + 1), arg3 -> (arg1 + arg2)}> Fresh variables: undef7, undef11, undef12, undef16, undef17, undef18, Undef variables: undef7, undef11, undef12, undef16, undef17, undef18, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: arg1 + arg2, arg2 -> 1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Precedence: Graph 0 Graph 1 0, arg2 -> 0, arg3 -> 0, rest remain the same}> 0, arg2 -> -undef7, arg3 -> 0, rest remain the same}> -undef12, arg2 -> -undef11, arg3 -> -undef12, rest remain the same}> 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.003172 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000720s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002253s [52985 : 52986] [52985 : 52987] Successful child: 52986 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: arg1 + arg2, arg2 -> 1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: arg1 + arg2, arg2 -> 1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> New Graphs: LOG: CALL check - Post:arg2 <= arg1 - Process 1 * Exit transition: -undef12, arg2 -> -undef11, arg3 -> -undef12, rest remain the same}> * Postcondition : arg2 <= arg1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000508s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000642s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 <= arg1 , Narrowing transition: arg1 + arg2, arg2 -> 1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: arg1 + arg2, arg2 -> 1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000706s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002343s [52985 : 53142] [52985 : 53143] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014669s Time used: 0.014211 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000283s Time used: 1.00028 LOG: SAT solveNonLinear - Elapsed time: 1.014951s Cost: 1; Total time: 1.01449 Termination implied by a set of invariant(s): Invariant at l2: arg1 <= 1 + arg3 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): arg1 + arg2, arg2 -> 1 + arg2, arg3 -> arg1 + arg2, 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): arg1 + arg2, arg2 -> 1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> Quasi-ranking function: 50000 - arg2 New Graphs: Transitions: arg1 + arg2, arg2 -> 1 + arg2, arg3 -> arg1 + arg2, rest remain the same}> Variables: arg1, arg2, arg3 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000915s Ranking function: (~(1) / 50000) + (~(1) / 50000)*arg1 + (1 / 50000)*arg2 New Graphs: INVARIANTS: 2: arg1 <= 1 + arg3 , Quasi-INVARIANTS to narrow Graph: 2: Program Terminates