NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef4, x_5^0 -> undef5}> undef8}> Fresh variables: undef4, undef5, undef8, Undef variables: undef4, undef5, undef8, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef5}> undef8}> Fresh variables: undef4, undef5, undef8, Undef variables: undef4, undef5, undef8, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef8, rest remain the same}> Variables: x_5^0, y_6^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 undef5, rest remain the same}> Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 1 ) ( 3 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.00185 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000545s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001779s Trying to remove transition: undef8, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004211s Time used: 0.004045 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006541s Time used: 0.006203 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011470s Time used: 0.011464 LOG: SAT solveNonLinear - Elapsed time: 0.018011s Cost: 1; Total time: 0.017667 Failed at location 2: 1 + x_5^0 + y_6^0 <= 0 Before Improving: Quasi-invariant at l2: 1 + x_5^0 + y_6^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001862s Remaining time after improvement: 0.999079 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + x_5^0 + y_6^0 <= 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: undef8, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef8, rest remain the same}> New Graphs: Calling Safety with literal 1 + x_5^0 + y_6^0 <= 0 and entry LOG: CALL check - Post:1 + x_5^0 + y_6^0 <= 0 - Process 1 * Exit transition: * Postcondition : 1 + x_5^0 + y_6^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000330s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000400s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + x_5^0 + y_6^0 <= 0 , Narrowing transition: undef8, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef8, rest remain the same}> Variables: x_5^0, y_6^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000566s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001947s Trying to remove transition: undef8, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003934s Time used: 0.003782 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007572s Time used: 0.007173 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010466s Time used: 0.010461 LOG: SAT solveNonLinear - Elapsed time: 0.018037s Cost: 1; Total time: 0.017634 Failed at location 2: 1 + y_6^0 <= 0 Before Improving: Quasi-invariant at l2: 1 + y_6^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002045s Remaining time after improvement: 0.998871 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 1 + y_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): undef8, 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): undef8, rest remain the same}> Ranking function: 2*x_5^0 + y_6^0 New Graphs: Calling Safety with literal 1 + y_6^0 <= 0 and entry LOG: CALL check - Post:1 + y_6^0 <= 0 - Process 2 * Exit transition: * Postcondition : 1 + y_6^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000328s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000396s INVARIANTS: 2: Quasi-INVARIANTS to narrow Graph: 2: 1 + y_6^0 <= 0 , Narrowing transition: undef8, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef8, rest remain the same}> Variables: x_5^0, y_6^0 Checking conditional termination of SCC {l2}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000610s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002139s Trying to remove transition: undef8, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004062s Time used: 0.003904 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007273s Time used: 0.006966 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001126s Time used: 4.00046 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003940s Time used: 1.00043 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008866s Time used: 0.005868 Proving non-termination of subgraph 1 Transitions: undef8, rest remain the same}> Variables: x_5^0, y_6^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001019s Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016952s Time used: 0.016698 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.043137s Time used: 0.043129 LOG: SAT solveNonLinear - Elapsed time: 0.060089s Cost: 2; Total time: 0.059827 Failed at location 2: 0 <= x_5^0 + y_6^0 Before Improving: Quasi-invariant at l2: 0 <= x_5^0 + y_6^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007726s Remaining time after improvement: 0.998339 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.003091s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 0 <= x_5^0 + y_6^0 Strengthening and disabling EXIT transitions... Closed exits from l2: 1 Strengthening exit transition (result): Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef8, rest remain the same}> Checking conditional non-termination of SCC {l2}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018401s Time used: 0.018158 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.021259s Time used: 0.021251 LOG: SAT solveNonLinear - Elapsed time: 0.039659s Cost: 1; Total time: 0.039409 Failed at location 2: 0 <= y_6^0 Before Improving: Quasi-invariant at l2: 0 <= y_6^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007429s Remaining time after improvement: 0.998246 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.002823s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l2: 0 <= y_6^0 Strengthening and disabling EXIT transitions... Closed exits from l2: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef8, rest remain the same}> Calling reachability with... Transition: Conditions: 0 <= x_5^0 + y_6^0, 0 <= y_6^0, OPEN EXITS: (condsUp: 0 <= y_6^0) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 0 <= x_5^0 + y_6^0, 0 <= y_6^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate