NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: undef5}> (0 + __const_3000^0)}> Fresh variables: undef5, Undef variables: undef5, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: undef5}> Fresh variables: undef5, Undef variables: undef5, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: undef5, rest remain the same}> Variables: __const_1000^0, __const_110^0, __const_4000^0, x^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.003284 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000787s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003123s Trying to remove transition: undef5, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011874s Time used: 0.011641 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013304s Time used: 0.012605 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.018068s Time used: 0.018061 LOG: SAT solveNonLinear - Elapsed time: 0.031372s Cost: 1; Total time: 0.030666 Failed at location 1: __const_4000^0 <= y^0 Before Improving: Quasi-invariant at l1: __const_4000^0 <= y^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003433s Remaining time after improvement: 0.998589 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: __const_4000^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: undef5, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef5, rest remain the same}> New Graphs: Calling Safety with literal __const_4000^0 <= y^0 and entry LOG: CALL check - Post:__const_4000^0 <= y^0 - Process 1 * Exit transition: * Postcondition : __const_4000^0 <= y^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000459s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000550s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_4000^0 <= y^0 , Narrowing transition: undef5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef5, rest remain the same}> Variables: __const_1000^0, __const_110^0, __const_4000^0, x^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000713s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002978s Trying to remove transition: undef5, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010064s Time used: 0.009824 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012593s Time used: 0.011791 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.016914s Time used: 0.016907 LOG: SAT solveNonLinear - Elapsed time: 0.029506s Cost: 1; Total time: 0.028698 Failed at location 1: __const_1000^0 + __const_4000^0 <= y^0 Before Improving: Quasi-invariant at l1: __const_1000^0 + __const_4000^0 <= y^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003401s Remaining time after improvement: 0.99854 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: __const_1000^0 + __const_4000^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): undef5, 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): undef5, rest remain the same}> Ranking function: __const_1000^0 - __const_110^0 + x^0 New Graphs: Calling Safety with literal __const_1000^0 + __const_4000^0 <= y^0 and entry LOG: CALL check - Post:__const_1000^0 + __const_4000^0 <= y^0 - Process 2 * Exit transition: * Postcondition : __const_1000^0 + __const_4000^0 <= y^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000416s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000503s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_1000^0 + __const_4000^0 <= y^0 , Narrowing transition: undef5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef5, rest remain the same}> Variables: __const_1000^0, __const_110^0, __const_4000^0, x^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000822s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003547s Trying to remove transition: undef5, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009930s Time used: 0.009724 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.017959s Time used: 0.017143 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014915s Time used: 0.014909 LOG: SAT solveNonLinear - Elapsed time: 0.032874s Cost: 1; Total time: 0.032052 Failed at location 1: __const_1000^0 + __const_4000^0 + x^0 <= 1 + __const_110^0 + y^0 Before Improving: Quasi-invariant at l1: __const_1000^0 + __const_4000^0 + x^0 <= 1 + __const_110^0 + y^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.003705s Remaining time after improvement: 0.998276 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: __const_1000^0 + __const_4000^0 + x^0 <= 1 + __const_110^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: undef5, 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: undef5, rest remain the same}> New Graphs: Calling Safety with literal __const_1000^0 + __const_4000^0 + x^0 <= 1 + __const_110^0 + y^0 and entry LOG: CALL check - Post:__const_1000^0 + __const_4000^0 + x^0 <= 1 + __const_110^0 + y^0 - Process 3 * Exit transition: * Postcondition : __const_1000^0 + __const_4000^0 + x^0 <= 1 + __const_110^0 + y^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000584s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000698s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_1000^0 + __const_4000^0 + x^0 <= 1 + __const_110^0 + y^0 , Narrowing transition: undef5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef5, rest remain the same}> Variables: __const_1000^0, __const_110^0, __const_4000^0, x^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000964s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004077s Trying to remove transition: undef5, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010995s Time used: 0.010768 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014769s Time used: 0.01391 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.020730s Time used: 0.020723 LOG: SAT solveNonLinear - Elapsed time: 0.035499s Cost: 1; Total time: 0.034633 Failed at location 1: 1 + __const_1000^0 <= 0 Before Improving: Quasi-invariant at l1: 1 + __const_1000^0 <= 0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004121s Remaining time after improvement: 0.998004 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + __const_1000^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): undef5, 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): undef5, rest remain the same}> Ranking function: __const_1000^0 - __const_110^0 + x^0 New Graphs: Calling Safety with literal 1 + __const_1000^0 <= 0 and entry LOG: CALL check - Post:1 + __const_1000^0 <= 0 - Process 4 * Exit transition: * Postcondition : 1 + __const_1000^0 <= 0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000556s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000654s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: 1 + __const_1000^0 <= 0 , Narrowing transition: undef5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef5, rest remain the same}> Variables: __const_1000^0, __const_110^0, __const_4000^0, x^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001017s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004356s Trying to remove transition: undef5, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010630s Time used: 0.010397 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016695s Time used: 0.015881 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.022254s Time used: 0.022248 LOG: SAT solveNonLinear - Elapsed time: 0.038949s Cost: 1; Total time: 0.038129 Failed at location 1: __const_1000^0 + x^0 <= __const_110^0 Before Improving: Quasi-invariant at l1: __const_1000^0 + x^0 <= __const_110^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004319s Remaining time after improvement: 0.997834 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: __const_1000^0 + x^0 <= __const_110^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: undef5, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: undef5, rest remain the same}> New Graphs: Calling Safety with literal __const_1000^0 + x^0 <= __const_110^0 and entry LOG: CALL check - Post:__const_1000^0 + x^0 <= __const_110^0 - Process 5 * Exit transition: * Postcondition : __const_1000^0 + x^0 <= __const_110^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000757s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000878s INVARIANTS: 1: Quasi-INVARIANTS to narrow Graph: 1: __const_1000^0 + x^0 <= __const_110^0 , Narrowing transition: undef5, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: undef5, rest remain the same}> Variables: __const_1000^0, __const_110^0, __const_4000^0, x^0, y^0 Checking conditional termination of SCC {l1}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001126s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.004720s Trying to remove transition: undef5, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011089s Time used: 0.010849 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025615s Time used: 0.024893 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001896s Time used: 4.00071 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.005937s Time used: 1.00008 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.027808s Time used: 0.014294 Proving non-termination of subgraph 1 Transitions: undef5, rest remain the same}> Variables: __const_1000^0, __const_110^0, __const_4000^0, x^0, y^0 Checking that every undef value has an assignment... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002254s Checking conditional non-termination of SCC {l1}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.084704s Time used: 0.084108 Improving Solution with cost 8 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.236288s Time used: 0.236273 LOG: SAT solveNonLinear - Elapsed time: 0.320992s Cost: 8; Total time: 0.320381 Failed at location 1: 1 + y^0 <= __const_1000^0 + __const_4000^0 Before Improving: Quasi-invariant at l1: 1 + y^0 <= __const_1000^0 + __const_4000^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.024793s Remaining time after improvement: 0.995605 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.008190s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 1 + y^0 <= __const_1000^0 + __const_4000^0 Strengthening and disabling EXIT transitions... Closed exits from l1: 4 Strengthening exit transition (result): Strengthening exit transition (result): 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): undef5, 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.000564s Time used: 5.00024 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.659311s Time used: 1.51596 Improving Solution with cost 3 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001469s Time used: 1.00141 LOG: SAT solveNonLinear - Elapsed time: 2.660780s Cost: 3; Total time: 2.51737 Failed at location 1: __const_1000^0 <= 0 Failed at location 1: 1 + __const_110^0 <= __const_1000^0 + x^0 Before Improving: Quasi-invariant at l1: __const_1000^0 <= 0 Quasi-invariant at l1: 1 + __const_110^0 <= __const_1000^0 + x^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.007579s Remaining time after improvement: 0.996048 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.008484s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: __const_1000^0 <= 0 Quasi-invariant at l1: 1 + __const_110^0 <= __const_1000^0 + x^0 Strengthening and disabling EXIT transitions... Closed exits from l1: 3 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): undef5, 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.005812s Time used: 5.00543 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.174871s Time used: 0.072422 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.082842s Time used: 0.082833 LOG: SAT solveNonLinear - Elapsed time: 0.257713s Cost: 1; Total time: 0.155255 Failed at location 1: 0 <= __const_1000^0 Before Improving: Quasi-invariant at l1: 0 <= __const_1000^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.034340s Remaining time after improvement: 0.996092 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.006738s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l1: 0 <= __const_1000^0 Strengthening and disabling EXIT transitions... Closed exits from l1: 1 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): undef5, rest remain the same}> Calling reachability with... Transition: Conditions: 1 + y^0 <= __const_1000^0 + __const_4000^0, __const_1000^0 <= 0, 1 + __const_110^0 <= __const_1000^0 + x^0, 0 <= __const_1000^0, OPEN EXITS: (condsUp: 1 + y^0 <= __const_1000^0 + __const_4000^0, __const_1000^0 <= 0, 0 <= __const_1000^0) --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 + __const_110^0 <= __const_1000^0 + x^0, 1 + y^0 <= __const_1000^0 + __const_4000^0, __const_1000^0 <= 0, 0 <= __const_1000^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate