YES Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ((0 + x^0) + y^0), y^0 -> ((0 + y^0) + (~(1) * z^0)), z^0 -> (1 + z^0)}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ((0 + x^0) + y^0), y^0 -> ((0 + y^0) + (~(1) * z^0)), z^0 -> (1 + z^0)}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^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.00223 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000847s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001993s Trying to remove transition: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007341s Time used: 0.007187 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008102s Time used: 0.007679 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012806s Time used: 0.0128 LOG: SAT solveNonLinear - Elapsed time: 0.020908s Cost: 1; Total time: 0.020479 Failed at location 1: x^0 <= 0 Before Improving: Quasi-invariant at l1: x^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001972s Remaining time after improvement: 0.999173 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 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: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> New Graphs: Calling Safety with literal x^0 <= 0 and entry LOG: CALL check - Post:x^0 <= 0 - Process 1 * Exit transition: * Postcondition : x^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000322s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000384s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: x^0 <= 0 , Narrowing transition: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000769s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001988s Trying to remove transition: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006318s Time used: 0.006189 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003747s Time used: 4.00313 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.064311s Time used: 0.058996 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000812s Time used: 1.00076 LOG: SAT solveNonLinear - Elapsed time: 1.065123s Cost: 2; Total time: 1.05975 Failed at location 1: x^0 + y^0 + z^0 <= 0 Failed at location 1: 1 <= z^0 Before Improving: Quasi-invariant at l1: x^0 + y^0 + z^0 <= 0 Quasi-invariant at l1: 1 <= z^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007774s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001228s Remaining time after improvement: 0.996588 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: x^0 + y^0 + z^0 <= 0 Quasi-invariant at l1: 0 <= z^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, 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): x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Ranking function: x^0 New Graphs: Calling Safety with literal x^0 + y^0 + z^0 <= 0 and entry LOG: CALL check - Post:x^0 + y^0 + z^0 <= 0 - Process 2 * Exit transition: * Postcondition : x^0 + y^0 + z^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000360s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000443s Calling Safety with literal 0 <= z^0 and entry LOG: CALL check - Post:0 <= z^0 - Process 3 * Exit transition: * Postcondition : 0 <= z^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000354s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000423s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: x^0 + y^0 + z^0 <= 0 , 0 <= z^0 , Narrowing transition: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001487s Ranking function: -z^0 New Graphs: Transitions: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000624s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002314s Trying to remove transition: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008155s Time used: 0.007992 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023037s Time used: 0.022457 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000596s Time used: 1.00054 LOG: SAT solveNonLinear - Elapsed time: 1.023633s Cost: 2; Total time: 1.02299 Failed at location 1: 1 + x^0 + y^0 <= z^0 Failed at location 1: 1 + x^0 + y^0 <= z^0 Before Improving: Quasi-invariant at l1: 1 + x^0 + y^0 <= z^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007349s Remaining time after improvement: 0.997696 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + x^0 + y^0 <= z^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, 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): x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Ranking function: 2 + x^0 + y^0 + z^0 New Graphs: Calling Safety with literal 1 + x^0 + y^0 <= z^0 and entry LOG: CALL check - Post:1 + x^0 + y^0 <= z^0 - Process 4 * Exit transition: * Postcondition : 1 + x^0 + y^0 <= z^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000487s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000591s Calling Safety with literal 1 + x^0 + y^0 <= z^0 and entry LOG: CALL check - Post:1 + x^0 + y^0 <= z^0 - Process 5 * Exit transition: * Postcondition : 1 + x^0 + y^0 <= z^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000442s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000537s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + x^0 + y^0 <= z^0 , Narrowing transition: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001735s Ranking function: 1 - z^0 New Graphs: Transitions: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000726s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003005s Trying to remove transition: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012598s Time used: 0.012426 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.029437s Time used: 0.028738 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000592s Time used: 1.00052 LOG: SAT solveNonLinear - Elapsed time: 1.030029s Cost: 2; Total time: 1.02926 Failed at location 1: x^0 + y^0 <= 1 + z^0 Failed at location 1: x^0 + y^0 <= 1 + z^0 Before Improving: Quasi-invariant at l1: x^0 + y^0 <= 1 + z^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007156s Remaining time after improvement: 0.997503 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: x^0 + y^0 <= 1 + z^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, 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): x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Ranking function: 2 + x^0 + y^0 - z^0 New Graphs: Calling Safety with literal x^0 + y^0 <= 1 + z^0 and entry LOG: CALL check - Post:x^0 + y^0 <= 1 + z^0 - Process 6 * Exit transition: * Postcondition : x^0 + y^0 <= 1 + z^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000557s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000676s Calling Safety with literal x^0 + y^0 <= 1 + z^0 and entry LOG: CALL check - Post:x^0 + y^0 <= 1 + z^0 - Process 7 * Exit transition: * Postcondition : x^0 + y^0 <= 1 + z^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000510s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000622s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: x^0 + y^0 <= 1 + z^0 , Narrowing transition: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001924s Ranking function: -1 - z^0 New Graphs: Transitions: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000771s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003079s Trying to remove transition: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010953s Time used: 0.010781 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.017464s Time used: 4.01677 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.271209s Time used: 0.219885 Improving Solution with cost 3 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000806s Time used: 1.00075 LOG: SAT solveNonLinear - Elapsed time: 1.272015s Cost: 3; Total time: 1.22064 Failed at location 1: 1 + y^0 + z^0 <= 0 Failed at location 1: 1 <= z^0 Failed at location 1: 1 <= z^0 Before Improving: Quasi-invariant at l1: 1 + y^0 + z^0 <= 0 Quasi-invariant at l1: 1 <= z^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014137s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002739s Remaining time after improvement: 0.993192 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: y^0 + z^0 <= 1 Quasi-invariant at l1: 1 <= z^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: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, 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): x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Ranking function: x^0 + y^0 New Graphs: Calling Safety with literal 1 <= z^0 and entry LOG: CALL check - Post:1 <= z^0 - Process 8 * Exit transition: * Postcondition : 1 <= z^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000618s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000719s Calling Safety with literal y^0 + z^0 <= 1 and entry LOG: CALL check - Post:y^0 + z^0 <= 1 - Process 9 * Exit transition: * Postcondition : y^0 + z^0 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000565s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000664s Calling Safety with literal 1 <= z^0 and entry LOG: CALL check - Post:1 <= z^0 - Process 10 * Exit transition: * Postcondition : 1 <= z^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000559s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000650s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 <= z^0 , y^0 + z^0 <= 1 , Narrowing transition: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002904s Ranking function: -1 - z^0 New Graphs: Transitions: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002276s Ranking function: -z^0 New Graphs: Transitions: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000939s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004963s Trying to remove transition: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016350s Time used: 0.016155 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001614s Time used: 4.00091 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.354942s Time used: 0.346914 Improving Solution with cost 5 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.769770s Time used: 0.769727 Improving Solution with cost 3 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000796s Time used: 1.00071 LOG: SAT solveNonLinear - Elapsed time: 2.125508s Cost: 3; Total time: 2.11735 Failed at location 1: 7 <= z^0 Failed at location 1: 7 <= z^0 Failed at location 1: 7 <= z^0 Before Improving: Quasi-invariant at l1: 7 <= z^0 Quasi-invariant at l1: 0 <= x^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.035743s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005753s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005461s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004043s Remaining time after improvement: 0.979697 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 4 <= z^0 Quasi-invariant at l1: 0 <= x^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: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, 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): x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Ranking function: 2*y^0 + 2*z^0 New Graphs: Calling Safety with literal 4 <= z^0 and entry LOG: CALL check - Post:4 <= z^0 - Process 11 * Exit transition: * Postcondition : 4 <= z^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000704s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000817s Calling Safety with literal 4 <= z^0 and entry LOG: CALL check - Post:4 <= z^0 - Process 12 * Exit transition: * Postcondition : 4 <= z^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000687s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000787s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 0 <= x^0 , 4 <= z^0 , Narrowing transition: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> y^0 - z^0, z^0 -> 1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003126s Ranking function: 3 - z^0 New Graphs: Program Terminates