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


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


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l25, true>
<l1, l2, ((0 + seq^0) <= (1 + N^0))>
<l3, l1, (1 <= (0 + b_arp^0))>
<l3, l1, ((0 + b_arp^0) <= 0), par{b_configured^0 -> 1}>
<l4, l3, true>
<l5, l6, ((0 + seq^0) <= (1 + N^0)), par{k^0 -> (1 + k^0)}>
<l7, l5, ((0 + seq^0) <= (1 + N^0))>
<l8, l7, (1 <= (0 + pos^0)), par{i^0 -> (~(1) + i^0), pos^0 -> 0}>
<l8, l7, ((0 + pos^0) <= 0) /\ ((0 + b_arp^0) <= 0), par{pos^0 -> (1 + pos^0)}>
<l9, l7, ((0 + i^0) <= 0) /\ (undef89 = (1 + seq^0)) /\ (undef90 = undef90) /\ (0 <= (0 + undef90)), par{i^0 -> (3 + undef89), pos^0 -> 0, seq^0 -> undef89, z^0 -> undef90}>
<l9, l8, (1 <= (0 + i^0))>
<l10, l7, (1 <= (0 + z^0)), par{z^0 -> (~(1) + z^0)}>
<l10, l9, ((0 + z^0) <= 0)>
<l11, l5, (1 <= (0 + b_ip^0))>
<l11, l10, ((0 + b_ip^0) <= 0) /\ (undef132 = undef132) /\ (0 <= (0 + undef132)) /\ ((0 + undef132) <= 1), par{b_arp^0 -> undef132}>
<l12, l5, ((1 + b_probe^0) <= 1)>
<l12, l11, (1 <= (0 + b_probe^0))>
<l13, l12, (1 <= (0 + pos^0)), par{i^0 -> (~(1) + i^0), pos^0 -> 0}>
<l13, l12, ((0 + pos^0) <= 0) /\ ((0 + b_probe^0) <= 0), par{pos^0 -> (1 + pos^0)}>
<l14, l12, ((0 + i^0) <= 0) /\ (undef189 = (1 + seq^0)) /\ (undef190 = undef190) /\ (0 <= (0 + undef190)), par{i^0 -> (3 + undef189), pos^0 -> 0, seq^0 -> undef189, z^0 -> undef190}>
<l14, l13, (1 <= (0 + i^0))>
<l15, l12, (1 <= (0 + z^0)), par{z^0 -> (~(1) + z^0)}>
<l15, l14, ((0 + z^0) <= 0)>
<l16, l4, ((1 + N^0) <= (0 + k^0))>
<l16, l15, ((0 + k^0) <= (0 + N^0)) /\ (undef235 = undef235) /\ (0 <= (0 + undef235)) /\ ((0 + undef235) <= 1), par{b_probe^0 -> undef235}>
<l17, l4, (1 <= (0 + b_arp^0))>
<l17, l16, ((0 + b_arp^0) <= 0)>
<l6, l17, true>
<l18, l6, (1 <= (0 + pos^0)), par{i^0 -> (~(1) + i^0), pos^0 -> 0}>
<l18, l6, ((0 + pos^0) <= 0) /\ ((0 + b_ip^0) <= 0), par{pos^0 -> (1 + pos^0)}>
<l19, l6, ((0 + i^0) <= 0) /\ (undef299 = (1 + seq^0)) /\ (undef300 = undef300) /\ (0 <= (0 + undef300)), par{i^0 -> (3 + undef299), pos^0 -> 0, seq^0 -> undef299, z^0 -> undef300}>
<l19, l18, (1 <= (0 + i^0))>
<l20, l6, (1 <= (0 + z^0)), par{z^0 -> (~(1) + z^0)}>
<l20, l19, ((0 + z^0) <= 0)>
<l21, l2, (undef339 = 1) /\ (undef340 = undef340) /\ (0 <= (0 + undef340)) /\ (undef331 = undef331) /\ (0 <= (0 + undef331)), par{N^0 -> undef331, b_arp^0 -> 0, b_configured^0 -> 0, b_ip^0 -> 0, b_probe^0 -> 0, i^0 -> (3 + undef339), k^0 -> 0, pos^0 -> 0, seq^0 -> undef339, z^0 -> undef340}>
<l22, l23, true>
<l24, l22, (1 <= (0 + b_configured^0))>
<l24, l22, ((1 + b_configured^0) <= 0)>
<l24, l20, ((0 + b_configured^0) <= 0) /\ (0 <= (0 + b_configured^0)) /\ (undef374 = undef374) /\ (0 <= (0 + undef374)) /\ ((0 + undef374) <= 1), par{b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, k^0 -> 0}>
<l2, l24, true>
<l25, l21, true>

Fresh variables:
undef89, undef90, undef132, undef189, undef190, undef235, undef299, undef300, undef331, undef339, undef340, undef374, 

Undef variables:
undef89, undef90, undef132, undef189, undef190, undef235, undef299, undef300, undef331, undef339, undef340, undef374, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l6, (N^0 = undef331) /\ (b_arp^0 = 0) /\ (b_configured^0 = 0) /\ (b_probe^0 = 0) /\ (i^0 = (3 + undef339)) /\ (k^0 = 0) /\ (pos^0 = 0) /\ (seq^0 = undef339) /\ (z^0 = undef340) /\ (undef339 = 1) /\ (undef340 = undef340) /\ (0 <= (0 + undef340)) /\ (undef331 = undef331) /\ (0 <= (0 + undef331)) /\ ((0 + 0) <= 0) /\ (0 <= (0 + 0)) /\ (undef374 = undef374) /\ (0 <= (0 + undef374)) /\ ((0 + undef374) <= 1) /\ (1 <= (0 + z^0)), par{b_ip^0 -> undef374, z^0 -> (~(1) + z^0)}>
<l0, l6, (N^0 = undef331) /\ (b_arp^0 = 0) /\ (b_configured^0 = 0) /\ (b_probe^0 = 0) /\ (i^0 = (3 + undef339)) /\ (k^0 = 0) /\ (pos^0 = 0) /\ (seq^0 = undef339) /\ (z^0 = undef340) /\ (undef339 = 1) /\ (undef340 = undef340) /\ (0 <= (0 + undef340)) /\ (undef331 = undef331) /\ (0 <= (0 + undef331)) /\ ((0 + 0) <= 0) /\ (0 <= (0 + 0)) /\ (undef374 = undef374) /\ (0 <= (0 + undef374)) /\ ((0 + undef374) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + i^0)) /\ ((0 + pos^0) <= 0) /\ ((0 + undef374) <= 0), par{b_ip^0 -> undef374, pos^0 -> (1 + pos^0)}>
<l6, l23, (1 <= (0 + b_arp^0)) /\ (1 <= (0 + b_arp^0)) /\ ((0 + seq^0) <= (1 + N^0)) /\ (1 <= (0 + b_configured^0))>
<l6, l23, (1 <= (0 + b_arp^0)) /\ (1 <= (0 + b_arp^0)) /\ ((0 + seq^0) <= (1 + N^0)) /\ ((1 + b_configured^0) <= 0)>
<l6, l6, (1 <= (0 + b_arp^0)) /\ (1 <= (0 + b_arp^0)) /\ ((0 + seq^0) <= (1 + N^0)) /\ ((0 + b_configured^0) <= 0) /\ (0 <= (0 + b_configured^0)) /\ (undef374 = undef374) /\ (0 <= (0 + undef374)) /\ ((0 + undef374) <= 1) /\ (1 <= (0 + z^0)), par{b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, k^0 -> 0, z^0 -> (~(1) + z^0)}>
<l6, l6, (1 <= (0 + b_arp^0)) /\ (1 <= (0 + b_arp^0)) /\ ((0 + seq^0) <= (1 + N^0)) /\ ((0 + b_configured^0) <= 0) /\ (0 <= (0 + b_configured^0)) /\ (undef374 = undef374) /\ (0 <= (0 + undef374)) /\ ((0 + undef374) <= 1) /\ ((0 + z^0) <= 0) /\ ((0 + i^0) <= 0) /\ (undef299 = (1 + seq^0)) /\ (undef300 = undef300) /\ (0 <= (0 + undef300)), par{b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, i^0 -> (3 + undef299), k^0 -> 0, pos^0 -> 0, seq^0 -> undef299, z^0 -> undef300}>
<l6, l6, (1 <= (0 + b_arp^0)) /\ (1 <= (0 + b_arp^0)) /\ ((0 + seq^0) <= (1 + N^0)) /\ ((0 + b_configured^0) <= 0) /\ (0 <= (0 + b_configured^0)) /\ (undef374 = undef374) /\ (0 <= (0 + undef374)) /\ ((0 + undef374) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + i^0)) /\ (1 <= (0 + pos^0)), par{b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, i^0 -> (~(1) + i^0), k^0 -> 0, pos^0 -> 0}>
<l6, l6, (1 <= (0 + b_arp^0)) /\ (1 <= (0 + b_arp^0)) /\ ((0 + seq^0) <= (1 + N^0)) /\ ((0 + b_configured^0) <= 0) /\ (0 <= (0 + b_configured^0)) /\ (undef374 = undef374) /\ (0 <= (0 + undef374)) /\ ((0 + undef374) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + i^0)) /\ ((0 + pos^0) <= 0) /\ ((0 + undef374) <= 0), par{b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, k^0 -> 0, pos^0 -> (1 + pos^0)}>
<l6, l23, ((0 + b_arp^0) <= 0) /\ ((1 + N^0) <= (0 + k^0)) /\ ((0 + b_arp^0) <= 0) /\ ((0 + seq^0) <= (1 + N^0)) /\ (1 <= (0 + 1)), par{b_configured^0 -> 1}>
<l6, l12, ((0 + b_arp^0) <= 0) /\ ((0 + k^0) <= (0 + N^0)) /\ (undef235 = undef235) /\ (0 <= (0 + undef235)) /\ ((0 + undef235) <= 1) /\ (1 <= (0 + z^0)), par{b_probe^0 -> undef235, z^0 -> (~(1) + z^0)}>
<l6, l12, ((0 + b_arp^0) <= 0) /\ ((0 + k^0) <= (0 + N^0)) /\ (undef235 = undef235) /\ (0 <= (0 + undef235)) /\ ((0 + undef235) <= 1) /\ ((0 + z^0) <= 0) /\ ((0 + i^0) <= 0) /\ (undef189 = (1 + seq^0)) /\ (undef190 = undef190) /\ (0 <= (0 + undef190)), par{b_probe^0 -> undef235, i^0 -> (3 + undef189), pos^0 -> 0, seq^0 -> undef189, z^0 -> undef190}>
<l6, l12, ((0 + b_arp^0) <= 0) /\ ((0 + k^0) <= (0 + N^0)) /\ (undef235 = undef235) /\ (0 <= (0 + undef235)) /\ ((0 + undef235) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + i^0)) /\ (1 <= (0 + pos^0)), par{b_probe^0 -> undef235, i^0 -> (~(1) + i^0), pos^0 -> 0}>
<l6, l12, ((0 + b_arp^0) <= 0) /\ ((0 + k^0) <= (0 + N^0)) /\ (undef235 = undef235) /\ (0 <= (0 + undef235)) /\ ((0 + undef235) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + i^0)) /\ ((0 + pos^0) <= 0) /\ ((0 + undef235) <= 0), par{b_probe^0 -> undef235, pos^0 -> (1 + pos^0)}>
<l12, l6, ((1 + b_probe^0) <= 1) /\ ((0 + seq^0) <= (1 + N^0)), par{k^0 -> (1 + k^0)}>
<l12, l6, (1 <= (0 + b_probe^0)) /\ (1 <= (0 + b_ip^0)) /\ ((0 + seq^0) <= (1 + N^0)), par{k^0 -> (1 + k^0)}>
<l12, l6, (1 <= (0 + b_probe^0)) /\ ((0 + b_ip^0) <= 0) /\ (undef132 = undef132) /\ (0 <= (0 + undef132)) /\ ((0 + undef132) <= 1) /\ (1 <= (0 + z^0)) /\ ((0 + seq^0) <= (1 + N^0)) /\ ((0 + seq^0) <= (1 + N^0)), par{b_arp^0 -> undef132, k^0 -> (1 + k^0), z^0 -> (~(1) + z^0)}>
<l12, l6, (1 <= (0 + b_probe^0)) /\ ((0 + b_ip^0) <= 0) /\ (undef132 = undef132) /\ (0 <= (0 + undef132)) /\ ((0 + undef132) <= 1) /\ ((0 + z^0) <= 0) /\ ((0 + i^0) <= 0) /\ (undef89 = (1 + seq^0)) /\ (undef90 = undef90) /\ (0 <= (0 + undef90)) /\ ((0 + undef89) <= (1 + N^0)) /\ ((0 + undef89) <= (1 + N^0)), par{b_arp^0 -> undef132, i^0 -> (3 + undef89), k^0 -> (1 + k^0), pos^0 -> 0, seq^0 -> undef89, z^0 -> undef90}>
<l12, l6, (1 <= (0 + b_probe^0)) /\ ((0 + b_ip^0) <= 0) /\ (undef132 = undef132) /\ (0 <= (0 + undef132)) /\ ((0 + undef132) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + i^0)) /\ (1 <= (0 + pos^0)) /\ ((0 + seq^0) <= (1 + N^0)) /\ ((0 + seq^0) <= (1 + N^0)), par{b_arp^0 -> undef132, i^0 -> (~(1) + i^0), k^0 -> (1 + k^0), pos^0 -> 0}>
<l12, l6, (1 <= (0 + b_probe^0)) /\ ((0 + b_ip^0) <= 0) /\ (undef132 = undef132) /\ (0 <= (0 + undef132)) /\ ((0 + undef132) <= 1) /\ ((0 + z^0) <= 0) /\ (1 <= (0 + i^0)) /\ ((0 + pos^0) <= 0) /\ ((0 + undef132) <= 0) /\ ((0 + seq^0) <= (1 + N^0)) /\ ((0 + seq^0) <= (1 + N^0)), par{b_arp^0 -> undef132, k^0 -> (1 + k^0), pos^0 -> (1 + pos^0)}>

Fresh variables:
undef89, undef90, undef132, undef189, undef190, undef235, undef299, undef300, undef331, undef339, undef340, undef374, 

Undef variables:
undef89, undef90, undef132, undef189, undef190, undef235, undef299, undef300, undef331, undef339, undef340, undef374, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l6, l6, 0 <= undef374 /\ 1 <= b_arp^0 /\ 1 <= z^0 /\ seq^0 <= 1 + N^0 /\ undef374 <= 1 /\ b_configured^0 = 0, {b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, k^0 -> 0, z^0 -> -1 + z^0, rest remain the same}>
<l6, l6, i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef300 /\ 0 <= undef374 /\ 1 <= b_arp^0 /\ seq^0 <= 1 + N^0 /\ undef374 <= 1 /\ b_configured^0 = 0 /\ 1 + seq^0 = undef299, {b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, i^0 -> 3 + undef299, k^0 -> 0, pos^0 -> 0, seq^0 -> undef299, z^0 -> undef300, rest remain the same}>
<l6, l6, z^0 <= 0 /\ 0 <= undef374 /\ 1 <= b_arp^0 /\ 1 <= i^0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ undef374 <= 1 /\ b_configured^0 = 0, {b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, i^0 -> -1 + i^0, k^0 -> 0, pos^0 -> 0, rest remain the same}>
<l6, l6, pos^0 <= 0 /\ z^0 <= 0 /\ 1 <= b_arp^0 /\ 1 <= i^0 /\ seq^0 <= 1 + N^0 /\ b_configured^0 = 0 /\ undef374 = 0, {b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, k^0 -> 0, pos^0 -> 1 + pos^0, rest remain the same}>
<l6, l12, k^0 <= N^0 /\ b_arp^0 <= 0 /\ 0 <= undef235 /\ 1 <= z^0 /\ undef235 <= 1, {b_probe^0 -> undef235, z^0 -> -1 + z^0, rest remain the same}>
<l6, l12, k^0 <= N^0 /\ b_arp^0 <= 0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef190 /\ 0 <= undef235 /\ undef235 <= 1 /\ 1 + seq^0 = undef189, {b_probe^0 -> undef235, i^0 -> 3 + undef189, pos^0 -> 0, seq^0 -> undef189, z^0 -> undef190, rest remain the same}>
<l6, l12, k^0 <= N^0 /\ b_arp^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef235 /\ 1 <= i^0 /\ 1 <= pos^0 /\ undef235 <= 1, {b_probe^0 -> undef235, i^0 -> -1 + i^0, pos^0 -> 0, rest remain the same}>
<l6, l12, k^0 <= N^0 /\ b_arp^0 <= 0 /\ pos^0 <= 0 /\ z^0 <= 0 /\ 1 <= i^0 /\ undef235 = 0, {b_probe^0 -> undef235, pos^0 -> 1 + pos^0, rest remain the same}>
<l12, l6, b_probe^0 <= 0 /\ seq^0 <= 1 + N^0, {k^0 -> 1 + k^0, rest remain the same}>
<l12, l6, 1 <= b_ip^0 /\ 1 <= b_probe^0 /\ seq^0 <= 1 + N^0, {k^0 -> 1 + k^0, rest remain the same}>
<l12, l6, b_ip^0 <= 0 /\ 0 <= undef132 /\ 1 <= b_probe^0 /\ 1 <= z^0 /\ seq^0 <= 1 + N^0 /\ undef132 <= 1, {b_arp^0 -> undef132, k^0 -> 1 + k^0, z^0 -> -1 + z^0, rest remain the same}>
<l12, l6, b_ip^0 <= 0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef90 /\ 0 <= undef132 /\ 1 <= b_probe^0 /\ undef89 <= 1 + N^0 /\ undef132 <= 1 /\ 1 + seq^0 = undef89, {b_arp^0 -> undef132, i^0 -> 3 + undef89, k^0 -> 1 + k^0, pos^0 -> 0, seq^0 -> undef89, z^0 -> undef90, rest remain the same}>
<l12, l6, b_ip^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef132 /\ 1 <= b_probe^0 /\ 1 <= i^0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ undef132 <= 1, {b_arp^0 -> undef132, i^0 -> -1 + i^0, k^0 -> 1 + k^0, pos^0 -> 0, rest remain the same}>
<l12, l6, b_ip^0 <= 0 /\ pos^0 <= 0 /\ z^0 <= 0 /\ 1 <= b_probe^0 /\ 1 <= i^0 /\ seq^0 <= 1 + N^0 /\ undef132 = 0, {b_arp^0 -> undef132, k^0 -> 1 + k^0, pos^0 -> 1 + pos^0, rest remain the same}>
Variables:
N^0, b_arp^0, b_configured^0, b_ip^0, seq^0, z^0, i^0, pos^0, b_probe^0, k^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l6, 0 <= undef331 /\ 0 <= undef340 /\ 0 <= undef374 /\ 1 <= z^0 /\ undef374 <= 1 /\ N^0 = undef331 /\ b_arp^0 = 0 /\ b_configured^0 = 0 /\ b_probe^0 = 0 /\ k^0 = 0 /\ pos^0 = 0 /\ seq^0 = undef339 /\ z^0 = undef340 /\ undef339 = 1 /\ i^0 = 3 + undef339, {b_ip^0 -> undef374, z^0 -> -1 + z^0, rest remain the same}>
<l0, l6, z^0 <= 0 /\ 0 <= undef331 /\ 0 <= undef340 /\ 1 <= i^0 /\ N^0 = undef331 /\ b_arp^0 = 0 /\ b_configured^0 = 0 /\ b_probe^0 = 0 /\ k^0 = 0 /\ pos^0 = 0 /\ seq^0 = undef339 /\ z^0 = undef340 /\ undef374 = 0 /\ undef339 = 1 /\ i^0 = 3 + undef339, {b_ip^0 -> undef374, pos^0 -> 1 + pos^0, rest remain the same}>

Graph 2
<l6, l23, 1 <= b_arp^0 /\ 1 <= b_configured^0 /\ seq^0 <= 1 + N^0, {all remain the same}>
<l6, l23, 1 <= b_arp^0 /\ 1 + b_configured^0 <= 0 /\ seq^0 <= 1 + N^0, {all remain the same}>
<l6, l23, b_arp^0 <= 0 /\ 1 + N^0 <= k^0 /\ seq^0 <= 1 + N^0, {b_configured^0 -> 1, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 6 , 1 )
( 12 , 1 )
( 23 , 2 )

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

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

Checking conditional termination of SCC {l6, l12}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.023231s
Ranking function: 2 + 2*N^0 - b_configured^0 - 2*seq^0
It's unfeasible after collapsing. Removing transition: 
<l6, l6, 1 <= 0, {b_arp^0 -> undef132, b_probe^0 -> undef235, i^0 -> 2 + undef189, k^0 -> 1 + k^0, pos^0 -> 0, seq^0 -> undef189, z^0 -> undef190, rest remain the same}>
It's unfeasible after collapsing. Removing transition: 
<l6, l6, 1 <= 0, {b_arp^0 -> undef132, b_probe^0 -> undef235, i^0 -> ((0 + ~(1)) + 0) + i^0, k^0 -> 1 + k^0, pos^0 -> 0, z^0 -> -1 + z^0, rest remain the same}>
It's unfeasible after collapsing. Removing transition: 
<l6, l6, 1 <= 0, {b_arp^0 -> undef132, b_probe^0 -> undef235, i^0 -> -2 + i^0, k^0 -> 1 + k^0, pos^0 -> 0, rest remain the same}>
It's unfeasible after collapsing. Removing transition: 
<l6, l6, 1 <= 0, {b_probe^0 -> undef235, k^0 -> 1 + k^0, pos^0 -> ((0 + 1) + 0) + pos^0, rest remain the same}>
It's unfeasible after collapsing. Removing transition: 
<l6, l6, 1 <= 0, {b_arp^0 -> undef132, b_probe^0 -> undef235, k^0 -> 1 + k^0, pos^0 -> ((0 + 1) + 0) + pos^0, z^0 -> -1 + z^0, rest remain the same}>
It's unfeasible after collapsing. Removing transition: 
<l6, l6, 1 <= 0, {b_arp^0 -> undef132, b_probe^0 -> undef235, i^0 -> 3 + undef89, k^0 -> 1 + k^0, pos^0 -> 0, seq^0 -> undef89, z^0 -> undef90, rest remain the same}>
It's unfeasible after collapsing. Removing transition: 
<l6, l6, 1 <= 0, {b_arp^0 -> undef132, b_probe^0 -> undef235, i^0 -> -1 + i^0, k^0 -> 1 + k^0, pos^0 -> 0, rest remain the same}>
It's unfeasible after collapsing. Removing transition: 
<l6, l6, 1 <= 0, {b_arp^0 -> undef132, b_probe^0 -> undef235, k^0 -> 1 + k^0, pos^0 -> 2 + pos^0, rest remain the same}>
New Graphs: 
Transitions:
<l6, l6, 0 <= undef374 /\ 1 <= b_arp^0 /\ 1 <= z^0 /\ seq^0 <= 1 + N^0 /\ undef374 <= 1 /\ b_configured^0 = 0, {b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, k^0 -> 0, z^0 -> -1 + z^0, rest remain the same}>
<l6, l6, z^0 <= 0 /\ 0 <= undef374 /\ 1 <= b_arp^0 /\ 1 <= i^0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ undef374 <= 1 /\ b_configured^0 = 0, {b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, i^0 -> -1 + i^0, k^0 -> 0, pos^0 -> 0, rest remain the same}>
<l6, l6, pos^0 <= 0 /\ z^0 <= 0 /\ 1 <= b_arp^0 /\ 1 <= i^0 /\ seq^0 <= 1 + N^0 /\ b_configured^0 = 0 /\ undef374 = 0, {b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, k^0 -> 0, pos^0 -> 1 + pos^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ 1 <= z^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 0, {b_probe^0 -> undef235, k^0 -> 1 + k^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ 1 <= b_ip^0 /\ 1 <= z^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 1, {b_probe^0 -> undef235, k^0 -> 1 + k^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ 0 <= undef132 /\ seq^0 <= 1 + N^0 /\ undef132 <= 1 /\ 2 <= z^0 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, k^0 -> 1 + k^0, z^0 -> -2 + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ i^0 <= 0 /\ 0 <= undef90 /\ 0 <= undef132 /\ undef89 <= 1 + N^0 /\ undef132 <= 1 /\ 1 + seq^0 = undef89 /\ z^0 = 1 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, i^0 -> 3 + undef89, k^0 -> 1 + k^0, pos^0 -> 0, seq^0 -> undef89, z^0 -> undef90, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ 0 <= undef132 /\ 1 <= i^0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ undef132 <= 1 /\ z^0 = 1 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, i^0 -> -1 + i^0, k^0 -> 1 + k^0, pos^0 -> 0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ pos^0 <= 0 /\ 1 <= i^0 /\ seq^0 <= 1 + N^0 /\ undef132 = 0 /\ z^0 = 1 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, k^0 -> 1 + k^0, pos^0 -> 1 + pos^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef190 /\ undef189 <= 1 + N^0 /\ undef235 = 0 /\ 1 + seq^0 = undef189, {b_probe^0 -> undef235, i^0 -> ((0 + 3) + 0) + undef189, k^0 -> 1 + k^0, pos^0 -> 0, seq^0 -> undef189, z^0 -> undef190, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef190 /\ 1 <= b_ip^0 /\ undef189 <= 1 + N^0 /\ 1 + seq^0 = undef189 /\ undef235 = 1, {b_probe^0 -> undef235, i^0 -> ((0 + 3) + 0) + undef189, k^0 -> 1 + k^0, pos^0 -> 0, seq^0 -> undef189, z^0 -> undef190, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef132 /\ 1 <= undef190 /\ undef189 <= 1 + N^0 /\ undef132 <= 1 /\ 1 + seq^0 = undef189 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, i^0 -> ((0 + 3) + 0) + undef189, k^0 -> 1 + k^0, pos^0 -> 0, seq^0 -> undef189, z^0 -> -1 + undef190, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ i^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef90 /\ 0 <= undef132 /\ undef89 <= 1 + N^0 /\ undef132 <= 1 /\ 3 + undef189 <= 0 /\ undef190 = 0 /\ 1 + seq^0 = undef189 /\ undef89 = 1 + undef189 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, i^0 -> 3 + undef89, k^0 -> 1 + k^0, pos^0 -> 0, seq^0 -> undef89, z^0 -> undef90, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ i^0 <= 0 /\ z^0 <= 0 /\ undef189 <= 1 + N^0 /\ 0 <= 2 + undef189 /\ undef132 = 0 /\ undef190 = 0 /\ 1 + seq^0 = undef189 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, i^0 -> ((0 + 3) + 0) + undef189, k^0 -> 1 + k^0, pos^0 -> 1, seq^0 -> undef189, z^0 -> undef190, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ z^0 <= 0 /\ 1 <= i^0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 0, {b_probe^0 -> undef235, i^0 -> ((0 + ~(1)) + 0) + i^0, k^0 -> 1 + k^0, pos^0 -> 0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ z^0 <= 0 /\ 1 <= b_ip^0 /\ 1 <= i^0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 1, {b_probe^0 -> undef235, i^0 -> ((0 + ~(1)) + 0) + i^0, k^0 -> 1 + k^0, pos^0 -> 0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ z^0 <= 0 /\ 0 <= undef90 /\ 0 <= undef132 /\ 1 <= pos^0 /\ undef89 <= 1 + N^0 /\ undef132 <= 1 /\ 1 + seq^0 = undef89 /\ i^0 = 1 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, i^0 -> 3 + undef89, k^0 -> 1 + k^0, pos^0 -> 0, seq^0 -> undef89, z^0 -> undef90, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ z^0 <= 0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ 2 <= i^0 /\ undef132 = 0 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, i^0 -> ((0 + ~(1)) + 0) + i^0, k^0 -> 1 + k^0, pos^0 -> 1, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ pos^0 <= 0 /\ z^0 <= 0 /\ 1 <= i^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 0, {b_probe^0 -> undef235, k^0 -> 1 + k^0, pos^0 -> ((0 + 1) + 0) + pos^0, rest remain the same}>
Variables:
N^0, b_arp^0, b_configured^0, b_ip^0, b_probe^0, i^0, k^0, pos^0, seq^0, z^0
Checking conditional termination of SCC {l6}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.041942s
Ranking function: 6*N^0 - 6*seq^0
New Graphs: 
Transitions:
<l6, l6, 0 <= undef374 /\ 1 <= b_arp^0 /\ 1 <= z^0 /\ seq^0 <= 1 + N^0 /\ undef374 <= 1 /\ b_configured^0 = 0, {b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, k^0 -> 0, z^0 -> -1 + z^0, rest remain the same}>
<l6, l6, z^0 <= 0 /\ 0 <= undef374 /\ 1 <= b_arp^0 /\ 1 <= i^0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ undef374 <= 1 /\ b_configured^0 = 0, {b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, i^0 -> -1 + i^0, k^0 -> 0, pos^0 -> 0, rest remain the same}>
<l6, l6, pos^0 <= 0 /\ z^0 <= 0 /\ 1 <= b_arp^0 /\ 1 <= i^0 /\ seq^0 <= 1 + N^0 /\ b_configured^0 = 0 /\ undef374 = 0, {b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, k^0 -> 0, pos^0 -> 1 + pos^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ 1 <= z^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 0, {b_probe^0 -> undef235, k^0 -> 1 + k^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ 1 <= b_ip^0 /\ 1 <= z^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 1, {b_probe^0 -> undef235, k^0 -> 1 + k^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ 0 <= undef132 /\ seq^0 <= 1 + N^0 /\ undef132 <= 1 /\ 2 <= z^0 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, k^0 -> 1 + k^0, z^0 -> -2 + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ 0 <= undef132 /\ 1 <= i^0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ undef132 <= 1 /\ z^0 = 1 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, i^0 -> -1 + i^0, k^0 -> 1 + k^0, pos^0 -> 0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ pos^0 <= 0 /\ 1 <= i^0 /\ seq^0 <= 1 + N^0 /\ undef132 = 0 /\ z^0 = 1 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, k^0 -> 1 + k^0, pos^0 -> 1 + pos^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ z^0 <= 0 /\ 1 <= i^0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 0, {b_probe^0 -> undef235, i^0 -> ((0 + ~(1)) + 0) + i^0, k^0 -> 1 + k^0, pos^0 -> 0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ z^0 <= 0 /\ 1 <= b_ip^0 /\ 1 <= i^0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 1, {b_probe^0 -> undef235, i^0 -> ((0 + ~(1)) + 0) + i^0, k^0 -> 1 + k^0, pos^0 -> 0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ z^0 <= 0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ 2 <= i^0 /\ undef132 = 0 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, i^0 -> ((0 + ~(1)) + 0) + i^0, k^0 -> 1 + k^0, pos^0 -> 1, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ pos^0 <= 0 /\ z^0 <= 0 /\ 1 <= i^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 0, {b_probe^0 -> undef235, k^0 -> 1 + k^0, pos^0 -> ((0 + 1) + 0) + pos^0, rest remain the same}>
Variables:
N^0, b_arp^0, b_configured^0, b_ip^0, b_probe^0, i^0, k^0, pos^0, seq^0, z^0
Checking conditional termination of SCC {l6}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.017256s
Ranking function: -7 + N^0 - b_configured^0 - seq^0 + 8*z^0
New Graphs: 
Transitions:
<l6, l6, z^0 <= 0 /\ 0 <= undef374 /\ 1 <= b_arp^0 /\ 1 <= i^0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ undef374 <= 1 /\ b_configured^0 = 0, {b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, i^0 -> -1 + i^0, k^0 -> 0, pos^0 -> 0, rest remain the same}>
<l6, l6, pos^0 <= 0 /\ z^0 <= 0 /\ 1 <= b_arp^0 /\ 1 <= i^0 /\ seq^0 <= 1 + N^0 /\ b_configured^0 = 0 /\ undef374 = 0, {b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, k^0 -> 0, pos^0 -> 1 + pos^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ 1 <= z^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 0, {b_probe^0 -> undef235, k^0 -> 1 + k^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ 1 <= b_ip^0 /\ 1 <= z^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 1, {b_probe^0 -> undef235, k^0 -> 1 + k^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ 0 <= undef132 /\ seq^0 <= 1 + N^0 /\ undef132 <= 1 /\ 2 <= z^0 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, k^0 -> 1 + k^0, z^0 -> -2 + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ 0 <= undef132 /\ 1 <= i^0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ undef132 <= 1 /\ z^0 = 1 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, i^0 -> -1 + i^0, k^0 -> 1 + k^0, pos^0 -> 0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ pos^0 <= 0 /\ 1 <= i^0 /\ seq^0 <= 1 + N^0 /\ undef132 = 0 /\ z^0 = 1 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, k^0 -> 1 + k^0, pos^0 -> 1 + pos^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ z^0 <= 0 /\ 1 <= i^0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 0, {b_probe^0 -> undef235, i^0 -> ((0 + ~(1)) + 0) + i^0, k^0 -> 1 + k^0, pos^0 -> 0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ z^0 <= 0 /\ 1 <= b_ip^0 /\ 1 <= i^0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 1, {b_probe^0 -> undef235, i^0 -> ((0 + ~(1)) + 0) + i^0, k^0 -> 1 + k^0, pos^0 -> 0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ z^0 <= 0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ 2 <= i^0 /\ undef132 = 0 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, i^0 -> ((0 + ~(1)) + 0) + i^0, k^0 -> 1 + k^0, pos^0 -> 1, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ pos^0 <= 0 /\ z^0 <= 0 /\ 1 <= i^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 0, {b_probe^0 -> undef235, k^0 -> 1 + k^0, pos^0 -> ((0 + 1) + 0) + pos^0, rest remain the same}>
Variables:
N^0, b_arp^0, b_configured^0, b_ip^0, b_probe^0, i^0, k^0, pos^0, seq^0, z^0
Checking conditional termination of SCC {l6}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.017805s
Ranking function: -7 + N^0 - b_configured^0 + 8*i^0 - seq^0
New Graphs: 
Transitions:
<l6, l6, pos^0 <= 0 /\ z^0 <= 0 /\ 1 <= b_arp^0 /\ 1 <= i^0 /\ seq^0 <= 1 + N^0 /\ b_configured^0 = 0 /\ undef374 = 0, {b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, k^0 -> 0, pos^0 -> 1 + pos^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ 1 <= z^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 0, {b_probe^0 -> undef235, k^0 -> 1 + k^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ 1 <= b_ip^0 /\ 1 <= z^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 1, {b_probe^0 -> undef235, k^0 -> 1 + k^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ 0 <= undef132 /\ seq^0 <= 1 + N^0 /\ undef132 <= 1 /\ 2 <= z^0 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, k^0 -> 1 + k^0, z^0 -> -2 + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ 0 <= undef132 /\ 1 <= i^0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ undef132 <= 1 /\ z^0 = 1 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, i^0 -> -1 + i^0, k^0 -> 1 + k^0, pos^0 -> 0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ pos^0 <= 0 /\ 1 <= i^0 /\ seq^0 <= 1 + N^0 /\ undef132 = 0 /\ z^0 = 1 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, k^0 -> 1 + k^0, pos^0 -> 1 + pos^0, z^0 -> ((0 + ~(1)) + 0) + z^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ z^0 <= 0 /\ 1 <= i^0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 0, {b_probe^0 -> undef235, i^0 -> ((0 + ~(1)) + 0) + i^0, k^0 -> 1 + k^0, pos^0 -> 0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ z^0 <= 0 /\ 1 <= b_ip^0 /\ 1 <= i^0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 1, {b_probe^0 -> undef235, i^0 -> ((0 + ~(1)) + 0) + i^0, k^0 -> 1 + k^0, pos^0 -> 0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ z^0 <= 0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ 2 <= i^0 /\ undef132 = 0 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, i^0 -> ((0 + ~(1)) + 0) + i^0, k^0 -> 1 + k^0, pos^0 -> 1, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ pos^0 <= 0 /\ z^0 <= 0 /\ 1 <= i^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 0, {b_probe^0 -> undef235, k^0 -> 1 + k^0, pos^0 -> ((0 + 1) + 0) + pos^0, rest remain the same}>
Variables:
N^0, b_arp^0, b_configured^0, b_ip^0, b_probe^0, i^0, k^0, pos^0, seq^0, z^0
Checking conditional termination of SCC {l6}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.014503s
Ranking function: -6 + N^0 - seq^0 + 7*z^0
New Graphs: 
Transitions:
<l6, l6, pos^0 <= 0 /\ z^0 <= 0 /\ 1 <= b_arp^0 /\ 1 <= i^0 /\ seq^0 <= 1 + N^0 /\ b_configured^0 = 0 /\ undef374 = 0, {b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, k^0 -> 0, pos^0 -> 1 + pos^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ z^0 <= 0 /\ 1 <= i^0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 0, {b_probe^0 -> undef235, i^0 -> ((0 + ~(1)) + 0) + i^0, k^0 -> 1 + k^0, pos^0 -> 0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ z^0 <= 0 /\ 1 <= b_ip^0 /\ 1 <= i^0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 1, {b_probe^0 -> undef235, i^0 -> ((0 + ~(1)) + 0) + i^0, k^0 -> 1 + k^0, pos^0 -> 0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ b_ip^0 <= 0 /\ z^0 <= 0 /\ 1 <= pos^0 /\ seq^0 <= 1 + N^0 /\ 2 <= i^0 /\ undef132 = 0 /\ undef235 = 1, {b_arp^0 -> undef132, b_probe^0 -> undef235, i^0 -> ((0 + ~(1)) + 0) + i^0, k^0 -> 1 + k^0, pos^0 -> 1, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ pos^0 <= 0 /\ z^0 <= 0 /\ 1 <= i^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 0, {b_probe^0 -> undef235, k^0 -> 1 + k^0, pos^0 -> ((0 + 1) + 0) + pos^0, rest remain the same}>
Variables:
N^0, b_arp^0, b_configured^0, b_ip^0, b_probe^0, i^0, k^0, pos^0, seq^0, z^0
Checking conditional termination of SCC {l6}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007850s
Ranking function: N^0 + i^0 - seq^0
New Graphs: 
Transitions:
<l6, l6, pos^0 <= 0 /\ z^0 <= 0 /\ 1 <= b_arp^0 /\ 1 <= i^0 /\ seq^0 <= 1 + N^0 /\ b_configured^0 = 0 /\ undef374 = 0, {b_arp^0 -> 0, b_ip^0 -> undef374, b_probe^0 -> 0, k^0 -> 0, pos^0 -> 1 + pos^0, rest remain the same}>
<l6, l6, k^0 <= N^0 /\ b_arp^0 <= 0 /\ pos^0 <= 0 /\ z^0 <= 0 /\ 1 <= i^0 /\ seq^0 <= 1 + N^0 /\ undef235 = 0, {b_probe^0 -> undef235, k^0 -> 1 + k^0, pos^0 -> ((0 + 1) + 0) + pos^0, rest remain the same}>
Variables:
N^0, b_arp^0, b_configured^0, b_ip^0, b_probe^0, i^0, k^0, pos^0, seq^0, z^0
Checking conditional termination of SCC {l6}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003499s
Ranking function: 1 + N^0 - pos^0 - seq^0
New Graphs: 
Proving termination of subgraph 2
Analyzing SCC {l23}...
No cycles found.

Program Terminates