/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files -------------------------------------------------------------------------------- NO Solver Timeout: 4 Global Timeout: 300 Maximum number of concurrent processes: 900 No parsing errors! Init Location: 0 Transitions: undef3}> undef8, i_13^0 -> undef9}> (0 + st_14^0)}> undef22, i_20^0 -> undef23}> Fresh variables: undef3, undef8, undef9, undef13, undef22, undef23, Undef variables: undef3, undef8, undef9, undef13, undef22, undef23, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef22}> Fresh variables: undef3, undef8, undef9, undef13, undef22, undef23, Undef variables: undef3, undef8, undef9, undef13, undef22, undef23, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef22, rest remain the same}> Variables: __const_10^0, i_13^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 4 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002167 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000746s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003039s [16582 : 16592] [16582 : 16593] Successful child: 16592 [ 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: undef22, 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: undef22, rest remain the same}> New Graphs: LOG: CALL check - Post:__const_10^0 <= 0 - Process 1 * Exit transition: * Postcondition : __const_10^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000449s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000546s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: __const_10^0 <= 0 , 0 <= i_13^0 , Narrowing transition: undef22, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: undef22, rest remain the same}> undef22, rest remain the same}> Variables: __const_10^0, i_13^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001474s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009242s [16582 : 16638] [16582 : 16639] Successful child: 16638 [ 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: undef22, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, 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: undef22, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, rest remain the same}> New Graphs: Transitions: undef22, rest remain the same}> Variables: __const_10^0, i_13^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000814s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002989s [16582 : 16643] [16582 : 16644] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008711s Time used: 0.008064 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000516s Time used: 1.00037 LOG: SAT solveNonLinear - Elapsed time: 1.009227s Cost: 1; Total time: 1.00843 Termination implied by a set of invariant(s): Invariant at l2: 1 <= __const_10^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, 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): undef22, rest remain the same}> Quasi-ranking function: 50000 - __const_10^0 + i_13^0 New Graphs: Transitions: undef22, rest remain the same}> Variables: __const_10^0, i_13^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000819s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004112s [16582 : 16994] [16582 : 16995] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010322s Time used: 0.009558 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000559s Time used: 1.00044 LOG: SAT solveNonLinear - Elapsed time: 1.010881s Cost: 1; Total time: 1.01 Termination implied by a set of invariant(s): Invariant at l2: i_13^0 <= 0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, 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): undef22, rest remain the same}> Quasi-ranking function: 50000 + i_13^0 New Graphs: Transitions: undef22, rest remain the same}> Variables: __const_10^0, i_13^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000892s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003936s [16582 : 17265] [16582 : 17266] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011105s Time used: 0.010283 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001722s Time used: 1.00144 LOG: SAT solveNonLinear - Elapsed time: 1.012826s Cost: 1; Total time: 1.01172 Quasi-ranking function: 50000 + __const_10^0 + i_13^0 New Graphs: Transitions: undef22, rest remain the same}> Variables: __const_10^0, i_13^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000987s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004130s [16582 : 17594] [16582 : 17595] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.101963s Time used: 4.10065 [16582 : 18269] [16582 : 18271] Successful child: 18269 Program does NOT terminate