NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef1}> undef8, y_6^0 -> (~(1) + y_6^0)}> undef18}> undef22}> 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}> 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, 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.003931 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001268s Ranking function: -1 - x_5^0 + y_6^0 New Graphs: Transitions: undef22, 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.000555s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002010s Trying to remove transition: undef22, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006415s Time used: 0.006236 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012472s Time used: 0.012002 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021806s Time used: 0.021797 LOG: SAT solveNonLinear - Elapsed time: 0.034278s Cost: 1; Total time: 0.033799 Failed at location 1: y_6^0 <= x_5^0 Before Improving: Quasi-invariant at l1: y_6^0 <= x_5^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003390s Remaining time after improvement: 0.998717 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: y_6^0 <= x_5^0 [ 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, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef22, rest remain the same}> New Graphs: Calling Safety with literal y_6^0 <= x_5^0 and entry 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.000429s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000510s 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, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + y_6^0, rest remain the same}> undef22, 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.001217s Ranking function: -1 - x_5^0 + y_6^0 New Graphs: Transitions: undef22, 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.000564s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002070s Trying to remove transition: undef22, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.005754s Time used: 0.005596 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011267s Time used: 0.010835 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001734s Time used: 4.0006 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.004907s Time used: 1.0001 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022069s Time used: 0.008562 Proving non-termination of subgraph 1 Transitions: -1 + y_6^0, rest remain the same}> undef22, rest remain the same}> Variables: x_5^0, y_6^0, __disjvr_0^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000987s Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.004980s Time used: 5.00426 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.011894s Time used: 5.00145 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.011327s Time used: 5.00021 > Checking if the negation of the conditions of every pending exit is quasi-invariant... NO Proving non-termination of subgraph 1 Transitions: undef22, rest remain the same}> Variables: __disjvr_0^0, x_5^0, y_6^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001150s Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018082s Time used: 0.017824 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.025762s Time used: 0.025752 LOG: SAT solveNonLinear - Elapsed time: 0.043844s Cost: 1; Total time: 0.043576 Failed at location 1: 1 + x_5^0 <= y_6^0 Before Improving: Quasi-invariant at l1: 1 + x_5^0 <= y_6^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009053s Remaining time after improvement: 0.998235 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.003335s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + x_5^0 <= y_6^0 Strengthening and disabling EXIT transitions... Closed exits from l1: 1 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}> Calling reachability with... Transition: Conditions: 1 + x_5^0 <= y_6^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 + x_5^0 <= y_6^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate