NO

Solver Timeout: 4
Global Timeout: 300
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.015274

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003927s
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.001924s
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.000499s
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.000450s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001930s
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.003682s
Time used: 0.003506
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.039497s
Time used: 0.039436

LOG: SAT solveNonLinear - Elapsed time: 0.065472s
Cost: 1; Total time: 0.064928
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.006989s
Remaining time after improvement: 0.997532
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.000299s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000328s
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.003095s
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.000574s
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.000453s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001925s
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.003771s
Time used: 0.0036
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.030339s
Time used: 0.030337

LOG: SAT solveNonLinear - Elapsed time: 0.050866s
Cost: 1; Total time: 0.050282
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.007033s
Remaining time after improvement: 0.997448
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.000479s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000513s
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.003138s
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.000580s
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.000453s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001929s
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.003818s
Time used: 0.003646
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.036409s
Time used: 0.036407

LOG: SAT solveNonLinear - Elapsed time: 0.059228s
Cost: 1; Total time: 0.058604
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.007037s
Remaining time after improvement: 0.997631
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.000502s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000540s
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.003138s
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.000596s
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.000459s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001932s
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.003882s
Time used: 0.003679
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.049933s
Time used: 0.04993

LOG: SAT solveNonLinear - Elapsed time: 0.075719s
Cost: 1; Total time: 0.075144
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.007883s
Quasi-invariant improved

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002757s
Remaining time after improvement: 0.994338
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.000377s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000416s
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.003166s
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.000586s
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.000464s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001920s
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.003864s
Time used: 0.003724
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.045391s
Time used: 0.045389

LOG: SAT solveNonLinear - Elapsed time: 0.068396s
Cost: 1; Total time: 0.067764
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.007005s
Remaining time after improvement: 0.997394
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.000391s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000428s
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.003161s
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.002140s
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.000603s
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.000462s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001963s
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.003892s
Time used: 0.003752
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.032130s
Time used: 0.032128

LOG: SAT solveNonLinear - Elapsed time: 0.061936s
Cost: 1; Total time: 0.061312
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.007490s
Remaining time after improvement: 0.996882
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.000426s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000468s
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.001631s
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.000501s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002066s
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.003942s
Time used: 0.003791
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.027745s
Time used: 0.027742

LOG: SAT solveNonLinear - Elapsed time: 0.157443s
Cost: 1; Total time: 0.156873
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.005174s
Remaining time after improvement: 0.997656
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.000498s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000544s
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.002463s
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.000552s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002591s
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.004440s
Time used: 0.004155
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.030927s
Time used: 0.030925

LOG: SAT solveNonLinear - Elapsed time: 0.232951s
Cost: 1; Total time: 0.232381
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.005498s
Remaining time after improvement: 0.997669
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.000764s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000815s
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.002687s
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.000610s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002898s
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.004497s
Time used: 0.004195
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.027774s
Time used: 0.027772

LOG: SAT solveNonLinear - Elapsed time: 0.259941s
Cost: 1; Total time: 0.259252
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.006314s
Remaining time after improvement: 0.996973
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.000588s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000646s
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.000663s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003363s
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.004897s
Time used: 0.004593
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.031832s
Time used: 0.03183

LOG: SAT solveNonLinear - Elapsed time: 0.278597s
Cost: 1; Total time: 0.277923
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.004803s
Remaining time after improvement: 0.997899
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.000644s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000699s
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.001434s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007025s
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.009156s
Time used: 0.00831
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.007635s
Time used: 0.006665
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.034391s
Time used: 0.034388

LOG: SAT solveNonLinear - Elapsed time: 0.062693s
Cost: 1; Total time: 0.061581
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.007477s
Remaining time after improvement: 0.996296
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.000747s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003643s
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.005161s
Time used: 0.004769
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.021389s
Time used: 0.013276

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.005149s
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: 1.924571s
Time used: 1.9229
Improving Solution with cost 39 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001798s
Time used: 1.00178

LOG: SAT solveNonLinear - Elapsed time: 2.926368s
Cost: 39; Total time: 2.92468
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.018147s
Remaining time after improvement: 0.987972
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.023853s
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: 1.385632s
Time used: 1.38437
Improving Solution with cost 15 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001198s
Time used: 1.00118

LOG: SAT solveNonLinear - Elapsed time: 2.386830s
Cost: 15; Total time: 2.38555
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.021520s
Quasi-invariant improved

LOG: CALL solveLinear

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

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.017120s
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.262895s
Time used: 0.261845
Improving Solution with cost 3 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001148s
Time used: 1.00113

LOG: SAT solveNonLinear - Elapsed time: 1.264044s
Cost: 3; Total time: 1.26298
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.016966s
Remaining time after improvement: 0.990774
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.014545s
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.203035s
Time used: 0.202956

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

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.017245s
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