/export/starexec/sandbox2/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox2/benchmark/theBenchmark.smt2 /export/starexec/sandbox2/output/output_files


--------------------------------------------------------------------------------


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l13, true>
<l1, l2, (undef15 = (0 + b_128^0)) /\ ((5 + (~(1) * undef15)) <= 0) /\ (undef9 = undef9) /\ (undef3 = 1) /\ (undef2 = (0 + undef3)) /\ (undef14 = (0 + undef2)) /\ (undef1 = undef1), par{Result_4^0 -> undef1, ___cil_tmp2_7^0 -> undef2, ___retres1_6^0 -> undef3, lt_13^0 -> undef9, tmp_11^0 -> (0 + undef14)}>
<l1, l3, (undef31 = (0 + b_128^0)) /\ (0 <= (4 + (~(1) * undef31))) /\ (undef24 = undef24) /\ (undef30 = (0 + b_128^0)) /\ (undef23 = undef23) /\ (undef18 = 0) /\ (undef17 = (0 + undef18)) /\ (undef29 = (0 + undef17)) /\ (undef16 = undef16), par{Result_4^0 -> undef16, ___cil_tmp2_7^0 -> undef17, ___retres1_6^0 -> undef18, lt_12^0 -> undef23, lt_13^0 -> undef24, tmp_11^0 -> (0 + undef29)}>
<l4, l5, (((0 + (~(1) * x_8^0)) + y_9^0) <= 0) /\ (undef32 = undef32), par{Result_4^0 -> undef32}>
<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)) /\ (undef86 = 0) /\ (0 <= (4 + (~(1) * undef86))) /\ (undef79 = undef79) /\ (undef85 = 0) /\ (undef78 = undef78) /\ (undef73 = 0) /\ (undef72 = (0 + undef73)) /\ (undef84 = (0 + undef72)) /\ (undef71 = undef71), par{Result_4^0 -> undef71, ___cil_tmp2_7^0 -> undef72, ___retres1_6^0 -> undef73, lt_12^0 -> undef78, lt_13^0 -> undef79, tmp_11^0 -> (0 + undef84)}>
<l7, l4, (((0 + (~(1) * y_9^0)) + z_10^0) <= 0), par{x_8^0 -> (1 + x_8^0)}>
<l2, l8, ((1 + tmp_11^0) <= 0)>
<l2, l8, (1 <= (0 + tmp_11^0))>
<l8, l7, true, par{y_9^0 -> (1 + y_9^0)}>
<l6, l3, (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0)) /\ (undef154 = 0) /\ (0 <= (4 + (~(1) * undef154))) /\ (undef147 = undef147) /\ (undef153 = 0) /\ (undef146 = undef146) /\ (undef141 = 0) /\ (undef140 = (0 + undef141)) /\ (undef152 = (0 + undef140)) /\ (undef139 = undef139), par{Result_4^0 -> undef139, ___cil_tmp2_7^0 -> undef140, ___retres1_6^0 -> undef141, lt_12^0 -> undef146, lt_13^0 -> undef147, tmp_11^0 -> (0 + undef152)}>
<l6, l4, (((0 + (~(1) * y_9^0)) + z_10^0) <= 0), par{x_8^0 -> (1 + x_8^0)}>
<l9, l4, (undef174 = undef174), par{count_5^0 -> undef174}>
<l10, l3, (undef196 = 1) /\ (0 <= (4 + (~(1) * undef196))) /\ (undef189 = undef189) /\ (undef195 = 1) /\ (undef188 = undef188) /\ (undef183 = 0) /\ (undef182 = (0 + undef183)) /\ (undef194 = (0 + undef182)) /\ (undef181 = undef181), par{Result_4^0 -> undef181, ___cil_tmp2_7^0 -> undef182, ___retres1_6^0 -> undef183, b_51^0 -> 2, lt_12^0 -> undef188, lt_13^0 -> undef189, tmp_11^0 -> (0 + undef194)}>
<l11, l3, (undef212 = (0 + b_51^0)) /\ (0 <= (4 + (~(1) * undef212))) /\ (undef205 = undef205) /\ (undef211 = (0 + b_51^0)) /\ (undef204 = undef204) /\ (undef199 = 0) /\ (undef198 = (0 + undef199)) /\ (undef210 = (0 + undef198)) /\ (undef197 = undef197), par{Result_4^0 -> undef197, ___cil_tmp2_7^0 -> undef198, ___retres1_6^0 -> undef199, b_76^0 -> (1 + b_51^0), lt_12^0 -> undef204, lt_13^0 -> undef205, tmp_11^0 -> (0 + undef210)}>
<l11, l2, (undef227 = (0 + b_51^0)) /\ ((5 + (~(1) * undef227)) <= 0) /\ (undef221 = undef221) /\ (undef215 = 1) /\ (undef214 = (0 + undef215)) /\ (undef226 = (0 + undef214)) /\ (undef213 = undef213), par{Result_4^0 -> undef213, ___cil_tmp2_7^0 -> undef214, ___retres1_6^0 -> undef215, lt_13^0 -> undef221, tmp_11^0 -> (0 + undef226)}>
<l12, l3, (undef243 = 1) /\ (0 <= (4 + (~(1) * undef243))) /\ (undef236 = undef236) /\ (undef242 = 1) /\ (undef235 = undef235) /\ (undef230 = 0) /\ (undef229 = (0 + undef230)) /\ (undef241 = (0 + undef229)) /\ (undef228 = undef228), par{Result_4^0 -> undef228, ___cil_tmp2_7^0 -> undef229, ___retres1_6^0 -> undef230, b_128^0 -> 2, lt_12^0 -> undef235, lt_13^0 -> undef236, tmp_11^0 -> (0 + undef241)}>
<l13, l9, true>

Fresh variables:
undef1, undef2, undef3, undef9, undef14, undef15, undef16, undef17, undef18, undef23, undef24, undef29, undef30, undef31, undef32, undef71, undef72, undef73, undef78, undef79, undef84, undef85, undef86, undef139, undef140, undef141, undef146, undef147, undef152, undef153, undef154, undef174, undef181, undef182, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef199, undef204, undef205, undef210, undef211, undef212, undef213, undef214, undef215, undef221, undef226, undef227, undef228, undef229, undef230, undef235, undef236, undef241, undef242, undef243, 

Undef variables:
undef1, undef2, undef3, undef9, undef14, undef15, undef16, undef17, undef18, undef23, undef24, undef29, undef30, undef31, undef32, undef71, undef72, undef73, undef78, undef79, undef84, undef85, undef86, undef139, undef140, undef141, undef146, undef147, undef152, undef153, undef154, undef174, undef181, undef182, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef199, undef204, undef205, undef210, undef211, undef212, undef213, undef214, undef215, undef221, undef226, undef227, undef228, undef229, undef230, undef235, undef236, undef241, undef242, undef243, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, (undef174 = undef174)>
<l3, l3, ((0 + tmp_11^0) <= 0) /\ (0 <= (0 + tmp_11^0)) /\ (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0)) /\ (undef15 = (0 + b_128^0)) /\ ((5 + (~(1) * undef15)) <= 0) /\ (undef9 = undef9) /\ (undef3 = 1) /\ (undef2 = (0 + undef3)) /\ (undef14 = (0 + undef2)) /\ (undef1 = undef1) /\ (1 <= (0 + (0 + undef14))) /\ (0 <= ((~(1) + (~(1) * (1 + y_9^0))) + z_10^0)) /\ (undef86 = 0) /\ (0 <= (4 + (~(1) * undef86))) /\ (undef79 = undef79) /\ (undef85 = 0) /\ (undef78 = undef78) /\ (undef73 = 0) /\ (undef72 = (0 + undef73)) /\ (undef84 = (0 + undef72)) /\ (undef71 = undef71), par{tmp_11^0 -> (0 + undef84), 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)) /\ (undef15 = (0 + b_128^0)) /\ ((5 + (~(1) * undef15)) <= 0) /\ (undef9 = undef9) /\ (undef3 = 1) /\ (undef2 = (0 + undef3)) /\ (undef14 = (0 + undef2)) /\ (undef1 = undef1) /\ (1 <= (0 + (0 + undef14))) /\ (((0 + (~(1) * (1 + y_9^0))) + z_10^0) <= 0), par{tmp_11^0 -> (0 + undef14), 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)) /\ (undef31 = (0 + b_128^0)) /\ (0 <= (4 + (~(1) * undef31))) /\ (undef24 = undef24) /\ (undef30 = (0 + b_128^0)) /\ (undef23 = undef23) /\ (undef18 = 0) /\ (undef17 = (0 + undef18)) /\ (undef29 = (0 + undef17)) /\ (undef16 = undef16), par{tmp_11^0 -> (0 + undef29)}>
<l4, l5, (((0 + (~(1) * x_8^0)) + y_9^0) <= 0) /\ (undef32 = undef32)>
<l4, l3, (0 <= ((~(1) + (~(1) * x_8^0)) + y_9^0)) /\ (0 <= ((~(1) + (~(1) * y_9^0)) + z_10^0)) /\ (undef154 = 0) /\ (0 <= (4 + (~(1) * undef154))) /\ (undef147 = undef147) /\ (undef153 = 0) /\ (undef146 = undef146) /\ (undef141 = 0) /\ (undef140 = (0 + undef141)) /\ (undef152 = (0 + undef140)) /\ (undef139 = undef139), par{tmp_11^0 -> (0 + undef152)}>
<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, undef3, undef9, undef14, undef15, undef16, undef17, undef18, undef23, undef24, undef29, undef30, undef31, undef32, undef71, undef72, undef73, undef78, undef79, undef84, undef85, undef86, undef139, undef140, undef141, undef146, undef147, undef152, undef153, undef154, undef174, undef181, undef182, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef199, undef204, undef205, undef210, undef211, undef212, undef213, undef214, undef215, undef221, undef226, undef227, undef228, undef229, undef230, undef235, undef236, undef241, undef242, undef243, 

Undef variables:
undef1, undef2, undef3, undef9, undef14, undef15, undef16, undef17, undef18, undef23, undef24, undef29, undef30, undef31, undef32, undef71, undef72, undef73, undef78, undef79, undef84, undef85, undef86, undef139, undef140, undef141, undef146, undef147, undef152, undef153, undef154, undef174, undef181, undef182, undef183, undef188, undef189, undef194, undef195, undef196, undef197, undef198, undef199, undef204, undef205, undef210, undef211, undef212, undef213, undef214, undef215, undef221, undef226, undef227, undef228, undef229, undef230, undef235, undef236, undef241, undef242, undef243, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l3, 5 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l4, 5 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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:
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.027409

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

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007599s
Ranking function: -35 + b_128^0 - 15*y_9^0 + 15*z_10^0
New Graphs: 
Transitions:
<l3, l4, 5 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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:
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.003790s
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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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.001045s
Ranking function: -1 - x_8^0 + y_9^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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.000925s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003997s
[47902 : 47903]
[47902 : 47904]
Successful child: 47903
[ 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 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, 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 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
New Graphs: 

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

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.000709s
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 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l4, 5 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l4, 5 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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:
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.006305s
Ranking function: -35 + b_128^0 - 15*y_9^0 + 15*z_10^0
New Graphs: 
Transitions:
<l3, l4, 5 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
<l4, l3, 1 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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:
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.003867s
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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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.001099s
Ranking function: -1 - x_8^0 + y_9^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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.000927s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004013s
[47902 : 47908]
[47902 : 47909]
Successful child: 47908
[ 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 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, 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 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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 /\ 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:z_10^0 <= 1 + x_8^0 - Process 2
* Exit transition: <l0, l4, 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.000599s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000679s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 1 + tmp_11^0 <= 0 , 
4: z_10^0 <= 1 + x_8^0 , 
Narrowing transition: 
<l3, l3, 5 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l4, 5 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l4, 5 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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:
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.006656s
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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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.001106s
Ranking function: -1 - x_8^0 + y_9^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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.000947s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004036s
[47902 : 47913]
[47902 : 47914]
Successful child: 47913
[ 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 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, 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 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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 /\ 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:z_10^0 <= y_9^0 - Process 3
* Exit transition: <l0, l4, 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.000655s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000745s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 1 + tmp_11^0 <= 0 , 
4: z_10^0 <= y_9^0 , 
Narrowing transition: 
<l3, l3, 5 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>

LOG: Narrow transition size 1
It's unfeasible. Removing transition: 
<l3, l4, 5 <= undef15 /\ 1 <= undef14 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ 1 + y_9^0 = z_10^0 /\ undef3 = 1, {tmp_11^0 -> undef14, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>

LOG: Narrow transition size 1
It's unfeasible. Removing 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}>
invGraph after Narrowing: 
Transitions:
<l3, l3, 5 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>
Variables:
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.003068s
Ranking function: -7 + b_128^0 + 3*tmp_11^0 - y_9^0 + z_10^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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.000970s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004173s
[47902 : 47918]
[47902 : 47919]
Successful child: 47918
[ 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, 5 <= undef15 /\ 1 <= undef14 /\ 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:3 + z_10^0 <= b_128^0 + x_8^0 - Process 4
* 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.000751s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000860s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 4 + z_10^0 <= b_128^0 + tmp_11^0 + y_9^0 , 
4: 3 + z_10^0 <= b_128^0 + x_8^0 , 
Narrowing transition: 
<l3, l3, 5 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, 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 /\ undef31 <= 4 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 5 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>
Variables:
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.004621s
Ranking function: -16 - 8*y_9^0 + 8*z_10^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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.001090s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005431s
[47902 : 47923]
[47902 : 47924]
Successful child: 47923
[ 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 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, 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 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:4 + z_10^0 <= b_128^0 + y_9^0 - Process 5
* 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.000844s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000964s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 4 + z_10^0 <= b_128^0 + y_9^0 , 
4: 4 + z_10^0 <= b_128^0 + y_9^0 , 
Narrowing transition: 
<l3, l3, 5 <= undef15 /\ 1 <= undef14 /\ 2 + y_9^0 <= z_10^0 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, 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 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 5 <= undef15 /\ 1 <= undef14 /\ 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 + z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>
Variables:
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.005305s
Ranking function: -67 + 13*b_128^0 - y_9^0 + z_10^0
New Graphs: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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.001190s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005660s
[47902 : 47928]
[47902 : 47929]
Successful child: 47928
[ 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, 5 + tmp_11^0 <= b_128^0 /\ 5 <= undef15 /\ 1 <= undef14 /\ 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 + z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, 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 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:4 + y_9^0 <= b_128^0 + x_8^0 - Process 6
* 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.000916s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.001061s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 5 + tmp_11^0 <= b_128^0 , 
4: 4 + y_9^0 <= b_128^0 + x_8^0 , 
It's unfeasible. Removing transition: 
<l3, l3, 5 <= undef15 /\ 1 <= undef14 /\ 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 + z_10^0 /\ b_128^0 = undef15 /\ tmp_11^0 = 0 /\ undef2 = undef3 /\ undef2 = undef14 /\ undef72 = undef73 /\ undef72 = undef84 /\ undef73 = 0 /\ undef85 = 0 /\ undef86 = 0 /\ undef3 = 1, {tmp_11^0 -> undef84, y_9^0 -> 1 + y_9^0, rest remain the same}>
Narrowing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 + tmp_11^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>
Variables:
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.001300s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006293s
[47902 : 47933]
[47902 : 47934]
Successful child: 47933
[ 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, 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 + tmp_11^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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 /\ b_128^0 <= 4 + tmp_11^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
New Graphs: 

LOG: CALL check - Post:5 <= b_128^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 /\ 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.000950s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.001079s
INVARIANTS: 
3: 
4: 
Quasi-INVARIANTS to narrow Graph: 
3: 5 <= b_128^0 , 
4: 5 <= b_128^0 , 
Narrowing transition: 
<l3, l3, 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 + tmp_11^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 <= 4 + tmp_11^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>
Variables:
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.002765s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.014241s
[47902 : 47938]
[47902 : 47939]
Successful child: 47938
[ 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, 1 + tmp_11^0 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 <= 4 + tmp_11^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 <= 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, 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, 1 + tmp_11^0 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 <= 4 + tmp_11^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, 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 <= 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 /\ undef140 = undef141 /\ undef140 = undef152 /\ undef141 = 0 /\ undef153 = 0 /\ undef154 = 0, {tmp_11^0 -> undef152, rest remain the same}>
Ranking function: -tmp_11^0
New Graphs: 
Transitions:
<l3, l3, 1 + tmp_11^0 + x_8^0 <= y_9^0 /\ 1 + y_9^0 <= z_10^0 /\ b_128^0 <= 4 /\ b_128^0 <= 4 + tmp_11^0 /\ undef31 <= 4 /\ b_128^0 + tmp_11^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 + y_9^0 <= 3 + z_10^0 /\ b_128^0 = undef30 /\ b_128^0 = undef31 /\ tmp_11^0 = 0 /\ undef17 = undef18 /\ undef17 = undef29 /\ undef18 = 0, {tmp_11^0 -> undef29, rest remain the same}>
Variables:
b_128^0, tmp_11^0, x_8^0, y_9^0, z_10^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001574s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008091s
[47902 : 47943]
[47902 : 47944]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.025918s
Time used: 0.024784

[47902 : 48044]
[47902 : 48048]
Successful child: 48048

Program does NOT terminate