NO Solver Timeout: 4 Global Timeout: 60 No parsing errors! Init Location: 0 Transitions: (1 + num^0)}> 0, status^0 -> 1}> 0, Pdo^0 -> 0, conditional^0 -> undef37}> 1, num^0 -> 0}> 1, conditional^0 -> undef77}> (~(1) + i^0)}> (1 + i^0)}> 0}> undef111, PPBlockInits^0 -> 1, status^0 -> 0}> 0, PPBlockInits^0 -> 1, PPBunlockInits^0 -> 0, Pdolen^0 -> undef126, i^0 -> undef128, status^0 -> 0}> Fresh variables: undef37, undef77, undef111, undef126, undef128, Undef variables: undef37, undef77, undef111, undef126, undef128, Abstraction variables: Exit nodes: Accepting locations: Asserts: Preprocessed LLVMGraph Init Location: 0 Transitions: 0}> (~(1) + i^0)}> (1 + i^0)}> (1 + num^0)}> Fresh variables: undef37, undef77, undef111, undef126, undef128, Undef variables: undef37, undef77, undef111, undef126, undef128, Abstraction variables: Exit nodes: Accepting locations: Asserts: ************************************************************* ******************************************************************************************* *********************** WORKING TRANSITION SYSTEM (DAG) *********************** ******************************************************************************************* Init Location: 0 Graph 0: Transitions: Variables: Graph 1: Transitions: -1 + i^0, rest remain the same}> 1 + i^0, rest remain the same}> 1 + num^0, rest remain the same}> Variables: Pdolen^0, i^0, num^0 Graph 2: Transitions: 0, rest remain the same}> Variables: Precedence: Graph 0 Graph 1 Graph 2 Map Locations to Subgraph: ( 0 , 0 ) ( 2 , 2 ) ( 3 , 1 ) ******************************************************************************************* ******************************** CHECKING ASSERTIONS ******************************** ******************************************************************************************* Proving termination of subgraph 0 Proving termination of subgraph 1 Checking unfeasibility... Time used: 0.00804 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001740s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011869s Trying to remove transition: 1 + num^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016135s Time used: 0.015811 Trying to remove transition: 1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012159s Time used: 0.011141 Trying to remove transition: -1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009544s Time used: 0.00881 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.033704s Time used: 0.032817 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.093705s Time used: 0.093695 LOG: SAT solveNonLinear - Elapsed time: 0.127409s Cost: 1; Total time: 0.126512 Failed at location 3: 1 + Pdolen^0 <= i^0 Before Improving: Quasi-invariant at l3: 1 + Pdolen^0 <= i^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.010701s Remaining time after improvement: 0.996873 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 + Pdolen^0 <= i^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: -1 + i^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 + i^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 + num^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: 1 + num^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 + i^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 + i^0, rest remain the same}> New Graphs: Calling Safety with literal 1 + Pdolen^0 <= i^0 and entry LOG: CALL check - Post:1 + Pdolen^0 <= i^0 - Process 1 * Exit transition: * Postcondition : 1 + Pdolen^0 <= i^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000853s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.000948s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: 1 + Pdolen^0 <= i^0 , Narrowing transition: -1 + i^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + i^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + num^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + i^0, rest remain the same}> 1 + i^0, rest remain the same}> 1 + num^0, rest remain the same}> Variables: Pdolen^0, i^0, num^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001571s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012096s Trying to remove transition: 1 + num^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013439s Time used: 0.01288 Trying to remove transition: 1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012338s Time used: 0.011297 Trying to remove transition: -1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009651s Time used: 0.008847 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.035841s Time used: 0.03491 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.060185s Time used: 0.060177 LOG: SAT solveNonLinear - Elapsed time: 0.096027s Cost: 1; Total time: 0.095087 Failed at location 3: Pdolen^0 <= i^0 Before Improving: Quasi-invariant at l3: Pdolen^0 <= i^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.011366s Remaining time after improvement: 0.996337 Termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: Pdolen^0 <= i^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: -1 + i^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 + i^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 + num^0, rest remain the same}> [ Termination Graph ] Strengthening and disabling transitions... > It's unfeasible. Removing transition: -1 + i^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 + i^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 + num^0, rest remain the same}> New Graphs: Calling Safety with literal Pdolen^0 <= i^0 and entry LOG: CALL check - Post:Pdolen^0 <= i^0 - Process 2 * Exit transition: * Postcondition : Pdolen^0 <= i^0 LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.000923s > Postcondition is not implied! LOG: RETURN check - Elapsed time: 0.001023s INVARIANTS: 3: Quasi-INVARIANTS to narrow Graph: 3: Pdolen^0 <= i^0 , Narrowing transition: -1 + i^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + i^0, rest remain the same}> LOG: Narrow transition size 1 Narrowing transition: 1 + num^0, rest remain the same}> LOG: Narrow transition size 1 invGraph after Narrowing: Transitions: -1 + i^0, rest remain the same}> 1 + i^0, rest remain the same}> 1 + num^0, rest remain the same}> Variables: Pdolen^0, i^0, num^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001583s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.012202s Trying to remove transition: 1 + num^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013503s Time used: 0.012889 Trying to remove transition: 1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012380s Time used: 0.011265 Trying to remove transition: -1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009707s Time used: 0.008873 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002094s Time used: 4.00073 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.011213s Time used: 4.00064 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009185s Time used: 1.00003 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.078430s Time used: 0.034279 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.068678s Time used: 0.068669 LOG: SAT solveNonLinear - Elapsed time: 0.147108s Cost: 1; Total time: 0.102948 Termination implied by a set of invariant(s): Invariant at l3: i^0 <= 1 + Pdolen^0 [ Invariant Graph ] Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + num^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): -1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + num^0, rest remain the same}> Quasi-ranking function: 50000 - num^0 New Graphs: Transitions: -1 + i^0, rest remain the same}> 1 + i^0, rest remain the same}> 1 + num^0, rest remain the same}> Variables: Pdolen^0, i^0, num^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.001841s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.014766s Trying to remove transition: 1 + num^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018106s Time used: 0.017561 Trying to remove transition: 1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.015002s Time used: 0.013775 Trying to remove transition: -1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011729s Time used: 0.01083 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.002299s Time used: 4.00099 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.011271s Time used: 4.00088 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009661s Time used: 1.00018 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.055528s Time used: 0.035229 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.063053s Time used: 0.063044 LOG: SAT solveNonLinear - Elapsed time: 0.118581s Cost: 1; Total time: 0.098273 Quasi-ranking function: 50000 + Pdolen^0 - num^0 New Graphs: Transitions: -1 + i^0, rest remain the same}> 1 + i^0, rest remain the same}> 1 + num^0, rest remain the same}> Variables: Pdolen^0, i^0, num^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002046s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.016352s Trying to remove transition: 1 + num^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016296s Time used: 0.015432 Trying to remove transition: 1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016063s Time used: 0.014535 Trying to remove transition: -1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.012844s Time used: 0.011837 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.008537s Time used: 4.00709 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.010674s Time used: 4.00116 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.009761s Time used: 1.00003 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.055376s Time used: 0.034469 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.072708s Time used: 0.072698 LOG: SAT solveNonLinear - Elapsed time: 0.128084s Cost: 1; Total time: 0.107167 Quasi-ranking function: 50000 - Pdolen^0 - num^0 New Graphs: Transitions: -1 + i^0, rest remain the same}> 1 + i^0, rest remain the same}> 1 + num^0, rest remain the same}> Variables: Pdolen^0, i^0, num^0 Checking conditional termination of SCC {l3}... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.002127s LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.016690s Trying to remove transition: 1 + num^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019849s Time used: 0.019175 Trying to remove transition: 1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016514s Time used: 0.015251 Trying to remove transition: -1 + i^0, rest remain the same}> Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014044s Time used: 0.013016 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.748811s Time used: 1.74773 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.993295s Time used: 0.987714 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.995643s Time used: 0.98723 Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.060747s Time used: 0.040572 Proving non-termination of subgraph 1 Transitions: -1 + i^0, rest remain the same}> 1 + i^0, rest remain the same}> 1 + num^0, rest remain the same}> Variables: Pdolen^0, i^0, num^0 Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.010104s Time used: 5.00157 Solving with 2 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.005197s Time used: 5.00133 Solving with 3 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 5.022455s Time used: 5.00114 > Checking if the negation of the conditions of every pending exit is quasi-invariant... NO Proving non-termination of subgraph 1 Transitions: -1 + i^0, rest remain the same}> 1 + i^0, rest remain the same}> 1 + num^0, rest remain the same}> Variables: Pdolen^0, i^0, num^0 Checking conditional non-termination of SCC {l3}... EXIT TRANSITIONS: Solving with 1 template(s). LOG: CALL solveNonLinearGetFirstSolution LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.078840s Time used: 0.078421 Improving Solution with cost 4 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.303152s Time used: 0.303133 Improving Solution with cost 1 ... LOG: CALL solveNonLinearGetNextSolution LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.072021s Time used: 0.072012 LOG: SAT solveNonLinear - Elapsed time: 0.454013s Cost: 1; Total time: 0.453566 Failed at location 3: 1 + i^0 <= Pdolen^0 Before Improving: Quasi-invariant at l3: 1 + i^0 <= Pdolen^0 Optimizing invariants... LOG: CALL solveLinear LOG: RETURN solveLinear - Elapsed time: 0.009356s Remaining time after improvement: 0.996167 Minimizing number of undef constraints... LOG: CALL solveNonLinear LOG: RETURN solveNonLinear - Elapsed time: 0.009150s Number of undef constraints reduced! Non-termination implied by a set of quasi-invariant(s): Quasi-invariant at l3: 1 + i^0 <= Pdolen^0 Constraint over undef '6 <= undef77' in transition: 1 + i^0, rest remain the same}> Strengthening and disabling EXIT transitions... Closed exits from l3: 4 Strengthening and disabling transitions... LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): -1 + i^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 + i^0, rest remain the same}> LOG: CALL solverLinear in Graph for feasibility LOG: RETURN solveLinear in Graph for feasibility Strengthening transition (result): 1 + num^0, rest remain the same}> Calling reachability with... Transition: Conditions: 1 + i^0 <= Pdolen^0, OPEN EXITS: --- Reachability graph --- > Graph without transitions. Calling reachability with... Transition: Conditions: 1 + i^0 <= Pdolen^0, OPEN EXITS: > Conditions are reachable! Program does NOT terminate