/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/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, (undef6 > ~(1)) /\ (arg2 > 0) /\ (undef2 <= arg1) /\ (arg1 > 0) /\ (undef1 > 2) /\ (undef2 > 0), par{arg1 -> undef1, arg2 -> undef2, arg3 -> arg2, arg4 -> undef4, arg5 -> undef5}>
<l1, l2, ((undef7 - 1) <= arg1) /\ (arg2 > 0) /\ (undef8 <= arg1) /\ (arg1 > 0) /\ (undef7 > 1) /\ (undef8 > 0), par{arg1 -> undef7, arg2 -> undef8, arg3 -> arg2, arg4 -> undef10, arg5 -> undef11}>
<l2, l3, (arg1 >= undef12) /\ (arg3 > 1) /\ (undef12 <= arg2) /\ (arg1 >= undef13) /\ (arg1 >= (undef14 - 1)) /\ ((undef14 - 1) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef12 > 0) /\ (undef13 > 0) /\ (undef14 > 1) /\ (arg1 >= (undef16 + 2)), par{arg1 -> undef12, arg2 -> undef13, arg3 -> undef14, arg4 -> arg3, arg5 -> undef16}>
<l2, l3, (undef22 > ~(1)) /\ (arg3 > 1) /\ (undef17 <= arg1) /\ (undef17 <= arg2) /\ (undef18 <= arg1) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef17 > 0) /\ (undef18 > 0) /\ (undef19 > 2) /\ ((undef21 + 2) <= arg1), par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> arg3, arg5 -> undef21}>
<l1, l4, (undef23 > ~(1)) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> undef23, arg2 -> undef24, arg3 -> undef25, arg4 -> undef26, arg5 -> undef27}>
<l2, l4, (undef28 > ~(1)) /\ (arg3 > 1) /\ (arg1 > 0) /\ (arg2 > 0), par{arg1 -> undef28, arg2 -> undef29, arg3 -> undef30, arg4 -> undef31, arg5 -> undef32}>
<l4, l4, (arg1 > 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, arg5 -> undef37}>
<l3, l5, (undef38 <= arg2) /\ (arg4 > 1) /\ (undef39 <= arg3) /\ (undef40 <= arg3) /\ ((undef41 + 1) <= arg3) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef38 > 0) /\ (undef39 > 0) /\ (undef40 > 0) /\ (undef41 > ~(1)) /\ ((arg5 + 2) <= arg2), par{arg1 -> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, arg5 -> undef42}>
<l5, l5, (undef43 <= arg1) /\ (undef44 <= arg3) /\ ((undef44 - 2) <= arg4) /\ (undef45 <= arg3) /\ ((undef45 - 2) <= arg4) /\ ((undef46 + 2) <= arg3) /\ (undef46 <= arg4) /\ (arg1 > 0) /\ (arg2 > 1) /\ (arg3 > 2) /\ (arg4 > 0) /\ (undef43 > 0) /\ (undef44 > 2) /\ (undef45 > 2) /\ (undef46 > 0), par{arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, arg5 -> undef47}>
<l5, l5, ((undef48 + 2) <= arg1) /\ ((undef49 + 2) <= arg2) /\ (undef50 <= arg3) /\ ((undef50 - 2) <= arg4) /\ ((undef51 + 2) <= arg3) /\ (undef51 <= arg4) /\ (arg1 > 2) /\ (arg2 > 2) /\ (arg3 > 2) /\ (arg4 > 0) /\ (undef48 > 0) /\ (undef49 > 0) /\ (undef50 > 2) /\ (undef51 > 0), par{arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, arg5 -> undef52}>
<l6, l1, true, par{arg1 -> undef53, arg2 -> undef54, arg3 -> undef55, arg4 -> undef56, arg5 -> undef57}>

Fresh variables:
undef1, undef2, undef4, undef5, undef6, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, 

Undef variables:
undef1, undef2, undef4, undef5, undef6, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l5, (undef6 > ~(1)) /\ (undef54 > 0) /\ (undef2 <= undef53) /\ (undef53 > 0) /\ (undef1 > 2) /\ (undef2 > 0) /\ (undef1 >= undef12) /\ (undef54 > 1) /\ (undef12 <= undef2) /\ (undef1 >= undef13) /\ (undef1 >= (undef14 - 1)) /\ ((undef14 - 1) <= undef2) /\ (undef1 > 0) /\ (undef2 > 0) /\ (undef12 > 0) /\ (undef13 > 0) /\ (undef14 > 1) /\ (undef1 >= (undef16 + 2)) /\ (undef38 <= undef13) /\ (undef54 > 1) /\ (undef39 <= undef14) /\ (undef40 <= undef14) /\ ((undef41 + 1) <= undef14) /\ (undef12 > 0) /\ (undef13 > 0) /\ (undef14 > 0) /\ (undef38 > 0) /\ (undef39 > 0) /\ (undef40 > 0) /\ (undef41 > ~(1)) /\ ((undef16 + 2) <= undef13), par{arg1 -> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41}>
<l0, l5, (undef6 > ~(1)) /\ (undef54 > 0) /\ (undef2 <= undef53) /\ (undef53 > 0) /\ (undef1 > 2) /\ (undef2 > 0) /\ (undef22 > ~(1)) /\ (undef54 > 1) /\ (undef17 <= undef1) /\ (undef17 <= undef2) /\ (undef18 <= undef1) /\ (undef1 > 0) /\ (undef2 > 0) /\ (undef17 > 0) /\ (undef18 > 0) /\ (undef19 > 2) /\ ((undef21 + 2) <= undef1) /\ (undef38 <= undef18) /\ (undef54 > 1) /\ (undef39 <= undef19) /\ (undef40 <= undef19) /\ ((undef41 + 1) <= undef19) /\ (undef17 > 0) /\ (undef18 > 0) /\ (undef19 > 0) /\ (undef38 > 0) /\ (undef39 > 0) /\ (undef40 > 0) /\ (undef41 > ~(1)) /\ ((undef21 + 2) <= undef18), par{arg1 -> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41}>
<l0, l4, (undef6 > ~(1)) /\ (undef54 > 0) /\ (undef2 <= undef53) /\ (undef53 > 0) /\ (undef1 > 2) /\ (undef2 > 0) /\ (undef28 > ~(1)) /\ (undef54 > 1) /\ (undef1 > 0) /\ (undef2 > 0), par{arg1 -> undef28, arg2 -> undef29, arg3 -> undef30, arg4 -> undef31}>
<l0, l5, ((undef7 - 1) <= undef53) /\ (undef54 > 0) /\ (undef8 <= undef53) /\ (undef53 > 0) /\ (undef7 > 1) /\ (undef8 > 0) /\ (undef7 >= undef12) /\ (undef54 > 1) /\ (undef12 <= undef8) /\ (undef7 >= undef13) /\ (undef7 >= (undef14 - 1)) /\ ((undef14 - 1) <= undef8) /\ (undef7 > 0) /\ (undef8 > 0) /\ (undef12 > 0) /\ (undef13 > 0) /\ (undef14 > 1) /\ (undef7 >= (undef16 + 2)) /\ (undef38 <= undef13) /\ (undef54 > 1) /\ (undef39 <= undef14) /\ (undef40 <= undef14) /\ ((undef41 + 1) <= undef14) /\ (undef12 > 0) /\ (undef13 > 0) /\ (undef14 > 0) /\ (undef38 > 0) /\ (undef39 > 0) /\ (undef40 > 0) /\ (undef41 > ~(1)) /\ ((undef16 + 2) <= undef13), par{arg1 -> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41}>
<l0, l5, ((undef7 - 1) <= undef53) /\ (undef54 > 0) /\ (undef8 <= undef53) /\ (undef53 > 0) /\ (undef7 > 1) /\ (undef8 > 0) /\ (undef22 > ~(1)) /\ (undef54 > 1) /\ (undef17 <= undef7) /\ (undef17 <= undef8) /\ (undef18 <= undef7) /\ (undef7 > 0) /\ (undef8 > 0) /\ (undef17 > 0) /\ (undef18 > 0) /\ (undef19 > 2) /\ ((undef21 + 2) <= undef7) /\ (undef38 <= undef18) /\ (undef54 > 1) /\ (undef39 <= undef19) /\ (undef40 <= undef19) /\ ((undef41 + 1) <= undef19) /\ (undef17 > 0) /\ (undef18 > 0) /\ (undef19 > 0) /\ (undef38 > 0) /\ (undef39 > 0) /\ (undef40 > 0) /\ (undef41 > ~(1)) /\ ((undef21 + 2) <= undef18), par{arg1 -> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41}>
<l0, l4, ((undef7 - 1) <= undef53) /\ (undef54 > 0) /\ (undef8 <= undef53) /\ (undef53 > 0) /\ (undef7 > 1) /\ (undef8 > 0) /\ (undef28 > ~(1)) /\ (undef54 > 1) /\ (undef7 > 0) /\ (undef8 > 0), par{arg1 -> undef28, arg2 -> undef29, arg3 -> undef30, arg4 -> undef31}>
<l0, l4, (undef23 > ~(1)) /\ (undef54 > 0) /\ (undef53 > 0), par{arg1 -> undef23, arg2 -> undef24, arg3 -> undef25, arg4 -> undef26}>
<l4, l4, (arg1 > 0) /\ ((arg1 - 1) < arg1), par{arg1 -> (arg1 - 1), arg2 -> undef34, arg3 -> undef35, arg4 -> undef36}>
<l5, l5, (undef43 <= arg1) /\ (undef44 <= arg3) /\ ((undef44 - 2) <= arg4) /\ (undef45 <= arg3) /\ ((undef45 - 2) <= arg4) /\ ((undef46 + 2) <= arg3) /\ (undef46 <= arg4) /\ (arg1 > 0) /\ (arg2 > 1) /\ (arg3 > 2) /\ (arg4 > 0) /\ (undef43 > 0) /\ (undef44 > 2) /\ (undef45 > 2) /\ (undef46 > 0), par{arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46}>
<l5, l5, ((undef48 + 2) <= arg1) /\ ((undef49 + 2) <= arg2) /\ (undef50 <= arg3) /\ ((undef50 - 2) <= arg4) /\ ((undef51 + 2) <= arg3) /\ (undef51 <= arg4) /\ (arg1 > 2) /\ (arg2 > 2) /\ (arg3 > 2) /\ (arg4 > 0) /\ (undef48 > 0) /\ (undef49 > 0) /\ (undef50 > 2) /\ (undef51 > 0), par{arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51}>

Fresh variables:
undef1, undef2, undef4, undef5, undef6, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, 

Undef variables:
undef1, undef2, undef4, undef5, undef6, undef7, undef8, undef10, undef11, undef12, undef13, undef14, undef16, undef17, undef18, undef19, undef21, undef22, undef23, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef42, undef43, undef44, undef45, undef46, undef47, undef48, undef49, undef50, undef51, undef52, undef53, undef54, undef55, undef56, undef57, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l4, l4, 1 <= arg1, {arg1 -> -1 + arg1, arg2 -> undef34, arg3 -> undef35, arg4 -> undef36, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4

Graph 2:
Transitions:
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>
<l5, l5, 1 <= arg4 /\ 1 <= undef48 /\ 1 <= undef49 /\ 1 <= undef51 /\ undef50 <= arg3 /\ undef51 <= arg4 /\ 2 + undef48 <= arg1 /\ 2 + undef49 <= arg2 /\ 2 + undef51 <= arg3 /\ undef50 <= 2 + arg4 /\ 3 <= arg1 /\ 3 <= arg2 /\ 3 <= arg3 /\ 3 <= undef50, {arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4

Precedence: 
Graph 0

Graph 1
<l0, l4, 1 <= undef2 /\ 1 <= undef53 /\ undef2 <= undef53 /\ 0 <= undef6 /\ 0 <= undef28 /\ 2 <= undef54 /\ 3 <= undef1, {arg1 -> undef28, arg2 -> undef29, arg3 -> undef30, arg4 -> undef31, rest remain the same}>
<l0, l4, 1 <= undef8 /\ 1 <= undef53 /\ undef7 <= 1 + undef53 /\ undef8 <= undef53 /\ 0 <= undef28 /\ 2 <= undef7 /\ 2 <= undef54, {arg1 -> undef28, arg2 -> undef29, arg3 -> undef30, arg4 -> undef31, rest remain the same}>
<l0, l4, 1 <= undef53 /\ 1 <= undef54 /\ 0 <= undef23, {arg1 -> undef23, arg2 -> undef24, arg3 -> undef25, arg4 -> undef26, rest remain the same}>

Graph 2
<l0, l5, 1 <= undef2 /\ 1 <= undef12 /\ 1 <= undef13 /\ 1 + undef41 <= undef14 /\ 1 <= undef38 /\ 1 <= undef39 /\ 1 <= undef40 /\ 1 <= undef53 /\ undef14 <= 1 + undef1 /\ undef14 <= 1 + undef2 /\ undef12 <= undef1 /\ undef13 <= undef1 /\ undef2 <= undef53 /\ undef12 <= undef2 /\ 0 <= undef6 /\ undef38 <= undef13 /\ undef39 <= undef14 /\ undef40 <= undef14 /\ 0 <= undef41 /\ 2 + undef16 <= undef1 /\ 2 + undef16 <= undef13 /\ 2 <= undef14 /\ 2 <= undef54 /\ 3 <= undef1, {arg1 -> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}>
<l0, l5, 1 <= undef2 /\ 1 <= undef17 /\ 1 <= undef18 /\ 1 + undef41 <= undef19 /\ 1 <= undef38 /\ 1 <= undef39 /\ 1 <= undef40 /\ 1 <= undef53 /\ undef17 <= undef1 /\ undef18 <= undef1 /\ undef2 <= undef53 /\ undef17 <= undef2 /\ 0 <= undef6 /\ undef38 <= undef18 /\ undef39 <= undef19 /\ undef40 <= undef19 /\ 0 <= undef22 /\ 0 <= undef41 /\ 2 + undef21 <= undef1 /\ 2 + undef21 <= undef18 /\ 2 <= undef54 /\ 3 <= undef1 /\ 3 <= undef19, {arg1 -> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}>
<l0, l5, 1 <= undef8 /\ 1 <= undef12 /\ 1 <= undef13 /\ 1 + undef41 <= undef14 /\ 1 <= undef38 /\ 1 <= undef39 /\ 1 <= undef40 /\ 1 <= undef53 /\ undef7 <= 1 + undef53 /\ undef14 <= 1 + undef7 /\ undef14 <= 1 + undef8 /\ undef12 <= undef7 /\ undef13 <= undef7 /\ undef8 <= undef53 /\ undef12 <= undef8 /\ undef38 <= undef13 /\ undef39 <= undef14 /\ undef40 <= undef14 /\ 0 <= undef41 /\ 2 <= undef7 /\ 2 + undef16 <= undef7 /\ 2 + undef16 <= undef13 /\ 2 <= undef14 /\ 2 <= undef54, {arg1 -> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest remain the same}>
<l0, l5, 1 <= undef8 /\ 1 <= undef17 /\ 1 <= undef18 /\ 1 + undef41 <= undef19 /\ 1 <= undef38 /\ 1 <= undef39 /\ 1 <= undef40 /\ 1 <= undef53 /\ undef7 <= 1 + undef53 /\ undef17 <= undef7 /\ undef18 <= undef7 /\ undef8 <= undef53 /\ undef17 <= undef8 /\ undef38 <= undef18 /\ undef39 <= undef19 /\ undef40 <= undef19 /\ 0 <= undef22 /\ 0 <= undef41 /\ 2 <= undef7 /\ 2 + undef21 <= undef7 /\ 2 + undef21 <= undef18 /\ 2 <= undef54 /\ 3 <= undef19, {arg1 -> undef38, arg2 -> undef39, arg3 -> undef40, arg4 -> undef41, rest 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.003704

Checking conditional termination of SCC {l4}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000837s
Ranking function: -1 + arg1
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.018206

Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005463s
Ranking function: -24 + 8*arg1
New Graphs: 
Transitions:
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001772s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.009876s
[53457 : 53458]
[53457 : 53459]
Successful child: 53458
[ 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: 
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l5, l5, 1 <= arg4 /\ 1 <= undef48 /\ 1 <= undef49 /\ 1 <= undef51 /\ undef50 <= arg3 /\ undef51 <= arg4 /\ 2 + undef48 <= arg1 /\ 2 + undef49 <= arg2 /\ 2 + undef51 <= arg3 /\ undef50 <= 2 + arg4 /\ 3 <= arg1 /\ 3 <= arg2 /\ 3 <= arg3 /\ 3 <= undef50, {arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, 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: 
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>
New Graphs: 
[53457 : 53463]
[53457 : 53464]
[53457 : 53465]
[53457 : 53466]
INVARIANTS: 
5: 
Quasi-INVARIANTS to narrow Graph: 
5: arg4 <= 0 , 
Narrowing transition: 
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, 1 <= arg4 /\ 1 <= undef48 /\ 1 <= undef49 /\ 1 <= undef51 /\ undef50 <= arg3 /\ undef51 <= arg4 /\ 2 + undef48 <= arg1 /\ 2 + undef49 <= arg2 /\ 2 + undef51 <= arg3 /\ undef50 <= 2 + arg4 /\ 3 <= arg1 /\ 3 <= arg2 /\ 3 <= arg3 /\ 3 <= undef50, {arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>
<l5, l5, 1 <= arg4 /\ 1 <= undef48 /\ 1 <= undef49 /\ 1 <= undef51 /\ undef50 <= arg3 /\ undef51 <= arg4 /\ 2 + undef48 <= arg1 /\ 2 + undef49 <= arg2 /\ 2 + undef51 <= arg3 /\ undef50 <= 2 + arg4 /\ 3 <= arg1 /\ 3 <= arg2 /\ 3 <= arg3 /\ 3 <= undef50, {arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005542s
Ranking function: -24 + 8*arg1
New Graphs: 
Transitions:
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001781s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010444s
[53457 : 53467]
[53457 : 53468]
Successful child: 53467
[ 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: 
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l5, l5, 1 <= arg4 /\ 1 <= undef48 /\ 1 <= undef49 /\ 1 <= undef51 /\ undef50 <= arg3 /\ undef51 <= arg4 /\ 2 + undef48 <= arg1 /\ 2 + undef49 <= arg2 /\ 2 + undef51 <= arg3 /\ undef50 <= 2 + arg4 /\ 3 <= arg1 /\ 3 <= arg2 /\ 3 <= arg3 /\ 3 <= undef50, {arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>
New Graphs: 
[53457 : 53472]
[53457 : 53473]
[53457 : 53474]
[53457 : 53475]
INVARIANTS: 
5: 
Quasi-INVARIANTS to narrow Graph: 
5: arg3 <= 1 , 
Narrowing transition: 
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, 1 <= arg4 /\ 1 <= undef48 /\ 1 <= undef49 /\ 1 <= undef51 /\ undef50 <= arg3 /\ undef51 <= arg4 /\ 2 + undef48 <= arg1 /\ 2 + undef49 <= arg2 /\ 2 + undef51 <= arg3 /\ undef50 <= 2 + arg4 /\ 3 <= arg1 /\ 3 <= arg2 /\ 3 <= arg3 /\ 3 <= undef50, {arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>
<l5, l5, 1 <= arg4 /\ 1 <= undef48 /\ 1 <= undef49 /\ 1 <= undef51 /\ undef50 <= arg3 /\ undef51 <= arg4 /\ 2 + undef48 <= arg1 /\ 2 + undef49 <= arg2 /\ 2 + undef51 <= arg3 /\ undef50 <= 2 + arg4 /\ 3 <= arg1 /\ 3 <= arg2 /\ 3 <= arg3 /\ 3 <= undef50, {arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005495s
Ranking function: -24 + 8*arg1
New Graphs: 
Transitions:
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001784s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010464s
[53457 : 53476]
[53457 : 53477]
Successful child: 53476
[ 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: 
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l5, l5, 1 <= arg4 /\ 1 <= undef48 /\ 1 <= undef49 /\ 1 <= undef51 /\ undef50 <= arg3 /\ undef51 <= arg4 /\ 2 + undef48 <= arg1 /\ 2 + undef49 <= arg2 /\ 2 + undef51 <= arg3 /\ undef50 <= 2 + arg4 /\ 3 <= arg1 /\ 3 <= arg2 /\ 3 <= arg3 /\ 3 <= undef50, {arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>
New Graphs: 
[53457 : 53481]
[53457 : 53482]
[53457 : 53483]
[53457 : 53484]
INVARIANTS: 
5: 
Quasi-INVARIANTS to narrow Graph: 
5: arg2 <= 1 , 
Narrowing transition: 
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, 1 <= arg4 /\ 1 <= undef48 /\ 1 <= undef49 /\ 1 <= undef51 /\ undef50 <= arg3 /\ undef51 <= arg4 /\ 2 + undef48 <= arg1 /\ 2 + undef49 <= arg2 /\ 2 + undef51 <= arg3 /\ undef50 <= 2 + arg4 /\ 3 <= arg1 /\ 3 <= arg2 /\ 3 <= arg3 /\ 3 <= undef50, {arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>
<l5, l5, 1 <= arg4 /\ 1 <= undef48 /\ 1 <= undef49 /\ 1 <= undef51 /\ undef50 <= arg3 /\ undef51 <= arg4 /\ 2 + undef48 <= arg1 /\ 2 + undef49 <= arg2 /\ 2 + undef51 <= arg3 /\ undef50 <= 2 + arg4 /\ 3 <= arg1 /\ 3 <= arg2 /\ 3 <= arg3 /\ 3 <= undef50, {arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005536s
Ranking function: -24 + 8*arg1
New Graphs: 
Transitions:
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001812s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010464s
[53457 : 53485]
[53457 : 53486]
Successful child: 53485
[ 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: 
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l5, l5, 1 <= arg4 /\ 1 <= undef48 /\ 1 <= undef49 /\ 1 <= undef51 /\ undef50 <= arg3 /\ undef51 <= arg4 /\ 2 + undef48 <= arg1 /\ 2 + undef49 <= arg2 /\ 2 + undef51 <= arg3 /\ undef50 <= 2 + arg4 /\ 3 <= arg1 /\ 3 <= arg2 /\ 3 <= arg3 /\ 3 <= undef50, {arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>
New Graphs: 
[53457 : 53490]
[53457 : 53491]
[53457 : 53492]
[53457 : 53493]
INVARIANTS: 
5: 
Quasi-INVARIANTS to narrow Graph: 
5: arg3 <= 2 , 
Narrowing transition: 
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>

LOG: Narrow transition size 1
Narrowing transition: 
<l5, l5, 1 <= arg4 /\ 1 <= undef48 /\ 1 <= undef49 /\ 1 <= undef51 /\ undef50 <= arg3 /\ undef51 <= arg4 /\ 2 + undef48 <= arg1 /\ 2 + undef49 <= arg2 /\ 2 + undef51 <= arg3 /\ undef50 <= 2 + arg4 /\ 3 <= arg1 /\ 3 <= arg2 /\ 3 <= arg3 /\ 3 <= undef50, {arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>
<l5, l5, 1 <= arg4 /\ 1 <= undef48 /\ 1 <= undef49 /\ 1 <= undef51 /\ undef50 <= arg3 /\ undef51 <= arg4 /\ 2 + undef48 <= arg1 /\ 2 + undef49 <= arg2 /\ 2 + undef51 <= arg3 /\ undef50 <= 2 + arg4 /\ 3 <= arg1 /\ 3 <= arg2 /\ 3 <= arg3 /\ 3 <= undef50, {arg1 -> undef48, arg2 -> undef49, arg3 -> undef50, arg4 -> undef51, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005537s
Ranking function: -24 + 8*arg1
New Graphs: 
Transitions:
<l5, l5, 1 <= arg1 /\ 1 <= arg4 /\ 1 <= undef43 /\ 1 <= undef46 /\ undef43 <= arg1 /\ undef44 <= arg3 /\ undef45 <= arg3 /\ undef46 <= arg4 /\ 2 <= arg2 /\ 2 + undef46 <= arg3 /\ undef44 <= 2 + arg4 /\ undef45 <= 2 + arg4 /\ 3 <= arg3 /\ 3 <= undef44 /\ 3 <= undef45, {arg1 -> undef43, arg2 -> undef44, arg3 -> undef45, arg4 -> undef46, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001806s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010479s
[53457 : 53494]
[53457 : 53495]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.029481s
Time used: 0.028319

[53457 : 53499]
[53457 : 53500]
Successful child: 53500

Program does NOT terminate