/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: (0 + undef10), __cil_tmp4_8^0 -> undef10, __retres3_7^0 -> undef12}> ((0 + (~(1) * d_6^0)) + i_5^0)}> (0 + undef31), __cil_tmp4_8^0 -> undef31, __retres3_7^0 -> undef33}> (0 + undef44), __cil_tmp2_10^0 -> undef44, __retres1_9^0 -> undef46}> Fresh variables: undef10, undef12, undef31, undef33, undef44, undef46, Undef variables: undef10, undef12, undef31, undef33, undef44, undef46, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ((0 + (~(1) * d_6^0)) + i_5^0)}> Fresh variables: undef10, undef12, undef31, undef33, undef44, undef46, Undef variables: undef10, undef12, undef31, undef33, undef44, undef46, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -d_6^0 + i_5^0, rest remain the same}> Variables: d_6^0, i_5^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ( 6 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002206 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000836s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001375s [11483 : 11484] [11483 : 11485] Successful child: 11484 [ 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: -d_6^0 + i_5^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -d_6^0 + i_5^0, rest remain the same}> New Graphs: LOG: CALL check - Post:1 + i_5^0 <= 0 - Process 1 * Exit transition: * Postcondition : 1 + i_5^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000342s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000414s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: 1 + i_5^0 <= 0 , Narrowing transition: -d_6^0 + i_5^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -d_6^0 + i_5^0, rest remain the same}> Variables: d_6^0, i_5^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000834s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001488s [11483 : 11489] [11483 : 11490] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006470s Time used: 0.006186 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014294s Time used: 0.014287 LOG: SAT solveNonLinear - Elapsed time: 0.020764s Cost: 1; Total time: 0.020473 Termination implied by a set of invariant(s): Invariant at l3: 1 + d_6^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): -d_6^0 + i_5^0, 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): -d_6^0 + i_5^0, rest remain the same}> Quasi-ranking function: 50000 - i_5^0 New Graphs: Transitions: -d_6^0 + i_5^0, rest remain the same}> Variables: d_6^0, i_5^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000515s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001881s [11483 : 11494] [11483 : 11495] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007255s Time used: 0.0069 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014977s Time used: 0.014971 LOG: SAT solveNonLinear - Elapsed time: 0.022232s Cost: 1; Total time: 0.021871 Quasi-ranking function: 50000 - 2*d_6^0 - i_5^0 New Graphs: Transitions: -d_6^0 + i_5^0, rest remain the same}> Variables: d_6^0, i_5^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000598s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002859s [11483 : 11499] [11483 : 11500] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007379s Time used: 0.006948 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012428s Time used: 0.012422 LOG: SAT solveNonLinear - Elapsed time: 0.019806s Cost: 1; Total time: 0.01937 Termination implied by a set of invariant(s): Invariant at l3: d_6^0 <= 1 + i_5^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -d_6^0 + i_5^0, 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): -d_6^0 + i_5^0, rest remain the same}> Quasi-ranking function: 50000 + d_6^0 - i_5^0 New Graphs: Transitions: -d_6^0 + i_5^0, rest remain the same}> Variables: d_6^0, i_5^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000705s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002667s [11483 : 11504] [11483 : 11505] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007300s Time used: 0.006947 [11483 : 11509] [11483 : 11513] Successful child: 11509 Program does NOT terminate