NO

Solver Timeout: 4
Global Timeout: 300
No parsing errors!
Init Location: 0
Transitions:
<l0, l12, true>
<l1, l2, (undef1 <= arg1) /\ (arg1 > 0) /\ (undef1 > 0), par{arg1 -> undef1, arg3 -> undef3, arg4 -> undef4}>
<l3, l2, (undef5 <= arg1) /\ (arg1 > 0) /\ (undef5 > 0), par{arg1 -> undef5, arg2 -> undef6, arg3 -> undef7, arg4 -> undef8}>
<l3, l4, (arg1 >= undef9) /\ (arg1 > 0) /\ (undef9 > 0) /\ (undef10 > 0), par{arg1 -> undef9, arg2 -> undef10, arg3 -> undef11, arg4 -> undef12}>
<l5, l4, (undef13 <= arg1) /\ ((undef13 + 1) <= arg2) /\ (undef14 <= arg2) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef13 > 0) /\ (undef14 > 1) /\ ((arg4 + 2) <= arg2), par{arg1 -> undef13, arg2 -> undef14}>
<l2, l6, (undef17 <= arg1) /\ (arg2 > 0) /\ (arg1 > 0) /\ (undef17 > 0) /\ (undef18 > 0), par{arg1 -> undef17, arg2 -> undef18, arg3 -> undef19, arg4 -> undef20}>
<l7, l6, (undef21 <= arg1) /\ ((undef21 + 1) <= arg2) /\ (undef22 <= arg2) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef21 > 0) /\ (undef22 > 1) /\ ((arg3 + 2) <= arg2), par{arg1 -> undef21, arg2 -> undef22, arg4 -> undef24}>
<l3, l8, (arg1 > 0) /\ (arg2 > ~(1)), par{arg1 -> undef25, arg2 -> undef26, arg3 -> undef27, arg4 -> undef28}>
<l2, l8, (undef33 > ~(1)) /\ (arg2 > 0) /\ (arg1 > 0), par{arg1 -> undef29, arg2 -> undef30, arg3 -> undef31, arg4 -> undef32}>
<l4, l8, (arg1 > 0) /\ (undef38 > ~(1)) /\ (arg2 > 0) /\ ((arg4 + 2) <= arg2), par{arg1 -> undef34, arg2 -> undef35, arg3 -> undef36, arg4 -> undef37}>
<l8, l9, (undef41 > 0) /\ (undef43 > ~(1)) /\ (undef40 > 1) /\ (undef39 > 1), par{arg1 -> undef39, arg2 -> undef40, arg3 -> undef41, arg4 -> (undef43 + 1)}>
<l9, l9, (arg4 > ~(1)) /\ (arg3 > 0) /\ (undef44 <= arg1) /\ ((undef45 + 2) <= arg2) /\ (arg1 > 0) /\ (arg2 > 2) /\ (undef44 > 0) /\ (undef45 > 0), par{arg1 -> undef44, arg2 -> undef45, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg3 > 0) /\ (undef52 > 0) /\ (arg4 > ~(1)) /\ (undef48 <= arg1) /\ ((undef49 + 2) <= arg2) /\ (arg1 > 0) /\ (arg2 > 2) /\ (undef48 > 0) /\ (undef49 > 0), par{arg1 -> undef48, arg2 -> undef49, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg3 > 0) /\ (undef57 > 0) /\ (arg4 > ~(1)) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef53 > 0) /\ (undef54 > 0), par{arg1 -> undef53, arg2 -> undef54, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg4 > ~(1)) /\ (arg3 > 0) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef58 > 0) /\ (undef59 > 0), par{arg1 -> undef58, arg2 -> undef59, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg4 > ~(1)) /\ (arg3 > 0) /\ ((undef62 - 2) <= arg1) /\ ((undef62 - 2) <= arg2) /\ ((undef63 - 2) <= arg1) /\ ((undef63 - 2) <= arg2) /\ (arg1 > 1) /\ (arg2 > 1) /\ (undef62 > 3) /\ (undef63 > 3), par{arg1 -> undef62, arg2 -> undef63, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg3 > 0) /\ (undef70 > 0) /\ (arg4 > ~(1)) /\ ((undef66 - 2) <= arg1) /\ ((undef66 - 2) <= arg2) /\ ((undef67 - 2) <= arg1) /\ ((undef67 - 2) <= arg2) /\ (arg1 > 1) /\ (arg2 > 1) /\ (undef66 > 3) /\ (undef67 > 3), par{arg1 -> undef66, arg2 -> undef67, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l2, l10, (undef75 > 0) /\ (arg2 > 0) /\ ((undef71 + 1) <= arg1) /\ ((undef72 + 1) <= arg1) /\ ((undef73 + 1) <= arg1) /\ (arg1 > 0) /\ (undef71 > ~(1)) /\ (undef72 > ~(1)) /\ (undef73 > ~(1)), par{arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74}>
<l6, l10, ((undef76 + 1) <= arg1) /\ ((undef76 + 1) <= arg2) /\ (undef77 <= arg2) /\ ((undef78 + 1) <= arg1) /\ ((undef78 + 1) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef76 > ~(1)) /\ (undef77 > 0) /\ (undef78 > ~(1)) /\ ((arg3 + 2) <= arg2), par{arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79}>
<l4, l10, (undef80 <= arg2) /\ (undef84 > 0) /\ ((undef81 + 1) <= arg1) /\ ((undef81 + 1) <= arg2) /\ (undef82 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef80 > 0) /\ (undef81 > ~(1)) /\ (undef82 > 0) /\ ((arg4 + 2) <= arg2), par{arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83}>
<l4, l10, (undef85 <= arg2) /\ (undef87 <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (undef85 > 0) /\ (undef86 > 0) /\ (undef87 > 0) /\ ((arg4 + 2) <= arg2), par{arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88}>
<l10, l10, (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef89 > ~(1)) /\ (undef90 > ~(1)) /\ (undef91 > ~(1)), par{arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92}>
<l10, l11, (undef93 <= arg1) /\ (undef93 <= arg3) /\ (undef94 <= arg1) /\ (undef94 <= arg3) /\ ((undef95 + 1) <= arg1) /\ ((undef95 + 1) <= arg3) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef93 > 0) /\ (undef94 > 0) /\ (undef95 > ~(1)), par{arg1 -> undef93, arg2 -> undef94, arg3 -> undef95, arg4 -> undef96}>
<l10, l11, (undef97 <= arg2) /\ (undef98 <= arg2) /\ ((undef99 + 1) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef97 > 0) /\ (undef98 > 0) /\ (undef99 > ~(1)), par{arg1 -> undef97, arg2 -> undef98, arg3 -> undef99, arg4 -> undef100}>
<l11, l11, (undef101 <= arg1) /\ ((undef102 - 2) <= arg2) /\ ((undef103 + 3) <= arg2) /\ ((undef103 + 1) <= arg3) /\ (arg1 > 0) /\ (arg2 > 2) /\ (arg3 > 0) /\ (undef101 > 0) /\ (undef102 > 2) /\ (undef103 > ~(1)), par{arg1 -> undef101, arg2 -> undef102, arg3 -> undef103, arg4 -> undef104}>
<l12, l3, true, par{arg1 -> undef105, arg2 -> undef106, arg3 -> undef107, arg4 -> undef108}>

Fresh variables:
undef1, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef17, undef18, undef19, undef20, undef21, undef22, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef43, undef44, undef45, undef48, undef49, undef52, undef53, undef54, undef57, undef58, undef59, undef62, undef63, undef66, undef67, undef70, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, undef79, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef87, undef88, undef89, undef90, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, undef100, undef101, undef102, undef103, undef104, undef105, undef106, undef107, undef108, 

Undef variables:
undef1, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef17, undef18, undef19, undef20, undef21, undef22, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef43, undef44, undef45, undef48, undef49, undef52, undef53, undef54, undef57, undef58, undef59, undef62, undef63, undef66, undef67, undef70, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, undef79, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef87, undef88, undef89, undef90, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, undef100, undef101, undef102, undef103, undef104, undef105, undef106, undef107, undef108, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l10, (undef5 <= undef105) /\ (undef105 > 0) /\ (undef5 > 0) /\ (undef17 <= undef5) /\ (undef6 > 0) /\ (undef5 > 0) /\ (undef17 > 0) /\ (undef18 > 0) /\ ((undef76 + 1) <= undef17) /\ ((undef76 + 1) <= undef18) /\ (undef77 <= undef18) /\ ((undef78 + 1) <= undef17) /\ ((undef78 + 1) <= undef18) /\ (undef17 > 0) /\ (undef18 > 0) /\ (undef76 > ~(1)) /\ (undef77 > 0) /\ (undef78 > ~(1)) /\ ((undef19 + 2) <= undef18), par{arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79}>
<l0, l9, (undef5 <= undef105) /\ (undef105 > 0) /\ (undef5 > 0) /\ (undef33 > ~(1)) /\ (undef6 > 0) /\ (undef5 > 0) /\ (undef41 > 0) /\ (undef43 > ~(1)) /\ (undef40 > 1) /\ (undef39 > 1), par{arg1 -> undef39, arg2 -> undef40, arg3 -> undef41, arg4 -> (undef43 + 1)}>
<l0, l10, (undef5 <= undef105) /\ (undef105 > 0) /\ (undef5 > 0) /\ (undef75 > 0) /\ (undef6 > 0) /\ ((undef71 + 1) <= undef5) /\ ((undef72 + 1) <= undef5) /\ ((undef73 + 1) <= undef5) /\ (undef5 > 0) /\ (undef71 > ~(1)) /\ (undef72 > ~(1)) /\ (undef73 > ~(1)), par{arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74}>
<l0, l9, (undef105 >= undef9) /\ (undef105 > 0) /\ (undef9 > 0) /\ (undef10 > 0) /\ (undef9 > 0) /\ (undef38 > ~(1)) /\ (undef10 > 0) /\ ((undef12 + 2) <= undef10) /\ (undef41 > 0) /\ (undef43 > ~(1)) /\ (undef40 > 1) /\ (undef39 > 1), par{arg1 -> undef39, arg2 -> undef40, arg3 -> undef41, arg4 -> (undef43 + 1)}>
<l0, l10, (undef105 >= undef9) /\ (undef105 > 0) /\ (undef9 > 0) /\ (undef10 > 0) /\ (undef80 <= undef10) /\ (undef84 > 0) /\ ((undef81 + 1) <= undef9) /\ ((undef81 + 1) <= undef10) /\ (undef82 <= undef10) /\ (undef9 > 0) /\ (undef10 > 0) /\ (undef80 > 0) /\ (undef81 > ~(1)) /\ (undef82 > 0) /\ ((undef12 + 2) <= undef10), par{arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83}>
<l0, l10, (undef105 >= undef9) /\ (undef105 > 0) /\ (undef9 > 0) /\ (undef10 > 0) /\ (undef85 <= undef10) /\ (undef87 <= undef10) /\ (undef9 > 0) /\ (undef10 > 0) /\ (undef85 > 0) /\ (undef86 > 0) /\ (undef87 > 0) /\ ((undef12 + 2) <= undef10), par{arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88}>
<l0, l9, (undef105 > 0) /\ (undef106 > ~(1)) /\ (undef41 > 0) /\ (undef43 > ~(1)) /\ (undef40 > 1) /\ (undef39 > 1), par{arg1 -> undef39, arg2 -> undef40, arg3 -> undef41, arg4 -> (undef43 + 1)}>
<l9, l9, (arg4 > ~(1)) /\ (arg3 > 0) /\ (undef44 <= arg1) /\ ((undef45 + 2) <= arg2) /\ (arg1 > 0) /\ (arg2 > 2) /\ (undef44 > 0) /\ (undef45 > 0), par{arg1 -> undef44, arg2 -> undef45, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg3 > 0) /\ (undef52 > 0) /\ (arg4 > ~(1)) /\ (undef48 <= arg1) /\ ((undef49 + 2) <= arg2) /\ (arg1 > 0) /\ (arg2 > 2) /\ (undef48 > 0) /\ (undef49 > 0), par{arg1 -> undef48, arg2 -> undef49, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg3 > 0) /\ (undef57 > 0) /\ (arg4 > ~(1)) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef53 > 0) /\ (undef54 > 0), par{arg1 -> undef53, arg2 -> undef54, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg4 > ~(1)) /\ (arg3 > 0) /\ (arg1 > 0) /\ (arg2 > 1) /\ (undef58 > 0) /\ (undef59 > 0), par{arg1 -> undef58, arg2 -> undef59, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg4 > ~(1)) /\ (arg3 > 0) /\ ((undef62 - 2) <= arg1) /\ ((undef62 - 2) <= arg2) /\ ((undef63 - 2) <= arg1) /\ ((undef63 - 2) <= arg2) /\ (arg1 > 1) /\ (arg2 > 1) /\ (undef62 > 3) /\ (undef63 > 3), par{arg1 -> undef62, arg2 -> undef63, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l9, l9, (arg3 > 0) /\ (undef70 > 0) /\ (arg4 > ~(1)) /\ ((undef66 - 2) <= arg1) /\ ((undef66 - 2) <= arg2) /\ ((undef67 - 2) <= arg1) /\ ((undef67 - 2) <= arg2) /\ (arg1 > 1) /\ (arg2 > 1) /\ (undef66 > 3) /\ (undef67 > 3), par{arg1 -> undef66, arg2 -> undef67, arg3 -> (arg3 - 1), arg4 -> (arg4 + 1)}>
<l10, l10, (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef89 > ~(1)) /\ (undef90 > ~(1)) /\ (undef91 > ~(1)), par{arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92}>
<l10, l11, (undef93 <= arg1) /\ (undef93 <= arg3) /\ (undef94 <= arg1) /\ (undef94 <= arg3) /\ ((undef95 + 1) <= arg1) /\ ((undef95 + 1) <= arg3) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef93 > 0) /\ (undef94 > 0) /\ (undef95 > ~(1)), par{arg1 -> undef93, arg2 -> undef94, arg3 -> undef95, arg4 -> undef96}>
<l10, l11, (undef97 <= arg2) /\ (undef98 <= arg2) /\ ((undef99 + 1) <= arg2) /\ (arg1 > 0) /\ (arg2 > 0) /\ (arg3 > 0) /\ (undef97 > 0) /\ (undef98 > 0) /\ (undef99 > ~(1)), par{arg1 -> undef97, arg2 -> undef98, arg3 -> undef99, arg4 -> undef100}>
<l11, l11, (undef101 <= arg1) /\ ((undef102 - 2) <= arg2) /\ ((undef103 + 3) <= arg2) /\ ((undef103 + 1) <= arg3) /\ (arg1 > 0) /\ (arg2 > 2) /\ (arg3 > 0) /\ (undef101 > 0) /\ (undef102 > 2) /\ (undef103 > ~(1)), par{arg1 -> undef101, arg2 -> undef102, arg3 -> undef103, arg4 -> undef104}>

Fresh variables:
undef1, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef17, undef18, undef19, undef20, undef21, undef22, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef43, undef44, undef45, undef48, undef49, undef52, undef53, undef54, undef57, undef58, undef59, undef62, undef63, undef66, undef67, undef70, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, undef79, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef87, undef88, undef89, undef90, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, undef100, undef101, undef102, undef103, undef104, undef105, undef106, undef107, undef108, 

Undef variables:
undef1, undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef13, undef14, undef17, undef18, undef19, undef20, undef21, undef22, undef24, undef25, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef38, undef39, undef40, undef41, undef43, undef44, undef45, undef48, undef49, undef52, undef53, undef54, undef57, undef58, undef59, undef62, undef63, undef66, undef67, undef70, undef71, undef72, undef73, undef74, undef75, undef76, undef77, undef78, undef79, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef87, undef88, undef89, undef90, undef91, undef92, undef93, undef94, undef95, undef96, undef97, undef98, undef99, undef100, undef101, undef102, undef103, undef104, undef105, undef106, undef107, undef108, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l9, l9, undef44 <= arg1 /\ 0 <= arg4 /\ 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef44 /\ 1 <= undef45 /\ 2 + undef45 <= arg2 /\ 3 <= arg2, {arg1 -> undef44, arg2 -> undef45, arg3 -> -1 + arg3, arg4 -> 1 + arg4, rest remain the same}>
<l9, l9, undef48 <= arg1 /\ 0 <= arg4 /\ 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef48 /\ 1 <= undef49 /\ 1 <= undef52 /\ 2 + undef49 <= arg2 /\ 3 <= arg2, {arg1 -> undef48, arg2 -> undef49, arg3 -> -1 + arg3, arg4 -> 1 + arg4, rest remain the same}>
<l9, l9, 0 <= arg4 /\ 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef53 /\ 1 <= undef54 /\ 1 <= undef57 /\ 2 <= arg2, {arg1 -> undef53, arg2 -> undef54, arg3 -> -1 + arg3, arg4 -> 1 + arg4, rest remain the same}>
<l9, l9, 0 <= arg4 /\ 1 <= arg1 /\ 1 <= arg3 /\ 1 <= undef58 /\ 1 <= undef59 /\ 2 <= arg2, {arg1 -> undef58, arg2 -> undef59, arg3 -> -1 + arg3, arg4 -> 1 + arg4, rest remain the same}>
<l9, l9, 0 <= arg4 /\ 1 <= arg3 /\ 2 <= arg1 /\ 2 <= arg2 /\ undef62 <= 2 + arg1 /\ undef63 <= 2 + arg1 /\ undef62 <= 2 + arg2 /\ undef63 <= 2 + arg2 /\ 4 <= undef62 /\ 4 <= undef63, {arg1 -> undef62, arg2 -> undef63, arg3 -> -1 + arg3, arg4 -> 1 + arg4, rest remain the same}>
<l9, l9, 0 <= arg4 /\ 1 <= arg3 /\ 1 <= undef70 /\ 2 <= arg1 /\ 2 <= arg2 /\ undef66 <= 2 + arg1 /\ undef67 <= 2 + arg1 /\ undef66 <= 2 + arg2 /\ undef67 <= 2 + arg2 /\ 4 <= undef66 /\ 4 <= undef67, {arg1 -> undef66, arg2 -> undef67, arg3 -> -1 + arg3, arg4 -> 1 + arg4, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4

Graph 2:
Transitions:
<l10, l10, 0 <= undef89 /\ 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4

Graph 3:
Transitions:
<l11, l11, undef101 <= arg1 /\ 0 <= undef103 /\ 1 <= arg1 /\ 1 <= arg3 /\ 1 + undef103 <= arg3 /\ 1 <= undef101 /\ 3 <= arg2 /\ 3 + undef103 <= arg2 /\ 3 <= undef102 /\ undef102 <= 2 + arg2, {arg1 -> undef101, arg2 -> undef102, arg3 -> undef103, arg4 -> undef104, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4

Precedence: 
Graph 0

Graph 1
<l0, l9, undef5 <= undef105 /\ 0 <= undef33 /\ 0 <= undef43 /\ 1 <= undef5 /\ 1 <= undef6 /\ 1 <= undef41 /\ 1 <= undef105 /\ 2 <= undef39 /\ 2 <= undef40, {arg1 -> undef39, arg2 -> undef40, arg3 -> undef41, arg4 -> 1 + undef43, rest remain the same}>
<l0, l9, undef9 <= undef105 /\ 0 <= undef38 /\ 0 <= undef43 /\ 1 <= undef9 /\ 1 <= undef10 /\ 1 <= undef41 /\ 1 <= undef105 /\ 2 + undef12 <= undef10 /\ 2 <= undef39 /\ 2 <= undef40, {arg1 -> undef39, arg2 -> undef40, arg3 -> undef41, arg4 -> 1 + undef43, rest remain the same}>
<l0, l9, 0 <= undef43 /\ 0 <= undef106 /\ 1 <= undef41 /\ 1 <= undef105 /\ 2 <= undef39 /\ 2 <= undef40, {arg1 -> undef39, arg2 -> undef40, arg3 -> undef41, arg4 -> 1 + undef43, rest remain the same}>

Graph 2
<l0, l10, undef5 <= undef105 /\ undef17 <= undef5 /\ undef77 <= undef18 /\ 0 <= undef76 /\ 0 <= undef78 /\ 1 <= undef5 /\ 1 <= undef6 /\ 1 <= undef17 /\ 1 + undef76 <= undef17 /\ 1 + undef78 <= undef17 /\ 1 <= undef18 /\ 1 + undef76 <= undef18 /\ 1 + undef78 <= undef18 /\ 1 <= undef77 /\ 1 <= undef105 /\ 2 + undef19 <= undef18, {arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79, rest remain the same}>
<l0, l10, undef5 <= undef105 /\ 0 <= undef71 /\ 0 <= undef72 /\ 0 <= undef73 /\ 1 <= undef5 /\ 1 + undef71 <= undef5 /\ 1 + undef72 <= undef5 /\ 1 + undef73 <= undef5 /\ 1 <= undef6 /\ 1 <= undef75 /\ 1 <= undef105, {arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74, rest remain the same}>
<l0, l10, undef9 <= undef105 /\ undef80 <= undef10 /\ undef82 <= undef10 /\ 0 <= undef81 /\ 1 <= undef9 /\ 1 + undef81 <= undef9 /\ 1 <= undef10 /\ 1 + undef81 <= undef10 /\ 1 <= undef80 /\ 1 <= undef82 /\ 1 <= undef84 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, rest remain the same}>
<l0, l10, undef9 <= undef105 /\ undef85 <= undef10 /\ undef87 <= undef10 /\ 1 <= undef9 /\ 1 <= undef10 /\ 1 <= undef85 /\ 1 <= undef86 /\ 1 <= undef87 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88, rest remain the same}>

Graph 3
<l10, l11, undef93 <= arg1 /\ undef94 <= arg1 /\ undef93 <= arg3 /\ undef94 <= arg3 /\ 0 <= undef95 /\ 1 <= arg1 /\ 1 + undef95 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 + undef95 <= arg3 /\ 1 <= undef93 /\ 1 <= undef94, {arg1 -> undef93, arg2 -> undef94, arg3 -> undef95, arg4 -> undef96, rest remain the same}>
<l10, l11, undef97 <= arg2 /\ undef98 <= arg2 /\ 0 <= undef99 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 + undef99 <= arg2 /\ 1 <= arg3 /\ 1 <= undef97 /\ 1 <= undef98, {arg1 -> undef97, arg2 -> undef98, arg3 -> undef99, arg4 -> undef100, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 9 , 1 )
( 10 , 2 )
( 11 , 3 )

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

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

Checking conditional termination of SCC {l9}...

LOG: CALL solveLinear

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

Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000597s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001814s
Trying to remove transition: <l10, l10, 0 <= undef89 /\ 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011502s
Time used: 0.011099
Improving Solution with cost 4 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013866s
Time used: 0.013863

LOG: SAT solveNonLinear - Elapsed time: 0.025368s
Cost: 4; Total time: 0.024962
Failed at location 10: arg1 <= 0
Failed at location 10: arg1 <= 0
Failed at location 10: arg1 <= 0
Failed at location 10: arg1 <= 0
Before Improving: 
Quasi-invariant at l10: arg1 <= 0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002416s
Remaining time after improvement: 0.998892
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l10: arg1 <= 0
[ 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: 
<l10, l10, 0 <= undef89 /\ 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, 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: 
<l10, l10, 0 <= undef89 /\ 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>
New Graphs: 
Calling Safety with literal arg1 <= 0 and entry <l0, l10, undef5 <= undef105 /\ undef17 <= undef5 /\ undef77 <= undef18 /\ 0 <= undef76 /\ 0 <= undef78 /\ 1 <= undef5 /\ 1 <= undef6 /\ 1 <= undef17 /\ 1 + undef76 <= undef17 /\ 1 + undef78 <= undef17 /\ 1 <= undef18 /\ 1 + undef76 <= undef18 /\ 1 + undef78 <= undef18 /\ 1 <= undef77 /\ 1 <= undef105 /\ 2 + undef19 <= undef18, {arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79, rest remain the same}>

LOG: CALL check - Post:arg1 <= 0 - Process 1
* Exit transition: <l0, l10, undef5 <= undef105 /\ undef17 <= undef5 /\ undef77 <= undef18 /\ 0 <= undef76 /\ 0 <= undef78 /\ 1 <= undef5 /\ 1 <= undef6 /\ 1 <= undef17 /\ 1 + undef76 <= undef17 /\ 1 + undef78 <= undef17 /\ 1 <= undef18 /\ 1 + undef76 <= undef18 /\ 1 + undef78 <= undef18 /\ 1 <= undef77 /\ 1 <= undef105 /\ 2 + undef19 <= undef18, {arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79, rest remain the same}>
* Postcondition  : arg1 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000645s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000744s
Calling Safety with literal arg1 <= 0 and entry <l0, l10, undef5 <= undef105 /\ 0 <= undef71 /\ 0 <= undef72 /\ 0 <= undef73 /\ 1 <= undef5 /\ 1 + undef71 <= undef5 /\ 1 + undef72 <= undef5 /\ 1 + undef73 <= undef5 /\ 1 <= undef6 /\ 1 <= undef75 /\ 1 <= undef105, {arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74, rest remain the same}>

LOG: CALL check - Post:arg1 <= 0 - Process 2
* Exit transition: <l0, l10, undef5 <= undef105 /\ 0 <= undef71 /\ 0 <= undef72 /\ 0 <= undef73 /\ 1 <= undef5 /\ 1 + undef71 <= undef5 /\ 1 + undef72 <= undef5 /\ 1 + undef73 <= undef5 /\ 1 <= undef6 /\ 1 <= undef75 /\ 1 <= undef105, {arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74, rest remain the same}>
* Postcondition  : arg1 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000531s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000606s
Calling Safety with literal arg1 <= 0 and entry <l0, l10, undef9 <= undef105 /\ undef80 <= undef10 /\ undef82 <= undef10 /\ 0 <= undef81 /\ 1 <= undef9 /\ 1 + undef81 <= undef9 /\ 1 <= undef10 /\ 1 + undef81 <= undef10 /\ 1 <= undef80 /\ 1 <= undef82 /\ 1 <= undef84 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, rest remain the same}>

LOG: CALL check - Post:arg1 <= 0 - Process 3
* Exit transition: <l0, l10, undef9 <= undef105 /\ undef80 <= undef10 /\ undef82 <= undef10 /\ 0 <= undef81 /\ 1 <= undef9 /\ 1 + undef81 <= undef9 /\ 1 <= undef10 /\ 1 + undef81 <= undef10 /\ 1 <= undef80 /\ 1 <= undef82 /\ 1 <= undef84 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, rest remain the same}>
* Postcondition  : arg1 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000508s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000595s
Calling Safety with literal arg1 <= 0 and entry <l0, l10, undef9 <= undef105 /\ undef85 <= undef10 /\ undef87 <= undef10 /\ 1 <= undef9 /\ 1 <= undef10 /\ 1 <= undef85 /\ 1 <= undef86 /\ 1 <= undef87 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88, rest remain the same}>

LOG: CALL check - Post:arg1 <= 0 - Process 4
* Exit transition: <l0, l10, undef9 <= undef105 /\ undef85 <= undef10 /\ undef87 <= undef10 /\ 1 <= undef9 /\ 1 <= undef10 /\ 1 <= undef85 /\ 1 <= undef86 /\ 1 <= undef87 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88, rest remain the same}>
* Postcondition  : arg1 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000459s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000529s
INVARIANTS: 
10: 
Quasi-INVARIANTS to narrow Graph: 
10: arg1 <= 0 , 
Narrowing transition: 
<l10, l10, 0 <= undef89 /\ 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l10, l10, 0 <= undef89 /\ 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000469s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001854s
Trying to remove transition: <l10, l10, 0 <= undef89 /\ 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.011650s
Time used: 0.011235
Improving Solution with cost 4 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.014990s
Time used: 0.014989

LOG: SAT solveNonLinear - Elapsed time: 0.026640s
Cost: 4; Total time: 0.026224
Failed at location 10: arg2 <= 0
Failed at location 10: arg2 <= 0
Failed at location 10: arg2 <= 0
Failed at location 10: arg2 <= 0
Before Improving: 
Quasi-invariant at l10: arg2 <= 0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002401s
Remaining time after improvement: 0.998881
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l10: arg2 <= 0
[ 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: 
<l10, l10, 0 <= undef89 /\ 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l10, l10, 0 <= undef89 /\ 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>
New Graphs: 
Calling Safety with literal arg2 <= 0 and entry <l0, l10, undef5 <= undef105 /\ undef17 <= undef5 /\ undef77 <= undef18 /\ 0 <= undef78 /\ 1 <= undef5 /\ 1 <= undef6 /\ 1 <= undef17 /\ 1 + undef76 <= undef17 /\ 1 + undef78 <= undef17 /\ 1 <= undef18 /\ 1 + undef76 <= undef18 /\ 1 + undef78 <= undef18 /\ 1 <= undef76 /\ 1 <= undef77 /\ 1 <= undef105 /\ 2 + undef19 <= undef18, {arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79, rest remain the same}>

LOG: CALL check - Post:arg2 <= 0 - Process 5
* Exit transition: <l0, l10, undef5 <= undef105 /\ undef17 <= undef5 /\ undef77 <= undef18 /\ 0 <= undef78 /\ 1 <= undef5 /\ 1 <= undef6 /\ 1 <= undef17 /\ 1 + undef76 <= undef17 /\ 1 + undef78 <= undef17 /\ 1 <= undef18 /\ 1 + undef76 <= undef18 /\ 1 + undef78 <= undef18 /\ 1 <= undef76 /\ 1 <= undef77 /\ 1 <= undef105 /\ 2 + undef19 <= undef18, {arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79, rest remain the same}>
* Postcondition  : arg2 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000634s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000733s
Calling Safety with literal arg2 <= 0 and entry <l0, l10, undef5 <= undef105 /\ 0 <= undef72 /\ 0 <= undef73 /\ 1 <= undef5 /\ 1 + undef71 <= undef5 /\ 1 + undef72 <= undef5 /\ 1 + undef73 <= undef5 /\ 1 <= undef6 /\ 1 <= undef71 /\ 1 <= undef75 /\ 1 <= undef105, {arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74, rest remain the same}>

LOG: CALL check - Post:arg2 <= 0 - Process 6
* Exit transition: <l0, l10, undef5 <= undef105 /\ 0 <= undef72 /\ 0 <= undef73 /\ 1 <= undef5 /\ 1 + undef71 <= undef5 /\ 1 + undef72 <= undef5 /\ 1 + undef73 <= undef5 /\ 1 <= undef6 /\ 1 <= undef71 /\ 1 <= undef75 /\ 1 <= undef105, {arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74, rest remain the same}>
* Postcondition  : arg2 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000527s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000601s
Calling Safety with literal arg2 <= 0 and entry <l0, l10, undef9 <= undef105 /\ undef80 <= undef10 /\ undef82 <= undef10 /\ 0 <= undef81 /\ 1 <= undef9 /\ 1 + undef81 <= undef9 /\ 1 <= undef10 /\ 1 + undef81 <= undef10 /\ 1 <= undef80 /\ 1 <= undef82 /\ 1 <= undef84 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, rest remain the same}>

LOG: CALL check - Post:arg2 <= 0 - Process 7
* Exit transition: <l0, l10, undef9 <= undef105 /\ undef80 <= undef10 /\ undef82 <= undef10 /\ 0 <= undef81 /\ 1 <= undef9 /\ 1 + undef81 <= undef9 /\ 1 <= undef10 /\ 1 + undef81 <= undef10 /\ 1 <= undef80 /\ 1 <= undef82 /\ 1 <= undef84 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, rest remain the same}>
* Postcondition  : arg2 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000516s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000598s
Calling Safety with literal arg2 <= 0 and entry <l0, l10, undef9 <= undef105 /\ undef85 <= undef10 /\ undef87 <= undef10 /\ 1 <= undef9 /\ 1 <= undef10 /\ 1 <= undef85 /\ 1 <= undef86 /\ 1 <= undef87 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88, rest remain the same}>

LOG: CALL check - Post:arg2 <= 0 - Process 8
* Exit transition: <l0, l10, undef9 <= undef105 /\ undef85 <= undef10 /\ undef87 <= undef10 /\ 1 <= undef9 /\ 1 <= undef10 /\ 1 <= undef85 /\ 1 <= undef86 /\ 1 <= undef87 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88, rest remain the same}>
* Postcondition  : arg2 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000474s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000542s
INVARIANTS: 
10: 
Quasi-INVARIANTS to narrow Graph: 
10: arg2 <= 0 , 
Narrowing transition: 
<l10, l10, 0 <= undef89 /\ 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l10, l10, 0 <= undef89 /\ 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000473s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001850s
Trying to remove transition: <l10, l10, 0 <= undef89 /\ 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013538s
Time used: 0.013088
Improving Solution with cost 4 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.013848s
Time used: 0.013846

LOG: SAT solveNonLinear - Elapsed time: 0.027386s
Cost: 4; Total time: 0.026934
Failed at location 10: arg3 <= 0
Failed at location 10: arg3 <= 0
Failed at location 10: arg3 <= 0
Failed at location 10: arg3 <= 0
Before Improving: 
Quasi-invariant at l10: arg3 <= 0
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002411s
Remaining time after improvement: 0.998877
Termination implied by a set of quasi-invariant(s):
Quasi-invariant at l10: arg3 <= 0
[ 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: 
<l10, l10, 0 <= undef89 /\ 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l10, l10, 0 <= undef89 /\ 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>
New Graphs: 
Calling Safety with literal arg3 <= 0 and entry <l0, l10, undef5 <= undef105 /\ undef17 <= undef5 /\ undef77 <= undef18 /\ 0 <= undef78 /\ 1 <= undef5 /\ 1 <= undef6 /\ 1 <= undef17 /\ 1 + undef76 <= undef17 /\ 1 + undef78 <= undef17 /\ 1 <= undef18 /\ 1 + undef76 <= undef18 /\ 1 + undef78 <= undef18 /\ 1 <= undef76 /\ 1 <= undef77 /\ 1 <= undef105 /\ 2 + undef19 <= undef18, {arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79, rest remain the same}>

LOG: CALL check - Post:arg3 <= 0 - Process 9
* Exit transition: <l0, l10, undef5 <= undef105 /\ undef17 <= undef5 /\ undef77 <= undef18 /\ 0 <= undef78 /\ 1 <= undef5 /\ 1 <= undef6 /\ 1 <= undef17 /\ 1 + undef76 <= undef17 /\ 1 + undef78 <= undef17 /\ 1 <= undef18 /\ 1 + undef76 <= undef18 /\ 1 + undef78 <= undef18 /\ 1 <= undef76 /\ 1 <= undef77 /\ 1 <= undef105 /\ 2 + undef19 <= undef18, {arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79, rest remain the same}>
* Postcondition  : arg3 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000650s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000748s
Calling Safety with literal arg3 <= 0 and entry <l0, l10, undef5 <= undef105 /\ 0 <= undef73 /\ 1 <= undef5 /\ 1 + undef71 <= undef5 /\ 1 + undef72 <= undef5 /\ 1 + undef73 <= undef5 /\ 1 <= undef6 /\ 1 <= undef71 /\ 1 <= undef72 /\ 1 <= undef75 /\ 1 <= undef105, {arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74, rest remain the same}>

LOG: CALL check - Post:arg3 <= 0 - Process 10
* Exit transition: <l0, l10, undef5 <= undef105 /\ 0 <= undef73 /\ 1 <= undef5 /\ 1 + undef71 <= undef5 /\ 1 + undef72 <= undef5 /\ 1 + undef73 <= undef5 /\ 1 <= undef6 /\ 1 <= undef71 /\ 1 <= undef72 /\ 1 <= undef75 /\ 1 <= undef105, {arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74, rest remain the same}>
* Postcondition  : arg3 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000541s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000622s
Calling Safety with literal arg3 <= 0 and entry <l0, l10, undef9 <= undef105 /\ undef80 <= undef10 /\ undef82 <= undef10 /\ 1 <= undef9 /\ 1 + undef81 <= undef9 /\ 1 <= undef10 /\ 1 + undef81 <= undef10 /\ 1 <= undef80 /\ 1 <= undef81 /\ 1 <= undef82 /\ 1 <= undef84 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, rest remain the same}>

LOG: CALL check - Post:arg3 <= 0 - Process 11
* Exit transition: <l0, l10, undef9 <= undef105 /\ undef80 <= undef10 /\ undef82 <= undef10 /\ 1 <= undef9 /\ 1 + undef81 <= undef9 /\ 1 <= undef10 /\ 1 + undef81 <= undef10 /\ 1 <= undef80 /\ 1 <= undef81 /\ 1 <= undef82 /\ 1 <= undef84 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, rest remain the same}>
* Postcondition  : arg3 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000516s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000598s
Calling Safety with literal arg3 <= 0 and entry <l0, l10, undef9 <= undef105 /\ undef85 <= undef10 /\ undef87 <= undef10 /\ 1 <= undef9 /\ 1 <= undef10 /\ 1 <= undef85 /\ 1 <= undef86 /\ 1 <= undef87 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88, rest remain the same}>

LOG: CALL check - Post:arg3 <= 0 - Process 12
* Exit transition: <l0, l10, undef9 <= undef105 /\ undef85 <= undef10 /\ undef87 <= undef10 /\ 1 <= undef9 /\ 1 <= undef10 /\ 1 <= undef85 /\ 1 <= undef86 /\ 1 <= undef87 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88, rest remain the same}>
* Postcondition  : arg3 <= 0

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000456s
> Postcondition is not implied!

LOG: RETURN check - Elapsed time: 0.000525s
INVARIANTS: 
10: 
Quasi-INVARIANTS to narrow Graph: 
10: arg3 <= 0 , 
Narrowing transition: 
<l10, l10, 0 <= undef89 /\ 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>

LOG: Narrow transition size 1
invGraph after Narrowing: 
Transitions:
<l10, l10, 0 <= undef89 /\ 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000474s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001838s
Trying to remove transition: <l10, l10, 0 <= undef89 /\ 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.032027s
Time used: 0.031671
Solving with 2 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 4.001141s
Time used: 4.00035
Solving with 3 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016498s
Time used: 0.007634

Proving non-termination of subgraph 2
Transitions:
<l10, l10, 0 <= undef89 /\ 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4

Checking conditional non-termination of SCC {l10}...
EXIT TRANSITIONS:
<l10, end, arg3 <= 0 /\ 1 <= arg1 /\ 1 <= arg2, {all remain the same}>
<l10, end, arg2 <= 0 /\ 1 <= arg1, {all remain the same}>
<l10, end, arg1 <= 0, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.020671s
Time used: 0.020455
Improving Solution with cost 5 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.049931s
Time used: 0.049929

LOG: SAT solveNonLinear - Elapsed time: 0.070603s
Cost: 5; Total time: 0.070384
Failed at location 10: 1 <= arg1
Failed at location 10: 1 <= arg1
Before Improving: 
Quasi-invariant at l10: 1 <= arg1
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008461s
Remaining time after improvement: 0.9985
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.002827s
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l10: 1 <= arg1
Constraint over undef '1 <= undef89' in transition:
<l10, l10, 0 <= undef89 /\ 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>

Strengthening and disabling EXIT transitions...
Closed exits from l10: 1
Strengthening exit transition (result): 
<l10, end, arg3 <= 0 /\ 1 <= arg1 /\ 1 <= arg2, {all remain the same}>
Strengthening exit transition (result): 
<l10, end, arg2 <= 0 /\ 1 <= arg1, {all remain the same}>

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef89, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>

Checking conditional non-termination of SCC {l10}...
EXIT TRANSITIONS:
<l10, end, arg3 <= 0 /\ 1 <= arg1 /\ 1 <= arg2, {all remain the same}>
<l10, end, arg2 <= 0 /\ 1 <= arg1, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.016812s
Time used: 0.016597
Improving Solution with cost 3 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.025067s
Time used: 0.025065

LOG: SAT solveNonLinear - Elapsed time: 0.041879s
Cost: 3; Total time: 0.041662
Failed at location 10: 1 <= arg2
Failed at location 10: 1 <= arg2
Before Improving: 
Quasi-invariant at l10: 1 <= arg2
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008292s
Remaining time after improvement: 0.998418
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.002849s
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l10: 1 <= arg2
Constraint over undef '1 <= undef90' in transition:
<l10, l10, 0 <= undef90 /\ 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef89, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>

Strengthening and disabling EXIT transitions...
Closed exits from l10: 1
Strengthening exit transition (result): 
<l10, end, arg3 <= 0 /\ 1 <= arg1 /\ 1 <= arg2, {all remain the same}>

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef89 /\ 1 <= undef90, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>

Checking conditional non-termination of SCC {l10}...
EXIT TRANSITIONS:
<l10, end, arg3 <= 0 /\ 1 <= arg1 /\ 1 <= arg2, {all remain the same}>

Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.014377s
Time used: 0.014146
Improving Solution with cost 2 ...

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.038042s
Time used: 0.03804

LOG: SAT solveNonLinear - Elapsed time: 0.052419s
Cost: 2; Total time: 0.052186
Failed at location 10: 1 <= arg3
Failed at location 10: 1 <= arg3
Before Improving: 
Quasi-invariant at l10: 1 <= arg3
Optimizing invariants...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007895s
Remaining time after improvement: 0.998409
Minimizing number of undef constraints...

LOG: CALL solveNonLinear

LOG: RETURN solveNonLinear - Elapsed time: 0.002783s
Non-termination implied by a set of quasi-invariant(s):
Quasi-invariant at l10: 1 <= arg3
Constraint over undef '1 <= undef91' in transition:
<l10, l10, 0 <= undef91 /\ 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef89 /\ 1 <= undef90, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>

Strengthening and disabling EXIT transitions...
Closed exits from l10: 1

Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3 /\ 1 <= undef89 /\ 1 <= undef90 /\ 1 <= undef91, {arg1 -> undef89, arg2 -> undef90, arg3 -> undef91, arg4 -> undef92, rest remain the same}>

Calling reachability with...
Transition: <l10, end, true, {all remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
Transition: <l10, end, true, {all remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
Transition: <l10, end, true, {all remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
Transition: <l10, end, true, {all remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
OPEN EXITS: 
<l10, end, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {all remain the same}>
<l10, end, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {all remain the same}>
<l10, end, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {all remain the same}>
<l10, end, 1 <= arg1 /\ 1 <= arg2 /\ 1 <= arg3, {all remain the same}>

--- Reachability graph ---
> Graph without transitions.

Calling reachability with...
Transition: <l0, l10, undef5 <= undef105 /\ undef17 <= undef5 /\ undef77 <= undef18 /\ 0 <= undef76 /\ 0 <= undef78 /\ 1 <= undef5 /\ 1 <= undef6 /\ 1 <= undef17 /\ 1 + undef76 <= undef17 /\ 1 + undef78 <= undef17 /\ 1 <= undef18 /\ 1 + undef76 <= undef18 /\ 1 + undef78 <= undef18 /\ 1 <= undef77 /\ 1 <= undef105 /\ 2 + undef19 <= undef18, {arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79, rest remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
Transition: <l0, l10, undef5 <= undef105 /\ 0 <= undef71 /\ 0 <= undef72 /\ 0 <= undef73 /\ 1 <= undef5 /\ 1 + undef71 <= undef5 /\ 1 + undef72 <= undef5 /\ 1 + undef73 <= undef5 /\ 1 <= undef6 /\ 1 <= undef75 /\ 1 <= undef105, {arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74, rest remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
Transition: <l0, l10, undef9 <= undef105 /\ undef80 <= undef10 /\ undef82 <= undef10 /\ 0 <= undef81 /\ 1 <= undef9 /\ 1 + undef81 <= undef9 /\ 1 <= undef10 /\ 1 + undef81 <= undef10 /\ 1 <= undef80 /\ 1 <= undef82 /\ 1 <= undef84 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, rest remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
Transition: <l0, l10, undef9 <= undef105 /\ undef85 <= undef10 /\ undef87 <= undef10 /\ 1 <= undef9 /\ 1 <= undef10 /\ 1 <= undef85 /\ 1 <= undef86 /\ 1 <= undef87 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88, rest remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
Transition: <l0, l10, undef5 <= undef105 /\ undef17 <= undef5 /\ undef77 <= undef18 /\ 0 <= undef76 /\ 0 <= undef78 /\ 1 <= undef5 /\ 1 <= undef6 /\ 1 <= undef17 /\ 1 + undef76 <= undef17 /\ 1 + undef78 <= undef17 /\ 1 <= undef18 /\ 1 + undef76 <= undef18 /\ 1 + undef78 <= undef18 /\ 1 <= undef77 /\ 1 <= undef105 /\ 2 + undef19 <= undef18, {arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79, rest remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
Transition: <l0, l10, undef5 <= undef105 /\ 0 <= undef71 /\ 0 <= undef72 /\ 0 <= undef73 /\ 1 <= undef5 /\ 1 + undef71 <= undef5 /\ 1 + undef72 <= undef5 /\ 1 + undef73 <= undef5 /\ 1 <= undef6 /\ 1 <= undef75 /\ 1 <= undef105, {arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74, rest remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
Transition: <l0, l10, undef9 <= undef105 /\ undef80 <= undef10 /\ undef82 <= undef10 /\ 0 <= undef81 /\ 1 <= undef9 /\ 1 + undef81 <= undef9 /\ 1 <= undef10 /\ 1 + undef81 <= undef10 /\ 1 <= undef80 /\ 1 <= undef82 /\ 1 <= undef84 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, rest remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
Transition: <l0, l10, undef9 <= undef105 /\ undef85 <= undef10 /\ undef87 <= undef10 /\ 1 <= undef9 /\ 1 <= undef10 /\ 1 <= undef85 /\ 1 <= undef86 /\ 1 <= undef87 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88, rest remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
Transition: <l0, l10, undef5 <= undef105 /\ undef17 <= undef5 /\ undef77 <= undef18 /\ 0 <= undef76 /\ 0 <= undef78 /\ 1 <= undef5 /\ 1 <= undef6 /\ 1 <= undef17 /\ 1 + undef76 <= undef17 /\ 1 + undef78 <= undef17 /\ 1 <= undef18 /\ 1 + undef76 <= undef18 /\ 1 + undef78 <= undef18 /\ 1 <= undef77 /\ 1 <= undef105 /\ 2 + undef19 <= undef18, {arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79, rest remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
Transition: <l0, l10, undef5 <= undef105 /\ 0 <= undef71 /\ 0 <= undef72 /\ 0 <= undef73 /\ 1 <= undef5 /\ 1 + undef71 <= undef5 /\ 1 + undef72 <= undef5 /\ 1 + undef73 <= undef5 /\ 1 <= undef6 /\ 1 <= undef75 /\ 1 <= undef105, {arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74, rest remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
Transition: <l0, l10, undef9 <= undef105 /\ undef80 <= undef10 /\ undef82 <= undef10 /\ 0 <= undef81 /\ 1 <= undef9 /\ 1 + undef81 <= undef9 /\ 1 <= undef10 /\ 1 + undef81 <= undef10 /\ 1 <= undef80 /\ 1 <= undef82 /\ 1 <= undef84 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, rest remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
Transition: <l0, l10, undef9 <= undef105 /\ undef85 <= undef10 /\ undef87 <= undef10 /\ 1 <= undef9 /\ 1 <= undef10 /\ 1 <= undef85 /\ 1 <= undef86 /\ 1 <= undef87 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88, rest remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
Transition: <l0, l10, undef5 <= undef105 /\ undef17 <= undef5 /\ undef77 <= undef18 /\ 0 <= undef76 /\ 0 <= undef78 /\ 1 <= undef5 /\ 1 <= undef6 /\ 1 <= undef17 /\ 1 + undef76 <= undef17 /\ 1 + undef78 <= undef17 /\ 1 <= undef18 /\ 1 + undef76 <= undef18 /\ 1 + undef78 <= undef18 /\ 1 <= undef77 /\ 1 <= undef105 /\ 2 + undef19 <= undef18, {arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79, rest remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
Transition: <l0, l10, undef5 <= undef105 /\ 0 <= undef71 /\ 0 <= undef72 /\ 0 <= undef73 /\ 1 <= undef5 /\ 1 + undef71 <= undef5 /\ 1 + undef72 <= undef5 /\ 1 + undef73 <= undef5 /\ 1 <= undef6 /\ 1 <= undef75 /\ 1 <= undef105, {arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74, rest remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
Transition: <l0, l10, undef9 <= undef105 /\ undef80 <= undef10 /\ undef82 <= undef10 /\ 0 <= undef81 /\ 1 <= undef9 /\ 1 + undef81 <= undef9 /\ 1 <= undef10 /\ 1 + undef81 <= undef10 /\ 1 <= undef80 /\ 1 <= undef82 /\ 1 <= undef84 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, rest remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
Transition: <l0, l10, undef9 <= undef105 /\ undef85 <= undef10 /\ undef87 <= undef10 /\ 1 <= undef9 /\ 1 <= undef10 /\ 1 <= undef85 /\ 1 <= undef86 /\ 1 <= undef87 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88, rest remain the same}>
Conditions: 1 <= arg1, 1 <= arg2, 1 <= arg3, 
OPEN EXITS: 
<l0, l10, undef5 <= undef105 /\ undef17 <= undef5 /\ undef77 <= undef18 /\ 1 <= undef5 /\ 1 <= undef6 /\ 1 <= undef17 /\ 1 + undef76 <= undef17 /\ 1 + undef78 <= undef17 /\ 1 <= undef18 /\ 1 + undef76 <= undef18 /\ 1 + undef78 <= undef18 /\ 1 <= undef76 /\ 1 <= undef77 /\ 1 <= undef78 /\ 1 <= undef105 /\ 2 + undef19 <= undef18, {arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79, rest remain the same}>
<l0, l10, undef5 <= undef105 /\ 1 <= undef5 /\ 1 + undef71 <= undef5 /\ 1 + undef72 <= undef5 /\ 1 + undef73 <= undef5 /\ 1 <= undef6 /\ 1 <= undef71 /\ 1 <= undef72 /\ 1 <= undef73 /\ 1 <= undef75 /\ 1 <= undef105, {arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74, rest remain the same}>
<l0, l10, undef9 <= undef105 /\ undef80 <= undef10 /\ undef82 <= undef10 /\ 1 <= undef9 /\ 1 + undef81 <= undef9 /\ 1 <= undef10 /\ 1 + undef81 <= undef10 /\ 1 <= undef80 /\ 1 <= undef81 /\ 1 <= undef82 /\ 1 <= undef84 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, rest remain the same}>
<l0, l10, undef9 <= undef105 /\ undef85 <= undef10 /\ undef87 <= undef10 /\ 1 <= undef9 /\ 1 <= undef10 /\ 1 <= undef85 /\ 1 <= undef86 /\ 1 <= undef87 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88, rest remain the same}>
<l0, l10, undef5 <= undef105 /\ undef17 <= undef5 /\ undef77 <= undef18 /\ 1 <= undef5 /\ 1 <= undef6 /\ 1 <= undef17 /\ 1 + undef76 <= undef17 /\ 1 + undef78 <= undef17 /\ 1 <= undef18 /\ 1 + undef76 <= undef18 /\ 1 + undef78 <= undef18 /\ 1 <= undef76 /\ 1 <= undef77 /\ 1 <= undef78 /\ 1 <= undef105 /\ 2 + undef19 <= undef18, {arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79, rest remain the same}>
<l0, l10, undef5 <= undef105 /\ 1 <= undef5 /\ 1 + undef71 <= undef5 /\ 1 + undef72 <= undef5 /\ 1 + undef73 <= undef5 /\ 1 <= undef6 /\ 1 <= undef71 /\ 1 <= undef72 /\ 1 <= undef73 /\ 1 <= undef75 /\ 1 <= undef105, {arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74, rest remain the same}>
<l0, l10, undef9 <= undef105 /\ undef80 <= undef10 /\ undef82 <= undef10 /\ 1 <= undef9 /\ 1 + undef81 <= undef9 /\ 1 <= undef10 /\ 1 + undef81 <= undef10 /\ 1 <= undef80 /\ 1 <= undef81 /\ 1 <= undef82 /\ 1 <= undef84 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, rest remain the same}>
<l0, l10, undef9 <= undef105 /\ undef85 <= undef10 /\ undef87 <= undef10 /\ 1 <= undef9 /\ 1 <= undef10 /\ 1 <= undef85 /\ 1 <= undef86 /\ 1 <= undef87 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88, rest remain the same}>
<l0, l10, undef5 <= undef105 /\ undef17 <= undef5 /\ undef77 <= undef18 /\ 1 <= undef5 /\ 1 <= undef6 /\ 1 <= undef17 /\ 1 + undef76 <= undef17 /\ 1 + undef78 <= undef17 /\ 1 <= undef18 /\ 1 + undef76 <= undef18 /\ 1 + undef78 <= undef18 /\ 1 <= undef76 /\ 1 <= undef77 /\ 1 <= undef78 /\ 1 <= undef105 /\ 2 + undef19 <= undef18, {arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79, rest remain the same}>
<l0, l10, undef5 <= undef105 /\ 1 <= undef5 /\ 1 + undef71 <= undef5 /\ 1 + undef72 <= undef5 /\ 1 + undef73 <= undef5 /\ 1 <= undef6 /\ 1 <= undef71 /\ 1 <= undef72 /\ 1 <= undef73 /\ 1 <= undef75 /\ 1 <= undef105, {arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74, rest remain the same}>
<l0, l10, undef9 <= undef105 /\ undef80 <= undef10 /\ undef82 <= undef10 /\ 1 <= undef9 /\ 1 + undef81 <= undef9 /\ 1 <= undef10 /\ 1 + undef81 <= undef10 /\ 1 <= undef80 /\ 1 <= undef81 /\ 1 <= undef82 /\ 1 <= undef84 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, rest remain the same}>
<l0, l10, undef9 <= undef105 /\ undef85 <= undef10 /\ undef87 <= undef10 /\ 1 <= undef9 /\ 1 <= undef10 /\ 1 <= undef85 /\ 1 <= undef86 /\ 1 <= undef87 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88, rest remain the same}>
<l0, l10, undef5 <= undef105 /\ undef17 <= undef5 /\ undef77 <= undef18 /\ 1 <= undef5 /\ 1 <= undef6 /\ 1 <= undef17 /\ 1 + undef76 <= undef17 /\ 1 + undef78 <= undef17 /\ 1 <= undef18 /\ 1 + undef76 <= undef18 /\ 1 + undef78 <= undef18 /\ 1 <= undef76 /\ 1 <= undef77 /\ 1 <= undef78 /\ 1 <= undef105 /\ 2 + undef19 <= undef18, {arg1 -> undef76, arg2 -> undef77, arg3 -> undef78, arg4 -> undef79, rest remain the same}>
<l0, l10, undef5 <= undef105 /\ 1 <= undef5 /\ 1 + undef71 <= undef5 /\ 1 + undef72 <= undef5 /\ 1 + undef73 <= undef5 /\ 1 <= undef6 /\ 1 <= undef71 /\ 1 <= undef72 /\ 1 <= undef73 /\ 1 <= undef75 /\ 1 <= undef105, {arg1 -> undef71, arg2 -> undef72, arg3 -> undef73, arg4 -> undef74, rest remain the same}>
<l0, l10, undef9 <= undef105 /\ undef80 <= undef10 /\ undef82 <= undef10 /\ 1 <= undef9 /\ 1 + undef81 <= undef9 /\ 1 <= undef10 /\ 1 + undef81 <= undef10 /\ 1 <= undef80 /\ 1 <= undef81 /\ 1 <= undef82 /\ 1 <= undef84 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef80, arg2 -> undef81, arg3 -> undef82, arg4 -> undef83, rest remain the same}>
<l0, l10, undef9 <= undef105 /\ undef85 <= undef10 /\ undef87 <= undef10 /\ 1 <= undef9 /\ 1 <= undef10 /\ 1 <= undef85 /\ 1 <= undef86 /\ 1 <= undef87 /\ 1 <= undef105 /\ 2 + undef12 <= undef10, {arg1 -> undef85, arg2 -> undef86, arg3 -> undef87, arg4 -> undef88, rest remain the same}>

> Conditions are reachable!

Program does NOT terminate