YES Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ((0 + x^0) + z^0), z^0 -> (~(1) + z^0)}> ((0 + x^0) + y^0), y^0 -> (~(1) + y^0)}> Fresh variables: Undef variables: Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ((0 + x^0) + z^0), z^0 -> (~(1) + z^0)}> ((0 + x^0) + y^0), y^0 -> (~(1) + y^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 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Variables: x^0, z^0, y^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.003808 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000837s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002764s Trying to remove transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008299s Time used: 0.008106 Trying to remove transition: x^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.008510s Time used: 0.008061 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.022353s Time used: 0.02176 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.041102s Time used: 0.041092 LOG: SAT solveNonLinear - Elapsed time: 0.063455s Cost: 1; Total time: 0.062852 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.005100s Remaining time after improvement: 0.998705 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 + 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 -> -1 + y^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 It's unfeasible. Removing transition: x^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 -> -1 + y^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.000419s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000481s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: x^0 <= 0 , Narrowing transition: x^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 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Variables: x^0, z^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000759s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002871s Trying to remove transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007409s Time used: 0.007253 Trying to remove transition: x^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.008608s Time used: 0.008103 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001774s Time used: 4.00087 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.136064s Time used: 0.1304 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000801s Time used: 1.0007 LOG: SAT solveNonLinear - Elapsed time: 1.136865s Cost: 2; Total time: 1.1311 Failed at location 1: 1 + x^0 + y^0 <= z^0 Failed at location 1: x^0 + z^0 <= 0 Before Improving: Quasi-invariant at l1: 1 + x^0 + y^0 <= z^0 Quasi-invariant at l1: x^0 + z^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019058s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002458s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001753s Remaining time after improvement: 0.993131 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: x^0 + y^0 <= 1 + z^0 Quasi-invariant at l1: x^0 + z^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): x^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 -> -1 + y^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 + 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 -> -1 + y^0, rest remain the same}> Ranking function: x^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 2 * Exit transition: * Postcondition : x^0 + y^0 <= 1 + z^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000448s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000532s Calling Safety with literal x^0 + z^0 <= 0 and entry LOG: CALL check - Post:x^0 + z^0 <= 0 - Process 3 * Exit transition: * Postcondition : x^0 + z^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000417s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000491s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: x^0 + z^0 <= 0 , x^0 + y^0 <= 1 + z^0 , Narrowing transition: x^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 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Variables: x^0, z^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001945s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014461s Piecewise ranking function: min(0,-3 + 3*x^0) New Graphs: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^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.001608s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013208s Trying to remove transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015507s Time used: 0.014898 Trying to remove transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023310s Time used: 0.022107 Trying to remove transition: x^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.011435s Time used: 0.010224 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002199s Time used: 4.00098 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.331483s Time used: 0.320115 Improving Solution with cost 3 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.006397s Time used: 1.00627 LOG: SAT solveNonLinear - Elapsed time: 1.337880s Cost: 3; Total time: 1.32639 Failed at location 1: x^0 + z^0 <= 0 Failed at location 1: x^0 + y^0 <= 1 Failed at location 1: x^0 + y^0 <= 1 Before Improving: Quasi-invariant at l1: x^0 + z^0 <= 0 Quasi-invariant at l1: x^0 + y^0 <= 1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.044601s Remaining time after improvement: 0.994981 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: x^0 + z^0 <= 0 Quasi-invariant at l1: x^0 + y^0 <= 1 [ 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 + 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 + 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 -> -1 + y^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 -> -1 + y^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: x^0 + y^0, y^0 -> -1 + y^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 + 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 -> -1 + y^0, rest remain the same}> New Graphs: Transitions: x^0 + y^0, y^0 -> -1 + y^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.001387s Ranking function: -2 + y^0 - 2*z^0 New Graphs: Calling Safety with literal x^0 + y^0 <= 1 and entry LOG: CALL check - Post:x^0 + y^0 <= 1 - Process 4 * Exit transition: * Postcondition : x^0 + y^0 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000747s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000846s Calling Safety with literal x^0 + z^0 <= 0 and entry LOG: CALL check - Post:x^0 + z^0 <= 0 - Process 5 * Exit transition: * Postcondition : x^0 + z^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000696s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000781s Calling Safety with literal x^0 + y^0 <= 1 and entry LOG: CALL check - Post:x^0 + y^0 <= 1 - Process 6 * Exit transition: * Postcondition : x^0 + y^0 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000716s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000822s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: x^0 + z^0 <= 0 , x^0 + y^0 <= 1 , Narrowing transition: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: x^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 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Variables: x^0, z^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002351s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.019073s Piecewise ranking function: min(0,-3 + 3*x^0) New Graphs: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^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.001786s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014967s Trying to remove transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013398s Time used: 0.012732 Trying to remove transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025832s Time used: 0.024593 Trying to remove transition: x^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.011761s Time used: 0.010548 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002308s Time used: 4.00105 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.418631s Time used: 0.407357 Improving Solution with cost 3 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000901s Time used: 1.0008 LOG: SAT solveNonLinear - Elapsed time: 1.419533s Cost: 3; Total time: 1.40816 Failed at location 1: z^0 <= 0 Failed at location 1: 1 + x^0 + y^0 <= 0 Failed at location 1: 1 + x^0 + y^0 <= 0 Before Improving: Quasi-invariant at l1: z^0 <= 0 Quasi-invariant at l1: 1 + x^0 + y^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.046758s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006595s Remaining time after improvement: 0.986117 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: z^0 <= 0 Quasi-invariant at l1: x^0 + y^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 + 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 + 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 -> -1 + y^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 -> -1 + y^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 + 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 -> -1 + y^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 -> -1 + y^0, rest remain the same}> New Graphs: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^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.002384s Ranking function: -1 + x^0 New Graphs: Transitions: x^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.001459s Ranking function: -1 - y^0 + z^0 New Graphs: Calling Safety with literal x^0 + y^0 <= 0 and entry LOG: CALL check - Post:x^0 + y^0 <= 0 - Process 7 * Exit transition: * Postcondition : x^0 + y^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000902s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001010s Calling Safety with literal z^0 <= 0 and entry LOG: CALL check - Post:z^0 <= 0 - Process 8 * Exit transition: * Postcondition : z^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000839s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000916s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: x^0 + y^0 <= 0 , z^0 <= 0 , Narrowing transition: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: x^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 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Variables: x^0, z^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004792s Ranking function: -2 + 2*z^0 New Graphs: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^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.003288s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.056312s Piecewise ranking function: min(1,-2 + 3*x^0) New Graphs: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^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.002083s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.041402s Trying to remove transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017125s Time used: 0.016444 Trying to remove transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.030758s Time used: 0.029455 Trying to remove transition: x^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.019698s Time used: 0.018347 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.007096s Time used: 4.00131 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.478343s Time used: 0.459817 Improving Solution with cost 4 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001479s Time used: 1.00137 LOG: SAT solveNonLinear - Elapsed time: 1.479822s Cost: 4; Total time: 1.46118 Failed at location 1: z^0 <= 1 Failed at location 1: z^0 <= 1 Failed at location 1: 1 + y^0 <= 0 Failed at location 1: 1 + y^0 <= 0 Before Improving: Quasi-invariant at l1: z^0 <= 1 Quasi-invariant at l1: 1 + y^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015529s Remaining time after improvement: 0.990435 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: z^0 <= 1 Quasi-invariant at l1: 1 + y^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): x^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 + 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 + 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 -> -1 + y^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 -> -1 + y^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 -> -1 + y^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 + 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 -> -1 + y^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 -> -1 + y^0, rest remain the same}> Ranking function: 2 + x^0 + z^0 New Graphs: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^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.002036s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.044708s Trying to remove transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020734s Time used: 0.020234 LOG: SAT solveNonLinear - Elapsed time: 0.020734s Cost: 0; Total time: 0.020234 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: x^0 + z^0 <= 0 Ranking function: y^0 - z^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: x^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.000936s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004399s Trying to remove transition: x^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.013075s Time used: 0.012893 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033656s Time used: 0.032749 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.061956s Time used: 0.061943 LOG: SAT solveNonLinear - Elapsed time: 0.095613s Cost: 2; Total time: 0.094692 Failed at location 1: x^0 + z^0 <= 0 Failed at location 1: x^0 + z^0 <= 0 Before Improving: Quasi-invariant at l1: x^0 + z^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011769s Remaining time after improvement: 0.995537 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: x^0 + z^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): x^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 + 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 + 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 -> -1 + y^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 -> -1 + y^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 -> -1 + y^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> New Graphs: Calling Safety with literal 1 + y^0 <= 0 and entry LOG: CALL check - Post:1 + y^0 <= 0 - Process 9 * Exit transition: * Postcondition : 1 + y^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001306s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001407s Calling Safety with literal z^0 <= 1 and entry LOG: CALL check - Post:z^0 <= 1 - Process 10 * Exit transition: * Postcondition : z^0 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001288s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001384s Calling Safety with literal z^0 <= 1 and entry LOG: CALL check - Post:z^0 <= 1 - Process 11 * Exit transition: * Postcondition : z^0 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001266s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001354s Calling Safety with literal 1 + y^0 <= 0 and entry LOG: CALL check - Post:1 + y^0 <= 0 - Process 12 * Exit transition: * Postcondition : 1 + y^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001265s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001359s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + y^0 <= 0 , z^0 <= 1 , Calling Safety with literal x^0 + z^0 <= 0 and entry LOG: CALL check - Post:x^0 + z^0 <= 0 - Process 13 * Exit transition: * Postcondition : x^0 + z^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001262s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001364s Calling Safety with literal x^0 + z^0 <= 0 and entry LOG: CALL check - Post:x^0 + z^0 <= 0 - Process 14 * Exit transition: * Postcondition : x^0 + z^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001252s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001355s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: x^0 + z^0 <= 0 , Narrowing transition: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Variables: x^0, z^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009182s Ranking function: -2 + 2*z^0 New Graphs: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^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.007450s Ranking function: 1 + y^0 New Graphs: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^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.003641s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.074211s Piecewise ranking function: min(0,-4 + 4*x^0) New Graphs: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^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.002451s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.049397s Trying to remove transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.023901s Time used: 0.023058 Trying to remove transition: x^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.019592s Time used: 0.018253 Trying to remove transition: x^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.022749s Time used: 0.021386 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.065519s Time used: 0.063817 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.103859s Time used: 0.103843 LOG: SAT solveNonLinear - Elapsed time: 0.169378s Cost: 2; Total time: 0.16766 Failed at location 1: 1 + y^0 <= 0 Failed at location 1: 1 + y^0 <= 0 Before Improving: Quasi-invariant at l1: 1 + y^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.024472s Remaining time after improvement: 0.992875 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + y^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 + 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 + 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 + 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 + 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 -> -1 + y^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 -> -1 + y^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 -> -1 + y^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 -> -1 + y^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: x^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 + 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 -> -1 + y^0, rest remain the same}> New Graphs: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^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.001910s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.021087s Trying to remove transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019286s Time used: 0.018709 Trying to remove transition: x^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.018355s Time used: 0.017505 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.054999s Time used: 0.05383 Improving Solution with cost 3 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.024156s Time used: 1.02405 LOG: SAT solveNonLinear - Elapsed time: 1.079155s Cost: 3; Total time: 1.07788 Failed at location 1: x^0 + z^0 <= 1 Failed at location 1: x^0 + z^0 <= 1 Failed at location 1: x^0 + z^0 <= 1 Before Improving: Quasi-invariant at l1: x^0 + z^0 <= 1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.018523s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004438s Remaining time after improvement: 0.98782 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: x^0 + z^0 <= 2 [ 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 + 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 + 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 -> -1 + y^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 -> -1 + y^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 + 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 -> -1 + y^0, rest remain the same}> Ranking function: x^0 + z^0 New Graphs: Calling Safety with literal 1 + y^0 <= 0 and entry LOG: CALL check - Post:1 + y^0 <= 0 - Process 15 * Exit transition: * Postcondition : 1 + y^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001549s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001660s Calling Safety with literal 1 + y^0 <= 0 and entry LOG: CALL check - Post:1 + y^0 <= 0 - Process 16 * Exit transition: * Postcondition : 1 + y^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001513s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001610s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + y^0 <= 0 , Calling Safety with literal x^0 + z^0 <= 2 and entry LOG: CALL check - Post:x^0 + z^0 <= 2 - Process 17 * Exit transition: * Postcondition : x^0 + z^0 <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001529s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001633s Calling Safety with literal x^0 + z^0 <= 2 and entry LOG: CALL check - Post:x^0 + z^0 <= 2 - Process 18 * Exit transition: * Postcondition : x^0 + z^0 <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001534s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001639s Calling Safety with literal x^0 + z^0 <= 2 and entry LOG: CALL check - Post:x^0 + z^0 <= 2 - Process 19 * Exit transition: * Postcondition : x^0 + z^0 <= 2 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001536s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001641s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: x^0 + z^0 <= 2 , Narrowing transition: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: x^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 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Variables: x^0, z^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009334s Ranking function: -2 + 2*z^0 New Graphs: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^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.007623s Ranking function: 1 + y^0 New Graphs: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^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.003753s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.056379s Piecewise ranking function: min(2,-2 + 4*x^0) New Graphs: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^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.002531s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.058612s Trying to remove transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026337s Time used: 0.025432 Trying to remove transition: x^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.020264s Time used: 0.018893 Trying to remove transition: x^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.022681s Time used: 0.021397 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.065014s Time used: 0.063227 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.085502s Time used: 0.085488 LOG: SAT solveNonLinear - Elapsed time: 0.150516s Cost: 2; Total time: 0.148715 Failed at location 1: 1 + y^0 <= 0 Failed at location 1: 1 + y^0 <= 0 Before Improving: Quasi-invariant at l1: 1 + y^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.024017s Remaining time after improvement: 0.993034 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + y^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 + 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 + 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 + 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 + 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 -> -1 + y^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 -> -1 + y^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 -> -1 + y^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 -> -1 + y^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 + 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 + 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 -> -1 + y^0, rest remain the same}> New Graphs: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^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.001933s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.020460s Trying to remove transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017943s Time used: 0.017494 Trying to remove transition: x^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.018481s Time used: 0.017522 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.050385s Time used: 0.049144 Improving Solution with cost 3 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001457s Time used: 1.00134 LOG: SAT solveNonLinear - Elapsed time: 1.051842s Cost: 3; Total time: 1.05049 Failed at location 1: z^0 <= 1 Failed at location 1: z^0 <= 1 Failed at location 1: z^0 <= 1 Before Improving: Quasi-invariant at l1: z^0 <= 1 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.016085s Remaining time after improvement: 0.995508 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: z^0 <= 1 [ 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 + 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 + 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 -> -1 + y^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 -> -1 + y^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 + 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 -> -1 + y^0, rest remain the same}> Ranking function: 2 + x^0 + z^0 New Graphs: Transitions: x^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.001021s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004370s Trying to remove transition: x^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.013759s Time used: 0.013574 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.043734s Time used: 0.042834 Improving Solution with cost 3 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.037989s Time used: 0.037979 LOG: SAT solveNonLinear - Elapsed time: 0.081723s Cost: 3; Total time: 0.080813 Failed at location 1: 1 + z^0 <= 0 Failed at location 1: 1 + z^0 <= 0 Failed at location 1: 1 + z^0 <= 0 Before Improving: Quasi-invariant at l1: 1 + z^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011667s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003723s Remaining time after improvement: 0.990148 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: z^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 + 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 + 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 -> -1 + y^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 -> -1 + y^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 + z^0, z^0 -> -1 + z^0, rest remain the same}> Ranking function: 2*x^0 + 2*z^0 New Graphs: INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + y^0 <= 0 , Calling Safety with literal z^0 <= 1 and entry LOG: CALL check - Post:z^0 <= 1 - Process 20 * Exit transition: * Postcondition : z^0 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001737s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001837s Calling Safety with literal z^0 <= 1 and entry LOG: CALL check - Post:z^0 <= 1 - Process 21 * Exit transition: * Postcondition : z^0 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001727s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001825s Calling Safety with literal z^0 <= 1 and entry LOG: CALL check - Post:z^0 <= 1 - Process 22 * Exit transition: * Postcondition : z^0 <= 1 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001718s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001816s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: z^0 <= 1 , INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: z^0 <= 0 , Narrowing transition: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 3 Narrowing transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 3 invGraph after Narrowing: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Variables: x^0, z^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009794s Ranking function: -2 + 2*z^0 New Graphs: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^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.006898s Ranking function: 1 + y^0 New Graphs: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^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.003187s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.049746s Piecewise ranking function: min(8 + 8*y^0,4 + 4*x^0 + 8*y^0) New Graphs: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^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.002553s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.022511s Piecewise ranking function: min(-1 + x^0 + z^0,z^0) New Graphs: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^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.001910s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.022023s Trying to remove transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016684s Time used: 0.016181 LOG: SAT solveNonLinear - Elapsed time: 0.016684s Cost: 0; Total time: 0.016181 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + y^0 <= 0 Ranking function: 2*x^0 - y^0 Ranking function and negation of Quasi-Invariant applied New Graphs: Transitions: x^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.000904s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003629s Trying to remove transition: x^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.011050s Time used: 0.010871 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.051439s Time used: 0.050423 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.060483s Time used: 0.06047 LOG: SAT solveNonLinear - Elapsed time: 0.111922s Cost: 2; Total time: 0.110893 Failed at location 1: 1 + y^0 <= 0 Failed at location 1: 1 + y^0 <= 0 Before Improving: Quasi-invariant at l1: 1 + y^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.015582s Remaining time after improvement: 0.994223 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + y^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 + 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 + 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 + 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 + 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 -> -1 + y^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 -> -1 + y^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 -> -1 + y^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 -> -1 + y^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 It's unfeasible. Removing transition: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> New Graphs: INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + y^0 <= 0 , Narrowing transition: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> It's unfeasible. Removing transition: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> Narrowing transition: x^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 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> It's unfeasible. Removing transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Narrowing transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Variables: x^0, z^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005588s Ranking function: y^0 New Graphs: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^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.001936s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.013665s Piecewise ranking function: min(-2 + 2*x^0 + 2*y^0,2*y^0) New Graphs: Transitions: x^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.000895s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003471s Trying to remove transition: x^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.011082s Time used: 0.010901 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025592s Time used: 0.024724 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.029031s Time used: 0.029021 LOG: SAT solveNonLinear - Elapsed time: 0.054623s Cost: 1; Total time: 0.053745 Failed at location 1: z^0 <= 0 Before Improving: Quasi-invariant at l1: z^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008296s Remaining time after improvement: 0.996511 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: z^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): x^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 + 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 -> -1 + y^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 -> -1 + y^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 + z^0, z^0 -> -1 + z^0, rest remain the same}> Ranking function: x^0 + z^0 New Graphs: INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: z^0 <= 0 , It's unfeasible. Removing transition: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> Narrowing transition: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> LOG: Narrow transition size 1 It's unfeasible. Removing transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Narrowing transition: x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: x^0 + z^0, z^0 -> -1 + z^0, rest remain the same}> x^0 + y^0, y^0 -> -1 + y^0, rest remain the same}> Variables: x^0, z^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003987s Ranking function: y^0 New Graphs: Transitions: x^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.002672s Ranking function: -1 + z^0 New Graphs: Program Terminates