NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: ((0 + x^0) + (~(1) * y^0)), z^0 -> undef3}> (1 + y^0), z^0 -> (~(1) + z^0)}> Fresh variables: undef3, Undef variables: undef3, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: ((0 + x^0) + (~(1) * y^0)), z^0 -> undef3}> (1 + y^0), z^0 -> (~(1) + z^0)}> Fresh variables: undef3, Undef variables: undef3, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: x^0 - y^0, z^0 -> undef3, rest remain the same}> 1 + y^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.004532 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001053s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003718s Trying to remove transition: 1 + y^0, z^0 -> -1 + z^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009018s Time used: 0.008817 Trying to remove transition: x^0 - y^0, z^0 -> undef3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012105s Time used: 0.011662 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021705s Time used: 0.021007 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.038867s Time used: 0.038862 LOG: SAT solveNonLinear - Elapsed time: 0.060572s Cost: 1; Total time: 0.059869 Failed at location 1: x^0 <= y^0 Before Improving: Quasi-invariant at l1: x^0 <= y^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.005349s Remaining time after improvement: 0.998494 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: x^0 <= y^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, z^0 -> undef3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + y^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, z^0 -> undef3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + y^0, z^0 -> -1 + z^0, rest remain the same}> New Graphs: Transitions: 1 + y^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.000778s Ranking function: -2 + z^0 New Graphs: Calling Safety with literal x^0 <= y^0 and entry LOG: CALL check - Post:x^0 <= y^0 - Process 1 * Exit transition: * Postcondition : x^0 <= y^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000402s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000484s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: x^0 <= y^0 , Narrowing transition: x^0 - y^0, z^0 -> undef3, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + y^0, z^0 -> -1 + z^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: x^0 - y^0, z^0 -> undef3, rest remain the same}> 1 + y^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.001058s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006432s Trying to remove transition: 1 + y^0, z^0 -> -1 + z^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011269s Time used: 0.011088 Trying to remove transition: x^0 - y^0, z^0 -> undef3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008763s Time used: 0.008121 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021194s Time used: 0.020519 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.037252s Time used: 0.037248 LOG: SAT solveNonLinear - Elapsed time: 0.058447s Cost: 1; Total time: 0.057767 Failed at location 1: 1 <= y^0 Before Improving: Quasi-invariant at l1: 1 <= y^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.006533s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001792s Remaining time after improvement: 0.995825 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 0 <= y^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, z^0 -> undef3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + y^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, z^0 -> undef3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + y^0, z^0 -> -1 + z^0, rest remain the same}> Ranking function: 2*x^0 - y^0 New Graphs: Transitions: x^0 - y^0, z^0 -> undef3, 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.000712s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002126s Trying to remove transition: x^0 - y^0, z^0 -> undef3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006119s Time used: 0.005981 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011106s Time used: 0.010517 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014741s Time used: 0.014735 LOG: SAT solveNonLinear - Elapsed time: 0.025846s Cost: 1; Total time: 0.025252 Failed at location 1: 1 <= y^0 Before Improving: Quasi-invariant at l1: 1 <= y^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003531s Remaining time after improvement: 0.998562 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 <= y^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, z^0 -> undef3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + y^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, z^0 -> undef3, rest remain the same}> Ranking function: x^0 New Graphs: Calling Safety with literal 0 <= y^0 and entry LOG: CALL check - Post:0 <= y^0 - Process 2 * Exit transition: * Postcondition : 0 <= y^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000525s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000607s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 0 <= y^0 , INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 <= y^0 , Narrowing transition: x^0 - y^0, z^0 -> undef3, rest remain the same}> LOG: Narrow transition size 2 Narrowing transition: 1 + y^0, z^0 -> -1 + z^0, rest remain the same}> LOG: Narrow transition size 2 invGraph after Narrowing: Transitions: x^0 - y^0, z^0 -> undef3, rest remain the same}> x^0 - y^0, z^0 -> undef3, rest remain the same}> 1 + y^0, z^0 -> -1 + z^0, rest remain the same}> 1 + y^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.002519s Ranking function: -1 - 2*y^0 New Graphs: Transitions: x^0 - y^0, z^0 -> undef3, rest remain the same}> x^0 - y^0, z^0 -> undef3, rest remain the same}> 1 + y^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.002037s Ranking function: -y^0 New Graphs: Transitions: x^0 - y^0, z^0 -> undef3, rest remain the same}> x^0 - y^0, z^0 -> undef3, 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.001133s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004027s Trying to remove transition: x^0 - y^0, z^0 -> undef3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010847s Time used: 0.010665 Trying to remove transition: x^0 - y^0, z^0 -> undef3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009552s Time used: 0.008929 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.024395s Time used: 0.023588 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.078972s Time used: 0.078968 LOG: SAT solveNonLinear - Elapsed time: 0.103367s Cost: 1; Total time: 0.102556 Failed at location 1: 0 <= y^0 Before Improving: Quasi-invariant at l1: 0 <= y^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.008572s Remaining time after improvement: 0.997494 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 0 <= y^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, z^0 -> undef3, 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, z^0 -> undef3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + y^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: 1 + y^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, z^0 -> undef3, 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, z^0 -> undef3, rest remain the same}> New Graphs: Transitions: x^0 - y^0, z^0 -> undef3, 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.000692s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002089s Trying to remove transition: x^0 - y^0, z^0 -> undef3, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.006112s Time used: 0.005973 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011676s Time used: 0.011215 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001657s Time used: 4.0007 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.012338s Time used: 1.00603 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017187s Time used: 0.009556 Proving non-termination of subgraph 1 Transitions: x^0 - y^0, z^0 -> undef3, rest remain the same}> x^0 - y^0, z^0 -> undef3, rest remain the same}> 1 + y^0, z^0 -> -1 + z^0, rest remain the same}> 1 + y^0, z^0 -> -1 + z^0, rest remain the same}> Variables: x^0, y^0, z^0 Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.050122s Time used: 0.04974 Improving Solution with cost 5 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.199524s Time used: 0.199522 Improving Solution with cost 4 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000969s Time used: 1.00097 LOG: SAT solveNonLinear - Elapsed time: 1.250615s Cost: 4; Total time: 1.25024 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.043725s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 2 <= x^0 Strengthening and disabling EXIT transitions... Closed exits from l1: 4 Strengthening exit transition (result): Strengthening exit transition (result): 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, z^0 -> undef3, 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, z^0 -> undef3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + y^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): 1 + y^0, z^0 -> -1 + z^0, rest remain the same}> Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.003581s Time used: 5.00318 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.231143s Time used: 0.225915 Improving Solution with cost 2 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001428s Time used: 1.0013 LOG: SAT solveNonLinear - Elapsed time: 1.232571s Cost: 2; Total time: 1.22722 Failed at location 1: 1 + y^0 <= 0 Failed at location 1: z^0 <= y^0 Before Improving: Quasi-invariant at l1: 1 + y^0 <= 0 Quasi-invariant at l1: z^0 <= y^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010294s Quasi-invariant improved LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003611s Remaining time after improvement: 0.990713 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.007679s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + y^0 <= 0 Quasi-invariant at l1: z^0 <= 2 + y^0 Strengthening and disabling EXIT transitions... Closed exits from l1: 2 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, z^0 -> undef3, 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, z^0 -> undef3, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility It's unfeasible. Removing transition: 1 + y^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: 1 + y^0, z^0 -> -1 + z^0, rest remain the same}> Calling reachability with... Transition: Conditions: 2 <= x^0, 1 + y^0 <= 0, z^0 <= 2 + y^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 + y^0 <= 0, 2 <= x^0, z^0 <= 2 + y^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate