/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, l8, true>
<l1, l2, (0 <= (0 + k_121^0)) /\ (undef11 = (0 + a_10^0)) /\ ((1 + y_11^0) <= (0 + undef11)), par{x_12^0 -> undef11}>
<l1, l2, (0 <= (0 + k_121^0)) /\ (undef26 = (0 + a_10^0)) /\ ((1 + undef26) <= (0 + y_11^0)), par{x_12^0 -> undef26}>
<l3, l1, (undef59 = 0) /\ (undef56 = undef56) /\ (undef63 = (0 + undef56)) /\ (undef53 = (0 + undef63)) /\ (undef46 = (0 + undef53)) /\ (undef60 = (0 + undef46)) /\ (undef47 = undef47) /\ (undef57 = undef57) /\ (undef64 = (0 + undef57)) /\ (undef54 = (0 + undef64)) /\ (undef48 = (0 + undef54)) /\ (undef38 = 2) /\ (undef61 = (0 + undef48)) /\ (undef49 = undef49) /\ (0 <= (0 + undef38)) /\ (0 <= (0 + undef38)) /\ (0 <= (0 + undef38)) /\ (undef58 = undef58) /\ (undef65 = (0 + undef58)) /\ (undef55 = (0 + undef65)) /\ (undef50 = (0 + undef55)) /\ (0 <= (0 + undef38)) /\ (undef36 = (1 + undef38)) /\ (undef62 = (0 + undef50)) /\ (undef51 = undef51) /\ (0 <= (0 + undef36)) /\ (0 <= (0 + undef36)) /\ (0 <= (0 + undef36)) /\ (undef40 = undef40) /\ (undef43 = (0 + undef40)) /\ (undef32 = (0 + undef43)) /\ (undef52 = (0 + undef32)) /\ (0 <= (0 + undef36)) /\ (undef31 = undef31) /\ (0 <= (0 + k_121^0)) /\ (0 <= (0 + k_121^0)), par{Result_4^0 -> undef31, ___cil_tmp5_9^0 -> undef32, k_83^0 -> undef36, len_54^0 -> undef38, tmp_8^0 -> undef40, x_13^0 -> (0 + undef52), x_7^0 -> undef43, y_14^0 -> 0}>
<l2, l4, (0 <= (0 + k_121^0)) /\ ((1 + y_11^0) <= (0 + x_12^0)) /\ (undef81 = undef81) /\ (undef74 = undef74), par{len_181^0 -> 1, lt_15^0 -> undef74, x_12^0 -> (0 + undef81)}>
<l2, l4, (0 <= (0 + k_121^0)) /\ ((1 + x_12^0) <= (0 + y_11^0)) /\ (undef97 = undef97) /\ (undef90 = undef90), par{len_181^0 -> 1, lt_15^0 -> undef90, x_12^0 -> (0 + undef97)}>
<l4, l5, (0 <= (0 + a_178^0)) /\ (0 <= (0 + len_181^0)) /\ ((0 + y_11^0) <= (0 + x_12^0)) /\ ((0 + x_12^0) <= (0 + y_11^0)) /\ (undef113 = undef113) /\ (0 <= (0 + len_181^0)) /\ (0 <= (0 + len_181^0)) /\ (undef98 = undef98), par{Result_4^0 -> undef98}>
<l4, l6, (0 <= (0 + a_178^0)) /\ (0 <= (0 + len_181^0)) /\ ((1 + y_11^0) <= (0 + x_12^0)) /\ (undef129 = undef129) /\ (undef122 = undef122), par{len_181^0 -> (1 + len_181^0), lt_15^0 -> undef122, x_12^0 -> (0 + undef129)}>
<l6, l4, true>
<l4, l7, (0 <= (0 + a_178^0)) /\ (0 <= (0 + len_181^0)) /\ ((1 + x_12^0) <= (0 + y_11^0)) /\ (undef160 = undef160) /\ (undef153 = undef153), par{len_181^0 -> (1 + len_181^0), lt_15^0 -> undef153, x_12^0 -> (0 + undef160)}>
<l7, l4, true>
<l8, l3, true>

Fresh variables:
undef11, undef26, undef31, undef32, undef36, undef38, undef40, undef43, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, undef65, undef74, undef81, undef90, undef97, undef98, undef113, undef122, undef129, undef153, undef160, 

Undef variables:
undef11, undef26, undef31, undef32, undef36, undef38, undef40, undef43, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, undef65, undef74, undef81, undef90, undef97, undef98, undef113, undef122, undef129, undef153, undef160, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l4, (len_181^0 = 1) /\ (undef59 = 0) /\ (undef56 = undef56) /\ (undef63 = (0 + undef56)) /\ (undef53 = (0 + undef63)) /\ (undef46 = (0 + undef53)) /\ (undef60 = (0 + undef46)) /\ (undef47 = undef47) /\ (undef57 = undef57) /\ (undef64 = (0 + undef57)) /\ (undef54 = (0 + undef64)) /\ (undef48 = (0 + undef54)) /\ (undef38 = 2) /\ (undef61 = (0 + undef48)) /\ (undef49 = undef49) /\ (0 <= (0 + undef38)) /\ (0 <= (0 + undef38)) /\ (0 <= (0 + undef38)) /\ (undef58 = undef58) /\ (undef65 = (0 + undef58)) /\ (undef55 = (0 + undef65)) /\ (undef50 = (0 + undef55)) /\ (0 <= (0 + undef38)) /\ (undef36 = (1 + undef38)) /\ (undef62 = (0 + undef50)) /\ (undef51 = undef51) /\ (0 <= (0 + undef36)) /\ (0 <= (0 + undef36)) /\ (0 <= (0 + undef36)) /\ (undef40 = undef40) /\ (undef43 = (0 + undef40)) /\ (undef32 = (0 + undef43)) /\ (undef52 = (0 + undef32)) /\ (0 <= (0 + undef36)) /\ (undef31 = undef31) /\ (0 <= (0 + k_121^0)) /\ (0 <= (0 + k_121^0)) /\ (0 <= (0 + k_121^0)) /\ (undef11 = (0 + a_10^0)) /\ ((1 + y_11^0) <= (0 + undef11)) /\ (0 <= (0 + k_121^0)) /\ ((1 + y_11^0) <= (0 + undef11)) /\ (undef81 = undef81) /\ (undef74 = undef74), par{x_12^0 -> (0 + undef81)}>
<l0, l4, (len_181^0 = 1) /\ (undef59 = 0) /\ (undef56 = undef56) /\ (undef63 = (0 + undef56)) /\ (undef53 = (0 + undef63)) /\ (undef46 = (0 + undef53)) /\ (undef60 = (0 + undef46)) /\ (undef47 = undef47) /\ (undef57 = undef57) /\ (undef64 = (0 + undef57)) /\ (undef54 = (0 + undef64)) /\ (undef48 = (0 + undef54)) /\ (undef38 = 2) /\ (undef61 = (0 + undef48)) /\ (undef49 = undef49) /\ (0 <= (0 + undef38)) /\ (0 <= (0 + undef38)) /\ (0 <= (0 + undef38)) /\ (undef58 = undef58) /\ (undef65 = (0 + undef58)) /\ (undef55 = (0 + undef65)) /\ (undef50 = (0 + undef55)) /\ (0 <= (0 + undef38)) /\ (undef36 = (1 + undef38)) /\ (undef62 = (0 + undef50)) /\ (undef51 = undef51) /\ (0 <= (0 + undef36)) /\ (0 <= (0 + undef36)) /\ (0 <= (0 + undef36)) /\ (undef40 = undef40) /\ (undef43 = (0 + undef40)) /\ (undef32 = (0 + undef43)) /\ (undef52 = (0 + undef32)) /\ (0 <= (0 + undef36)) /\ (undef31 = undef31) /\ (0 <= (0 + k_121^0)) /\ (0 <= (0 + k_121^0)) /\ (0 <= (0 + k_121^0)) /\ (undef26 = (0 + a_10^0)) /\ ((1 + undef26) <= (0 + y_11^0)) /\ (0 <= (0 + k_121^0)) /\ ((1 + undef26) <= (0 + y_11^0)) /\ (undef97 = undef97) /\ (undef90 = undef90), par{x_12^0 -> (0 + undef97)}>
<l4, l5, (0 <= (0 + a_178^0)) /\ (0 <= (0 + len_181^0)) /\ ((0 + y_11^0) <= (0 + x_12^0)) /\ ((0 + x_12^0) <= (0 + y_11^0)) /\ (undef113 = undef113) /\ (0 <= (0 + len_181^0)) /\ (0 <= (0 + len_181^0)) /\ (undef98 = undef98)>
<l4, l4, (0 <= (0 + a_178^0)) /\ (0 <= (0 + len_181^0)) /\ ((1 + y_11^0) <= (0 + x_12^0)) /\ (undef129 = undef129) /\ (undef122 = undef122), par{len_181^0 -> (1 + len_181^0), x_12^0 -> (0 + undef129)}>
<l4, l4, (0 <= (0 + a_178^0)) /\ (0 <= (0 + len_181^0)) /\ ((1 + x_12^0) <= (0 + y_11^0)) /\ (undef160 = undef160) /\ (undef153 = undef153), par{len_181^0 -> (1 + len_181^0), x_12^0 -> (0 + undef160)}>

Fresh variables:
undef11, undef26, undef31, undef32, undef36, undef38, undef40, undef43, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, undef65, undef74, undef81, undef90, undef97, undef98, undef113, undef122, undef129, undef153, undef160, 

Undef variables:
undef11, undef26, undef31, undef32, undef36, undef38, undef40, undef43, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef64, undef65, undef74, undef81, undef90, undef97, undef98, undef113, undef122, undef129, undef153, undef160, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + y_11^0 <= x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + x_12^0 <= y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Variables:
a_178^0, len_181^0, x_12^0, y_11^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l4, 0 <= k_121^0 /\ 0 <= undef36 /\ 1 + y_11^0 <= undef11 /\ a_10^0 = undef11 /\ undef32 = undef43 /\ undef32 = undef52 /\ undef40 = undef43 /\ undef46 = undef53 /\ undef46 = undef60 /\ undef48 = undef54 /\ undef48 = undef61 /\ undef50 = undef55 /\ undef50 = undef62 /\ undef53 = undef63 /\ undef54 = undef64 /\ undef55 = undef65 /\ undef56 = undef63 /\ undef57 = undef64 /\ undef58 = undef65 /\ undef59 = 0 /\ len_181^0 = 1 /\ undef36 = 1 + undef38 /\ undef38 = 2, {x_12^0 -> undef81, rest remain the same}>
<l0, l4, 0 <= k_121^0 /\ 0 <= undef36 /\ 1 + undef26 <= y_11^0 /\ a_10^0 = undef26 /\ undef32 = undef43 /\ undef32 = undef52 /\ undef40 = undef43 /\ undef46 = undef53 /\ undef46 = undef60 /\ undef48 = undef54 /\ undef48 = undef61 /\ undef50 = undef55 /\ undef50 = undef62 /\ undef53 = undef63 /\ undef54 = undef64 /\ undef55 = undef65 /\ undef56 = undef63 /\ undef57 = undef64 /\ undef58 = undef65 /\ undef59 = 0 /\ len_181^0 = 1 /\ undef36 = 1 + undef38 /\ undef38 = 2, {x_12^0 -> undef97, rest remain the same}>

Graph 2
<l4, l5, 0 <= a_178^0 /\ 0 <= len_181^0 /\ x_12^0 = y_11^0, {all remain the same}>

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

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

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

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002096s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006399s
[46887 : 46888]
[46887 : 46889]
Successful child: 46888
[ 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: 
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + y_11^0 <= x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, 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, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + x_12^0 <= y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + y_11^0 <= x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, 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, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + x_12^0 <= y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
New Graphs: 
[46887 : 46893]
[46887 : 46894]
INVARIANTS: 
4: 
Quasi-INVARIANTS to narrow Graph: 
4: 1 + a_178^0 <= 0 , 1 <= len_181^0 , len_181^0 <= 1 , 
Narrowing transition: 
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + y_11^0 <= x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>

LOG: Narrow transition size 3
Narrowing transition: 
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + x_12^0 <= y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>

LOG: Narrow transition size 3
invGraph after Narrowing: 
Transitions:
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + y_11^0 <= x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + x_12^0 <= y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Variables:
a_178^0, len_181^0, x_12^0, y_11^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001761s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006818s
[46887 : 46895]
[46887 : 46896]
Successful child: 46895
[ 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: 
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + y_11^0 <= x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, 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, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + x_12^0 <= y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, 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: 
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + y_11^0 <= x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, 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, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + x_12^0 <= y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
New Graphs: 
[46887 : 46900]
[46887 : 46901]
[46887 : 46902]
[46887 : 46903]
INVARIANTS: 
4: 
Quasi-INVARIANTS to narrow Graph: 
4: x_12^0 <= y_11^0 , 1 <= a_178^0 + len_181^0 , a_178^0 + len_181^0 + y_11^0 <= 1 + x_12^0 , 
Narrowing transition: 
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + y_11^0 <= x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>

LOG: Narrow transition size 3
Narrowing transition: 
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + x_12^0 <= y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>

LOG: Narrow transition size 3
invGraph after Narrowing: 
Transitions:
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + y_11^0 <= x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
<l4, l4, a_178^0 + len_181^0 <= 0 /\ 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + x_12^0 <= y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Variables:
a_178^0, len_181^0, x_12^0, y_11^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003000s
Ranking function: -len_181^0
New Graphs: 
Transitions:
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + y_11^0 <= x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Variables:
a_178^0, len_181^0, x_12^0, y_11^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001827s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008017s
[46887 : 46904]
[46887 : 46905]
Successful child: 46904
[ 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: 
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + y_11^0 <= x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, 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, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, 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, a_178^0 + len_181^0 <= 0 /\ 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + x_12^0 <= y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, 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: 
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + y_11^0 <= x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, 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, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
New Graphs: 
[46887 : 46909]
[46887 : 46910]
[46887 : 46911]
[46887 : 46912]
INVARIANTS: 
4: 
Quasi-INVARIANTS to narrow Graph: 
4: y_11^0 <= x_12^0 , 1 <= len_181^0 , len_181^0 + x_12^0 <= 1 + y_11^0 , 
Narrowing transition: 
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + y_11^0 <= x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>

LOG: Narrow transition size 3
Narrowing transition: 
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>

LOG: Narrow transition size 3
Narrowing transition: 
<l4, l4, a_178^0 + len_181^0 <= 0 /\ 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + x_12^0 <= y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>

LOG: Narrow transition size 3
invGraph after Narrowing: 
Transitions:
<l4, l4, 0 <= a_178^0 /\ 1 <= len_181^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>
<l4, l4, 0 <= a_178^0 /\ 1 + y_11^0 <= x_12^0 /\ len_181^0 = 0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
<l4, l4, a_178^0 + len_181^0 <= 0 /\ 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + x_12^0 <= y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Variables:
a_178^0, len_181^0, x_12^0, y_11^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003400s
Ranking function: -4*len_181^0
New Graphs: 
Transitions:
<l4, l4, 0 <= a_178^0 /\ 1 <= len_181^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>
<l4, l4, 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Variables:
a_178^0, len_181^0, x_12^0, y_11^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001499s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008085s
[46887 : 46913]
[46887 : 46914]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000862s
Time used: 1.00086

LOG: SAT solveNonLinear - Elapsed time: 1.048732s
Cost: 1; Total time: 1.04731
Quasi-ranking function: 50000 - len_181^0
New Graphs: 
Transitions:
<l4, l4, 0 <= a_178^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0 /\ 50001 <= len_181^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>
<l4, l4, 0 <= a_178^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 <= len_181^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Variables:
a_178^0, len_181^0, x_12^0, y_11^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001641s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009578s
[46887 : 46965]
[46887 : 46966]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.000726s
Time used: 1.00072

LOG: SAT solveNonLinear - Elapsed time: 1.048683s
Cost: 1; Total time: 1.04646
Termination implied by a set of invariant(s):
Invariant at l4: 1 <= len_181^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 0 <= a_178^0 /\ 1 <= len_181^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, 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, 0 <= a_178^0 /\ 1 + y_11^0 <= x_12^0 /\ len_181^0 = 0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 0 <= a_178^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 <= len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, 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, a_178^0 + len_181^0 <= 0 /\ 0 <= a_178^0 /\ 0 <= len_181^0 /\ 1 + x_12^0 <= y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, 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): 
<l4, l4, 0 <= a_178^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0 /\ 50001 <= len_181^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 0 <= a_178^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 <= len_181^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Quasi-ranking function: 50000 + a_178^0 - len_181^0 + y_11^0
New Graphs: 
Transitions:
<l4, l4, 0 <= a_178^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 <= len_181^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>
<l4, l4, 0 <= a_178^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 <= len_181^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Variables:
a_178^0, len_181^0, x_12^0, y_11^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001832s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.013518s
[46887 : 47166]
[46887 : 47167]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.027384s
Time used: 1.02737

LOG: SAT solveNonLinear - Elapsed time: 1.063993s
Cost: 1; Total time: 1.06177
Quasi-ranking function: 50000 + a_178^0 - len_181^0 - y_11^0
New Graphs: 
Transitions:
<l4, l4, 0 <= a_178^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 <= len_181^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>
<l4, l4, 0 <= a_178^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 <= len_181^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Variables:
a_178^0, len_181^0, x_12^0, y_11^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002057s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.013791s
[46887 : 47475]
[46887 : 47476]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001071s
Time used: 1.00092

LOG: SAT solveNonLinear - Elapsed time: 1.039014s
Cost: 1; Total time: 1.03618
Termination implied by a set of invariant(s):
Invariant at l4: 0 <= a_178^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 0 <= a_178^0 /\ 1 <= len_181^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 0 <= a_178^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 <= len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, 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): 
<l4, l4, 0 <= a_178^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 <= len_181^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 0 <= a_178^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 <= len_181^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Quasi-ranking function: 50000 - a_178^0 - len_181^0 + y_11^0
New Graphs: 
Transitions:
<l4, l4, 0 <= a_178^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 + y_11^0 <= a_178^0 + len_181^0 /\ 50001 <= len_181^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>
<l4, l4, 0 <= a_178^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 + y_11^0 <= a_178^0 + len_181^0 /\ 50001 <= len_181^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Variables:
a_178^0, len_181^0, x_12^0, y_11^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002316s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.013082s
[46887 : 47673]
[46887 : 47674]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001143s
Time used: 1.00111

LOG: SAT solveNonLinear - Elapsed time: 1.039721s
Cost: 1; Total time: 1.03674
Quasi-ranking function: 50000 - a_178^0 - len_181^0 - y_11^0
New Graphs: 
Transitions:
<l4, l4, 0 <= a_178^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 + y_11^0 <= a_178^0 + len_181^0 /\ 50001 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 <= len_181^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>
<l4, l4, 0 <= a_178^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 + y_11^0 <= a_178^0 + len_181^0 /\ 50001 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 <= len_181^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Variables:
a_178^0, len_181^0, x_12^0, y_11^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002664s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.015846s
[46887 : 47958]
[46887 : 47959]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.025865s
Time used: 1.02586

LOG: SAT solveNonLinear - Elapsed time: 1.066716s
Cost: 1; Total time: 1.06359
Termination implied by a set of invariant(s):
Invariant at l4: 0 <= 1 + a_178^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 0 <= a_178^0 /\ 1 <= len_181^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 0 <= a_178^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 <= len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, 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): 
<l4, l4, 0 <= a_178^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 + y_11^0 <= a_178^0 + len_181^0 /\ 50001 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 <= len_181^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 0 <= a_178^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 + y_11^0 <= a_178^0 + len_181^0 /\ 50001 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 <= len_181^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Quasi-ranking function: 50000 - len_181^0 - y_11^0
New Graphs: 
Transitions:
<l4, l4, 0 <= a_178^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 + y_11^0 <= a_178^0 + len_181^0 /\ 50001 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 <= len_181^0 /\ 50001 <= len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>
<l4, l4, 0 <= a_178^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 + y_11^0 <= a_178^0 + len_181^0 /\ 50001 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 <= len_181^0 /\ 50001 <= len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Variables:
a_178^0, len_181^0, x_12^0, y_11^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002773s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.022295s
[46887 : 48248]
[46887 : 48249]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.035846s
Time used: 1.03584

LOG: SAT solveNonLinear - Elapsed time: 1.077941s
Cost: 1; Total time: 1.07453
Termination implied by a set of invariant(s):
Invariant at l4: 0 <= 1 + a_178^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 0 <= a_178^0 /\ 1 <= len_181^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 0 <= a_178^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 <= len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, 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): 
<l4, l4, 0 <= a_178^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 + y_11^0 <= a_178^0 + len_181^0 /\ 50001 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 <= len_181^0 /\ 50001 <= len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 0 <= a_178^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 + y_11^0 <= a_178^0 + len_181^0 /\ 50001 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 <= len_181^0 /\ 50001 <= len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Quasi-ranking function: 50000 - len_181^0 + 2*y_11^0
New Graphs: 
Transitions:
<l4, l4, 0 <= a_178^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 + y_11^0 <= a_178^0 + len_181^0 /\ 50001 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 <= len_181^0 /\ 50001 + 2*y_11^0 <= len_181^0 /\ 50001 <= len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>
<l4, l4, 0 <= a_178^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 + y_11^0 <= a_178^0 + len_181^0 /\ 50001 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 <= len_181^0 /\ 50001 + 2*y_11^0 <= len_181^0 /\ 50001 <= len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Variables:
a_178^0, len_181^0, x_12^0, y_11^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002980s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.015997s
[46887 : 48253]
[46887 : 48254]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.038189s
Time used: 1.03817

LOG: SAT solveNonLinear - Elapsed time: 1.084065s
Cost: 1; Total time: 1.08021
Termination implied by a set of invariant(s):
Invariant at l4: 0 <= a_178^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 0 <= a_178^0 /\ 1 <= len_181^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 0 <= a_178^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 <= len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, 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): 
<l4, l4, 0 <= a_178^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 + y_11^0 <= a_178^0 + len_181^0 /\ 50001 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 <= len_181^0 /\ 50001 + 2*y_11^0 <= len_181^0 /\ 50001 <= len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l4, l4, 0 <= a_178^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 + y_11^0 <= a_178^0 + len_181^0 /\ 50001 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 <= len_181^0 /\ 50001 + 2*y_11^0 <= len_181^0 /\ 50001 <= len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Quasi-ranking function: 50000 + a_178^0 - len_181^0
New Graphs: 
Transitions:
<l4, l4, 0 <= a_178^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0 /\ 50001 + a_178^0 <= len_181^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 + y_11^0 <= a_178^0 + len_181^0 /\ 50001 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 <= len_181^0 /\ 50001 + 2*y_11^0 <= len_181^0 /\ 50001 <= len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>
<l4, l4, 0 <= a_178^0 /\ 1 <= a_178^0 + len_181^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 + a_178^0 <= len_181^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 + y_11^0 <= a_178^0 + len_181^0 /\ 50001 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 <= len_181^0 /\ 50001 + 2*y_11^0 <= len_181^0 /\ 50001 <= len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Variables:
a_178^0, len_181^0, x_12^0, y_11^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003205s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.020520s
[46887 : 48477]
[46887 : 48478]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.012465s
Time used: 1.01246

LOG: SAT solveNonLinear - Elapsed time: 1.055994s
Cost: 1; Total time: 1.05213
Quasi-ranking function: 50000 - a_178^0 - len_181^0
New Graphs: 
Transitions:
<l4, l4, 0 <= a_178^0 /\ 1 + y_11^0 <= x_12^0 /\ 2 + y_11^0 <= len_181^0 + x_12^0 /\ 50001 + a_178^0 <= len_181^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 <= a_178^0 + len_181^0 /\ 50001 + y_11^0 <= a_178^0 + len_181^0 /\ 50001 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 <= len_181^0 /\ 50001 + 2*y_11^0 <= len_181^0 /\ 50001 <= len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef129, rest remain the same}>
<l4, l4, 0 <= a_178^0 /\ 1 + x_12^0 <= y_11^0 /\ 2 + x_12^0 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 + a_178^0 <= len_181^0 /\ 50001 + a_178^0 + y_11^0 <= len_181^0 /\ 50001 + a_178^0 <= len_181^0 + y_11^0 /\ 50001 <= a_178^0 + len_181^0 /\ 50001 + y_11^0 <= a_178^0 + len_181^0 /\ 50001 <= a_178^0 + len_181^0 + y_11^0 /\ 50001 <= len_181^0 /\ 50001 + 2*y_11^0 <= len_181^0 /\ 50001 <= len_181^0 + y_11^0, {len_181^0 -> 1 + len_181^0, x_12^0 -> undef160, rest remain the same}>
Variables:
a_178^0, len_181^0, x_12^0, y_11^0
Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003408s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.024003s
[46887 : 48526]
[46887 : 48527]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.104941s
Time used: 4.10156

[46887 : 48616]
[46887 : 48620]
Successful child: 48616

Program does NOT terminate