/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files -------------------------------------------------------------------------------- NO 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}> ~(1)) /\ (arg2 > ~(1)) /\ (arg2 <= arg1) /\ ((arg1 - arg2) > 0), par{arg1 -> (arg1 - 1)}> ~(1)) /\ (arg2 > ~(1)) /\ (arg2 <= arg1) /\ ((arg1 - arg2) = 0) /\ ((2 * arg1) >= 0), par{arg1 -> ((2 * arg1) + 1), arg2 -> (arg2 + 1)}> undef7, arg2 -> undef8}> Fresh variables: undef1, undef2, undef7, undef8, Undef variables: undef1, undef2, undef7, undef8, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ~(1)) /\ (undef8 > 1) /\ (undef1 > ~(1)) /\ (undef7 > 0)> ~(1)) /\ (arg2 > ~(1)) /\ (arg2 <= arg1) /\ ((arg1 - arg2) > 0), par{arg1 -> (arg1 - 1)}> ~(1)) /\ (arg2 > ~(1)) /\ (arg2 <= arg1) /\ ((arg1 - arg2) = 0) /\ ((2 * arg1) >= 0), par{arg1 -> ((2 * arg1) + 1), arg2 -> (arg2 + 1)}> Fresh variables: undef1, undef2, undef7, undef8, Undef variables: undef1, undef2, undef7, undef8, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg1, rest remain the same}> 1 + 2*arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: 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.004508 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001058s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004459s [12696 : 12697] [12696 : 12698] Successful child: 12697 [ 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: -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + 2*arg1, arg2 -> 1 + arg2, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + 2*arg1, arg2 -> 1 + arg2, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + arg1 <= arg2 - Process 1 * Exit transition: * Postcondition : 1 + arg1 <= arg2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000674s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000819s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg1 <= arg2 , Narrowing transition: -1 + arg1, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + 2*arg1, arg2 -> 1 + arg2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, rest remain the same}> 1 + 2*arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000968s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004688s [12696 : 12702] [12696 : 12703] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020257s Time used: 0.019578 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.042746s Time used: 0.042738 LOG: SAT solveNonLinear - Elapsed time: 0.063003s Cost: 1; Total time: 0.062316 Termination implied by a set of invariant(s): Invariant at l2: arg2 <= 1 + arg1 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + 2*arg1, arg2 -> 1 + 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): -1 + arg1, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + 2*arg1, arg2 -> 1 + arg2, rest remain the same}> Quasi-ranking function: 50000 - arg2 New Graphs: Transitions: -1 + arg1, rest remain the same}> 1 + 2*arg1, arg2 -> 1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000956s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013282s [12696 : 12715] [12696 : 12716] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.051151s Time used: 0.050451 [12696 : 12720] [12696 : 12724] Successful child: 12720 Program does NOT terminate