NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef1}> Fresh variables: undef1, Undef variables: undef1, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef1}> Fresh variables: undef1, Undef variables: undef1, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef1, rest remain the same}> Variables: x^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.001497 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000541s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001919s Trying to remove transition: undef1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003608s Time used: 0.003455 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001579s Time used: 4.00108 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.006655s Time used: 4.001 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.007875s Time used: 1.00053 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006918s Time used: 0.004528 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.007926s Time used: 0.007921 LOG: SAT solveNonLinear - Elapsed time: 0.014844s Cost: 1; Total time: 0.012449 Quasi-ranking function: 50000 - x^0 New Graphs: Transitions: undef1, rest remain the same}> Variables: x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000586s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002240s Trying to remove transition: undef1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004040s Time used: 0.003889 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.751312s Time used: 1.75094 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.270436s Time used: 0.270401 LOG: SAT solveNonLinear - Elapsed time: 2.021748s Cost: 1; Total time: 2.02135 Failed at location 1: 831 + x^0 <= 0 Before Improving: Quasi-invariant at l1: 831 + x^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010172s Remaining time after improvement: 0.997755 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 831 + x^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: undef1, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef1, rest remain the same}> New Graphs: Calling Safety with literal 831 + x^0 <= 0 and entry LOG: CALL check - Post:831 + x^0 <= 0 - Process 1 * Exit transition: * Postcondition : 831 + x^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001919s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001990s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 831 + x^0 <= 0 , Narrowing transition: undef1, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef1, rest remain the same}> Variables: x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000639s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002416s Trying to remove transition: undef1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.003991s Time used: 0.003838 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002220s Time used: 4.00176 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.012857s Time used: 4.00121 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.022907s Time used: 1.01001 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020081s Time used: 0.006167 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010558s Time used: 0.010552 LOG: SAT solveNonLinear - Elapsed time: 0.030639s Cost: 1; Total time: 0.016719 Quasi-ranking function: 50000 - x^0 New Graphs: Transitions: undef1, rest remain the same}> Variables: x^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000610s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002384s Trying to remove transition: undef1, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.004526s Time used: 0.004374 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002895s Time used: 4.00293 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.012446s Time used: 4.00167 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.013544s Time used: 1.00104 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007729s Time used: 0.004764 Proving non-termination of subgraph 1 Transitions: undef1, rest remain the same}> Variables: x^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000687s Checking conditional non-termination of SCC {l1}... > No assignment for some undef value. > Checking if the negation of the conditions of every pending exit is quasi-invariant... YES Calling reachability with... Transition: Conditions: 0 <= 830 + x^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 0 <= 830 + x^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate