NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef12, up5^0 -> (~(1) + low6^0)}> undef33, tmp^0 -> (0 + undef33)}> undef41}> (1 + mid4^0)}> (~(1) + mid4^0)}> ~(1), low6^0 -> 0, up5^0 -> (0 + __const_14^0), x2^0 -> (0 + __const_8^0)}> Fresh variables: undef12, undef33, undef41, Undef variables: undef12, undef33, undef41, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: (1 + undef41)}> (~(1) + undef41)}> undef12, up5^0 -> (~(1) + low6^0)}> (1 + undef41)}> (~(1) + undef41)}> Fresh variables: undef12, undef33, undef41, Undef variables: undef12, undef33, undef41, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: 1 + undef41, rest remain the same}> -1 + undef41, rest remain the same}> undef12, up5^0 -> -1 + low6^0, rest remain the same}> 1 + undef41, rest remain the same}> -1 + undef41, rest remain the same}> Variables: low6^0, up5^0, fvalue3^0 Graph 2: Transitions: Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 3 , 1 ) ( 5 , 2 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.013152 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002072s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008241s Piecewise ranking function: min(1 - 3*low6^0 + 3*up5^0,0) New Graphs: Transitions: 1 + undef41, rest remain the same}> -1 + undef41, rest remain the same}> 1 + undef41, rest remain the same}> -1 + undef41, rest remain the same}> Variables: low6^0, up5^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001144s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006219s Trying to remove transition: -1 + undef41, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010614s Time used: 0.010217 Trying to remove transition: 1 + undef41, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009903s Time used: 0.008957 Trying to remove transition: -1 + undef41, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009754s Time used: 0.008887 Trying to remove transition: 1 + undef41, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009758s Time used: 0.008872 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.053440s Time used: 0.05234 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.119659s Time used: 0.119646 LOG: SAT solveNonLinear - Elapsed time: 0.173099s Cost: 1; Total time: 0.171986 Failed at location 3: 1 + up5^0 <= low6^0 Before Improving: Quasi-invariant at l3: 1 + up5^0 <= low6^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.016491s Remaining time after improvement: 0.99638 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 + up5^0 <= low6^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 + undef41, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + undef41, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: undef12, up5^0 -> -1 + low6^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 + undef41, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + undef41, rest remain the same}> [ Termination 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 + undef41, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + undef41, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + undef41, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: -1 + undef41, rest remain the same}> New Graphs: Calling Safety with literal 1 + up5^0 <= low6^0 and entry LOG: CALL check - Post:1 + up5^0 <= low6^0 - Process 1 * Exit transition: * Postcondition : 1 + up5^0 <= low6^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000911s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001036s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: 1 + up5^0 <= low6^0 , Narrowing transition: 1 + undef41, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + undef41, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: undef12, up5^0 -> -1 + low6^0, rest remain the same}> Narrowing transition: 1 + undef41, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: -1 + undef41, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: 1 + undef41, rest remain the same}> -1 + undef41, rest remain the same}> 1 + undef41, rest remain the same}> -1 + undef41, rest remain the same}> Variables: low6^0, up5^0, fvalue3^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001185s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006367s Trying to remove transition: -1 + undef41, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009563s Time used: 0.009173 Trying to remove transition: 1 + undef41, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010030s Time used: 0.008967 Trying to remove transition: -1 + undef41, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010130s Time used: 0.009096 Trying to remove transition: 1 + undef41, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009958s Time used: 0.00896 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.030453s Time used: 0.02945 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.004565s Time used: 4.00132 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.029639s Time used: 1.0013 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.038087s Time used: 0.034033 Proving non-termination of subgraph 1 Transitions: 1 + undef41, rest remain the same}> -1 + undef41, rest remain the same}> 1 + undef41, rest remain the same}> -1 + undef41, rest remain the same}> Variables: low6^0, up5^0, fvalue3^0 Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033212s Time used: 0.032888 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.139486s Time used: 0.139472 LOG: SAT solveNonLinear - Elapsed time: 0.172699s Cost: 1; Total time: 0.17236 Failed at location 3: 1 + low6^0 <= up5^0 Before Improving: Quasi-invariant at l3: 1 + low6^0 <= up5^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.025962s Remaining time after improvement: 0.998025 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.004614s Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 + low6^0 <= up5^0 Constraint over undef '1 + undef41 <= low6^0' in transition: 1 + undef41, rest remain the same}> Constraint over undef '1 + up5^0 <= undef41' in transition: -1 + undef41, rest remain the same}> Constraint over undef '1 + undef41 <= low6^0' in transition: 1 + undef41, rest remain the same}> Constraint over undef '1 + up5^0 <= undef41' in transition: -1 + undef41, rest remain the same}> Strengthening and disabling EXIT transitions... Closed exits from l3: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + undef41, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + undef41, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + undef41, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + undef41, rest remain the same}> Calling reachability with... Transition: Conditions: 1 + low6^0 <= up5^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 + low6^0 <= up5^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate