/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, l6, true>
<l1, l2, (undef3 > ~(1)) /\ (arg2 > 1) /\ (undef1 > ~(1)) /\ (undef4 > undef2) /\ (undef4 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef1, arg2 -> undef2}>
<l1, l2, (undef7 > ~(1)) /\ (arg2 > 1) /\ (undef6 < 1) /\ (undef5 > ~(1)) /\ (arg1 > 0), par{arg1 -> undef5, arg2 -> undef6}>
<l2, l3, (arg2 > 0), par{arg2 -> 0}>
<l2, l3, true, par{arg2 -> 1}>
<l3, l4, ((arg1 - (2 * undef14)) = 0) /\ (arg2 > 0) /\ (undef15 < arg2) /\ (undef15 > 0) /\ (arg1 >= undef16)>
<l4, l3, ((arg1 - (2 * undef19)) = 0) /\ (arg2 > 0) /\ (undef20 < arg2) /\ (arg1 >= undef17) /\ (undef20 > 0) /\ ((arg1 - (2 * undef19)) >= 0) /\ ((arg1 - (2 * undef19)) < 2) /\ ((arg1 - (2 * undef17)) < 2) /\ ((arg1 - (2 * undef17)) >= 0), par{arg1 -> undef17, arg2 -> 0}>
<l3, l4, ((arg1 - (2 * undef23)) = 1) /\ (arg2 > 0) /\ (undef24 < arg2) /\ (undef24 > 0) /\ (arg1 >= undef25)>
<l4, l3, ((arg1 - (2 * undef28)) = 1) /\ (arg2 > 0) /\ (undef29 < arg2) /\ (arg1 >= undef26) /\ (undef29 > 0) /\ ((arg1 - (2 * undef28)) >= 0) /\ ((arg1 - (2 * undef28)) < 2) /\ ((arg1 - (2 * undef26)) < 2) /\ ((arg1 - (2 * undef26)) >= 0), par{arg1 -> undef26, arg2 -> 1}>
<l3, l4, ((arg1 - (2 * undef32)) = 1) /\ (arg2 > 0) /\ (undef33 < arg2) /\ (arg1 >= undef34)>
<l4, l3, ((arg1 - (2 * undef37)) = 1) /\ (arg2 > 0) /\ (arg1 >= undef35) /\ (undef38 < arg2) /\ ((arg1 - (2 * undef37)) >= 0) /\ ((arg1 - (2 * undef37)) < 2) /\ ((arg1 - (2 * undef35)) < 2) /\ ((arg1 - (2 * undef35)) >= 0), par{arg1 -> undef35, arg2 -> 1}>
<l3, l4, ((arg1 - (2 * undef41)) = 0) /\ (arg2 > 0) /\ (undef42 < arg2) /\ (arg1 >= undef43)>
<l4, l3, ((arg1 - (2 * undef46)) = 0) /\ (arg2 > 0) /\ (arg1 >= undef44) /\ (undef47 < arg2) /\ ((arg1 - (2 * undef46)) >= 0) /\ ((arg1 - (2 * undef46)) < 2) /\ ((arg1 - (2 * undef44)) < 2) /\ ((arg1 - (2 * undef44)) >= 0), par{arg1 -> undef44, arg2 -> 1}>
<l1, l5, (undef50 > ~(1)) /\ (arg2 > 1) /\ (undef51 > ~(1)) /\ (arg1 > 0), par{arg1 -> (undef51 - 1), arg2 -> undef49}>
<l5, l5, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef53}>
<l6, l1, true, par{arg1 -> undef54, arg2 -> undef55}>

Fresh variables:
undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef14, undef15, undef16, undef17, undef19, undef20, undef23, undef24, undef25, undef26, undef28, undef29, undef32, undef33, undef34, undef35, undef37, undef38, undef41, undef42, undef43, undef44, undef46, undef47, undef49, undef50, undef51, undef53, undef54, undef55, 

Undef variables:
undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef14, undef15, undef16, undef17, undef19, undef20, undef23, undef24, undef25, undef26, undef28, undef29, undef32, undef33, undef34, undef35, undef37, undef38, undef41, undef42, undef43, undef44, undef46, undef47, undef49, undef50, undef51, undef53, undef54, undef55, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (undef3 > ~(1)) /\ (undef55 > 1) /\ (undef1 > ~(1)) /\ (undef4 > undef2) /\ (undef4 > ~(1)) /\ (undef54 > 0) /\ (undef2 > 0), par{arg1 -> undef1, arg2 -> 0}>
<l0, l3, (undef3 > ~(1)) /\ (undef55 > 1) /\ (undef1 > ~(1)) /\ (undef4 > undef2) /\ (undef4 > ~(1)) /\ (undef54 > 0), par{arg1 -> undef1, arg2 -> 1}>
<l0, l3, (undef7 > ~(1)) /\ (undef55 > 1) /\ (undef6 < 1) /\ (undef5 > ~(1)) /\ (undef54 > 0), par{arg1 -> undef5, arg2 -> 1}>
<l0, l5, (undef50 > ~(1)) /\ (undef55 > 1) /\ (undef51 > ~(1)) /\ (undef54 > 0), par{arg1 -> (undef51 - 1), arg2 -> undef49}>
<l3, l3, ((arg1 - (2 * undef14)) = 0) /\ (arg2 > 0) /\ (undef15 < arg2) /\ (undef15 > 0) /\ (arg1 >= undef16) /\ ((arg1 - (2 * undef19)) = 0) /\ (arg2 > 0) /\ (undef20 < arg2) /\ (arg1 >= undef17) /\ (undef20 > 0) /\ ((arg1 - (2 * undef19)) >= 0) /\ ((arg1 - (2 * undef19)) < 2) /\ ((arg1 - (2 * undef17)) < 2) /\ ((arg1 - (2 * undef17)) >= 0), par{arg1 -> undef17, arg2 -> 0}>
<l3, l3, ((arg1 - (2 * undef14)) = 0) /\ (arg2 > 0) /\ (undef15 < arg2) /\ (undef15 > 0) /\ (arg1 >= undef16) /\ ((arg1 - (2 * undef46)) = 0) /\ (arg2 > 0) /\ (arg1 >= undef44) /\ (undef47 < arg2) /\ ((arg1 - (2 * undef46)) >= 0) /\ ((arg1 - (2 * undef46)) < 2) /\ ((arg1 - (2 * undef44)) < 2) /\ ((arg1 - (2 * undef44)) >= 0), par{arg1 -> undef44, arg2 -> 1}>
<l3, l3, ((arg1 - (2 * undef23)) = 1) /\ (arg2 > 0) /\ (undef24 < arg2) /\ (undef24 > 0) /\ (arg1 >= undef25) /\ ((arg1 - (2 * undef28)) = 1) /\ (arg2 > 0) /\ (undef29 < arg2) /\ (arg1 >= undef26) /\ (undef29 > 0) /\ ((arg1 - (2 * undef28)) >= 0) /\ ((arg1 - (2 * undef28)) < 2) /\ ((arg1 - (2 * undef26)) < 2) /\ ((arg1 - (2 * undef26)) >= 0), par{arg1 -> undef26, arg2 -> 1}>
<l3, l3, ((arg1 - (2 * undef23)) = 1) /\ (arg2 > 0) /\ (undef24 < arg2) /\ (undef24 > 0) /\ (arg1 >= undef25) /\ ((arg1 - (2 * undef37)) = 1) /\ (arg2 > 0) /\ (arg1 >= undef35) /\ (undef38 < arg2) /\ ((arg1 - (2 * undef37)) >= 0) /\ ((arg1 - (2 * undef37)) < 2) /\ ((arg1 - (2 * undef35)) < 2) /\ ((arg1 - (2 * undef35)) >= 0), par{arg1 -> undef35, arg2 -> 1}>
<l3, l3, ((arg1 - (2 * undef32)) = 1) /\ (arg2 > 0) /\ (undef33 < arg2) /\ (arg1 >= undef34) /\ ((arg1 - (2 * undef28)) = 1) /\ (arg2 > 0) /\ (undef29 < arg2) /\ (arg1 >= undef26) /\ (undef29 > 0) /\ ((arg1 - (2 * undef28)) >= 0) /\ ((arg1 - (2 * undef28)) < 2) /\ ((arg1 - (2 * undef26)) < 2) /\ ((arg1 - (2 * undef26)) >= 0), par{arg1 -> undef26, arg2 -> 1}>
<l3, l3, ((arg1 - (2 * undef32)) = 1) /\ (arg2 > 0) /\ (undef33 < arg2) /\ (arg1 >= undef34) /\ ((arg1 - (2 * undef37)) = 1) /\ (arg2 > 0) /\ (arg1 >= undef35) /\ (undef38 < arg2) /\ ((arg1 - (2 * undef37)) >= 0) /\ ((arg1 - (2 * undef37)) < 2) /\ ((arg1 - (2 * undef35)) < 2) /\ ((arg1 - (2 * undef35)) >= 0), par{arg1 -> undef35, arg2 -> 1}>
<l3, l3, ((arg1 - (2 * undef41)) = 0) /\ (arg2 > 0) /\ (undef42 < arg2) /\ (arg1 >= undef43) /\ ((arg1 - (2 * undef19)) = 0) /\ (arg2 > 0) /\ (undef20 < arg2) /\ (arg1 >= undef17) /\ (undef20 > 0) /\ ((arg1 - (2 * undef19)) >= 0) /\ ((arg1 - (2 * undef19)) < 2) /\ ((arg1 - (2 * undef17)) < 2) /\ ((arg1 - (2 * undef17)) >= 0), par{arg1 -> undef17, arg2 -> 0}>
<l3, l3, ((arg1 - (2 * undef41)) = 0) /\ (arg2 > 0) /\ (undef42 < arg2) /\ (arg1 >= undef43) /\ ((arg1 - (2 * undef46)) = 0) /\ (arg2 > 0) /\ (arg1 >= undef44) /\ (undef47 < arg2) /\ ((arg1 - (2 * undef46)) >= 0) /\ ((arg1 - (2 * undef46)) < 2) /\ ((arg1 - (2 * undef44)) < 2) /\ ((arg1 - (2 * undef44)) >= 0), par{arg1 -> undef44, arg2 -> 1}>
<l5, l5, (arg1 > 0), par{arg1 -> (arg1 - 1), arg2 -> undef53}>

Fresh variables:
undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef14, undef15, undef16, undef17, undef19, undef20, undef23, undef24, undef25, undef26, undef28, undef29, undef32, undef33, undef34, undef35, undef37, undef38, undef41, undef42, undef43, undef44, undef46, undef47, undef49, undef50, undef51, undef53, undef54, undef55, 

Undef variables:
undef1, undef2, undef3, undef4, undef5, undef6, undef7, undef14, undef15, undef16, undef17, undef19, undef20, undef23, undef24, undef25, undef26, undef28, undef29, undef32, undef33, undef34, undef35, undef37, undef38, undef41, undef42, undef43, undef44, undef46, undef47, undef49, undef50, undef51, undef53, undef54, undef55, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l5, l5, 1 <= arg1, {arg1 -> -1 + arg1, arg2 -> undef53, rest remain the same}>
Variables:
arg1, arg2

Graph 2:
Transitions:
<l3, l3, 1 <= arg2 /\ 1 + undef15 <= arg2 /\ 1 + undef20 <= arg2 /\ 1 <= undef15 /\ 1 <= undef20 /\ arg1 <= 1 + 2*undef17 /\ undef16 <= arg1 /\ undef17 <= arg1 /\ 2*undef17 <= arg1 /\ arg1 = 2*undef14 /\ arg1 = 2*undef19, {arg1 -> undef17, arg2 -> 0, rest remain the same}>
<l3, l3, 1 <= arg2 /\ 1 + undef15 <= arg2 /\ 1 + undef47 <= arg2 /\ 1 <= undef15 /\ arg1 <= 1 + 2*undef44 /\ undef16 <= arg1 /\ undef44 <= arg1 /\ 2*undef44 <= arg1 /\ arg1 = 2*undef14 /\ arg1 = 2*undef46, {arg1 -> undef44, arg2 -> 1, rest remain the same}>
<l3, l3, 1 <= arg2 /\ 1 + undef24 <= arg2 /\ 1 + undef29 <= arg2 /\ 1 <= undef24 /\ 1 <= undef29 /\ arg1 <= 1 + 2*undef26 /\ undef25 <= arg1 /\ undef26 <= arg1 /\ 2*undef26 <= arg1 /\ arg1 = 1 + 2*undef23 /\ arg1 = 1 + 2*undef28, {arg1 -> undef26, arg2 -> 1, rest remain the same}>
<l3, l3, 1 <= arg2 /\ 1 + undef24 <= arg2 /\ 1 + undef38 <= arg2 /\ 1 <= undef24 /\ arg1 <= 1 + 2*undef35 /\ undef25 <= arg1 /\ undef35 <= arg1 /\ 2*undef35 <= arg1 /\ arg1 = 1 + 2*undef23 /\ arg1 = 1 + 2*undef37, {arg1 -> undef35, arg2 -> 1, rest remain the same}>
<l3, l3, 1 <= arg2 /\ 1 + undef29 <= arg2 /\ 1 + undef33 <= arg2 /\ 1 <= undef29 /\ arg1 <= 1 + 2*undef26 /\ undef26 <= arg1 /\ 2*undef26 <= arg1 /\ undef34 <= arg1 /\ arg1 = 1 + 2*undef28 /\ arg1 = 1 + 2*undef32, {arg1 -> undef26, arg2 -> 1, rest remain the same}>
<l3, l3, 1 <= arg2 /\ 1 + undef33 <= arg2 /\ 1 + undef38 <= arg2 /\ arg1 <= 1 + 2*undef35 /\ undef34 <= arg1 /\ undef35 <= arg1 /\ 2*undef35 <= arg1 /\ arg1 = 1 + 2*undef32 /\ arg1 = 1 + 2*undef37, {arg1 -> undef35, arg2 -> 1, rest remain the same}>
<l3, l3, 1 <= arg2 /\ 1 + undef20 <= arg2 /\ 1 + undef42 <= arg2 /\ 1 <= undef20 /\ arg1 <= 1 + 2*undef17 /\ undef17 <= arg1 /\ 2*undef17 <= arg1 /\ undef43 <= arg1 /\ arg1 = 2*undef19 /\ arg1 = 2*undef41, {arg1 -> undef17, arg2 -> 0, rest remain the same}>
<l3, l3, 1 <= arg2 /\ 1 + undef42 <= arg2 /\ 1 + undef47 <= arg2 /\ arg1 <= 1 + 2*undef44 /\ undef43 <= arg1 /\ undef44 <= arg1 /\ 2*undef44 <= arg1 /\ arg1 = 2*undef41 /\ arg1 = 2*undef46, {arg1 -> undef44, arg2 -> 1, rest remain the same}>
Variables:
arg1, arg2

Precedence: 
Graph 0

Graph 1
<l0, l5, 1 <= undef54 /\ 0 <= undef50 /\ 0 <= undef51 /\ 2 <= undef55, {arg1 -> -1 + undef51, arg2 -> undef49, rest remain the same}>

Graph 2
<l0, l3, 1 + undef2 <= undef4 /\ 1 <= undef2 /\ 1 <= undef54 /\ 0 <= undef1 /\ 0 <= undef3 /\ 0 <= undef4 /\ 2 <= undef55, {arg1 -> undef1, arg2 -> 0, rest remain the same}>
<l0, l3, 1 + undef2 <= undef4 /\ 1 <= undef54 /\ 0 <= undef1 /\ 0 <= undef3 /\ 0 <= undef4 /\ 2 <= undef55, {arg1 -> undef1, arg2 -> 1, rest remain the same}>
<l0, l3, 1 <= undef54 /\ 0 <= undef5 /\ undef6 <= 0 /\ 0 <= undef7 /\ 2 <= undef55, {arg1 -> undef5, arg2 -> 1, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000650s
Ranking function: -1 + arg1
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.027275
Some transition disabled by a set of invariant(s):
Invariant at l3: arg2 <= 1

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l3, l3, 1 <= arg2 /\ 1 + undef15 <= arg2 /\ 1 + undef47 <= arg2 /\ 1 <= undef15 /\ arg1 <= 1 + 2*undef44 /\ undef16 <= arg1 /\ undef44 <= arg1 /\ 2*undef44 <= arg1 /\ arg1 = 2*undef14 /\ arg1 = 2*undef46, {arg1 -> undef44, arg2 -> 1, 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 <= arg2 /\ 1 + undef15 <= arg2 /\ 1 + undef20 <= arg2 /\ 1 <= undef15 /\ 1 <= undef20 /\ arg1 <= 1 + 2*undef17 /\ undef16 <= arg1 /\ undef17 <= arg1 /\ 2*undef17 <= arg1 /\ arg1 = 2*undef14 /\ arg1 = 2*undef19, {arg1 -> undef17, arg2 -> 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 <= arg2 /\ 1 + undef24 <= arg2 /\ 1 + undef29 <= arg2 /\ 1 <= undef24 /\ 1 <= undef29 /\ arg1 <= 1 + 2*undef26 /\ undef25 <= arg1 /\ undef26 <= arg1 /\ 2*undef26 <= arg1 /\ arg1 = 1 + 2*undef23 /\ arg1 = 1 + 2*undef28, {arg1 -> undef26, arg2 -> 1, 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 <= arg2 /\ 1 + undef24 <= arg2 /\ 1 + undef38 <= arg2 /\ 1 <= undef24 /\ arg1 <= 1 + 2*undef35 /\ undef25 <= arg1 /\ undef35 <= arg1 /\ 2*undef35 <= arg1 /\ arg1 = 1 + 2*undef23 /\ arg1 = 1 + 2*undef37, {arg1 -> undef35, arg2 -> 1, 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 <= arg2 /\ 1 + undef29 <= arg2 /\ 1 + undef33 <= arg2 /\ 1 <= undef29 /\ arg1 <= 1 + 2*undef26 /\ undef26 <= arg1 /\ 2*undef26 <= arg1 /\ undef34 <= arg1 /\ arg1 = 1 + 2*undef28 /\ arg1 = 1 + 2*undef32, {arg1 -> undef26, arg2 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + undef33 <= arg2 /\ 1 + undef38 <= arg2 /\ arg1 <= 1 + 2*undef35 /\ undef34 <= arg1 /\ undef35 <= arg1 /\ 2*undef35 <= arg1 /\ arg1 = 1 + 2*undef32 /\ arg1 = 1 + 2*undef37 /\ arg2 = 1, {arg1 -> undef35, arg2 -> 1, 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 <= arg2 /\ 1 + undef20 <= arg2 /\ 1 + undef42 <= arg2 /\ 1 <= undef20 /\ arg1 <= 1 + 2*undef17 /\ undef17 <= arg1 /\ 2*undef17 <= arg1 /\ undef43 <= arg1 /\ arg1 = 2*undef19 /\ arg1 = 2*undef41, {arg1 -> undef17, arg2 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l3, 1 + undef42 <= arg2 /\ 1 + undef47 <= arg2 /\ arg1 <= 1 + 2*undef44 /\ undef43 <= arg1 /\ undef44 <= arg1 /\ 2*undef44 <= arg1 /\ arg2 = 1 /\ arg1 = 2*undef41 /\ arg1 = 2*undef46, {arg1 -> undef44, arg2 -> 1, rest remain the same}>
Checking unfeasibility...
Time used: 0.00538

Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002259s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009470s
[47212 : 47226]
[47212 : 47227]
Successful child: 47226
[ 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 + undef33 <= arg2 /\ 1 + undef38 <= arg2 /\ arg1 <= 1 + 2*undef35 /\ undef34 <= arg1 /\ undef35 <= arg1 /\ 2*undef35 <= arg1 /\ arg1 = 1 + 2*undef32 /\ arg1 = 1 + 2*undef37 /\ arg2 = 1, {arg1 -> undef35, arg2 -> 1, 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 + undef42 <= arg2 /\ 1 + undef47 <= arg2 /\ arg1 <= 1 + 2*undef44 /\ undef43 <= arg1 /\ undef44 <= arg1 /\ 2*undef44 <= arg1 /\ arg2 = 1 /\ arg1 = 2*undef41 /\ arg1 = 2*undef46, {arg1 -> undef44, arg2 -> 1, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l3, l3, 1 + undef42 <= arg2 /\ 1 + undef47 <= arg2 /\ arg1 <= 1 + 2*undef44 /\ undef43 <= arg1 /\ undef44 <= arg1 /\ 2*undef44 <= arg1 /\ arg2 = 1 /\ arg1 = 2*undef41 /\ arg1 = 2*undef46, {arg1 -> undef44, arg2 -> 1, 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 + undef33 <= arg2 /\ 1 + undef38 <= arg2 /\ arg1 <= 1 + 2*undef35 /\ undef34 <= arg1 /\ undef35 <= arg1 /\ 2*undef35 <= arg1 /\ arg1 = 1 + 2*undef32 /\ arg1 = 1 + 2*undef37 /\ arg2 = 1, {arg1 -> undef35, arg2 -> 1, rest remain the same}>
New Graphs: 
[47212 : 47240]
[47212 : 47241]
INVARIANTS: 
3: 
Quasi-INVARIANTS to narrow Graph: 
3: arg2 <= 0 , 
Narrowing transition: 
<l3, l3, 1 + undef33 <= arg2 /\ 1 + undef38 <= arg2 /\ arg1 <= 1 + 2*undef35 /\ undef34 <= arg1 /\ undef35 <= arg1 /\ 2*undef35 <= arg1 /\ arg1 = 1 + 2*undef32 /\ arg1 = 1 + 2*undef37 /\ arg2 = 1, {arg1 -> undef35, arg2 -> 1, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l3, l3, 1 + undef42 <= arg2 /\ 1 + undef47 <= arg2 /\ arg1 <= 1 + 2*undef44 /\ undef43 <= arg1 /\ undef44 <= arg1 /\ 2*undef44 <= arg1 /\ arg2 = 1 /\ arg1 = 2*undef41 /\ arg1 = 2*undef46, {arg1 -> undef44, arg2 -> 1, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l3, l3, 1 + undef33 <= arg2 /\ 1 + undef38 <= arg2 /\ arg1 <= 1 + 2*undef35 /\ undef34 <= arg1 /\ undef35 <= arg1 /\ 2*undef35 <= arg1 /\ arg1 = 1 + 2*undef32 /\ arg1 = 1 + 2*undef37 /\ arg2 = 1, {arg1 -> undef35, arg2 -> 1, rest remain the same}>
<l3, l3, 1 + undef42 <= arg2 /\ 1 + undef47 <= arg2 /\ arg1 <= 1 + 2*undef44 /\ undef43 <= arg1 /\ undef44 <= arg1 /\ 2*undef44 <= arg1 /\ arg2 = 1 /\ arg1 = 2*undef41 /\ arg1 = 2*undef46, {arg1 -> undef44, arg2 -> 1, rest remain the same}>
Variables:
arg1, arg2
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002165s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010005s
[47212 : 47242]
[47212 : 47243]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016670s
Time used: 0.015404

[47212 : 47320]
[47212 : 47321]
Successful child: 47320

Program does NOT terminate