NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: 1}> undef3}> 0}> Fresh variables: undef3, Undef variables: undef3, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef3, b^0 -> 0}> Fresh variables: undef3, Undef variables: undef3, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef3, b^0 -> 0, rest remain the same}> Variables: __disjvr_0^0, b^0 Precedence: Graph 0 Graph 1 Map Locations to Subgraph: ( 0 , 0 ) ( 1 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.001907 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000547s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001655s Trying to remove transition: undef3, b^0 -> 0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004232s Time used: 0.004069 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006434s Time used: 0.006094 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011553s Time used: 0.011547 LOG: SAT solveNonLinear - Elapsed time: 0.017986s Cost: 1; Total time: 0.017641 Failed at location 1: 1 + b^0 <= 0 Before Improving: Quasi-invariant at l1: 1 + b^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002252s Remaining time after improvement: 0.998727 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + b^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: undef3, b^0 -> 0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef3, b^0 -> 0, rest remain the same}> New Graphs: Calling Safety with literal 1 + b^0 <= 0 and entry LOG: CALL check - Post:1 + b^0 <= 0 - Process 1 * Exit transition: * Postcondition : 1 + b^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000312s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000376s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + b^0 <= 0 , Narrowing transition: undef3, b^0 -> 0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef3, b^0 -> 0, rest remain the same}> Variables: __disjvr_0^0, b^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000496s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001585s Trying to remove transition: undef3, b^0 -> 0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003703s Time used: 0.00356 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007294s Time used: 0.007003 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.015602s Time used: 4.01494 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.003886s Time used: 1.00046 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007454s Time used: 0.004581 Proving non-termination of subgraph 1 Transitions: undef3, b^0 -> 0, rest remain the same}> Variables: __disjvr_0^0, b^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001060s Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017844s Time used: 0.017614 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.026894s Time used: 0.026888 LOG: SAT solveNonLinear - Elapsed time: 0.044738s Cost: 1; Total time: 0.044502 Failed at location 1: 0 <= b^0 Before Improving: Quasi-invariant at l1: 0 <= b^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007006s Remaining time after improvement: 0.998077 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.002315s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 0 <= b^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): undef3, b^0 -> 0, rest remain the same}> Calling reachability with... Transition: Conditions: 0 <= b^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 0 <= b^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate