NO

Solver Timeout: 4
Global Timeout: 60
No parsing errors!
Init Location: 0
Transitions:
<l0, l13, true>
<l1, l2, (undef16 = (0 + b_128^0)) /\ ((5 + (~(1) * undef16)) <= 0) /\ (undef10 = undef10) /\ (undef4 = 1) /\ (undef2 = (0 + undef4)) /\ (undef15 = (0 + undef2)) /\ (undef1 = undef1), par{Result_4^0 -> undef1, __cil_tmp2_7^0 -> undef2, __retres1_6^0 -> undef4, lt_13^0 -> undef10, tmp_11^0 -> (0 + undef15)}>
<l1, l3, (undef33 = (0 + b_128^0)) /\ (0 <= (4 + (~(1) * undef33))) /\ (undef26 = undef26) /\ (undef32 = (0 + b_128^0)) /\ (undef25 = undef25) /\ (undef20 = 0) /\ (undef18 = (0 + undef20)) /\ (undef31 = (0 + undef18)) /\ (undef17 = undef17), par{Result_4^0 -> undef17, __cil_tmp2_7^0 -> undef18, __retres1_6^0 -> undef20, lt_12^0 -> undef25, lt_13^0 -> undef26, tmp_11^0 -> (0 + undef31)}>
<l4, l5, (((0 + (~(1) * x_8^0)) + y_9^0) <= 0) /\ (undef34 = undef34), par{Result_4^0 -> undef34}>
<l4, l6, (0 <= ((~(1) + (~(1) * x_8^0)) + y_9^0))>
<l3, l1, ((0 + tmp_11^0) <= 0) /\ (0 <= (0 + tmp_11^0)) /\ (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0))>
<l7, l3, (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0)) /\ (undef92 = 0) /\ (0 <= (4 + (~(1) * undef92))) /\ (undef85 = undef85) /\ (undef91 = 0) /\ (undef84 = undef84) /\ (undef79 = 0) /\ (undef77 = (0 + undef79)) /\ (undef90 = (0 + undef77)) /\ (undef76 = undef76), par{Result_4^0 -> undef76, __cil_tmp2_7^0 -> undef77, __retres1_6^0 -> undef79, lt_12^0 -> undef84, lt_13^0 -> undef85, tmp_11^0 -> (0 + undef90)}>
<l7, l4, (((0 + (~(1) * y_9^0)) + z_10^0) <= 0), par{x_8^0 -> (1 + x_8^0)}>
<l2, l8, (undef109 = __disjvr_0^0) /\ (__disjvr_0^0 = undef109), par{__disjvr_0^0 -> undef109}>
<l8, l7, true, par{y_9^0 -> (1 + y_9^0)}>
<l6, l3, (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0)) /\ (undef151 = 0) /\ (0 <= (4 + (~(1) * undef151))) /\ (undef144 = undef144) /\ (undef150 = 0) /\ (undef143 = undef143) /\ (undef138 = 0) /\ (undef136 = (0 + undef138)) /\ (undef149 = (0 + undef136)) /\ (undef135 = undef135), par{Result_4^0 -> undef135, __cil_tmp2_7^0 -> undef136, __retres1_6^0 -> undef138, lt_12^0 -> undef143, lt_13^0 -> undef144, tmp_11^0 -> (0 + undef149)}>
<l6, l4, (((0 + (~(1) * y_9^0)) + z_10^0) <= 0), par{x_8^0 -> (1 + x_8^0)}>
<l9, l4, (undef173 = undef173), par{count_5^0 -> undef173}>
<l10, l3, (undef196 = 1) /\ (0 <= (4 + (~(1) * undef196))) /\ (undef189 = undef189) /\ (undef195 = 1) /\ (undef188 = undef188) /\ (undef183 = 0) /\ (undef181 = (0 + undef183)) /\ (undef194 = (0 + undef181)) /\ (undef180 = undef180), par{Result_4^0 -> undef180, __cil_tmp2_7^0 -> undef181, __retres1_6^0 -> undef183, b_51^0 -> 2, lt_12^0 -> undef188, lt_13^0 -> undef189, tmp_11^0 -> (0 + undef194)}>
<l11, l3, (undef213 = (0 + b_51^0)) /\ (0 <= (4 + (~(1) * undef213))) /\ (undef206 = undef206) /\ (undef212 = (0 + b_51^0)) /\ (undef205 = undef205) /\ (undef200 = 0) /\ (undef198 = (0 + undef200)) /\ (undef211 = (0 + undef198)) /\ (undef197 = undef197), par{Result_4^0 -> undef197, __cil_tmp2_7^0 -> undef198, __retres1_6^0 -> undef200, b_76^0 -> (1 + b_51^0), lt_12^0 -> undef205, lt_13^0 -> undef206, tmp_11^0 -> (0 + undef211)}>
<l11, l2, (undef229 = (0 + b_51^0)) /\ ((5 + (~(1) * undef229)) <= 0) /\ (undef223 = undef223) /\ (undef217 = 1) /\ (undef215 = (0 + undef217)) /\ (undef228 = (0 + undef215)) /\ (undef214 = undef214), par{Result_4^0 -> undef214, __cil_tmp2_7^0 -> undef215, __retres1_6^0 -> undef217, lt_13^0 -> undef223, tmp_11^0 -> (0 + undef228)}>
<l12, l3, (undef246 = 1) /\ (0 <= (4 + (~(1) * undef246))) /\ (undef239 = undef239) /\ (undef245 = 1) /\ (undef238 = undef238) /\ (undef233 = 0) /\ (undef231 = (0 + undef233)) /\ (undef244 = (0 + undef231)) /\ (undef230 = undef230), par{Result_4^0 -> undef230, __cil_tmp2_7^0 -> undef231, __retres1_6^0 -> undef233, b_128^0 -> 2, lt_12^0 -> undef238, lt_13^0 -> undef239, tmp_11^0 -> (0 + undef244)}>
<l13, l9, true>

Fresh variables:
undef1, undef2, undef4, undef10, undef15, undef16, undef17, undef18, undef20, undef25, undef26, undef31, undef32, undef33, undef34, undef76, undef77, undef79, undef84, undef85, undef90, undef91, undef92, undef109, undef135, undef136, undef138, undef143, undef144, undef149, undef150, undef151, undef173, undef180, undef181, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef200, undef205, undef206, undef211, undef212, undef213, undef214, undef215, undef217, undef223, undef228, undef229, undef230, undef231, undef233, undef238, undef239, undef244, undef245, undef246, 

Undef variables:
undef1, undef2, undef4, undef10, undef15, undef16, undef17, undef18, undef20, undef25, undef26, undef31, undef32, undef33, undef34, undef76, undef77, undef79, undef84, undef85, undef90, undef91, undef92, undef109, undef135, undef136, undef138, undef143, undef144, undef149, undef150, undef151, undef173, undef180, undef181, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef200, undef205, undef206, undef211, undef212, undef213, undef214, undef215, undef217, undef223, undef228, undef229, undef230, undef231, undef233, undef238, undef239, undef244, undef245, undef246, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, (undef173 = undef173)>
<l3, l3, ((0 + tmp_11^0) <= 0) /\ (0 <= (0 + tmp_11^0)) /\ (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0)) /\ (undef16 = (0 + b_128^0)) /\ ((5 + (~(1) * undef16)) <= 0) /\ (undef10 = undef10) /\ (undef4 = 1) /\ (undef2 = (0 + undef4)) /\ (undef15 = (0 + undef2)) /\ (undef1 = undef1) /\ (undef109 = __disjvr_0^0) /\ (__disjvr_0^0 = undef109) /\ (0 <= ((~(1) + (~(1) * (1 + y_9^0))) + z_10^0)) /\ (undef92 = 0) /\ (0 <= (4 + (~(1) * undef92))) /\ (undef85 = undef85) /\ (undef91 = 0) /\ (undef84 = undef84) /\ (undef79 = 0) /\ (undef77 = (0 + undef79)) /\ (undef90 = (0 + undef77)) /\ (undef76 = undef76), par{__disjvr_0^0 -> undef109, tmp_11^0 -> (0 + undef90), y_9^0 -> (1 + y_9^0)}>
<l3, l4, ((0 + tmp_11^0) <= 0) /\ (0 <= (0 + tmp_11^0)) /\ (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0)) /\ (undef16 = (0 + b_128^0)) /\ ((5 + (~(1) * undef16)) <= 0) /\ (undef10 = undef10) /\ (undef4 = 1) /\ (undef2 = (0 + undef4)) /\ (undef15 = (0 + undef2)) /\ (undef1 = undef1) /\ (undef109 = __disjvr_0^0) /\ (__disjvr_0^0 = undef109) /\ (((0 + (~(1) * (1 + y_9^0))) + z_10^0) <= 0), par{__disjvr_0^0 -> undef109, tmp_11^0 -> (0 + undef15), x_8^0 -> (1 + x_8^0), y_9^0 -> (1 + y_9^0)}>
<l3, l3, ((0 + tmp_11^0) <= 0) /\ (0 <= (0 + tmp_11^0)) /\ (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0)) /\ (undef33 = (0 + b_128^0)) /\ (0 <= (4 + (~(1) * undef33))) /\ (undef26 = undef26) /\ (undef32 = (0 + b_128^0)) /\ (undef25 = undef25) /\ (undef20 = 0) /\ (undef18 = (0 + undef20)) /\ (undef31 = (0 + undef18)) /\ (undef17 = undef17), par{tmp_11^0 -> (0 + undef31)}>
<l4, l5, (((0 + (~(1) * x_8^0)) + y_9^0) <= 0) /\ (undef34 = undef34)>
<l4, l3, (0 <= ((~(1) + (~(1) * x_8^0)) + y_9^0)) /\ (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0)) /\ (undef151 = 0) /\ (0 <= (4 + (~(1) * undef151))) /\ (undef144 = undef144) /\ (undef150 = 0) /\ (undef143 = undef143) /\ (undef138 = 0) /\ (undef136 = (0 + undef138)) /\ (undef149 = (0 + undef136)) /\ (undef135 = undef135), par{tmp_11^0 -> (0 + undef149)}>
<l4, l4, (0 <= ((~(1) + (~(1) * x_8^0)) + y_9^0)) /\ (((0 + (~(1) * y_9^0)) + z_10^0) <= 0), par{x_8^0 -> (1 + x_8^0)}>

Fresh variables:
undef1, undef2, undef4, undef10, undef15, undef16, undef17, undef18, undef20, undef25, undef26, undef31, undef32, undef33, undef34, undef76, undef77, undef79, undef84, undef85, undef90, undef91, undef92, undef109, undef135, undef136, undef138, undef143, undef144, undef149, undef150, undef151, undef173, undef180, undef181, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef200, undef205, undef206, undef211, undef212, undef213, undef214, undef215, undef217, undef223, undef228, undef229, undef230, undef231, undef233, undef238, undef239, undef244, undef245, undef246, 

Undef variables:
undef1, undef2, undef4, undef10, undef15, undef16, undef17, undef18, undef20, undef25, undef26, undef31, undef32, undef33, undef34, undef76, undef77, undef79, undef84, undef85, undef90, undef91, undef92, undef109, undef135, undef136, undef138, undef143, undef144, undef149, undef150, undef151, undef173, undef180, undef181, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef200, undef205, undef206, undef211, undef212, undef213, undef214, undef215, undef217, undef223, undef228, undef229, undef230, undef231, undef233, undef238, undef239, undef244, undef245, undef246, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

*************************************************************
*******************************************************************************************
***********************       WORKING TRANSITION SYSTEM (DAG)       ***********************
*******************************************************************************************

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
<l4, l4, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l4, true, {all remain the same}>

Graph 2
<l4, l5, y_9^0 <= x_8^0, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 3 , 1 )
( 4 , 1 )
( 5 , 2 )

*******************************************************************************************
********************************    CHECKING ASSERTIONS    ********************************
*******************************************************************************************

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.034882

Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008578s
Ranking function: -35 + b_128^0 - 15*y_9^0 + 15*z_10^0
New Graphs: 
Transitions:
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
<l4, l4, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, x_8^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004041s
Ranking function: -71 + 14*b_128^0 - y_9^0 + z_10^0
New Graphs: 
Transitions:
<l4, l4, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
x_8^0, y_9^0, z_10^0
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001072s
Ranking function: -1 - x_8^0 + y_9^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000937s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004053s
Trying to remove transition: <l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.007889s
Time used: 0.007546
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.059970s
Time used: 0.05907
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.091775s
Time used: 0.091761

LOG: SAT solveNonLinear - Elapsed time: 0.151745s
Cost: 1; Total time: 0.150831
Failed at location 4: 1 + z_10^0 <= x_8^0
Before Improving: 
Quasi-invariant at l3: 1 + tmp_11^0 <= 0
Quasi-invariant at l4: 1 + z_10^0 <= x_8^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.014398s
Remaining time after improvement: 0.994671
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 1 + tmp_11^0 <= 0
Quasi-invariant at l4: 1 + z_10^0 <= x_8^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: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + z_10^0 <= x_8^0, {x_8^0 -> 1 + x_8^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: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 
Calling Safety with literal 1 + z_10^0 <= x_8^0 and entry <l0, l4, true, {all remain the same}>

LOG: CALL check - Post:1 + z_10^0 <= x_8^0 - Process 1
* Exit transition: <l0, l4, true, {all remain the same}>
* Postcondition  : 1 + z_10^0 <= x_8^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000626s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000700s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 1 + tmp_11^0 <= 0 , 
4: 1 + z_10^0 <= x_8^0 , 
Narrowing transition: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l4, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006579s
Ranking function: -73 + 14*b_128^0 - 3*y_9^0 + 3*z_10^0
New Graphs: 
Transitions:
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
x_8^0, y_9^0, z_10^0
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001206s
Ranking function: -x_8^0 + z_10^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000943s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004067s
Trying to remove transition: <l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008030s
Time used: 0.007687
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.045772s
Time used: 0.044709
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.068035s
Time used: 0.068023

LOG: SAT solveNonLinear - Elapsed time: 0.113807s
Cost: 1; Total time: 0.112732
Failed at location 4: 1 + y_9^0 <= x_8^0
Before Improving: 
Quasi-invariant at l3: 1 <= tmp_11^0
Quasi-invariant at l4: 1 + y_9^0 <= x_8^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.014490s
Remaining time after improvement: 0.994499
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 1 <= tmp_11^0
Quasi-invariant at l4: 1 + y_9^0 <= x_8^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: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l3, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^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: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 
Calling Safety with literal 1 + y_9^0 <= x_8^0 and entry <l0, l4, x_8^0 <= z_10^0, {all remain the same}>

LOG: CALL check - Post:1 + y_9^0 <= x_8^0 - Process 2
* Exit transition: <l0, l4, x_8^0 <= z_10^0, {all remain the same}>
* Postcondition  : 1 + y_9^0 <= x_8^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001026s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.001105s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 1 <= tmp_11^0 , 
4: 1 + y_9^0 <= x_8^0 , 
Narrowing transition: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006671s
Ranking function: -73 + 14*b_128^0 - 3*y_9^0 + 3*z_10^0
New Graphs: 
Transitions:
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
x_8^0, y_9^0, z_10^0
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001252s
Ranking function: -x_8^0 + z_10^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000958s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004086s
Trying to remove transition: <l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008166s
Time used: 0.007733
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.052204s
Time used: 0.051059
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.083176s
Time used: 0.083154

LOG: SAT solveNonLinear - Elapsed time: 0.135380s
Cost: 1; Total time: 0.134213
Failed at location 4: y_9^0 <= x_8^0
Before Improving: 
Quasi-invariant at l3: 1 + tmp_11^0 <= 0
Quasi-invariant at l4: y_9^0 <= x_8^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.014145s
Remaining time after improvement: 0.994916
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 1 + tmp_11^0 <= 0
Quasi-invariant at l4: y_9^0 <= x_8^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: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l3, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^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: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 
Calling Safety with literal y_9^0 <= x_8^0 and entry <l0, l4, x_8^0 <= y_9^0 /\ x_8^0 <= z_10^0, {all remain the same}>

LOG: CALL check - Post:y_9^0 <= x_8^0 - Process 3
* Exit transition: <l0, l4, x_8^0 <= y_9^0 /\ x_8^0 <= z_10^0, {all remain the same}>
* Postcondition  : y_9^0 <= x_8^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001095s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.001185s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 1 + tmp_11^0 <= 0 , 
4: y_9^0 <= x_8^0 , 
Narrowing transition: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006677s
Ranking function: -73 + 14*b_128^0 - 3*y_9^0 + 3*z_10^0
New Graphs: 
Transitions:
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
x_8^0, y_9^0, z_10^0
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001264s
Ranking function: -x_8^0 + z_10^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000969s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004121s
Trying to remove transition: <l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008216s
Time used: 0.007848
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.058990s
Time used: 0.057837
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.116653s
Time used: 0.116636

LOG: SAT solveNonLinear - Elapsed time: 0.175643s
Cost: 1; Total time: 0.174473
Failed at location 4: z_10^0 <= x_8^0
Before Improving: 
Quasi-invariant at l3: 1 <= tmp_11^0
Quasi-invariant at l4: z_10^0 <= x_8^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.016142s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005682s
Remaining time after improvement: 0.988068
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 1 <= tmp_11^0
Quasi-invariant at l4: z_10^0 <= 1 + x_8^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: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l3, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^0, {x_8^0 -> 1 + x_8^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: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 
Calling Safety with literal z_10^0 <= 1 + x_8^0 and entry <l0, l4, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0, {all remain the same}>

LOG: CALL check - Post:z_10^0 <= 1 + x_8^0 - Process 4
* Exit transition: <l0, l4, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0, {all remain the same}>
* Postcondition  : z_10^0 <= 1 + x_8^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000805s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000897s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 1 <= tmp_11^0 , 
4: z_10^0 <= 1 + x_8^0 , 
Narrowing transition: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, x_8^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l4, x_8^0 <= z_10^0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
<l4, l4, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006776s
Ranking function: -71 + 14*b_128^0 - y_9^0 + z_10^0
New Graphs: 
Transitions:
<l4, l4, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
x_8^0, y_9^0, z_10^0
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001270s
Ranking function: -1 - x_8^0 + y_9^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000972s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004120s
Trying to remove transition: <l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008263s
Time used: 0.007996
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.052356s
Time used: 0.051181
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.104509s
Time used: 0.104494

LOG: SAT solveNonLinear - Elapsed time: 0.156865s
Cost: 1; Total time: 0.155675
Failed at location 4: 1 + z_10^0 <= y_9^0
Before Improving: 
Quasi-invariant at l3: z_10^0 <= y_9^0
Quasi-invariant at l4: 1 + z_10^0 <= y_9^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.014203s
Remaining time after improvement: 0.994444
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: z_10^0 <= y_9^0
Quasi-invariant at l4: 1 + z_10^0 <= y_9^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: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 + x_8^0 <= y_9^0 /\ 1 + z_10^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0, {x_8^0 -> 1 + x_8^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: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 
Calling Safety with literal 1 + z_10^0 <= y_9^0 and entry <l0, l4, 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0, {all remain the same}>

LOG: CALL check - Post:1 + z_10^0 <= y_9^0 - Process 5
* Exit transition: <l0, l4, 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0, {all remain the same}>
* Postcondition  : 1 + z_10^0 <= y_9^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000839s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000929s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: z_10^0 <= y_9^0 , 
4: 1 + z_10^0 <= y_9^0 , 
Narrowing transition: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l4, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
<l4, l4, 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ y_9^0 = z_10^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006744s
Ranking function: -35 + b_128^0 - 15*y_9^0 + 15*z_10^0
New Graphs: 
Transitions:
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
<l4, l4, 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ y_9^0 = z_10^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, x_8^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004588s
Ranking function: -5 + b_128^0 - y_9^0 + z_10^0
New Graphs: 
Transitions:
<l4, l4, 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ y_9^0 = z_10^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
Variables:
x_8^0, y_9^0, z_10^0
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001290s
Ranking function: -1 - x_8^0 + y_9^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000966s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004175s
Trying to remove transition: <l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008261s
Time used: 0.007992
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.067149s
Time used: 0.065998
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.072483s
Time used: 0.072471

LOG: SAT solveNonLinear - Elapsed time: 0.139632s
Cost: 1; Total time: 0.138469
Failed at location 4: z_10^0 <= y_9^0
Before Improving: 
Quasi-invariant at l3: 1 <= 0
Quasi-invariant at l4: z_10^0 <= y_9^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.015525s
Remaining time after improvement: 0.993425
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 1 <= 0
Quasi-invariant at l4: z_10^0 <= y_9^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: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ y_9^0 = z_10^0, {x_8^0 -> 1 + x_8^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: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 
Calling Safety with literal z_10^0 <= y_9^0 and entry <l0, l4, y_9^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0, {all remain the same}>

LOG: CALL check - Post:z_10^0 <= y_9^0 - Process 6
* Exit transition: <l0, l4, y_9^0 <= z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0, {all remain the same}>
* Postcondition  : z_10^0 <= y_9^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000894s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.001015s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 1 <= 0 , 
4: z_10^0 <= y_9^0 , 
Narrowing transition: 
<l3, l3, 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l3, l4, 5 <= undef16 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ 1 + y_9^0 = z_10^0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef15, x_8^0 -> 1 + x_8^0, y_9^0 -> 1 + y_9^0, rest remain the same}>
Narrowing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l4, l4, 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ y_9^0 = z_10^0, {x_8^0 -> 1 + x_8^0, rest remain the same}>
invGraph after Narrowing: 
Transitions:
<l3, l3, 0 <= 0 /\ 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003492s
Ranking function: -1 - y_9^0 + z_10^0
New Graphs: 
Transitions:
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001023s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004368s
Trying to remove transition: <l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.008375s
Time used: 0.008096
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.292996s
Time used: 0.291924
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.062553s
Time used: 0.062541

LOG: SAT solveNonLinear - Elapsed time: 0.355549s
Cost: 1; Total time: 0.354465
Failed at location 4: 3 + z_10^0 <= b_128^0 + x_8^0
Before Improving: 
Quasi-invariant at l3: 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0
Quasi-invariant at l4: 3 + z_10^0 <= b_128^0 + x_8^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010777s
Remaining time after improvement: 0.994919
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0
Quasi-invariant at l4: 3 + z_10^0 <= b_128^0 + x_8^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= 0 /\ 5 <= undef16 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, 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: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 
Calling Safety with literal 3 + z_10^0 <= b_128^0 + x_8^0 and entry <l0, l4, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0, {all remain the same}>

LOG: CALL check - Post:3 + z_10^0 <= b_128^0 + x_8^0 - Process 7
* Exit transition: <l0, l4, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0, {all remain the same}>
* Postcondition  : 3 + z_10^0 <= b_128^0 + x_8^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001041s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.001158s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 , 
4: 3 + z_10^0 <= b_128^0 + x_8^0 , 
Narrowing transition: 
<l3, l3, 0 <= 0 /\ 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 0 <= 0 /\ 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005250s
Ranking function: -67 + 13*b_128^0 - y_9^0 + z_10^0
New Graphs: 
Transitions:
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001164s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005495s
Trying to remove transition: <l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009375s
Time used: 0.008849
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.460580s
Time used: 0.459527
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.076195s
Time used: 0.076182

LOG: SAT solveNonLinear - Elapsed time: 0.536774s
Cost: 1; Total time: 0.535709
Failed at location 4: 4 + z_10^0 <= b_128^0 + y_9^0
Before Improving: 
Quasi-invariant at l3: 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0
Quasi-invariant at l4: 4 + z_10^0 <= b_128^0 + y_9^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011268s
Remaining time after improvement: 0.995017
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0
Quasi-invariant at l4: 4 + z_10^0 <= b_128^0 + y_9^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: 
<l3, l3, 0 <= 0 /\ 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 
Calling Safety with literal 4 + z_10^0 <= b_128^0 + y_9^0 and entry <l0, l4, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0, {all remain the same}>

LOG: CALL check - Post:4 + z_10^0 <= b_128^0 + y_9^0 - Process 8
* Exit transition: <l0, l4, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0, {all remain the same}>
* Postcondition  : 4 + z_10^0 <= b_128^0 + y_9^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001375s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.001495s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 , 
4: 4 + z_10^0 <= b_128^0 + y_9^0 , 
Narrowing transition: 
<l3, l3, 0 <= 0 /\ 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 0 <= 0 /\ 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005647s
Ranking function: -19 + b_128^0 - 7*y_9^0 + 7*z_10^0
New Graphs: 
Transitions:
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001283s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006219s
Trying to remove transition: <l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.009527s
Time used: 0.009049
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.521195s
Time used: 0.519998
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.063724s
Time used: 0.063708

LOG: SAT solveNonLinear - Elapsed time: 0.584919s
Cost: 1; Total time: 0.583706
Failed at location 4: 4 + y_9^0 <= b_128^0 + x_8^0
Before Improving: 
Quasi-invariant at l3: 5 <= b_128^0 + tmp_11^0
Quasi-invariant at l4: 4 + y_9^0 <= b_128^0 + x_8^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.012859s
Remaining time after improvement: 0.99358
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 5 <= b_128^0 + tmp_11^0
Quasi-invariant at l4: 4 + y_9^0 <= b_128^0 + x_8^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= 0 /\ 5 <= b_128^0 + tmp_11^0 /\ 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + y_9^0 <= b_128^0 + x_8^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, 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: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 
Calling Safety with literal 4 + y_9^0 <= b_128^0 + x_8^0 and entry <l0, l4, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>

LOG: CALL check - Post:4 + y_9^0 <= b_128^0 + x_8^0 - Process 9
* Exit transition: <l0, l4, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
* Postcondition  : 4 + y_9^0 <= b_128^0 + x_8^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001262s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.001394s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 5 <= b_128^0 + tmp_11^0 , 
4: 4 + y_9^0 <= b_128^0 + x_8^0 , 
It's unfeasible. Removing transition: 
<l3, l3, 0 <= 0 /\ 5 <= undef16 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ __disjvr_0^0 = undef109 /\ b_128^0 = undef16 /\ tmp_11^0 = 0 /\ undef2 = undef4 /\ undef2 = undef15 /\ undef77 = undef79 /\ undef77 = undef90 /\ undef79 = 0 /\ undef91 = 0 /\ undef92 = 0 /\ undef4 = 1, {__disjvr_0^0 -> undef109, tmp_11^0 -> undef90, y_9^0 -> 1 + y_9^0, rest remain the same}>
Narrowing transition: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001392s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007170s
Trying to remove transition: <l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010287s
Time used: 0.009771
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.545209s
Time used: 0.544083
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.073212s
Time used: 0.073199

LOG: SAT solveNonLinear - Elapsed time: 0.618421s
Cost: 1; Total time: 0.617282
Failed at location 4: 5 <= b_128^0
Before Improving: 
Quasi-invariant at l3: 5 <= b_128^0
Quasi-invariant at l4: 5 <= b_128^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009692s
Remaining time after improvement: 0.995399
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 5 <= b_128^0
Quasi-invariant at l4: 5 <= b_128^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: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l3, 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, 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: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
New Graphs: 
Calling Safety with literal 5 <= b_128^0 and entry <l0, l4, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>

LOG: CALL check - Post:5 <= b_128^0 - Process 10
* Exit transition: <l0, l4, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
* Postcondition  : 5 <= b_128^0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001353s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.001481s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 5 <= b_128^0 , 
4: 5 <= b_128^0 , 
Narrowing transition: 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0
Checking conditional termination of SCC {l3, l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002897s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.015316s
Trying to remove transition: <l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.019463s
Time used: 0.018011
Trying to remove transition: <l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016537s
Time used: 0.014625
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.064500s
Time used: 0.062444
Improving Solution with cost 1 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.080540s
Time used: 0.080527

LOG: SAT solveNonLinear - Elapsed time: 0.145041s
Cost: 1; Total time: 0.142971
Failed at location 4: 1 <= tmp_11^0
Before Improving: 
Quasi-invariant at l3: y_9^0 <= tmp_11^0 + z_10^0
Quasi-invariant at l4: 1 <= tmp_11^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.015117s
Remaining time after improvement: 0.992689
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: y_9^0 <= tmp_11^0 + z_10^0
Quasi-invariant at l4: 1 <= tmp_11^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= 0 /\ y_9^0 <= tmp_11^0 + z_10^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l3, 1 <= tmp_11^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, 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): 
<l3, l3, 0 <= 0 /\ y_9^0 <= tmp_11^0 + z_10^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l3, 1 <= tmp_11^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
Ranking function: tmp_11^0
New Graphs: 
Transitions:
<l3, l3, 0 <= 0 /\ y_9^0 <= tmp_11^0 + z_10^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Variables:
b_128^0, tmp_11^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001563s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007842s
Trying to remove transition: <l3, l3, 0 <= 0 /\ y_9^0 <= tmp_11^0 + z_10^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.010907s
Time used: 0.010209
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.635846s
Time used: 0.634877
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.003252s
Time used: 4.00029
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 1.006850s
Time used: 1.00004
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.064972s
Time used: 0.028508

Proving non-termination of subgraph 1
Transitions:
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>
Variables:
__disjvr_0^0, b_128^0, tmp_11^0, y_9^0, z_10^0, x_8^0

Checking that every undef value has an assignment...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.011142s
Checking conditional non-termination of SCC {l3, l4}...
EXIT TRANSITIONS:
<l3, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0, {all remain the same}>
<l3, end, tmp_11^0 <= 0 /\ z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0, {all remain the same}>
<l3, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
<l3, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 1 + tmp_11^0 <= 0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 + tmp_11^0 <= 4, {all remain the same}>
<l3, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ b_128^0 <= 4, {all remain the same}>
<l3, end, z_10^0 <= y_9^0 /\ 1 <= tmp_11^0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4, {all remain the same}>
<l3, end, tmp_11^0 <= 0 /\ z_10^0 <= y_9^0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4, {all remain the same}>
<l3, end, z_10^0 <= y_9^0 /\ 1 <= tmp_11^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
<l3, end, z_10^0 <= y_9^0 /\ 1 + tmp_11^0 <= 0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, z_10^0 <= y_9^0 /\ 1 <= tmp_11^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
<l3, end, tmp_11^0 <= 0 /\ z_10^0 <= y_9^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
<l3, end, 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0, {all remain the same}>
<l3, end, tmp_11^0 <= 0 /\ 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0, {all remain the same}>
<l3, end, 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
<l3, end, 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
<l3, end, tmp_11^0 <= 0 /\ 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
<l3, end, 5 <= b_128^0 /\ 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
<l3, end, 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
<l3, end, 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ z_10^0 <= 1 + x_8^0 /\ 4 + y_9^0 <= b_128^0 + x_8^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ z_10^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^0 /\ b_128^0 <= 4 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ z_10^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^0 /\ b_128^0 <= 4 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ 5 <= b_128^0 /\ 1 + y_9^0 <= z_10^0 /\ z_10^0 <= 1 + x_8^0 /\ 4 + y_9^0 <= b_128^0 + x_8^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ 1 + y_9^0 <= z_10^0 /\ z_10^0 <= 1 + x_8^0 /\ 4 + y_9^0 <= b_128^0 + x_8^0 /\ b_128^0 <= 4 /\ 3 + z_10^0 <= b_128^0 + x_8^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ 1 + y_9^0 <= z_10^0 /\ z_10^0 <= 1 + x_8^0 /\ b_128^0 <= 4 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ 5 <= b_128^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + y_9^0 <= b_128^0 + x_8^0 /\ 2 + x_8^0 <= z_10^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ 5 <= b_128^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + y_9^0 <= b_128^0 + x_8^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l4, end, y_9^0 <= x_8^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 <= 4 /\ 3 + z_10^0 <= b_128^0 + x_8^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^0 /\ b_128^0 <= 4 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
<l4, end, 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + y_9^0 <= b_128^0 + x_8^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
<l4, end, 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.062481s
Time used: 4.05921
Improving Solution with cost 39 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.943566s
Time used: 0.943459

LOG: SAT solveNonLinear - Elapsed time: 5.006047s
Cost: 39; Total time: 5.00266
Failed at location 4: 1 + x_8^0 <= y_9^0
Before Improving: 
Quasi-invariant at l3: 1 + y_9^0 <= z_10^0
Quasi-invariant at l4: 1 + x_8^0 <= y_9^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.035676s
Remaining time after improvement: 0.975745
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.050081s
Number of undef constraints reduced!

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 1 + y_9^0 <= z_10^0
Quasi-invariant at l4: 1 + x_8^0 <= y_9^0

Strengthening and disabling EXIT transitions...
Closed exits from l3: 11
Closed exits from l4: 9
Strengthening exit transition (result): 
<l3, end, 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, tmp_11^0 <= 0 /\ 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, tmp_11^0 <= 0 /\ 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, 5 <= b_128^0 /\ 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l4, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
Strengthening exit transition (result): 
<l4, end, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 <= 4 /\ 3 + z_10^0 <= b_128^0 + x_8^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
Strengthening exit transition (result): 
<l4, end, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^0 /\ b_128^0 <= 4 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
Strengthening exit transition (result): 
<l4, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
Strengthening exit transition (result): 
<l4, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
Strengthening exit transition (result): 
<l4, end, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
Strengthening exit transition (result): 
<l4, end, 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + y_9^0 <= b_128^0 + x_8^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
Strengthening exit transition (result): 
<l4, end, 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0, {all remain the same}>

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

Checking conditional non-termination of SCC {l3, l4}...
EXIT TRANSITIONS:
<l3, end, 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0, {all remain the same}>
<l3, end, tmp_11^0 <= 0 /\ 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0, {all remain the same}>
<l3, end, 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
<l3, end, 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
<l3, end, tmp_11^0 <= 0 /\ 5 <= b_128^0 /\ 5 <= b_128^0 + tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
<l3, end, 5 <= b_128^0 /\ 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, 5 <= b_128^0 + tmp_11^0 /\ 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
<l3, end, 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
<l3, end, 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 <= 4 /\ 3 + z_10^0 <= b_128^0 + x_8^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^0 /\ b_128^0 <= 4 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
<l4, end, z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
<l4, end, 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + y_9^0 <= b_128^0 + x_8^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0, {all remain the same}>
<l4, end, 5 <= b_128^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 3.005517s
Time used: 3.0021
Improving Solution with cost 15 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002836s
Time used: 1.00271

LOG: SAT solveNonLinear - Elapsed time: 4.008353s
Cost: 15; Total time: 4.00481
Failed at location 4: 1 + b_128^0 <= 0
Before Improving: 
Quasi-invariant at l3: 1 + b_128^0 + tmp_11^0 <= 0
Quasi-invariant at l4: 1 + b_128^0 <= 0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.044098s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.023248s
Remaining time after improvement: 0.949798
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.037841s
Number of undef constraints reduced!

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: b_128^0 + tmp_11^0 <= 0
Quasi-invariant at l4: b_128^0 <= 0

Strengthening and disabling EXIT transitions...
Closed exits from l3: 7
Closed exits from l4: 5
Strengthening exit transition (result): 
<l3, end, b_128^0 + tmp_11^0 <= 0 /\ 5 <= b_128^0 /\ 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, b_128^0 + tmp_11^0 <= 0 /\ 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, b_128^0 + tmp_11^0 <= 0 /\ 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l3, end, b_128^0 + tmp_11^0 <= 0 /\ 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
Strengthening exit transition (result): 
<l4, end, b_128^0 <= 0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
Strengthening exit transition (result): 
<l4, end, b_128^0 <= 0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
Strengthening exit transition (result): 
<l4, end, b_128^0 <= 0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= 0 /\ b_128^0 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l3, b_128^0 <= 0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

Checking conditional non-termination of SCC {l3, l4}...
EXIT TRANSITIONS:
<l3, end, b_128^0 + tmp_11^0 <= 0 /\ 5 <= b_128^0 /\ 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, b_128^0 + tmp_11^0 <= 0 /\ 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ 4 + tmp_11^0 + z_10^0 <= b_128^0 + y_9^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0, {all remain the same}>
<l3, end, b_128^0 + tmp_11^0 <= 0 /\ 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
<l3, end, b_128^0 + tmp_11^0 <= 0 /\ 1 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>
<l4, end, b_128^0 <= 0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^0 /\ 4 + z_10^0 <= b_128^0 + y_9^0 /\ 3 + z_10^0 <= b_128^0 + x_8^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
<l4, end, b_128^0 <= 0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ z_10^0 <= 1 + x_8^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>
<l4, end, b_128^0 <= 0 /\ z_10^0 <= y_9^0 /\ 1 + x_8^0 <= y_9^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.575072s
Time used: 0.573135
Improving Solution with cost 3 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.008867s
Time used: 1.00876

LOG: SAT solveNonLinear - Elapsed time: 1.583939s
Cost: 3; Total time: 1.58189
Failed at location 4: 1 + y_9^0 <= b_128^0 + z_10^0
Before Improving: 
Quasi-invariant at l3: 0 <= tmp_11^0
Quasi-invariant at l4: 1 + y_9^0 <= b_128^0 + z_10^0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.031020s
Remaining time after improvement: 0.98201
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.031090s
Number of undef constraints reduced!

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: 0 <= tmp_11^0
Quasi-invariant at l4: 1 + y_9^0 <= b_128^0 + z_10^0

Strengthening and disabling EXIT transitions...
Closed exits from l3: 3
Closed exits from l4: 3
Strengthening exit transition (result): 
<l3, end, b_128^0 + tmp_11^0 <= 0 /\ 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= 0 /\ b_128^0 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l3, b_128^0 <= 0 /\ 1 + y_9^0 <= b_128^0 + z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

Checking conditional non-termination of SCC {l3, l4}...
EXIT TRANSITIONS:
<l3, end, b_128^0 + tmp_11^0 <= 0 /\ 1 <= tmp_11^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.447587s
Time used: 0.447407

LOG: SAT solveNonLinear - Elapsed time: 0.447587s
Cost: 0; Total time: 0.447407
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.034003s
Number of undef constraints reduced!

Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l3: tmp_11^0 <= 0

Strengthening and disabling EXIT transitions...
Closed exits from l3: 1

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 0 <= 0 /\ b_128^0 + tmp_11^0 <= 0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ undef33 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + tmp_11^0 + z_10^0 /\ b_128^0 = undef32 /\ b_128^0 = undef33 /\ tmp_11^0 = 0 /\ undef18 = undef20 /\ undef18 = undef31 /\ undef20 = 0, {tmp_11^0 -> undef31, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l3, b_128^0 <= 0 /\ 1 + y_9^0 <= b_128^0 + z_10^0 /\ 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ 2 + x_8^0 <= z_10^0 /\ b_128^0 + x_8^0 <= 2 + z_10^0 /\ b_128^0 + x_8^0 <= 3 + y_9^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ undef136 = undef138 /\ undef136 = undef149 /\ undef138 = 0 /\ undef150 = 0 /\ undef151 = 0, {tmp_11^0 -> undef149, rest remain the same}>

Calling reachability with...
Transition: <l4, end, true, {all remain the same}>
Conditions: 1 + x_8^0 <= y_9^0, b_128^0 <= 0, 1 + y_9^0 <= b_128^0 + z_10^0, 
OPEN EXITS: 
<l4, end, 1 + y_9^0 <= b_128^0 + z_10^0 /\ 1 + x_8^0 <= y_9^0, {all remain the same}> (condsUp: b_128^0 <= 0)

--- Reachability graph ---
> Graph without transitions.

Calling reachability with...
Transition: <l0, l4, true, {all remain the same}>
Conditions: 1 + y_9^0 <= b_128^0 + z_10^0, 1 + x_8^0 <= y_9^0, b_128^0 <= 0, 
OPEN EXITS: 
<l0, l4, b_128^0 <= 0 /\ 1 + y_9^0 <= b_128^0 + z_10^0 /\ 1 + x_8^0 <= y_9^0, {all remain the same}>

> Conditions are reachable!

Program does NOT terminate