YES

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l4, true>
<l1, l2, (1 <= (0 + m^0)) /\ (undef11 = undef11) /\ (0 <= (0 + undef11)) /\ ((0 + undef11) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + pos^0)) /\ ((0 + pos^0) <= 1) /\ ((0 + wpos^0) <= 0) /\ (1 <= (0 + undef11)) /\ (undef24 = (1 + wpos^0)) /\ (1 <= (0 + undef11)) /\ (undef15 = undef15) /\ (0 <= (0 + undef15)) /\ ((0 + undef15) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + pos^0)) /\ ((0 + pos^0) <= 1) /\ (1 <= (0 + undef24)) /\ ((0 + undef24) <= 1) /\ (1 <= (0 + pi^0)) /\ ((0 + undef15) <= 0) /\ (undef25 = 0) /\ (undef21 = (~(1) + pi^0)) /\ ((1 + undef15) <= 1) /\ (undef18 = (~(1) + m^0)) /\ (1 <= (0 + undef18)) /\ (undef12 = undef12) /\ (0 <= (0 + undef12)) /\ ((0 + undef12) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + pos^0)) /\ ((0 + pos^0) <= 1) /\ ((0 + undef25) <= 0) /\ (1 <= (0 + undef12)) /\ (undef26 = (1 + undef25)) /\ (1 <= (0 + undef12)) /\ (undef16 = undef16) /\ (0 <= (0 + undef16)) /\ ((0 + undef16) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + pos^0)) /\ ((0 + pos^0) <= 1) /\ (1 <= (0 + undef26)) /\ ((0 + undef26) <= 1) /\ ((0 + undef21) <= 0) /\ (undef8 = (1 + seq^0)) /\ (undef27 = 0) /\ (undef23 = 0) /\ (undef22 = (0 + undef8)) /\ (undef29 = undef29) /\ (0 <= (0 + undef29)) /\ (1 <= (0 + undef16)) /\ ((1 + undef18) <= (0 + max^0)) /\ (undef19 = (1 + undef18)) /\ (1 <= (0 + undef19)) /\ (undef13 = undef13) /\ (0 <= (0 + undef13)) /\ ((0 + undef13) <= 1) /\ (1 <= (0 + undef29)) /\ (undef30 = (~(1) + undef29)) /\ (1 <= (0 + undef13)) /\ (undef17 = undef17) /\ (0 <= (0 + undef17)) /\ ((0 + undef17) <= 1) /\ (1 <= (0 + undef30)) /\ (undef10 = (~(1) + undef30)) /\ (1 <= (0 + undef17)) /\ ((1 + undef19) <= (0 + max^0)) /\ (undef20 = (1 + undef19)) /\ (1 <= (0 + undef20)) /\ (undef14 = undef14) /\ (0 <= (0 + undef14)) /\ ((0 + undef14) <= 1) /\ ((0 + undef10) <= 0) /\ ((0 + undef23) <= 0) /\ ((0 + undef14) <= 0) /\ (undef7 = (1 + undef23)) /\ ((1 + undef14) <= 1) /\ (1 <= (0 + undef20)) /\ (undef1 = undef1) /\ (0 <= (0 + undef1)) /\ ((0 + undef1) <= 1) /\ ((0 + undef10) <= 0) /\ (1 <= (0 + undef7)) /\ ((0 + undef7) <= 1) /\ ((0 + undef27) <= 0) /\ (1 <= (0 + undef1)) /\ (undef28 = (1 + undef27)) /\ (1 <= (0 + undef1)) /\ (undef2 = undef2) /\ (0 <= (0 + undef2)) /\ ((0 + undef2) <= 1) /\ ((0 + undef10) <= 0) /\ (1 <= (0 + undef7)) /\ ((0 + undef7) <= 1) /\ (1 <= (0 + undef28)) /\ ((0 + undef28) <= 1) /\ (1 <= (0 + undef22)) /\ ((0 + undef2) <= 0) /\ ((1 + undef2) <= 1), par{c1^0 -> undef1, c2^0 -> undef2, m^0 -> (~(1) + undef20), pi^0 -> (~(1) + undef22), pos^0 -> undef7, seq^0 -> undef8, wpos^0 -> 0, z^0 -> undef10}>
<l2, l1, true>
<l3, l1, (undef48 = 1) /\ (undef50 = undef50) /\ (0 <= (0 + undef50)) /\ (undef51 = 0) /\ (undef45 = undef45) /\ (0 <= (0 + undef45)) /\ (undef44 = undef44) /\ (0 <= (0 + undef44)) /\ ((0 + undef44) <= (0 + undef45)) /\ (undef43 = undef43) /\ ((0 + undef43) <= (0 + undef44)) /\ (0 <= (0 + undef43)) /\ (1 <= (0 + undef43)) /\ (undef41 = undef41) /\ (0 <= (0 + undef41)) /\ ((0 + undef41) <= 1) /\ ((0 + undef50) <= 0) /\ ((0 + undef51) <= 0) /\ ((0 + undef41) <= 0) /\ ((1 + undef41) <= 1), par{c1^0 -> undef41, m^0 -> undef43, max^0 -> undef44, n^0 -> undef45, pi^0 -> (0 + undef48), pos^0 -> (1 + undef51), seq^0 -> undef48, wpos^0 -> 0, z^0 -> undef50}>
<l4, l3, true>

Fresh variables:
undef1, undef2, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef41, undef43, undef44, undef45, undef48, undef50, undef51, 

Undef variables:
undef1, undef2, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef41, undef43, undef44, undef45, undef48, undef50, undef51, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l1, (m^0 = undef43) /\ (max^0 = undef44) /\ (pi^0 = (0 + undef48)) /\ (pos^0 = (1 + undef51)) /\ (seq^0 = undef48) /\ (wpos^0 = 0) /\ (z^0 = undef50) /\ (undef48 = 1) /\ (undef50 = undef50) /\ (0 <= (0 + undef50)) /\ (undef51 = 0) /\ (undef45 = undef45) /\ (0 <= (0 + undef45)) /\ (undef44 = undef44) /\ (0 <= (0 + undef44)) /\ ((0 + undef44) <= (0 + undef45)) /\ (undef43 = undef43) /\ ((0 + undef43) <= (0 + undef44)) /\ (0 <= (0 + undef43)) /\ (1 <= (0 + undef43)) /\ (undef41 = undef41) /\ (0 <= (0 + undef41)) /\ ((0 + undef41) <= 1) /\ ((0 + undef50) <= 0) /\ ((0 + undef51) <= 0) /\ ((0 + undef41) <= 0) /\ ((1 + undef41) <= 1)>
<l1, l1, (1 <= (0 + m^0)) /\ (undef11 = undef11) /\ (0 <= (0 + undef11)) /\ ((0 + undef11) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + pos^0)) /\ ((0 + pos^0) <= 1) /\ ((0 + wpos^0) <= 0) /\ (1 <= (0 + undef11)) /\ (undef24 = (1 + wpos^0)) /\ (1 <= (0 + undef11)) /\ (undef15 = undef15) /\ (0 <= (0 + undef15)) /\ ((0 + undef15) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + pos^0)) /\ ((0 + pos^0) <= 1) /\ (1 <= (0 + undef24)) /\ ((0 + undef24) <= 1) /\ (1 <= (0 + pi^0)) /\ ((0 + undef15) <= 0) /\ (undef25 = 0) /\ (undef21 = (~(1) + pi^0)) /\ ((1 + undef15) <= 1) /\ (undef18 = (~(1) + m^0)) /\ (1 <= (0 + undef18)) /\ (undef12 = undef12) /\ (0 <= (0 + undef12)) /\ ((0 + undef12) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + pos^0)) /\ ((0 + pos^0) <= 1) /\ ((0 + undef25) <= 0) /\ (1 <= (0 + undef12)) /\ (undef26 = (1 + undef25)) /\ (1 <= (0 + undef12)) /\ (undef16 = undef16) /\ (0 <= (0 + undef16)) /\ ((0 + undef16) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + pos^0)) /\ ((0 + pos^0) <= 1) /\ (1 <= (0 + undef26)) /\ ((0 + undef26) <= 1) /\ ((0 + undef21) <= 0) /\ (undef8 = (1 + seq^0)) /\ (undef27 = 0) /\ (undef23 = 0) /\ (undef22 = (0 + undef8)) /\ (undef29 = undef29) /\ (0 <= (0 + undef29)) /\ (1 <= (0 + undef16)) /\ ((1 + undef18) <= (0 + max^0)) /\ (undef19 = (1 + undef18)) /\ (1 <= (0 + undef19)) /\ (undef13 = undef13) /\ (0 <= (0 + undef13)) /\ ((0 + undef13) <= 1) /\ (1 <= (0 + undef29)) /\ (undef30 = (~(1) + undef29)) /\ (1 <= (0 + undef13)) /\ (undef17 = undef17) /\ (0 <= (0 + undef17)) /\ ((0 + undef17) <= 1) /\ (1 <= (0 + undef30)) /\ (undef10 = (~(1) + undef30)) /\ (1 <= (0 + undef17)) /\ ((1 + undef19) <= (0 + max^0)) /\ (undef20 = (1 + undef19)) /\ (1 <= (0 + undef20)) /\ (undef14 = undef14) /\ (0 <= (0 + undef14)) /\ ((0 + undef14) <= 1) /\ ((0 + undef10) <= 0) /\ ((0 + undef23) <= 0) /\ ((0 + undef14) <= 0) /\ (undef7 = (1 + undef23)) /\ ((1 + undef14) <= 1) /\ (1 <= (0 + undef20)) /\ (undef1 = undef1) /\ (0 <= (0 + undef1)) /\ ((0 + undef1) <= 1) /\ ((0 + undef10) <= 0) /\ (1 <= (0 + undef7)) /\ ((0 + undef7) <= 1) /\ ((0 + undef27) <= 0) /\ (1 <= (0 + undef1)) /\ (undef28 = (1 + undef27)) /\ (1 <= (0 + undef1)) /\ (undef2 = undef2) /\ (0 <= (0 + undef2)) /\ ((0 + undef2) <= 1) /\ ((0 + undef10) <= 0) /\ (1 <= (0 + undef7)) /\ ((0 + undef7) <= 1) /\ (1 <= (0 + undef28)) /\ ((0 + undef28) <= 1) /\ (1 <= (0 + undef22)) /\ ((0 + undef2) <= 0) /\ ((1 + undef2) <= 1), par{m^0 -> (~(1) + undef20), pi^0 -> (~(1) + undef22), pos^0 -> undef7, seq^0 -> undef8, wpos^0 -> 0, z^0 -> undef10}>

Fresh variables:
undef1, undef2, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef41, undef43, undef44, undef45, undef48, undef50, undef51, 

Undef variables:
undef1, undef2, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef15, undef16, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef41, undef43, undef44, undef45, undef48, undef50, undef51, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l1, l1, 1 <= m^0 /\ 1 + undef18 <= max^0 /\ 1 + undef19 <= max^0 /\ 1 <= pi^0 /\ 1 <= undef18 /\ 1 <= undef19 /\ 1 <= undef20 /\ 1 <= undef22 /\ 1 <= undef29 /\ 1 <= undef30 /\ wpos^0 <= 0 /\ z^0 <= 0 /\ undef10 <= 0 /\ undef21 <= 0 /\ 1 + seq^0 = undef8 /\ 1 + wpos^0 = undef24 /\ 1 + undef10 = undef30 /\ 1 + undef18 = undef19 /\ 1 + undef19 = undef20 /\ 1 + undef25 = undef26 /\ 1 + undef27 = undef28 /\ undef2 = 0 /\ undef8 = undef22 /\ undef14 = 0 /\ undef15 = 0 /\ undef23 = 0 /\ undef25 = 0 /\ undef27 = 0 /\ m^0 = 1 + undef18 /\ pi^0 = 1 + undef21 /\ pos^0 = 1 /\ undef1 = 1 /\ undef7 = 1 /\ undef7 = 1 + undef23 /\ undef11 = 1 /\ undef12 = 1 /\ undef13 = 1 /\ undef16 = 1 /\ undef17 = 1 /\ undef24 = 1 /\ undef26 = 1 /\ undef28 = 1 /\ undef29 = 1 + undef30, {m^0 -> -1 + undef20, pi^0 -> -1 + undef22, pos^0 -> undef7, seq^0 -> undef8, wpos^0 -> 0, z^0 -> undef10, rest remain the same}>
Variables:
m^0, max^0, pi^0, pos^0, seq^0, wpos^0, z^0

Precedence: 
Graph 0

Graph 1
<l0, l1, 1 <= undef43 /\ undef43 <= undef44 /\ undef44 <= undef45 /\ 0 <= undef44 /\ 0 <= undef45 /\ m^0 = undef43 /\ max^0 = undef44 /\ pi^0 = undef48 /\ seq^0 = undef48 /\ wpos^0 = 0 /\ z^0 = undef50 /\ undef41 = 0 /\ undef50 = 0 /\ undef51 = 0 /\ pos^0 = 1 + undef51 /\ undef48 = 1, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 1 , 1 )

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

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

Checking conditional termination of SCC {l1}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001836s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.012707s
Trying to remove transition: <l1, l1, 1 <= m^0 /\ 1 + undef18 <= max^0 /\ 1 + undef19 <= max^0 /\ 1 <= pi^0 /\ 1 <= undef18 /\ 1 <= undef19 /\ 1 <= undef20 /\ 1 <= undef22 /\ 1 <= undef29 /\ 1 <= undef30 /\ wpos^0 <= 0 /\ z^0 <= 0 /\ undef10 <= 0 /\ undef21 <= 0 /\ 1 + seq^0 = undef8 /\ 1 + wpos^0 = undef24 /\ 1 + undef10 = undef30 /\ 1 + undef18 = undef19 /\ 1 + undef19 = undef20 /\ 1 + undef25 = undef26 /\ 1 + undef27 = undef28 /\ undef2 = 0 /\ undef8 = undef22 /\ undef14 = 0 /\ undef15 = 0 /\ undef23 = 0 /\ undef25 = 0 /\ undef27 = 0 /\ m^0 = 1 + undef18 /\ pi^0 = 1 + undef21 /\ pos^0 = 1 /\ undef1 = 1 /\ undef7 = 1 /\ undef7 = 1 + undef23 /\ undef11 = 1 /\ undef12 = 1 /\ undef13 = 1 /\ undef16 = 1 /\ undef17 = 1 /\ undef24 = 1 /\ undef26 = 1 /\ undef28 = 1 /\ undef29 = 1 + undef30, {m^0 -> -1 + undef20, pi^0 -> -1 + undef22, pos^0 -> undef7, seq^0 -> undef8, wpos^0 -> 0, z^0 -> undef10, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.018596s
Time used: 0.017379

LOG: SAT solveNonLinear - Elapsed time: 0.018596s
Cost: 0; Total time: 0.017379
Termination implied by a set of invariant(s):
Invariant at l1: seq^0 + wpos^0 <= 1 + pi^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l1, l1, 1 <= m^0 /\ 1 + undef18 <= max^0 /\ 1 + undef19 <= max^0 /\ 1 <= pi^0 /\ 1 <= undef18 /\ 1 <= undef19 /\ 1 <= undef20 /\ 1 <= undef22 /\ 1 <= undef29 /\ 1 <= undef30 /\ wpos^0 <= 0 /\ z^0 <= 0 /\ undef10 <= 0 /\ undef21 <= 0 /\ seq^0 + wpos^0 <= 1 + pi^0 /\ 1 + seq^0 = undef8 /\ 1 + wpos^0 = undef24 /\ 1 + undef10 = undef30 /\ 1 + undef18 = undef19 /\ 1 + undef19 = undef20 /\ 1 + undef25 = undef26 /\ 1 + undef27 = undef28 /\ undef2 = 0 /\ undef8 = undef22 /\ undef14 = 0 /\ undef15 = 0 /\ undef23 = 0 /\ undef25 = 0 /\ undef27 = 0 /\ m^0 = 1 + undef18 /\ pi^0 = 1 + undef21 /\ pos^0 = 1 /\ undef1 = 1 /\ undef7 = 1 /\ undef7 = 1 + undef23 /\ undef11 = 1 /\ undef12 = 1 /\ undef13 = 1 /\ undef16 = 1 /\ undef17 = 1 /\ undef24 = 1 /\ undef26 = 1 /\ undef28 = 1 /\ undef29 = 1 + undef30, {m^0 -> -1 + undef20, pi^0 -> -1 + undef22, pos^0 -> undef7, seq^0 -> undef8, wpos^0 -> 0, z^0 -> undef10, 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): 
<l1, l1, 1 <= m^0 /\ 1 + undef18 <= max^0 /\ 1 + undef19 <= max^0 /\ 1 <= pi^0 /\ 1 <= undef18 /\ 1 <= undef19 /\ 1 <= undef20 /\ 1 <= undef22 /\ 1 <= undef29 /\ 1 <= undef30 /\ wpos^0 <= 0 /\ z^0 <= 0 /\ undef10 <= 0 /\ undef21 <= 0 /\ seq^0 + wpos^0 <= 1 + pi^0 /\ 1 + seq^0 = undef8 /\ 1 + wpos^0 = undef24 /\ 1 + undef10 = undef30 /\ 1 + undef18 = undef19 /\ 1 + undef19 = undef20 /\ 1 + undef25 = undef26 /\ 1 + undef27 = undef28 /\ undef2 = 0 /\ undef8 = undef22 /\ undef14 = 0 /\ undef15 = 0 /\ undef23 = 0 /\ undef25 = 0 /\ undef27 = 0 /\ m^0 = 1 + undef18 /\ pi^0 = 1 + undef21 /\ pos^0 = 1 /\ undef1 = 1 /\ undef7 = 1 /\ undef7 = 1 + undef23 /\ undef11 = 1 /\ undef12 = 1 /\ undef13 = 1 /\ undef16 = 1 /\ undef17 = 1 /\ undef24 = 1 /\ undef26 = 1 /\ undef28 = 1 /\ undef29 = 1 + undef30, {m^0 -> -1 + undef20, pi^0 -> -1 + undef22, pos^0 -> undef7, seq^0 -> undef8, wpos^0 -> 0, z^0 -> undef10, rest remain the same}>
Ranking function: max^0 - seq^0
New Graphs: 
INVARIANTS: 
1: seq^0 + wpos^0 <= 1 + pi^0 , 
Quasi-INVARIANTS to narrow Graph: 
1: 
Program Terminates