/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) /\ (undef2 > ~(1)) /\ (1 = arg2), par{arg1 -> 0, arg2 -> undef2}> ~(1)) /\ (arg2 > 1) /\ (undef4 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef3, arg2 -> undef4}> 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + arg1)}> 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + arg1)}> undef9, arg2 -> undef10}> Fresh variables: undef2, undef3, undef4, undef9, undef10, Undef variables: undef2, undef3, undef4, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0) /\ (undef2 > ~(1)) /\ (1 = undef10), par{arg1 -> 0, arg2 -> undef2}> ~(1)) /\ (undef10 > 1) /\ (undef4 > ~(1)) /\ (undef9 > 0), par{arg1 -> undef3, arg2 -> undef4}> 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + arg1)}> 0), par{arg1 -> (arg1 - 1), arg2 -> (arg2 + arg1)}> Fresh variables: undef2, undef3, undef4, undef9, undef10, Undef variables: undef2, undef3, undef4, undef9, undef10, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> Variables: arg1, arg2 Graph 2: Transitions: -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> Variables: arg1, arg2 Precedence: Graph 0 Graph 1 undef3, arg2 -> undef4, rest remain the same}> Graph 2 0, arg2 -> undef2, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 2 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002091 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000487s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001357s [24805 : 24806] [24805 : 24807] Successful child: 24806 [ 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, arg2 -> 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): -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> Ranking function: arg2 New Graphs: LOG: CALL check - Post:arg1 + arg2 <= 0 - Process 1 * Exit transition: undef3, arg2 -> undef4, rest remain the same}> * Postcondition : arg1 + arg2 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000478s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000597s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: arg1 + arg2 <= 0 , Narrowing transition: -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000583s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002165s [24805 : 24811] [24805 : 24812] Successful child: 24811 [ 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, arg2 -> 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): -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> Ranking function: arg1 + arg2 New Graphs: LOG: CALL check - Post:arg1 <= 0 - Process 2 * Exit transition: undef3, arg2 -> undef4, rest remain the same}> * Postcondition : arg1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000453s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000578s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: arg1 <= 0 , Narrowing transition: -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000849s Ranking function: -1 + arg1 New Graphs: Proving termination of subgraph 2 Checking unfeasibility... Time used: 0.001903 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000511s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001427s [24805 : 24816] [24805 : 24817] Successful child: 24816 [ 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, arg2 -> 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 It's unfeasible. Removing transition: -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> New Graphs: LOG: CALL check - Post:arg2 <= 0 - Process 3 * Exit transition: 0, arg2 -> undef2, rest remain the same}> * Postcondition : arg2 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000490s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000589s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: arg2 <= 0 , Narrowing transition: -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000455s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001470s [24805 : 24821] [24805 : 24822] Successful child: 24821 [ 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, arg2 -> 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): -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> Ranking function: 1 + arg1 New Graphs: [24805 : 24826] [24805 : 24827] INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + arg1 <= arg2 , arg2 <= 1 , arg2 <= 2 + arg1 , Narrowing transition: -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001656s Ranking function: 2 + arg1 New Graphs: Transitions: -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000917s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006864s Piecewise ranking function: min(0,(~(22) / 3) - 4*arg1 + (17 / 3)*arg2) New Graphs: Transitions: -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000579s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001998s [24805 : 24828] [24805 : 24829] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013580s Time used: 0.013184 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000355s Time used: 1.00036 LOG: SAT solveNonLinear - Elapsed time: 1.013935s Cost: 1; Total time: 1.01354 Termination implied by a set of invariant(s): Invariant at l2: arg1 <= 1 [ 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, arg2 -> arg1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + arg1, arg2 -> 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): -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> Quasi-ranking function: 50000 + 2*arg1 + arg2 New Graphs: Transitions: -1 + arg1, arg2 -> arg1 + arg2, rest remain the same}> Variables: arg1, arg2 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001064s Ranking function: (~(4) / 50003) + (2 / 50003)*arg2 New Graphs: INVARIANTS: 2: arg1 <= 1 , Quasi-INVARIANTS to narrow Graph: 2: Program Terminates