/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: undef1}> undef8, y_6^0 -> (1 + y_6^0)}> undef18}> undef22}> (1 + x_5^0)}> Fresh variables: undef1, undef8, undef18, undef22, Undef variables: undef1, undef8, undef18, undef22, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (1 + y_6^0)}> undef22, x_5^0 -> (1 + x_5^0)}> Fresh variables: undef1, undef8, undef18, undef22, Undef variables: undef1, undef8, undef18, undef22, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + y_6^0, rest remain the same}> undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> Variables: x_5^0, y_6^0, __disjvr_0^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ( 2 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.003781 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001332s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006993s [53399 : 53400] [53399 : 53401] Successful child: 53400 [ 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 + y_6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + y_6^0, rest remain the same}> New Graphs: LOG: CALL check - Post:y_6^0 <= x_5^0 - Process 1 * Exit transition: * Postcondition : y_6^0 <= x_5^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000386s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000460s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: y_6^0 <= x_5^0 , Narrowing transition: 1 + y_6^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + y_6^0, rest remain the same}> undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> Variables: x_5^0, y_6^0, __disjvr_0^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001309s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007162s [53399 : 53405] [53399 : 53406] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021212s Time used: 0.020644 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.039655s Time used: 0.039652 LOG: SAT solveNonLinear - Elapsed time: 0.060867s Cost: 1; Total time: 0.060296 Termination implied by a set of invariant(s): Invariant at l1: x_5^0 <= y_6^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + y_6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, x_5^0 -> 1 + x_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): 1 + y_6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> Quasi-ranking function: 50000 - y_6^0 New Graphs: Transitions: 1 + y_6^0, rest remain the same}> undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> Variables: __disjvr_0^0, x_5^0, y_6^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001023s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009877s [53399 : 53410] [53399 : 53411] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019019s Time used: 0.01811 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.039191s Time used: 0.039188 LOG: SAT solveNonLinear - Elapsed time: 0.058210s Cost: 1; Total time: 0.057298 Termination implied by a set of invariant(s): Invariant at l1: x_5^0 <= y_6^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + y_6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, x_5^0 -> 1 + x_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): 1 + y_6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> Quasi-ranking function: 50000 - x_5^0 - y_6^0 New Graphs: Transitions: 1 + y_6^0, rest remain the same}> undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> Variables: __disjvr_0^0, x_5^0, y_6^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001294s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015626s [53399 : 53415] [53399 : 53416] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019596s Time used: 0.018805 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.048403s Time used: 0.0484 LOG: SAT solveNonLinear - Elapsed time: 0.067999s Cost: 1; Total time: 0.067205 Termination implied by a set of invariant(s): Invariant at l1: x_5^0 <= 1 + y_6^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + y_6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, x_5^0 -> 1 + x_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): 1 + y_6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> Quasi-ranking function: 50000 - x_5^0 New Graphs: Transitions: 1 + y_6^0, rest remain the same}> undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> Variables: __disjvr_0^0, x_5^0, y_6^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001391s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.016891s [53399 : 53420] [53399 : 53421] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023480s Time used: 0.022142 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.053496s Time used: 0.053493 LOG: SAT solveNonLinear - Elapsed time: 0.076976s Cost: 1; Total time: 0.075635 Quasi-ranking function: 50000 + __disjvr_0^0 - x_5^0 New Graphs: Transitions: 1 + y_6^0, rest remain the same}> undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> Variables: __disjvr_0^0, x_5^0, y_6^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001513s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019168s [53399 : 53425] [53399 : 53426] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023145s Time used: 0.021772 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.042779s Time used: 0.042776 LOG: SAT solveNonLinear - Elapsed time: 0.065924s Cost: 1; Total time: 0.064548 Termination implied by a set of invariant(s): Invariant at l1: x_5^0 <= y_6^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + y_6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, x_5^0 -> 1 + x_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): 1 + y_6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> Quasi-ranking function: 50000 + 2*__disjvr_0^0 - x_5^0 - y_6^0 New Graphs: Transitions: 1 + y_6^0, rest remain the same}> undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> Variables: __disjvr_0^0, x_5^0, y_6^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001738s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.026754s [53399 : 53430] [53399 : 53431] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024724s Time used: 0.02324 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.048451s Time used: 0.048448 LOG: SAT solveNonLinear - Elapsed time: 0.073175s Cost: 1; Total time: 0.071688 Termination implied by a set of invariant(s): Invariant at l1: x_5^0 <= y_6^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + y_6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, x_5^0 -> 1 + x_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): 1 + y_6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> Quasi-ranking function: 50000 - __disjvr_0^0 - x_5^0 - y_6^0 New Graphs: Transitions: 1 + y_6^0, rest remain the same}> undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> Variables: __disjvr_0^0, x_5^0, y_6^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002009s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.042147s [53399 : 53435] [53399 : 53436] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025937s Time used: 0.024262 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.044363s Time used: 0.04436 LOG: SAT solveNonLinear - Elapsed time: 0.070300s Cost: 1; Total time: 0.068622 Termination implied by a set of invariant(s): Invariant at l1: x_5^0 <= 1 + y_6^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + y_6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, x_5^0 -> 1 + x_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): 1 + y_6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> Quasi-ranking function: 50000 - __disjvr_0^0 - x_5^0 New Graphs: Transitions: 1 + y_6^0, rest remain the same}> undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> Variables: __disjvr_0^0, x_5^0, y_6^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002076s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.040486s [53399 : 53548] [53399 : 53549] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026359s Time used: 0.024568 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.046113s Time used: 0.04611 LOG: SAT solveNonLinear - Elapsed time: 0.072471s Cost: 1; Total time: 0.070678 Termination implied by a set of invariant(s): Invariant at l1: x_5^0 <= y_6^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + y_6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, x_5^0 -> 1 + x_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): 1 + y_6^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> Quasi-ranking function: 50000 - __disjvr_0^0 - y_6^0 New Graphs: Transitions: 1 + y_6^0, rest remain the same}> undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> Variables: __disjvr_0^0, x_5^0, y_6^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002199s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.026934s [53399 : 53553] [53399 : 53554] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026616s Time used: 0.024699 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.060389s Time used: 0.060386 LOG: SAT solveNonLinear - Elapsed time: 0.087005s Cost: 1; Total time: 0.085085 Quasi-ranking function: 50000 + __disjvr_0^0 - y_6^0 New Graphs: Transitions: 1 + y_6^0, rest remain the same}> undef22, x_5^0 -> 1 + x_5^0, rest remain the same}> Variables: __disjvr_0^0, x_5^0, y_6^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002432s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.034384s [53399 : 53558] [53399 : 53559] Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026512s Time used: 0.024665 [53399 : 53563] [53399 : 53567] Successful child: 53567 Program does NOT terminate