NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef5, temp6_11^0 -> undef8, x_10^0 -> (0 + undef8)}> undef10, nondet_8^0 -> undef15, temp5_9^0 -> undef16}> undef24, temp5_9^0 -> (0 + undef24)}> undef29}> (1 + x_10^0)}> undef46, nondet_8^0 -> undef51, temp5_9^0 -> undef52}> undef60, temp5_9^0 -> (0 + undef60)}> undef66}> (1 + x_10^0)}> undef91, nondet_8^0 -> undef96, temp5_9^0 -> undef97}> undef105, temp5_9^0 -> (0 + undef105)}> undef112}> (1 + x_10^0)}> Fresh variables: undef5, undef8, undef10, undef15, undef16, undef24, undef29, undef46, undef51, undef52, undef60, undef66, undef91, undef96, undef97, undef105, undef112, Undef variables: undef5, undef8, undef10, undef15, undef16, undef24, undef29, undef46, undef51, undef52, undef60, undef66, undef91, undef96, undef97, undef105, undef112, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (0 + undef8)}> undef112, x_10^0 -> (1 + (0 + undef8))}> undef66, x_10^0 -> (1 + x_10^0)}> Fresh variables: undef5, undef8, undef10, undef15, undef16, undef24, undef29, undef46, undef51, undef52, undef60, undef66, undef91, undef96, undef97, undef105, undef112, Undef variables: undef5, undef8, undef10, undef15, undef16, undef24, undef29, undef46, undef51, undef52, undef60, undef66, undef91, undef96, undef97, undef105, undef112, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef66, x_10^0 -> 1 + x_10^0, rest remain the same}> Variables: __disjvr_1^0, x_10^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 undef112, x_10^0 -> 1 + undef8, rest remain the same}> Graph 2 undef8, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 4 , 2 ) ( 7 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.002264 Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000598s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001854s Trying to remove transition: undef66, x_10^0 -> 1 + x_10^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004869s Time used: 0.004712 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002701s Time used: 4.00176 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007435s Time used: 4.00096 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003802s Time used: 1.00041 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009929s Time used: 0.006483 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013312s Time used: 0.013305 LOG: SAT solveNonLinear - Elapsed time: 0.023241s Cost: 1; Total time: 0.019788 Quasi-ranking function: 50000 - x_10^0 New Graphs: Transitions: undef66, x_10^0 -> 1 + x_10^0, rest remain the same}> Variables: __disjvr_1^0, x_10^0 Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000536s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001858s Trying to remove transition: undef66, x_10^0 -> 1 + x_10^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004804s Time used: 0.004651 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.005143s Time used: 4.00424 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006189s Time used: 4.00071 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004479s Time used: 1.00052 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010812s Time used: 0.006967 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.015351s Time used: 0.015343 LOG: SAT solveNonLinear - Elapsed time: 0.026163s Cost: 1; Total time: 0.02231 Quasi-ranking function: 50000 + __disjvr_1^0 - x_10^0 New Graphs: Transitions: undef66, x_10^0 -> 1 + x_10^0, rest remain the same}> Variables: __disjvr_1^0, x_10^0 Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000659s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002588s Trying to remove transition: undef66, x_10^0 -> 1 + x_10^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005338s Time used: 0.005165 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003028s Time used: 4.0018 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007179s Time used: 4.00081 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004721s Time used: 1.00085 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011846s Time used: 0.008511 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.017456s Time used: 0.01744 LOG: SAT solveNonLinear - Elapsed time: 0.029303s Cost: 1; Total time: 0.025951 Termination implied by a set of invariant(s): Invariant at l7: 1 <= x_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): undef66, x_10^0 -> 1 + x_10^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): undef66, x_10^0 -> 1 + x_10^0, rest remain the same}> Quasi-ranking function: 50000 - __disjvr_1^0 - x_10^0 New Graphs: Transitions: undef66, x_10^0 -> 1 + x_10^0, rest remain the same}> Variables: __disjvr_1^0, x_10^0 Checking conditional termination of SCC {l7}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000746s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002957s Trying to remove transition: undef66, x_10^0 -> 1 + x_10^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006383s Time used: 0.006201 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 2.790130s Time used: 2.78928 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.998428s Time used: 0.993982 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.981828s Time used: 0.979114 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012097s Time used: 0.008821 Termination failed. Trying to show unreachability... Proving unreachability of entry: undef112, x_10^0 -> 1 + undef8, rest remain the same}> LOG: CALL check - Post:1 <= 0 - Process 1 * Exit transition: undef112, x_10^0 -> 1 + undef8, rest remain the same}> * Postcondition : 1 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001339s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001438s Cannot prove unreachability Proving non-termination of subgraph 1 Transitions: undef66, x_10^0 -> 1 + x_10^0, rest remain the same}> Variables: __disjvr_1^0, x_10^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001042s Checking conditional non-termination of SCC {l7}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014711s Time used: 0.0146 LOG: SAT solveNonLinear - Elapsed time: 0.014711s Cost: 0; Total time: 0.0146 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.003610s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l7: 1 <= x_10^0 Strengthening and disabling EXIT transitions... Closed exits from l7: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef66, x_10^0 -> 1 + x_10^0, rest remain the same}> Calling reachability with... Transition: Conditions: 1 <= x_10^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: undef112, x_10^0 -> 1 + undef8, rest remain the same}> Conditions: 1 <= x_10^0, OPEN EXITS: undef112, x_10^0 -> 1 + undef8, rest remain the same}> > Conditions are reachable! Program does NOT terminate