/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, (undef7 > ~(1)) /\ (arg2 > 3) /\ (undef8 > ~(1)) /\ (undef9 > ~(1)) /\ ((undef9 - (2 * undef10)) = 1) /\ ((undef11 - (2 * undef12)) = 0) /\ (undef11 > ~(1)) /\ (arg1 > 0), par{arg3 -> undef3, arg4 -> undef4, arg5 -> undef5, arg6 -> undef6}>
<l2, l3, (undef15 > ~(1)) /\ (arg2 > 3) /\ (undef19 > ~(1)) /\ (undef20 > ~(1)) /\ ((undef20 - (2 * undef21)) = 1) /\ ((undef22 - (2 * undef23)) = 0) /\ (undef22 > ~(1)) /\ (arg1 > 0) /\ ((undef20 - (2 * undef21)) >= 0) /\ ((undef20 - (2 * undef21)) < 2) /\ ((undef22 - (2 * undef23)) < 2) /\ ((undef22 - (2 * undef23)) >= 0), par{arg1 -> (0 - undef19), arg2 -> (0 - undef19), arg3 -> undef15, arg4 -> (0 - undef19), arg5 -> undef17, arg6 -> undef18}>
<l1, l2, (undef30 > ~(1)) /\ (arg2 > 3) /\ (undef31 > ~(1)) /\ (undef32 > ~(1)) /\ ((undef32 - (2 * undef33)) = 1) /\ ((undef34 - (2 * undef35)) = 1) /\ (undef34 > ~(1)) /\ (arg1 > 0), par{arg3 -> undef26, arg4 -> undef27, arg5 -> undef28, arg6 -> undef29}>
<l2, l4, (undef36 > ~(1)) /\ (arg2 > 3) /\ (undef37 > ~(1)) /\ (undef42 > ~(1)) /\ ((undef42 - (2 * undef43)) = 1) /\ ((undef44 - (2 * undef45)) = 1) /\ (undef44 > ~(1)) /\ (arg1 > 0) /\ ((undef42 - (2 * undef43)) >= 0) /\ ((undef42 - (2 * undef43)) < 2) /\ ((undef44 - (2 * undef45)) < 2) /\ ((undef44 - (2 * undef45)) >= 0), par{arg1 -> undef36, arg2 -> undef37, arg3 -> undef36, arg4 -> undef37, arg5 -> undef36, arg6 -> undef37}>
<l3, l3, (arg2 < 1) /\ (arg1 < 1) /\ (arg3 > arg2) /\ (arg2 = arg4), par{arg2 -> (arg2 + arg1), arg4 -> (arg2 + arg1), arg5 -> undef50, arg6 -> undef51}>
<l1, l2, (undef58 > ~(1)) /\ (arg2 > 3) /\ (undef59 > ~(1)) /\ (undef60 > ~(1)) /\ ((undef60 - (2 * undef61)) = 0) /\ ((undef62 - (2 * undef63)) = 1) /\ (undef62 > ~(1)) /\ (arg1 > 0), par{arg3 -> undef54, arg4 -> undef55, arg5 -> undef56, arg6 -> undef57}>
<l2, l5, (undef70 > ~(1)) /\ (arg2 > 3) /\ (undef65 > ~(1)) /\ (undef71 > ~(1)) /\ ((undef71 - (2 * undef72)) = 0) /\ ((undef73 - (2 * undef74)) = 1) /\ (undef73 > ~(1)) /\ (arg1 > 0) /\ ((undef71 - (2 * undef72)) >= 0) /\ ((undef71 - (2 * undef72)) < 2) /\ ((undef73 - (2 * undef74)) < 2) /\ ((undef73 - (2 * undef74)) >= 0), par{arg1 -> (0 - undef70), arg2 -> undef65, arg3 -> (0 - undef70), arg4 -> undef65, arg5 -> (0 - undef70), arg6 -> undef65}>
<l1, l2, (undef81 > ~(1)) /\ (arg2 > 3) /\ (undef82 > ~(1)) /\ (undef83 > ~(1)) /\ ((undef83 - (2 * undef84)) = 0) /\ ((undef85 - (2 * undef86)) = 0) /\ (undef85 > ~(1)) /\ (arg1 > 0), par{arg3 -> undef77, arg4 -> undef78, arg5 -> undef79, arg6 -> undef80}>
<l2, l5, (undef93 > ~(1)) /\ (arg2 > 3) /\ (undef94 > ~(1)) /\ (undef95 > ~(1)) /\ ((undef95 - (2 * undef96)) = 0) /\ ((undef97 - (2 * undef98)) = 0) /\ (undef97 > ~(1)) /\ (arg1 > 0) /\ ((undef95 - (2 * undef96)) >= 0) /\ ((undef95 - (2 * undef96)) < 2) /\ ((undef97 - (2 * undef98)) < 2) /\ ((undef97 - (2 * undef98)) >= 0), par{arg1 -> (0 - undef93), arg2 -> (0 - undef94), arg3 -> (0 - undef93), arg4 -> (0 - undef94), arg5 -> (0 - undef93), arg6 -> (0 - undef94)}>
<l4, l4, (arg3 > ~(1)) /\ (arg1 > ~(1)) /\ (arg4 > arg3) /\ (arg3 = arg5) /\ (arg4 = arg6), par{arg3 -> (arg3 + arg1), arg5 -> (arg3 + arg1), arg6 -> arg4}>
<l4, l4, (arg4 > ~(1)) /\ (arg2 > ~(1)) /\ (arg4 < arg3) /\ (arg3 = arg5) /\ (arg4 = arg6), par{arg4 -> (arg4 + arg2), arg5 -> arg3, arg6 -> (arg4 + arg2)}>
<l5, l5, (arg3 < 1) /\ (arg1 < 1) /\ (arg4 > arg3) /\ (arg3 = arg5) /\ (arg4 = arg6), par{arg3 -> (arg3 + arg1), arg5 -> (arg3 + arg1), arg6 -> arg4}>
<l5, l5, (arg4 < arg3) /\ (arg3 = arg5) /\ (arg4 = arg6), par{arg4 -> (arg4 + arg2), arg5 -> arg3, arg6 -> (arg4 + arg2)}>
<l6, l1, true, par{arg1 -> undef123, arg2 -> undef124, arg3 -> undef125, arg4 -> undef126, arg5 -> undef127, arg6 -> undef128}>

Fresh variables:
undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef15, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef42, undef43, undef44, undef45, undef50, undef51, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef65, undef70, undef71, undef72, undef73, undef74, undef77, undef78, undef79, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef93, undef94, undef95, undef96, undef97, undef98, undef123, undef124, undef125, undef126, undef127, undef128, 

Undef variables:
undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef15, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef42, undef43, undef44, undef45, undef50, undef51, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef65, undef70, undef71, undef72, undef73, undef74, undef77, undef78, undef79, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef93, undef94, undef95, undef96, undef97, undef98, undef123, undef124, undef125, undef126, undef127, undef128, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l3, (undef7 > ~(1)) /\ (undef124 > 3) /\ (undef8 > ~(1)) /\ (undef9 > ~(1)) /\ ((undef9 - (2 * undef10)) = 1) /\ ((undef11 - (2 * undef12)) = 0) /\ (undef11 > ~(1)) /\ (undef123 > 0) /\ (undef15 > ~(1)) /\ (undef124 > 3) /\ (undef19 > ~(1)) /\ (undef20 > ~(1)) /\ ((undef20 - (2 * undef21)) = 1) /\ ((undef22 - (2 * undef23)) = 0) /\ (undef22 > ~(1)) /\ (undef123 > 0) /\ ((undef20 - (2 * undef21)) >= 0) /\ ((undef20 - (2 * undef21)) < 2) /\ ((undef22 - (2 * undef23)) < 2) /\ ((undef22 - (2 * undef23)) >= 0), par{arg1 -> (0 - undef19), arg2 -> (0 - undef19), arg3 -> undef15, arg4 -> (0 - undef19), arg5 -> undef17, arg6 -> undef18}>
<l0, l4, (undef7 > ~(1)) /\ (undef124 > 3) /\ (undef8 > ~(1)) /\ (undef9 > ~(1)) /\ ((undef9 - (2 * undef10)) = 1) /\ ((undef11 - (2 * undef12)) = 0) /\ (undef11 > ~(1)) /\ (undef123 > 0) /\ (undef36 > ~(1)) /\ (undef124 > 3) /\ (undef37 > ~(1)) /\ (undef42 > ~(1)) /\ ((undef42 - (2 * undef43)) = 1) /\ ((undef44 - (2 * undef45)) = 1) /\ (undef44 > ~(1)) /\ (undef123 > 0) /\ ((undef42 - (2 * undef43)) >= 0) /\ ((undef42 - (2 * undef43)) < 2) /\ ((undef44 - (2 * undef45)) < 2) /\ ((undef44 - (2 * undef45)) >= 0), par{arg1 -> undef36, arg2 -> undef37, arg3 -> undef36, arg4 -> undef37, arg5 -> undef36, arg6 -> undef37}>
<l0, l5, (undef7 > ~(1)) /\ (undef124 > 3) /\ (undef8 > ~(1)) /\ (undef9 > ~(1)) /\ ((undef9 - (2 * undef10)) = 1) /\ ((undef11 - (2 * undef12)) = 0) /\ (undef11 > ~(1)) /\ (undef123 > 0) /\ (undef70 > ~(1)) /\ (undef124 > 3) /\ (undef65 > ~(1)) /\ (undef71 > ~(1)) /\ ((undef71 - (2 * undef72)) = 0) /\ ((undef73 - (2 * undef74)) = 1) /\ (undef73 > ~(1)) /\ (undef123 > 0) /\ ((undef71 - (2 * undef72)) >= 0) /\ ((undef71 - (2 * undef72)) < 2) /\ ((undef73 - (2 * undef74)) < 2) /\ ((undef73 - (2 * undef74)) >= 0), par{arg1 -> (0 - undef70), arg2 -> undef65, arg3 -> (0 - undef70), arg4 -> undef65, arg5 -> (0 - undef70), arg6 -> undef65}>
<l0, l5, (undef7 > ~(1)) /\ (undef124 > 3) /\ (undef8 > ~(1)) /\ (undef9 > ~(1)) /\ ((undef9 - (2 * undef10)) = 1) /\ ((undef11 - (2 * undef12)) = 0) /\ (undef11 > ~(1)) /\ (undef123 > 0) /\ (undef93 > ~(1)) /\ (undef124 > 3) /\ (undef94 > ~(1)) /\ (undef95 > ~(1)) /\ ((undef95 - (2 * undef96)) = 0) /\ ((undef97 - (2 * undef98)) = 0) /\ (undef97 > ~(1)) /\ (undef123 > 0) /\ ((undef95 - (2 * undef96)) >= 0) /\ ((undef95 - (2 * undef96)) < 2) /\ ((undef97 - (2 * undef98)) < 2) /\ ((undef97 - (2 * undef98)) >= 0), par{arg1 -> (0 - undef93), arg2 -> (0 - undef94), arg3 -> (0 - undef93), arg4 -> (0 - undef94), arg5 -> (0 - undef93), arg6 -> (0 - undef94)}>
<l0, l3, (undef30 > ~(1)) /\ (undef124 > 3) /\ (undef31 > ~(1)) /\ (undef32 > ~(1)) /\ ((undef32 - (2 * undef33)) = 1) /\ ((undef34 - (2 * undef35)) = 1) /\ (undef34 > ~(1)) /\ (undef123 > 0) /\ (undef15 > ~(1)) /\ (undef124 > 3) /\ (undef19 > ~(1)) /\ (undef20 > ~(1)) /\ ((undef20 - (2 * undef21)) = 1) /\ ((undef22 - (2 * undef23)) = 0) /\ (undef22 > ~(1)) /\ (undef123 > 0) /\ ((undef20 - (2 * undef21)) >= 0) /\ ((undef20 - (2 * undef21)) < 2) /\ ((undef22 - (2 * undef23)) < 2) /\ ((undef22 - (2 * undef23)) >= 0), par{arg1 -> (0 - undef19), arg2 -> (0 - undef19), arg3 -> undef15, arg4 -> (0 - undef19), arg5 -> undef17, arg6 -> undef18}>
<l0, l4, (undef30 > ~(1)) /\ (undef124 > 3) /\ (undef31 > ~(1)) /\ (undef32 > ~(1)) /\ ((undef32 - (2 * undef33)) = 1) /\ ((undef34 - (2 * undef35)) = 1) /\ (undef34 > ~(1)) /\ (undef123 > 0) /\ (undef36 > ~(1)) /\ (undef124 > 3) /\ (undef37 > ~(1)) /\ (undef42 > ~(1)) /\ ((undef42 - (2 * undef43)) = 1) /\ ((undef44 - (2 * undef45)) = 1) /\ (undef44 > ~(1)) /\ (undef123 > 0) /\ ((undef42 - (2 * undef43)) >= 0) /\ ((undef42 - (2 * undef43)) < 2) /\ ((undef44 - (2 * undef45)) < 2) /\ ((undef44 - (2 * undef45)) >= 0), par{arg1 -> undef36, arg2 -> undef37, arg3 -> undef36, arg4 -> undef37, arg5 -> undef36, arg6 -> undef37}>
<l0, l5, (undef30 > ~(1)) /\ (undef124 > 3) /\ (undef31 > ~(1)) /\ (undef32 > ~(1)) /\ ((undef32 - (2 * undef33)) = 1) /\ ((undef34 - (2 * undef35)) = 1) /\ (undef34 > ~(1)) /\ (undef123 > 0) /\ (undef70 > ~(1)) /\ (undef124 > 3) /\ (undef65 > ~(1)) /\ (undef71 > ~(1)) /\ ((undef71 - (2 * undef72)) = 0) /\ ((undef73 - (2 * undef74)) = 1) /\ (undef73 > ~(1)) /\ (undef123 > 0) /\ ((undef71 - (2 * undef72)) >= 0) /\ ((undef71 - (2 * undef72)) < 2) /\ ((undef73 - (2 * undef74)) < 2) /\ ((undef73 - (2 * undef74)) >= 0), par{arg1 -> (0 - undef70), arg2 -> undef65, arg3 -> (0 - undef70), arg4 -> undef65, arg5 -> (0 - undef70), arg6 -> undef65}>
<l0, l5, (undef30 > ~(1)) /\ (undef124 > 3) /\ (undef31 > ~(1)) /\ (undef32 > ~(1)) /\ ((undef32 - (2 * undef33)) = 1) /\ ((undef34 - (2 * undef35)) = 1) /\ (undef34 > ~(1)) /\ (undef123 > 0) /\ (undef93 > ~(1)) /\ (undef124 > 3) /\ (undef94 > ~(1)) /\ (undef95 > ~(1)) /\ ((undef95 - (2 * undef96)) = 0) /\ ((undef97 - (2 * undef98)) = 0) /\ (undef97 > ~(1)) /\ (undef123 > 0) /\ ((undef95 - (2 * undef96)) >= 0) /\ ((undef95 - (2 * undef96)) < 2) /\ ((undef97 - (2 * undef98)) < 2) /\ ((undef97 - (2 * undef98)) >= 0), par{arg1 -> (0 - undef93), arg2 -> (0 - undef94), arg3 -> (0 - undef93), arg4 -> (0 - undef94), arg5 -> (0 - undef93), arg6 -> (0 - undef94)}>
<l0, l3, (undef58 > ~(1)) /\ (undef124 > 3) /\ (undef59 > ~(1)) /\ (undef60 > ~(1)) /\ ((undef60 - (2 * undef61)) = 0) /\ ((undef62 - (2 * undef63)) = 1) /\ (undef62 > ~(1)) /\ (undef123 > 0) /\ (undef15 > ~(1)) /\ (undef124 > 3) /\ (undef19 > ~(1)) /\ (undef20 > ~(1)) /\ ((undef20 - (2 * undef21)) = 1) /\ ((undef22 - (2 * undef23)) = 0) /\ (undef22 > ~(1)) /\ (undef123 > 0) /\ ((undef20 - (2 * undef21)) >= 0) /\ ((undef20 - (2 * undef21)) < 2) /\ ((undef22 - (2 * undef23)) < 2) /\ ((undef22 - (2 * undef23)) >= 0), par{arg1 -> (0 - undef19), arg2 -> (0 - undef19), arg3 -> undef15, arg4 -> (0 - undef19), arg5 -> undef17, arg6 -> undef18}>
<l0, l4, (undef58 > ~(1)) /\ (undef124 > 3) /\ (undef59 > ~(1)) /\ (undef60 > ~(1)) /\ ((undef60 - (2 * undef61)) = 0) /\ ((undef62 - (2 * undef63)) = 1) /\ (undef62 > ~(1)) /\ (undef123 > 0) /\ (undef36 > ~(1)) /\ (undef124 > 3) /\ (undef37 > ~(1)) /\ (undef42 > ~(1)) /\ ((undef42 - (2 * undef43)) = 1) /\ ((undef44 - (2 * undef45)) = 1) /\ (undef44 > ~(1)) /\ (undef123 > 0) /\ ((undef42 - (2 * undef43)) >= 0) /\ ((undef42 - (2 * undef43)) < 2) /\ ((undef44 - (2 * undef45)) < 2) /\ ((undef44 - (2 * undef45)) >= 0), par{arg1 -> undef36, arg2 -> undef37, arg3 -> undef36, arg4 -> undef37, arg5 -> undef36, arg6 -> undef37}>
<l0, l5, (undef58 > ~(1)) /\ (undef124 > 3) /\ (undef59 > ~(1)) /\ (undef60 > ~(1)) /\ ((undef60 - (2 * undef61)) = 0) /\ ((undef62 - (2 * undef63)) = 1) /\ (undef62 > ~(1)) /\ (undef123 > 0) /\ (undef70 > ~(1)) /\ (undef124 > 3) /\ (undef65 > ~(1)) /\ (undef71 > ~(1)) /\ ((undef71 - (2 * undef72)) = 0) /\ ((undef73 - (2 * undef74)) = 1) /\ (undef73 > ~(1)) /\ (undef123 > 0) /\ ((undef71 - (2 * undef72)) >= 0) /\ ((undef71 - (2 * undef72)) < 2) /\ ((undef73 - (2 * undef74)) < 2) /\ ((undef73 - (2 * undef74)) >= 0), par{arg1 -> (0 - undef70), arg2 -> undef65, arg3 -> (0 - undef70), arg4 -> undef65, arg5 -> (0 - undef70), arg6 -> undef65}>
<l0, l5, (undef58 > ~(1)) /\ (undef124 > 3) /\ (undef59 > ~(1)) /\ (undef60 > ~(1)) /\ ((undef60 - (2 * undef61)) = 0) /\ ((undef62 - (2 * undef63)) = 1) /\ (undef62 > ~(1)) /\ (undef123 > 0) /\ (undef93 > ~(1)) /\ (undef124 > 3) /\ (undef94 > ~(1)) /\ (undef95 > ~(1)) /\ ((undef95 - (2 * undef96)) = 0) /\ ((undef97 - (2 * undef98)) = 0) /\ (undef97 > ~(1)) /\ (undef123 > 0) /\ ((undef95 - (2 * undef96)) >= 0) /\ ((undef95 - (2 * undef96)) < 2) /\ ((undef97 - (2 * undef98)) < 2) /\ ((undef97 - (2 * undef98)) >= 0), par{arg1 -> (0 - undef93), arg2 -> (0 - undef94), arg3 -> (0 - undef93), arg4 -> (0 - undef94), arg5 -> (0 - undef93), arg6 -> (0 - undef94)}>
<l0, l3, (undef81 > ~(1)) /\ (undef124 > 3) /\ (undef82 > ~(1)) /\ (undef83 > ~(1)) /\ ((undef83 - (2 * undef84)) = 0) /\ ((undef85 - (2 * undef86)) = 0) /\ (undef85 > ~(1)) /\ (undef123 > 0) /\ (undef15 > ~(1)) /\ (undef124 > 3) /\ (undef19 > ~(1)) /\ (undef20 > ~(1)) /\ ((undef20 - (2 * undef21)) = 1) /\ ((undef22 - (2 * undef23)) = 0) /\ (undef22 > ~(1)) /\ (undef123 > 0) /\ ((undef20 - (2 * undef21)) >= 0) /\ ((undef20 - (2 * undef21)) < 2) /\ ((undef22 - (2 * undef23)) < 2) /\ ((undef22 - (2 * undef23)) >= 0), par{arg1 -> (0 - undef19), arg2 -> (0 - undef19), arg3 -> undef15, arg4 -> (0 - undef19), arg5 -> undef17, arg6 -> undef18}>
<l0, l4, (undef81 > ~(1)) /\ (undef124 > 3) /\ (undef82 > ~(1)) /\ (undef83 > ~(1)) /\ ((undef83 - (2 * undef84)) = 0) /\ ((undef85 - (2 * undef86)) = 0) /\ (undef85 > ~(1)) /\ (undef123 > 0) /\ (undef36 > ~(1)) /\ (undef124 > 3) /\ (undef37 > ~(1)) /\ (undef42 > ~(1)) /\ ((undef42 - (2 * undef43)) = 1) /\ ((undef44 - (2 * undef45)) = 1) /\ (undef44 > ~(1)) /\ (undef123 > 0) /\ ((undef42 - (2 * undef43)) >= 0) /\ ((undef42 - (2 * undef43)) < 2) /\ ((undef44 - (2 * undef45)) < 2) /\ ((undef44 - (2 * undef45)) >= 0), par{arg1 -> undef36, arg2 -> undef37, arg3 -> undef36, arg4 -> undef37, arg5 -> undef36, arg6 -> undef37}>
<l0, l5, (undef81 > ~(1)) /\ (undef124 > 3) /\ (undef82 > ~(1)) /\ (undef83 > ~(1)) /\ ((undef83 - (2 * undef84)) = 0) /\ ((undef85 - (2 * undef86)) = 0) /\ (undef85 > ~(1)) /\ (undef123 > 0) /\ (undef70 > ~(1)) /\ (undef124 > 3) /\ (undef65 > ~(1)) /\ (undef71 > ~(1)) /\ ((undef71 - (2 * undef72)) = 0) /\ ((undef73 - (2 * undef74)) = 1) /\ (undef73 > ~(1)) /\ (undef123 > 0) /\ ((undef71 - (2 * undef72)) >= 0) /\ ((undef71 - (2 * undef72)) < 2) /\ ((undef73 - (2 * undef74)) < 2) /\ ((undef73 - (2 * undef74)) >= 0), par{arg1 -> (0 - undef70), arg2 -> undef65, arg3 -> (0 - undef70), arg4 -> undef65, arg5 -> (0 - undef70), arg6 -> undef65}>
<l0, l5, (undef81 > ~(1)) /\ (undef124 > 3) /\ (undef82 > ~(1)) /\ (undef83 > ~(1)) /\ ((undef83 - (2 * undef84)) = 0) /\ ((undef85 - (2 * undef86)) = 0) /\ (undef85 > ~(1)) /\ (undef123 > 0) /\ (undef93 > ~(1)) /\ (undef124 > 3) /\ (undef94 > ~(1)) /\ (undef95 > ~(1)) /\ ((undef95 - (2 * undef96)) = 0) /\ ((undef97 - (2 * undef98)) = 0) /\ (undef97 > ~(1)) /\ (undef123 > 0) /\ ((undef95 - (2 * undef96)) >= 0) /\ ((undef95 - (2 * undef96)) < 2) /\ ((undef97 - (2 * undef98)) < 2) /\ ((undef97 - (2 * undef98)) >= 0), par{arg1 -> (0 - undef93), arg2 -> (0 - undef94), arg3 -> (0 - undef93), arg4 -> (0 - undef94), arg5 -> (0 - undef93), arg6 -> (0 - undef94)}>
<l3, l3, (arg2 < 1) /\ (arg1 < 1) /\ (arg3 > arg2) /\ (arg2 = arg4), par{arg2 -> (arg2 + arg1), arg4 -> (arg2 + arg1), arg5 -> undef50, arg6 -> undef51}>
<l4, l4, (arg3 > ~(1)) /\ (arg1 > ~(1)) /\ (arg4 > arg3) /\ (arg3 = arg5) /\ (arg4 = arg6), par{arg3 -> (arg3 + arg1), arg5 -> (arg3 + arg1), arg6 -> arg4}>
<l4, l4, (arg4 > ~(1)) /\ (arg2 > ~(1)) /\ (arg4 < arg3) /\ (arg3 = arg5) /\ (arg4 = arg6), par{arg4 -> (arg4 + arg2), arg5 -> arg3, arg6 -> (arg4 + arg2)}>
<l5, l5, (arg3 < 1) /\ (arg1 < 1) /\ (arg4 > arg3) /\ (arg3 = arg5) /\ (arg4 = arg6), par{arg3 -> (arg3 + arg1), arg5 -> (arg3 + arg1), arg6 -> arg4}>
<l5, l5, (arg4 < arg3) /\ (arg3 = arg5) /\ (arg4 = arg6), par{arg4 -> (arg4 + arg2), arg5 -> arg3, arg6 -> (arg4 + arg2)}>

Fresh variables:
undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef15, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef42, undef43, undef44, undef45, undef50, undef51, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef65, undef70, undef71, undef72, undef73, undef74, undef77, undef78, undef79, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef93, undef94, undef95, undef96, undef97, undef98, undef123, undef124, undef125, undef126, undef127, undef128, 

Undef variables:
undef3, undef4, undef5, undef6, undef7, undef8, undef9, undef10, undef11, undef12, undef15, undef17, undef18, undef19, undef20, undef21, undef22, undef23, undef26, undef27, undef28, undef29, undef30, undef31, undef32, undef33, undef34, undef35, undef36, undef37, undef42, undef43, undef44, undef45, undef50, undef51, undef54, undef55, undef56, undef57, undef58, undef59, undef60, undef61, undef62, undef63, undef65, undef70, undef71, undef72, undef73, undef74, undef77, undef78, undef79, undef80, undef81, undef82, undef83, undef84, undef85, undef86, undef93, undef94, undef95, undef96, undef97, undef98, undef123, undef124, undef125, undef126, undef127, undef128, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l5, l5, 1 + arg3 <= arg4 /\ arg1 <= 0 /\ arg3 <= 0 /\ arg3 = arg5 /\ arg4 = arg6, {arg3 -> arg1 + arg3, arg5 -> arg1 + arg3, arg6 -> arg4, rest remain the same}>
<l5, l5, 1 + arg4 <= arg3 /\ arg3 = arg5 /\ arg4 = arg6, {arg4 -> arg2 + arg4, arg5 -> arg3, arg6 -> arg2 + arg4, rest remain the same}>
Variables:
arg1, arg3, arg4, arg5, arg6, arg2

Graph 2:
Transitions:
<l4, l4, 1 + arg3 <= arg4 /\ 0 <= arg1 /\ 0 <= arg3 /\ arg3 = arg5 /\ arg4 = arg6, {arg3 -> arg1 + arg3, arg5 -> arg1 + arg3, arg6 -> arg4, rest remain the same}>
<l4, l4, 1 + arg4 <= arg3 /\ 0 <= arg2 /\ 0 <= arg4 /\ arg3 = arg5 /\ arg4 = arg6, {arg4 -> arg2 + arg4, arg5 -> arg3, arg6 -> arg2 + arg4, rest remain the same}>
Variables:
arg1, arg3, arg4, arg5, arg6, arg2

Graph 3:
Transitions:
<l3, l3, 1 + arg2 <= arg3 /\ arg1 <= 0 /\ arg2 <= 0 /\ arg2 = arg4, {arg2 -> arg1 + arg2, arg4 -> arg1 + arg2, arg5 -> undef50, arg6 -> undef51, rest remain the same}>
Variables:
arg1, arg2, arg3, arg4, arg5, arg6

Precedence: 
Graph 0

Graph 1
<l0, l5, 1 <= undef123 /\ 0 <= undef7 /\ 0 <= undef8 /\ 0 <= undef9 /\ 0 <= undef11 /\ 0 <= undef65 /\ 0 <= undef70 /\ 0 <= undef71 /\ 0 <= undef73 /\ 4 <= undef124 /\ undef9 = 1 + 2*undef10 /\ undef73 = 1 + 2*undef74 /\ undef11 = 2*undef12 /\ undef71 = 2*undef72, {arg1 -> -undef70, arg2 -> undef65, arg3 -> -undef70, arg4 -> undef65, arg5 -> -undef70, arg6 -> undef65, rest remain the same}>
<l0, l5, 1 <= undef123 /\ 0 <= undef7 /\ 0 <= undef8 /\ 0 <= undef9 /\ 0 <= undef11 /\ 0 <= undef93 /\ 0 <= undef94 /\ 0 <= undef95 /\ 0 <= undef97 /\ 4 <= undef124 /\ undef9 = 1 + 2*undef10 /\ undef11 = 2*undef12 /\ undef95 = 2*undef96 /\ undef97 = 2*undef98, {arg1 -> -undef93, arg2 -> -undef94, arg3 -> -undef93, arg4 -> -undef94, arg5 -> -undef93, arg6 -> -undef94, rest remain the same}>
<l0, l5, 1 <= undef123 /\ 0 <= undef30 /\ 0 <= undef31 /\ 0 <= undef32 /\ 0 <= undef34 /\ 0 <= undef65 /\ 0 <= undef70 /\ 0 <= undef71 /\ 0 <= undef73 /\ 4 <= undef124 /\ undef32 = 1 + 2*undef33 /\ undef34 = 1 + 2*undef35 /\ undef73 = 1 + 2*undef74 /\ undef71 = 2*undef72, {arg1 -> -undef70, arg2 -> undef65, arg3 -> -undef70, arg4 -> undef65, arg5 -> -undef70, arg6 -> undef65, rest remain the same}>
<l0, l5, 1 <= undef123 /\ 0 <= undef30 /\ 0 <= undef31 /\ 0 <= undef32 /\ 0 <= undef34 /\ 0 <= undef93 /\ 0 <= undef94 /\ 0 <= undef95 /\ 0 <= undef97 /\ 4 <= undef124 /\ undef32 = 1 + 2*undef33 /\ undef34 = 1 + 2*undef35 /\ undef95 = 2*undef96 /\ undef97 = 2*undef98, {arg1 -> -undef93, arg2 -> -undef94, arg3 -> -undef93, arg4 -> -undef94, arg5 -> -undef93, arg6 -> -undef94, rest remain the same}>
<l0, l5, 1 <= undef123 /\ 0 <= undef58 /\ 0 <= undef59 /\ 0 <= undef60 /\ 0 <= undef62 /\ 0 <= undef65 /\ 0 <= undef70 /\ 0 <= undef71 /\ 0 <= undef73 /\ 4 <= undef124 /\ undef62 = 1 + 2*undef63 /\ undef73 = 1 + 2*undef74 /\ undef60 = 2*undef61 /\ undef71 = 2*undef72, {arg1 -> -undef70, arg2 -> undef65, arg3 -> -undef70, arg4 -> undef65, arg5 -> -undef70, arg6 -> undef65, rest remain the same}>
<l0, l5, 1 <= undef123 /\ 0 <= undef58 /\ 0 <= undef59 /\ 0 <= undef60 /\ 0 <= undef62 /\ 0 <= undef93 /\ 0 <= undef94 /\ 0 <= undef95 /\ 0 <= undef97 /\ 4 <= undef124 /\ undef62 = 1 + 2*undef63 /\ undef60 = 2*undef61 /\ undef95 = 2*undef96 /\ undef97 = 2*undef98, {arg1 -> -undef93, arg2 -> -undef94, arg3 -> -undef93, arg4 -> -undef94, arg5 -> -undef93, arg6 -> -undef94, rest remain the same}>
<l0, l5, 1 <= undef123 /\ 0 <= undef65 /\ 0 <= undef70 /\ 0 <= undef71 /\ 0 <= undef73 /\ 0 <= undef81 /\ 0 <= undef82 /\ 0 <= undef83 /\ 0 <= undef85 /\ 4 <= undef124 /\ undef73 = 1 + 2*undef74 /\ undef71 = 2*undef72 /\ undef83 = 2*undef84 /\ undef85 = 2*undef86, {arg1 -> -undef70, arg2 -> undef65, arg3 -> -undef70, arg4 -> undef65, arg5 -> -undef70, arg6 -> undef65, rest remain the same}>
<l0, l5, 1 <= undef123 /\ 0 <= undef81 /\ 0 <= undef82 /\ 0 <= undef83 /\ 0 <= undef85 /\ 0 <= undef93 /\ 0 <= undef94 /\ 0 <= undef95 /\ 0 <= undef97 /\ 4 <= undef124 /\ undef83 = 2*undef84 /\ undef85 = 2*undef86 /\ undef95 = 2*undef96 /\ undef97 = 2*undef98, {arg1 -> -undef93, arg2 -> -undef94, arg3 -> -undef93, arg4 -> -undef94, arg5 -> -undef93, arg6 -> -undef94, rest remain the same}>

Graph 2
<l0, l4, 1 <= undef123 /\ 0 <= undef7 /\ 0 <= undef8 /\ 0 <= undef9 /\ 0 <= undef11 /\ 0 <= undef36 /\ 0 <= undef37 /\ 0 <= undef42 /\ 0 <= undef44 /\ 4 <= undef124 /\ undef9 = 1 + 2*undef10 /\ undef42 = 1 + 2*undef43 /\ undef44 = 1 + 2*undef45 /\ undef11 = 2*undef12, {arg1 -> undef36, arg2 -> undef37, arg3 -> undef36, arg4 -> undef37, arg5 -> undef36, arg6 -> undef37, rest remain the same}>
<l0, l4, 1 <= undef123 /\ 0 <= undef30 /\ 0 <= undef31 /\ 0 <= undef32 /\ 0 <= undef34 /\ 0 <= undef36 /\ 0 <= undef37 /\ 0 <= undef42 /\ 0 <= undef44 /\ 4 <= undef124 /\ undef32 = 1 + 2*undef33 /\ undef34 = 1 + 2*undef35 /\ undef42 = 1 + 2*undef43 /\ undef44 = 1 + 2*undef45, {arg1 -> undef36, arg2 -> undef37, arg3 -> undef36, arg4 -> undef37, arg5 -> undef36, arg6 -> undef37, rest remain the same}>
<l0, l4, 1 <= undef123 /\ 0 <= undef36 /\ 0 <= undef37 /\ 0 <= undef42 /\ 0 <= undef44 /\ 0 <= undef58 /\ 0 <= undef59 /\ 0 <= undef60 /\ 0 <= undef62 /\ 4 <= undef124 /\ undef42 = 1 + 2*undef43 /\ undef44 = 1 + 2*undef45 /\ undef62 = 1 + 2*undef63 /\ undef60 = 2*undef61, {arg1 -> undef36, arg2 -> undef37, arg3 -> undef36, arg4 -> undef37, arg5 -> undef36, arg6 -> undef37, rest remain the same}>
<l0, l4, 1 <= undef123 /\ 0 <= undef36 /\ 0 <= undef37 /\ 0 <= undef42 /\ 0 <= undef44 /\ 0 <= undef81 /\ 0 <= undef82 /\ 0 <= undef83 /\ 0 <= undef85 /\ 4 <= undef124 /\ undef42 = 1 + 2*undef43 /\ undef44 = 1 + 2*undef45 /\ undef83 = 2*undef84 /\ undef85 = 2*undef86, {arg1 -> undef36, arg2 -> undef37, arg3 -> undef36, arg4 -> undef37, arg5 -> undef36, arg6 -> undef37, rest remain the same}>

Graph 3
<l0, l3, 1 <= undef123 /\ 0 <= undef7 /\ 0 <= undef8 /\ 0 <= undef9 /\ 0 <= undef11 /\ 0 <= undef15 /\ 0 <= undef19 /\ 0 <= undef20 /\ 0 <= undef22 /\ 4 <= undef124 /\ undef9 = 1 + 2*undef10 /\ undef20 = 1 + 2*undef21 /\ undef11 = 2*undef12 /\ undef22 = 2*undef23, {arg1 -> -undef19, arg2 -> -undef19, arg3 -> undef15, arg4 -> -undef19, arg5 -> undef17, arg6 -> undef18, rest remain the same}>
<l0, l3, 1 <= undef123 /\ 0 <= undef15 /\ 0 <= undef19 /\ 0 <= undef20 /\ 0 <= undef22 /\ 0 <= undef30 /\ 0 <= undef31 /\ 0 <= undef32 /\ 0 <= undef34 /\ 4 <= undef124 /\ undef20 = 1 + 2*undef21 /\ undef32 = 1 + 2*undef33 /\ undef34 = 1 + 2*undef35 /\ undef22 = 2*undef23, {arg1 -> -undef19, arg2 -> -undef19, arg3 -> undef15, arg4 -> -undef19, arg5 -> undef17, arg6 -> undef18, rest remain the same}>
<l0, l3, 1 <= undef123 /\ 0 <= undef15 /\ 0 <= undef19 /\ 0 <= undef20 /\ 0 <= undef22 /\ 0 <= undef58 /\ 0 <= undef59 /\ 0 <= undef60 /\ 0 <= undef62 /\ 4 <= undef124 /\ undef20 = 1 + 2*undef21 /\ undef62 = 1 + 2*undef63 /\ undef22 = 2*undef23 /\ undef60 = 2*undef61, {arg1 -> -undef19, arg2 -> -undef19, arg3 -> undef15, arg4 -> -undef19, arg5 -> undef17, arg6 -> undef18, rest remain the same}>
<l0, l3, 1 <= undef123 /\ 0 <= undef15 /\ 0 <= undef19 /\ 0 <= undef20 /\ 0 <= undef22 /\ 0 <= undef81 /\ 0 <= undef82 /\ 0 <= undef83 /\ 0 <= undef85 /\ 4 <= undef124 /\ undef20 = 1 + 2*undef21 /\ undef22 = 2*undef23 /\ undef83 = 2*undef84 /\ undef85 = 2*undef86, {arg1 -> -undef19, arg2 -> -undef19, arg3 -> undef15, arg4 -> -undef19, arg5 -> undef17, arg6 -> undef18, rest remain the same}>

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

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

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

Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002245s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007273s
[49575 : 49576]
[49575 : 49577]
Successful child: 49576
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, 1 + arg3 <= arg4 /\ arg1 <= 0 /\ arg3 <= 0 /\ arg3 = arg5 /\ arg4 = arg6, {arg3 -> arg1 + arg3, arg5 -> arg1 + arg3, arg6 -> arg4, 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 <= arg3 /\ arg3 = arg5 /\ arg4 = arg6, {arg4 -> arg2 + arg4, arg5 -> arg3, arg6 -> arg2 + arg4, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l5, l5, 1 + arg4 <= arg3 /\ arg3 = arg5 /\ arg4 = arg6, {arg4 -> arg2 + arg4, arg5 -> arg3, arg6 -> arg2 + arg4, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, 1 + arg3 <= arg4 /\ arg1 <= 0 /\ arg3 <= 0 /\ arg3 = arg5 /\ arg4 = arg6, {arg3 -> arg1 + arg3, arg5 -> arg1 + arg3, arg6 -> arg4, rest remain the same}>
New Graphs: 
Transitions:
<l5, l5, 1 + arg3 <= arg4 /\ arg1 <= 0 /\ arg3 <= 0 /\ arg3 = arg5 /\ arg4 = arg6, {arg3 -> arg1 + arg3, arg5 -> arg1 + arg3, arg6 -> arg4, rest remain the same}>
Variables:
arg1, arg3, arg4, arg5, arg6
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000968s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003366s
[49575 : 49581]
[49575 : 49582]
Successful child: 49581
[ 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 + arg3 <= arg4 /\ arg1 <= 0 /\ arg3 <= 0 /\ arg3 = arg5 /\ arg4 = arg6, {arg3 -> arg1 + arg3, arg5 -> arg1 + arg3, arg6 -> arg4, 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 + arg3 <= arg4 /\ arg1 <= 0 /\ arg3 <= 0 /\ arg3 = arg5 /\ arg4 = arg6, {arg3 -> arg1 + arg3, arg5 -> arg1 + arg3, arg6 -> arg4, rest remain the same}>
New Graphs: 
[49575 : 49586]
[49575 : 49587]
[49575 : 49588]
[49575 : 49589]
INVARIANTS: 
5: 
Quasi-INVARIANTS to narrow Graph: 
5: arg3 <= arg4 , 
[49575 : 49590]
[49575 : 49591]
[49575 : 49592]
[49575 : 49593]
[49575 : 49594]
[49575 : 49595]
[49575 : 49596]
[49575 : 49597]
INVARIANTS: 
5: 
Quasi-INVARIANTS to narrow Graph: 
5: arg6 <= arg1 + arg5 , 
Narrowing transition: 
<l5, l5, 1 + arg3 <= arg4 /\ arg1 <= 0 /\ arg3 <= 0 /\ arg3 = arg5 /\ arg4 = arg6, {arg3 -> arg1 + arg3, arg5 -> arg1 + arg3, arg6 -> arg4, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l5, l5, 1 + arg4 <= arg3 /\ arg3 = arg5 /\ arg4 = arg6, {arg4 -> arg2 + arg4, arg5 -> arg3, arg6 -> arg2 + arg4, rest remain the same}>

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l5, l5, 1 + arg1 + arg5 <= arg6 /\ 1 + arg3 <= arg4 /\ arg1 <= 0 /\ arg3 <= 0 /\ arg3 = arg5 /\ arg4 = arg6, {arg3 -> arg1 + arg3, arg5 -> arg1 + arg3, arg6 -> arg4, rest remain the same}>
<l5, l5, 1 + arg4 <= arg3 /\ arg6 <= arg1 + arg5 /\ arg3 = arg5 /\ arg4 = arg6, {arg4 -> arg2 + arg4, arg5 -> arg3, arg6 -> arg2 + arg4, rest remain the same}>
<l5, l5, 1 + arg1 + arg5 <= arg6 /\ 1 + arg4 <= arg3 /\ arg3 = arg5 /\ arg4 = arg6, {arg4 -> arg2 + arg4, arg5 -> arg3, arg6 -> arg2 + arg4, rest remain the same}>
Variables:
arg1, arg3, arg4, arg5, arg6, arg2
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002340s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.013553s
[49575 : 49598]
[49575 : 49599]
Successful child: 49598
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, 1 + arg1 + arg5 <= arg6 /\ 1 + arg3 <= arg4 /\ arg1 <= 0 /\ arg3 <= 0 /\ arg3 <= arg6 /\ arg3 = arg5 /\ arg4 = arg6, {arg3 -> arg1 + arg3, arg5 -> arg1 + arg3, arg6 -> arg4, 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 <= arg3 /\ arg6 <= arg1 + arg5 /\ arg3 = arg5 /\ arg4 = arg6, {arg4 -> arg2 + arg4, arg5 -> arg3, arg6 -> arg2 + arg4, 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 + arg1 + arg5 <= arg6 /\ 1 + arg4 <= arg3 /\ arg3 = arg5 /\ arg4 = arg6, {arg4 -> arg2 + arg4, arg5 -> arg3, arg6 -> arg2 + arg4, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, 1 + arg1 + arg5 <= arg6 /\ 1 + arg3 <= arg4 /\ arg1 <= 0 /\ arg3 <= 0 /\ arg3 <= arg6 /\ arg3 = arg5 /\ arg4 = arg6, {arg3 -> arg1 + arg3, arg5 -> arg1 + arg3, arg6 -> arg4, 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 <= arg3 /\ arg6 <= arg1 + arg5 /\ arg3 = arg5 /\ arg4 = arg6, {arg4 -> arg2 + arg4, arg5 -> arg3, arg6 -> arg2 + arg4, 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 + arg1 + arg5 <= arg6 /\ 1 + arg4 <= arg3 /\ arg3 = arg5 /\ arg4 = arg6, {arg4 -> arg2 + arg4, arg5 -> arg3, arg6 -> arg2 + arg4, rest remain the same}>
New Graphs: 
Transitions:
<l5, l5, 1 + arg1 + arg5 <= arg6 /\ 1 + arg3 <= arg4 /\ arg1 <= 0 /\ arg3 <= 0 /\ arg3 <= arg6 /\ arg3 = arg5 /\ arg4 = arg6, {arg3 -> arg1 + arg3, arg5 -> arg1 + arg3, arg6 -> arg4, rest remain the same}>
Variables:
arg1, arg3, arg4, arg5, arg6
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001052s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004173s
[49575 : 49615]
[49575 : 49616]
Successful child: 49615
[ 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 + arg5 <= arg6 /\ 1 + arg3 <= arg4 /\ arg1 <= 0 /\ arg3 <= 0 /\ arg3 <= arg6 /\ arg3 = arg5 /\ arg4 = arg6, {arg3 -> arg1 + arg3, arg5 -> arg1 + arg3, arg6 -> arg4, 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 + arg5 <= arg6 /\ 1 + arg3 <= arg4 /\ arg1 <= 0 /\ arg3 <= 0 /\ arg3 <= arg6 /\ arg3 = arg5 /\ arg4 = arg6, {arg3 -> arg1 + arg3, arg5 -> arg1 + arg3, arg6 -> arg4, rest remain the same}>
New Graphs: 
[49575 : 49620]
[49575 : 49621]
[49575 : 49622]
[49575 : 49623]
INVARIANTS: 
5: 
Quasi-INVARIANTS to narrow Graph: 
5: arg3 <= arg6 , 
[49575 : 49624]
[49575 : 49625]
[49575 : 49626]
[49575 : 49627]
[49575 : 49628]
[49575 : 49629]
[49575 : 49630]
[49575 : 49631]
INVARIANTS: 
5: 
Quasi-INVARIANTS to narrow Graph: 
5: arg6 <= arg5 , 
Narrowing transition: 
<l5, l5, 1 + arg1 + arg5 <= arg6 /\ 1 + arg3 <= arg4 /\ arg1 <= 0 /\ arg3 <= 0 /\ arg3 = arg5 /\ arg4 = arg6, {arg3 -> arg1 + arg3, arg5 -> arg1 + arg3, arg6 -> arg4, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l5, l5, 1 + arg4 <= arg3 /\ arg6 <= arg1 + arg5 /\ arg3 = arg5 /\ arg4 = arg6, {arg4 -> arg2 + arg4, arg5 -> arg3, arg6 -> arg2 + arg4, rest remain the same}>

LOG: Narrow transition size 2
Narrowing transition: 
<l5, l5, 1 + arg1 + arg5 <= arg6 /\ 1 + arg4 <= arg3 /\ arg3 = arg5 /\ arg4 = arg6, {arg4 -> arg2 + arg4, arg5 -> arg3, arg6 -> arg2 + arg4, rest remain the same}>

LOG: Narrow transition size 2
invGraph after Narrowing: 
Transitions:
<l5, l5, 1 + arg1 + arg5 <= arg6 /\ 1 + arg3 <= arg4 /\ 1 + arg5 <= arg6 /\ arg1 <= 0 /\ arg3 <= 0 /\ arg3 <= arg6 /\ arg3 = arg5 /\ arg4 = arg6, {arg3 -> arg1 + arg3, arg5 -> arg1 + arg3, arg6 -> arg4, rest remain the same}>
<l5, l5, 1 + arg4 <= arg3 /\ 1 + arg6 <= arg3 /\ arg6 <= arg1 + arg5 /\ arg3 = arg5 /\ arg4 = arg6, {arg4 -> arg2 + arg4, arg5 -> arg3, arg6 -> arg2 + arg4, rest remain the same}>
<l5, l5, 1 + arg1 + arg5 <= arg6 /\ 1 + arg4 <= arg3 /\ 1 + arg6 <= arg3 /\ arg3 = arg5 /\ arg4 = arg6, {arg4 -> arg2 + arg4, arg5 -> arg3, arg6 -> arg2 + arg4, rest remain the same}>
Variables:
arg1, arg3, arg4, arg5, arg6, arg2
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002721s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.015393s
[49575 : 49632]
[49575 : 49633]
Successful child: 49632
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, 1 + arg1 + arg5 <= arg6 /\ 1 + arg3 <= arg4 /\ 1 + arg5 <= arg6 /\ arg1 <= 0 /\ arg3 <= 0 /\ arg3 <= arg6 /\ arg5 <= arg4 /\ arg3 = arg5 /\ arg4 = arg6, {arg3 -> arg1 + arg3, arg5 -> arg1 + arg3, arg6 -> arg4, 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 <= arg3 /\ 1 + arg6 <= arg3 /\ arg6 <= arg1 + arg5 /\ arg3 = arg5 /\ arg4 = arg6, {arg4 -> arg2 + arg4, arg5 -> arg3, arg6 -> arg2 + arg4, 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 + arg1 + arg5 <= arg6 /\ 1 + arg4 <= arg3 /\ 1 + arg6 <= arg3 /\ arg3 = arg5 /\ arg4 = arg6, {arg4 -> arg2 + arg4, arg5 -> arg3, arg6 -> arg2 + arg4, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l5, l5, 1 + arg1 + arg5 <= arg6 /\ 1 + arg4 <= arg3 /\ 1 + arg6 <= arg3 /\ arg3 = arg5 /\ arg4 = arg6, {arg4 -> arg2 + arg4, arg5 -> arg3, arg6 -> arg2 + arg4, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l5, l5, 1 + arg1 + arg5 <= arg6 /\ 1 + arg3 <= arg4 /\ 1 + arg5 <= arg6 /\ arg1 <= 0 /\ arg3 <= 0 /\ arg3 <= arg6 /\ arg5 <= arg4 /\ arg3 = arg5 /\ arg4 = arg6, {arg3 -> arg1 + arg3, arg5 -> arg1 + arg3, arg6 -> arg4, 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 <= arg3 /\ 1 + arg6 <= arg3 /\ arg6 <= arg1 + arg5 /\ arg3 = arg5 /\ arg4 = arg6, {arg4 -> arg2 + arg4, arg5 -> arg3, arg6 -> arg2 + arg4, rest remain the same}>
New Graphs: 
Transitions:
<l5, l5, 1 + arg1 + arg5 <= arg6 /\ 1 + arg3 <= arg4 /\ 1 + arg5 <= arg6 /\ arg1 <= 0 /\ arg3 <= 0 /\ arg3 <= arg6 /\ arg5 <= arg4 /\ arg3 = arg5 /\ arg4 = arg6, {arg3 -> arg1 + arg3, arg5 -> arg1 + arg3, arg6 -> arg4, rest remain the same}>
Variables:
arg1, arg3, arg4, arg5, arg6
Checking conditional termination of SCC {l5}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001202s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004772s
[49575 : 49637]
[49575 : 49638]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.026341s
Time used: 0.025818

[49575 : 49751]
[49575 : 49755]
Successful child: 49751

Program does NOT terminate