/export/starexec/sandbox/solver/bin/starexec_run_termcomp17 /export/starexec/sandbox/benchmark/theBenchmark.smt2 /export/starexec/sandbox/output/output_files


--------------------------------------------------------------------------------


NO

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l27, true>
<l1, l2, ((1 + k1^0) <= (0 + j5^0))>
<l1, l2, ((0 + j5^0) <= (0 + k1^0)), par{l6^0 -> (0 + i3^0)}>
<l3, l1, ((1 + j5^0) <= (0 + k1^0))>
<l3, l1, ((0 + k1^0) <= (0 + j5^0)), par{ir4^0 -> (~(1) + j5^0)}>
<l4, l5, true>
<l6, l4, (1 <= (0 + flag211^0))>
<l6, l4, ((1 + flag211^0) <= 0)>
<l6, l4, ((0 + flag211^0) <= 0) /\ (0 <= (0 + flag211^0)) /\ (undef104 = undef104), par{temp9^0 -> undef104}>
<l7, l6, ((0 + i3^0) <= (0 + j5^0))>
<l7, l6, ((1 + j5^0) <= (0 + i3^0)), par{flag211^0 -> 1}>
<l2, l8, true>
<l9, l10, true, par{j5^0 -> (~(1) + j5^0)}>
<l9, l7, true>
<l11, l12, true, par{i3^0 -> (1 + i3^0)}>
<l11, l10, true, par{j5^0 -> (~(1) + j5^0)}>
<l13, l3, true>
<l14, l13, (1 <= (0 + flag211^0))>
<l14, l13, ((1 + flag211^0) <= 0)>
<l14, l12, ((0 + flag211^0) <= 0) /\ (0 <= (0 + flag211^0)), par{i3^0 -> (1 + i3^0)}>
<l5, l14, true>
<l15, l5, (undef263 = undef263), par{a8^0 -> undef263, i3^0 -> (1 + l6^0), j5^0 -> (0 + ir4^0)}>
<l16, l15, (undef286 = undef286), par{temp9^0 -> undef286}>
<l16, l15, true>
<l12, l11, true>
<l17, l16, (undef325 = undef325), par{temp9^0 -> undef325}>
<l17, l16, true>
<l18, l17, (undef351 = undef351), par{temp9^0 -> undef351}>
<l18, l17, true>
<l19, l2, (1 <= (0 + flag10^0))>
<l19, l2, ((1 + flag10^0) <= 0)>
<l19, l18, ((0 + flag10^0) <= 0) /\ (0 <= (0 + flag10^0)) /\ (undef401 = undef401) /\ (undef403 = undef403), par{mid7^0 -> undef401, temp9^0 -> undef403}>
<l10, l9, true>
<l20, l2, true, par{flag10^0 -> 1}>
<l21, l20, (undef442 = undef442), par{temp9^0 -> undef442}>
<l21, l20, true>
<l22, l20, ((2 + l6^0) <= (0 + ir4^0))>
<l22, l20, ((1 + ir4^0) <= (1 + l6^0))>
<l22, l21, ((0 + ir4^0) <= (1 + l6^0)) /\ ((1 + l6^0) <= (0 + ir4^0))>
<l23, l24, true>
<l25, l19, ((2 + l6^0) <= (0 + ir4^0))>
<l25, l22, ((0 + ir4^0) <= (1 + l6^0))>
<l8, l23, (1 <= (0 + flag10^0))>
<l8, l23, ((1 + flag10^0) <= 0)>
<l8, l25, ((0 + flag10^0) <= 0) /\ (0 <= (0 + flag10^0))>
<l26, l2, (undef584 = (0 + __const_20^0)) /\ (undef577 = 0), par{flag10^0 -> (0 + undef577), flag211^0 -> undef577, ir4^0 -> (0 + undef584), k1^0 -> (0 + __const_10^0), l6^0 -> 1, n2^0 -> undef584}>
<l27, l26, true>

Fresh variables:
undef104, undef263, undef286, undef325, undef351, undef401, undef403, undef442, undef577, undef584, 

Undef variables:
undef104, undef263, undef286, undef325, undef351, undef401, undef403, undef442, undef577, undef584, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l2, (flag10^0 = (0 + undef577)) /\ (flag211^0 = undef577) /\ (ir4^0 = (0 + undef584)) /\ (k1^0 = (0 + k1^0)) /\ (l6^0 = 1) /\ (undef584 = (0 + __const_20^0)) /\ (undef577 = 0)>
<l2, l24, (1 <= (0 + flag10^0))>
<l2, l24, ((1 + flag10^0) <= 0)>
<l2, l17, ((0 + flag10^0) <= 0) /\ (0 <= (0 + flag10^0)) /\ ((2 + l6^0) <= (0 + ir4^0)) /\ ((0 + flag10^0) <= 0) /\ (0 <= (0 + flag10^0)) /\ (undef401 = undef401) /\ (undef403 = undef403) /\ (undef351 = undef351)>
<l2, l17, ((0 + flag10^0) <= 0) /\ (0 <= (0 + flag10^0)) /\ ((2 + l6^0) <= (0 + ir4^0)) /\ ((0 + flag10^0) <= 0) /\ (0 <= (0 + flag10^0)) /\ (undef401 = undef401) /\ (undef403 = undef403)>
<l2, l2, ((0 + flag10^0) <= 0) /\ (0 <= (0 + flag10^0)) /\ ((0 + ir4^0) <= (1 + l6^0)) /\ ((1 + ir4^0) <= (1 + l6^0)), par{flag10^0 -> 1}>
<l2, l2, ((0 + flag10^0) <= 0) /\ (0 <= (0 + flag10^0)) /\ ((0 + ir4^0) <= (1 + l6^0)) /\ ((0 + ir4^0) <= (1 + l6^0)) /\ ((1 + l6^0) <= (0 + ir4^0)) /\ (undef442 = undef442), par{flag10^0 -> 1}>
<l2, l2, ((0 + flag10^0) <= 0) /\ (0 <= (0 + flag10^0)) /\ ((0 + ir4^0) <= (1 + l6^0)) /\ ((0 + ir4^0) <= (1 + l6^0)) /\ ((1 + l6^0) <= (0 + ir4^0)), par{flag10^0 -> 1}>
<l10, l10, true, par{j5^0 -> (~(1) + j5^0)}>
<l10, l2, ((0 + i3^0) <= (0 + j5^0)) /\ (1 <= (0 + flag211^0)) /\ (1 <= (0 + flag211^0)) /\ ((1 + j5^0) <= (0 + k1^0)) /\ ((0 + j5^0) <= (0 + k1^0)), par{l6^0 -> (0 + i3^0)}>
<l10, l2, ((0 + i3^0) <= (0 + j5^0)) /\ (1 <= (0 + flag211^0)) /\ (1 <= (0 + flag211^0)) /\ ((0 + k1^0) <= (0 + j5^0)) /\ ((1 + k1^0) <= (0 + j5^0)), par{ir4^0 -> (~(1) + j5^0)}>
<l10, l2, ((0 + i3^0) <= (0 + j5^0)) /\ (1 <= (0 + flag211^0)) /\ (1 <= (0 + flag211^0)) /\ ((0 + k1^0) <= (0 + j5^0)) /\ ((0 + j5^0) <= (0 + k1^0)), par{ir4^0 -> (~(1) + j5^0), l6^0 -> (0 + i3^0)}>
<l10, l2, ((0 + i3^0) <= (0 + j5^0)) /\ ((1 + flag211^0) <= 0) /\ ((1 + flag211^0) <= 0) /\ ((1 + j5^0) <= (0 + k1^0)) /\ ((0 + j5^0) <= (0 + k1^0)), par{l6^0 -> (0 + i3^0)}>
<l10, l2, ((0 + i3^0) <= (0 + j5^0)) /\ ((1 + flag211^0) <= 0) /\ ((1 + flag211^0) <= 0) /\ ((0 + k1^0) <= (0 + j5^0)) /\ ((1 + k1^0) <= (0 + j5^0)), par{ir4^0 -> (~(1) + j5^0)}>
<l10, l2, ((0 + i3^0) <= (0 + j5^0)) /\ ((1 + flag211^0) <= 0) /\ ((1 + flag211^0) <= 0) /\ ((0 + k1^0) <= (0 + j5^0)) /\ ((0 + j5^0) <= (0 + k1^0)), par{ir4^0 -> (~(1) + j5^0), l6^0 -> (0 + i3^0)}>
<l10, l12, ((0 + i3^0) <= (0 + j5^0)) /\ ((0 + flag211^0) <= 0) /\ (0 <= (0 + flag211^0)) /\ (undef104 = undef104) /\ ((0 + flag211^0) <= 0) /\ (0 <= (0 + flag211^0)), par{i3^0 -> (1 + i3^0)}>
<l10, l2, ((1 + j5^0) <= (0 + i3^0)) /\ (1 <= (0 + 1)) /\ (1 <= (0 + 1)) /\ ((1 + j5^0) <= (0 + k1^0)) /\ ((0 + j5^0) <= (0 + k1^0)), par{flag211^0 -> 1, l6^0 -> (0 + i3^0)}>
<l10, l2, ((1 + j5^0) <= (0 + i3^0)) /\ (1 <= (0 + 1)) /\ (1 <= (0 + 1)) /\ ((0 + k1^0) <= (0 + j5^0)) /\ ((1 + k1^0) <= (0 + j5^0)), par{flag211^0 -> 1, ir4^0 -> (~(1) + j5^0)}>
<l10, l2, ((1 + j5^0) <= (0 + i3^0)) /\ (1 <= (0 + 1)) /\ (1 <= (0 + 1)) /\ ((0 + k1^0) <= (0 + j5^0)) /\ ((0 + j5^0) <= (0 + k1^0)), par{flag211^0 -> 1, ir4^0 -> (~(1) + j5^0), l6^0 -> (0 + i3^0)}>
<l12, l12, true, par{i3^0 -> (1 + i3^0)}>
<l12, l10, true, par{j5^0 -> (~(1) + j5^0)}>
<l17, l2, (undef325 = undef325) /\ (undef286 = undef286) /\ (undef263 = undef263) /\ (1 <= (0 + flag211^0)) /\ ((1 + (0 + ir4^0)) <= (0 + k1^0)) /\ ((0 + (0 + ir4^0)) <= (0 + k1^0)), par{i3^0 -> (1 + l6^0), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}>
<l17, l2, (undef325 = undef325) /\ (undef286 = undef286) /\ (undef263 = undef263) /\ (1 <= (0 + flag211^0)) /\ ((0 + k1^0) <= (0 + (0 + ir4^0))) /\ ((1 + k1^0) <= (0 + (0 + ir4^0))), par{i3^0 -> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0)}>
<l17, l2, (undef325 = undef325) /\ (undef286 = undef286) /\ (undef263 = undef263) /\ (1 <= (0 + flag211^0)) /\ ((0 + k1^0) <= (0 + (0 + ir4^0))) /\ ((0 + (0 + ir4^0)) <= (0 + k1^0)), par{i3^0 -> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}>
<l17, l2, (undef325 = undef325) /\ (undef286 = undef286) /\ (undef263 = undef263) /\ ((1 + flag211^0) <= 0) /\ ((1 + (0 + ir4^0)) <= (0 + k1^0)) /\ ((0 + (0 + ir4^0)) <= (0 + k1^0)), par{i3^0 -> (1 + l6^0), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}>
<l17, l2, (undef325 = undef325) /\ (undef286 = undef286) /\ (undef263 = undef263) /\ ((1 + flag211^0) <= 0) /\ ((0 + k1^0) <= (0 + (0 + ir4^0))) /\ ((1 + k1^0) <= (0 + (0 + ir4^0))), par{i3^0 -> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0)}>
<l17, l2, (undef325 = undef325) /\ (undef286 = undef286) /\ (undef263 = undef263) /\ ((1 + flag211^0) <= 0) /\ ((0 + k1^0) <= (0 + (0 + ir4^0))) /\ ((0 + (0 + ir4^0)) <= (0 + k1^0)), par{i3^0 -> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}>
<l17, l12, (undef325 = undef325) /\ (undef286 = undef286) /\ (undef263 = undef263) /\ ((0 + flag211^0) <= 0) /\ (0 <= (0 + flag211^0)), par{i3^0 -> (1 + (1 + l6^0)), j5^0 -> (0 + ir4^0)}>
<l17, l2, (undef325 = undef325) /\ (undef263 = undef263) /\ (1 <= (0 + flag211^0)) /\ ((1 + (0 + ir4^0)) <= (0 + k1^0)) /\ ((0 + (0 + ir4^0)) <= (0 + k1^0)), par{i3^0 -> (1 + l6^0), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}>
<l17, l2, (undef325 = undef325) /\ (undef263 = undef263) /\ (1 <= (0 + flag211^0)) /\ ((0 + k1^0) <= (0 + (0 + ir4^0))) /\ ((1 + k1^0) <= (0 + (0 + ir4^0))), par{i3^0 -> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0)}>
<l17, l2, (undef325 = undef325) /\ (undef263 = undef263) /\ (1 <= (0 + flag211^0)) /\ ((0 + k1^0) <= (0 + (0 + ir4^0))) /\ ((0 + (0 + ir4^0)) <= (0 + k1^0)), par{i3^0 -> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}>
<l17, l2, (undef325 = undef325) /\ (undef263 = undef263) /\ ((1 + flag211^0) <= 0) /\ ((1 + (0 + ir4^0)) <= (0 + k1^0)) /\ ((0 + (0 + ir4^0)) <= (0 + k1^0)), par{i3^0 -> (1 + l6^0), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}>
<l17, l2, (undef325 = undef325) /\ (undef263 = undef263) /\ ((1 + flag211^0) <= 0) /\ ((0 + k1^0) <= (0 + (0 + ir4^0))) /\ ((1 + k1^0) <= (0 + (0 + ir4^0))), par{i3^0 -> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0)}>
<l17, l2, (undef325 = undef325) /\ (undef263 = undef263) /\ ((1 + flag211^0) <= 0) /\ ((0 + k1^0) <= (0 + (0 + ir4^0))) /\ ((0 + (0 + ir4^0)) <= (0 + k1^0)), par{i3^0 -> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}>
<l17, l12, (undef325 = undef325) /\ (undef263 = undef263) /\ ((0 + flag211^0) <= 0) /\ (0 <= (0 + flag211^0)), par{i3^0 -> (1 + (1 + l6^0)), j5^0 -> (0 + ir4^0)}>
<l17, l2, (undef286 = undef286) /\ (undef263 = undef263) /\ (1 <= (0 + flag211^0)) /\ ((1 + (0 + ir4^0)) <= (0 + k1^0)) /\ ((0 + (0 + ir4^0)) <= (0 + k1^0)), par{i3^0 -> (1 + l6^0), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}>
<l17, l2, (undef286 = undef286) /\ (undef263 = undef263) /\ (1 <= (0 + flag211^0)) /\ ((0 + k1^0) <= (0 + (0 + ir4^0))) /\ ((1 + k1^0) <= (0 + (0 + ir4^0))), par{i3^0 -> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0)}>
<l17, l2, (undef286 = undef286) /\ (undef263 = undef263) /\ (1 <= (0 + flag211^0)) /\ ((0 + k1^0) <= (0 + (0 + ir4^0))) /\ ((0 + (0 + ir4^0)) <= (0 + k1^0)), par{i3^0 -> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}>
<l17, l2, (undef286 = undef286) /\ (undef263 = undef263) /\ ((1 + flag211^0) <= 0) /\ ((1 + (0 + ir4^0)) <= (0 + k1^0)) /\ ((0 + (0 + ir4^0)) <= (0 + k1^0)), par{i3^0 -> (1 + l6^0), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}>
<l17, l2, (undef286 = undef286) /\ (undef263 = undef263) /\ ((1 + flag211^0) <= 0) /\ ((0 + k1^0) <= (0 + (0 + ir4^0))) /\ ((1 + k1^0) <= (0 + (0 + ir4^0))), par{i3^0 -> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0)}>
<l17, l2, (undef286 = undef286) /\ (undef263 = undef263) /\ ((1 + flag211^0) <= 0) /\ ((0 + k1^0) <= (0 + (0 + ir4^0))) /\ ((0 + (0 + ir4^0)) <= (0 + k1^0)), par{i3^0 -> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}>
<l17, l12, (undef286 = undef286) /\ (undef263 = undef263) /\ ((0 + flag211^0) <= 0) /\ (0 <= (0 + flag211^0)), par{i3^0 -> (1 + (1 + l6^0)), j5^0 -> (0 + ir4^0)}>
<l17, l2, (undef263 = undef263) /\ (1 <= (0 + flag211^0)) /\ ((1 + (0 + ir4^0)) <= (0 + k1^0)) /\ ((0 + (0 + ir4^0)) <= (0 + k1^0)), par{i3^0 -> (1 + l6^0), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}>
<l17, l2, (undef263 = undef263) /\ (1 <= (0 + flag211^0)) /\ ((0 + k1^0) <= (0 + (0 + ir4^0))) /\ ((1 + k1^0) <= (0 + (0 + ir4^0))), par{i3^0 -> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0)}>
<l17, l2, (undef263 = undef263) /\ (1 <= (0 + flag211^0)) /\ ((0 + k1^0) <= (0 + (0 + ir4^0))) /\ ((0 + (0 + ir4^0)) <= (0 + k1^0)), par{i3^0 -> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}>
<l17, l2, (undef263 = undef263) /\ ((1 + flag211^0) <= 0) /\ ((1 + (0 + ir4^0)) <= (0 + k1^0)) /\ ((0 + (0 + ir4^0)) <= (0 + k1^0)), par{i3^0 -> (1 + l6^0), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}>
<l17, l2, (undef263 = undef263) /\ ((1 + flag211^0) <= 0) /\ ((0 + k1^0) <= (0 + (0 + ir4^0))) /\ ((1 + k1^0) <= (0 + (0 + ir4^0))), par{i3^0 -> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0)}>
<l17, l2, (undef263 = undef263) /\ ((1 + flag211^0) <= 0) /\ ((0 + k1^0) <= (0 + (0 + ir4^0))) /\ ((0 + (0 + ir4^0)) <= (0 + k1^0)), par{i3^0 -> (1 + l6^0), ir4^0 -> (~(1) + (0 + ir4^0)), j5^0 -> (0 + ir4^0), l6^0 -> (0 + (1 + l6^0))}>
<l17, l12, (undef263 = undef263) /\ ((0 + flag211^0) <= 0) /\ (0 <= (0 + flag211^0)), par{i3^0 -> (1 + (1 + l6^0)), j5^0 -> (0 + ir4^0)}>

Fresh variables:
undef104, undef263, undef286, undef325, undef351, undef401, undef403, undef442, undef577, undef584, 

Undef variables:
undef104, undef263, undef286, undef325, undef351, undef401, undef403, undef442, undef577, undef584, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l2, l17, 2 + l6^0 <= ir4^0 /\ flag10^0 = 0, {all remain the same}>
<l2, l17, 2 + l6^0 <= ir4^0 /\ flag10^0 = 0, {all remain the same}>
<l2, l2, ir4^0 <= l6^0 /\ flag10^0 = 0, {flag10^0 -> 1, rest remain the same}>
<l2, l2, flag10^0 = 0 /\ ir4^0 = 1 + l6^0, {flag10^0 -> 1, rest remain the same}>
<l2, l2, flag10^0 = 0 /\ ir4^0 = 1 + l6^0, {flag10^0 -> 1, rest remain the same}>
<l10, l10, true, {j5^0 -> -1 + j5^0, rest remain the same}>
<l10, l2, 1 <= flag211^0 /\ 1 + j5^0 <= k1^0 /\ i3^0 <= j5^0, {l6^0 -> i3^0, rest remain the same}>
<l10, l2, 1 <= flag211^0 /\ 1 + k1^0 <= j5^0 /\ i3^0 <= j5^0, {ir4^0 -> -1 + j5^0, rest remain the same}>
<l10, l2, 1 <= flag211^0 /\ i3^0 <= j5^0 /\ j5^0 = k1^0, {ir4^0 -> -1 + j5^0, l6^0 -> i3^0, rest remain the same}>
<l10, l2, 1 + flag211^0 <= 0 /\ 1 + j5^0 <= k1^0 /\ i3^0 <= j5^0, {l6^0 -> i3^0, rest remain the same}>
<l10, l2, 1 + flag211^0 <= 0 /\ 1 + k1^0 <= j5^0 /\ i3^0 <= j5^0, {ir4^0 -> -1 + j5^0, rest remain the same}>
<l10, l2, 1 + flag211^0 <= 0 /\ i3^0 <= j5^0 /\ j5^0 = k1^0, {ir4^0 -> -1 + j5^0, l6^0 -> i3^0, rest remain the same}>
<l10, l12, i3^0 <= j5^0 /\ flag211^0 = 0, {i3^0 -> 1 + i3^0, rest remain the same}>
<l10, l2, 1 + j5^0 <= i3^0 /\ 1 + j5^0 <= k1^0, {flag211^0 -> 1, l6^0 -> i3^0, rest remain the same}>
<l10, l2, 1 + j5^0 <= i3^0 /\ 1 + k1^0 <= j5^0, {flag211^0 -> 1, ir4^0 -> -1 + j5^0, rest remain the same}>
<l10, l2, 1 + j5^0 <= i3^0 /\ j5^0 = k1^0, {flag211^0 -> 1, ir4^0 -> -1 + j5^0, l6^0 -> i3^0, rest remain the same}>
<l12, l12, true, {i3^0 -> 1 + i3^0, rest remain the same}>
<l12, l10, true, {j5^0 -> -1 + j5^0, rest remain the same}>
<l17, l2, 1 <= flag211^0 /\ 1 + ir4^0 <= k1^0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l17, l2, 1 <= flag211^0 /\ 1 + k1^0 <= ir4^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>
<l17, l2, 1 <= flag211^0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l17, l2, 1 + flag211^0 <= 0 /\ 1 + ir4^0 <= k1^0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l17, l2, 1 + flag211^0 <= 0 /\ 1 + k1^0 <= ir4^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>
<l17, l2, 1 + flag211^0 <= 0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
<l17, l2, 1 <= flag211^0 /\ 1 + ir4^0 <= k1^0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l17, l2, 1 <= flag211^0 /\ 1 + k1^0 <= ir4^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>
<l17, l2, 1 <= flag211^0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l17, l2, 1 + flag211^0 <= 0 /\ 1 + ir4^0 <= k1^0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l17, l2, 1 + flag211^0 <= 0 /\ 1 + k1^0 <= ir4^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>
<l17, l2, 1 + flag211^0 <= 0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
<l17, l2, 1 <= flag211^0 /\ 1 + ir4^0 <= k1^0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l17, l2, 1 <= flag211^0 /\ 1 + k1^0 <= ir4^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>
<l17, l2, 1 <= flag211^0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l17, l2, 1 + flag211^0 <= 0 /\ 1 + ir4^0 <= k1^0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l17, l2, 1 + flag211^0 <= 0 /\ 1 + k1^0 <= ir4^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>
<l17, l2, 1 + flag211^0 <= 0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
<l17, l2, 1 <= flag211^0 /\ 1 + ir4^0 <= k1^0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l17, l2, 1 <= flag211^0 /\ 1 + k1^0 <= ir4^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>
<l17, l2, 1 <= flag211^0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l17, l2, 1 + flag211^0 <= 0 /\ 1 + ir4^0 <= k1^0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l17, l2, 1 + flag211^0 <= 0 /\ 1 + k1^0 <= ir4^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>
<l17, l2, 1 + flag211^0 <= 0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
Variables:
flag10^0, ir4^0, l6^0, j5^0, flag211^0, i3^0, k1^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l2, __const_20^0 = undef584 /\ flag10^0 = undef577 /\ flag211^0 = undef577 /\ ir4^0 = undef584 /\ undef577 = 0 /\ l6^0 = 1, {all remain the same}>

Graph 2
<l2, l24, 1 <= flag10^0, {all remain the same}>
<l2, l24, 1 + flag10^0 <= 0, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 2 , 1 )
( 10 , 1 )
( 12 , 1 )
( 17 , 1 )
( 24 , 2 )

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

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 1.83976
Some transition disabled by a set of invariant(s):
Invariant at l2: 0 <= 1 + flag211^0
Invariant at l10: 0 <= flag211^0
Invariant at l12: 0 <= flag211^0
Invariant at l17: 0 <= 1 + flag211^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l10, l2, 1 + flag211^0 <= 0 /\ 1 + j5^0 <= k1^0 /\ i3^0 <= j5^0, {l6^0 -> i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l17, 0 <= 1 + flag211^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l17, 0 <= 1 + flag211^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, ir4^0 <= l6^0 /\ 0 <= 1 + flag211^0 /\ flag10^0 = 0, {flag10^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= 1 + flag211^0 /\ flag10^0 = 0 /\ ir4^0 = 1 + l6^0, {flag10^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= 1 + flag211^0 /\ flag10^0 = 0 /\ ir4^0 = 1 + l6^0, {flag10^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, 0 <= flag211^0, {j5^0 -> -1 + j5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l2, 1 <= flag211^0 /\ 1 + j5^0 <= k1^0 /\ i3^0 <= j5^0, {l6^0 -> i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l2, 1 <= flag211^0 /\ 1 + k1^0 <= j5^0 /\ i3^0 <= j5^0, {ir4^0 -> -1 + j5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l2, 1 <= flag211^0 /\ i3^0 <= j5^0 /\ j5^0 = k1^0, {ir4^0 -> -1 + j5^0, l6^0 -> i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l2, 1 + flag211^0 <= 0 /\ 1 + k1^0 <= j5^0 /\ i3^0 <= j5^0, {ir4^0 -> -1 + j5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l2, 1 + flag211^0 <= 0 /\ i3^0 <= j5^0 /\ j5^0 = k1^0, {ir4^0 -> -1 + j5^0, l6^0 -> i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l12, i3^0 <= j5^0 /\ flag211^0 = 0, {i3^0 -> 1 + i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l2, 1 + j5^0 <= i3^0 /\ 1 + j5^0 <= k1^0 /\ 0 <= flag211^0, {flag211^0 -> 1, l6^0 -> i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l2, 1 + j5^0 <= i3^0 /\ 1 + k1^0 <= j5^0 /\ 0 <= flag211^0, {flag211^0 -> 1, ir4^0 -> -1 + j5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l2, 1 + j5^0 <= i3^0 /\ 0 <= flag211^0 /\ j5^0 = k1^0, {flag211^0 -> 1, ir4^0 -> -1 + j5^0, l6^0 -> i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, 0 <= flag211^0, {i3^0 -> 1 + i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l10, 0 <= flag211^0, {j5^0 -> -1 + j5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 <= flag211^0 /\ 1 + ir4^0 <= k1^0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 <= flag211^0 /\ 1 + k1^0 <= ir4^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 <= flag211^0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + ir4^0 <= k1^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + k1^0 <= ir4^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + flag211^0 = 0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 <= flag211^0 /\ 1 + ir4^0 <= k1^0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 <= flag211^0 /\ 1 + k1^0 <= ir4^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 <= flag211^0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + ir4^0 <= k1^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + k1^0 <= ir4^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + flag211^0 = 0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 <= flag211^0 /\ 1 + ir4^0 <= k1^0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 <= flag211^0 /\ 1 + k1^0 <= ir4^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 <= flag211^0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + ir4^0 <= k1^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + k1^0 <= ir4^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + flag211^0 = 0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 <= flag211^0 /\ 1 + ir4^0 <= k1^0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 <= flag211^0 /\ 1 + k1^0 <= ir4^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 <= flag211^0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + ir4^0 <= k1^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + k1^0 <= ir4^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + flag211^0 = 0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
Checking unfeasibility...
Time used: 1.05631
Some transition disabled by a set of invariant(s):
Invariant at l2: flag211^0 <= 1
Invariant at l10: flag211^0 <= 0
Invariant at l12: flag211^0 <= 0
Invariant at l17: flag211^0 <= 1

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l10, l2, 1 <= flag211^0 /\ 1 + k1^0 <= j5^0 /\ i3^0 <= j5^0, {ir4^0 -> -1 + j5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l17, flag211^0 <= 1 /\ 0 <= 1 + flag211^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l17, flag211^0 <= 1 /\ 0 <= 1 + flag211^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, ir4^0 <= l6^0 /\ flag211^0 <= 1 /\ 0 <= 1 + flag211^0 /\ flag10^0 = 0, {flag10^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, flag211^0 <= 1 /\ 0 <= 1 + flag211^0 /\ flag10^0 = 0 /\ ir4^0 = 1 + l6^0, {flag10^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, flag211^0 <= 1 /\ 0 <= 1 + flag211^0 /\ flag10^0 = 0 /\ ir4^0 = 1 + l6^0, {flag10^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l2, 1 <= flag211^0 /\ 1 + j5^0 <= k1^0 /\ i3^0 <= j5^0, {l6^0 -> i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l2, 1 <= flag211^0 /\ i3^0 <= j5^0 /\ j5^0 = k1^0, {ir4^0 -> -1 + j5^0, l6^0 -> i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l12, i3^0 <= j5^0 /\ flag211^0 = 0, {i3^0 -> 1 + i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l2, 1 + j5^0 <= i3^0 /\ 1 + j5^0 <= k1^0 /\ flag211^0 = 0, {flag211^0 -> 1, l6^0 -> i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l2, 1 + j5^0 <= i3^0 /\ 1 + k1^0 <= j5^0 /\ flag211^0 = 0, {flag211^0 -> 1, ir4^0 -> -1 + j5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l2, 1 + j5^0 <= i3^0 /\ flag211^0 = 0 /\ j5^0 = k1^0, {flag211^0 -> 1, ir4^0 -> -1 + j5^0, l6^0 -> i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, flag211^0 = 0, {i3^0 -> 1 + i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l10, flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + ir4^0 <= k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + k1^0 <= ir4^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, ir4^0 = k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + ir4^0 <= k1^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + k1^0 <= ir4^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + flag211^0 = 0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + ir4^0 <= k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + k1^0 <= ir4^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, ir4^0 = k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + ir4^0 <= k1^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + k1^0 <= ir4^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + flag211^0 = 0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + ir4^0 <= k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + k1^0 <= ir4^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, ir4^0 = k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + ir4^0 <= k1^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + k1^0 <= ir4^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + flag211^0 = 0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + ir4^0 <= k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + k1^0 <= ir4^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, ir4^0 = k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + ir4^0 <= k1^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + k1^0 <= ir4^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + flag211^0 = 0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
Checking unfeasibility...
Time used: 1.41804
Some transition disabled by a set of invariant(s):
Invariant at l2: 0 <= flag211^0
Invariant at l10: 1 + j5^0 <= flag211^0 + ir4^0
Invariant at l12: j5^0 <= ir4^0
Invariant at l17: 0 <= flag211^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l17, l2, 1 + flag211^0 = 0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l17, 0 <= flag211^0 /\ flag211^0 <= 1 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l17, 0 <= flag211^0 /\ flag211^0 <= 1 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= flag211^0 /\ ir4^0 <= l6^0 /\ flag211^0 <= 1 /\ flag10^0 = 0, {flag10^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= flag211^0 /\ flag211^0 <= 1 /\ flag10^0 = 0 /\ ir4^0 = 1 + l6^0, {flag10^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 0 <= flag211^0 /\ flag211^0 <= 1 /\ flag10^0 = 0 /\ ir4^0 = 1 + l6^0, {flag10^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, 1 + j5^0 <= flag211^0 + ir4^0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l12, 1 + j5^0 <= flag211^0 + ir4^0 /\ i3^0 <= j5^0 /\ flag211^0 = 0, {i3^0 -> 1 + i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l2, 1 + j5^0 <= flag211^0 + ir4^0 /\ 1 + j5^0 <= i3^0 /\ 1 + j5^0 <= k1^0 /\ flag211^0 = 0, {flag211^0 -> 1, l6^0 -> i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l2, 1 + j5^0 <= flag211^0 + ir4^0 /\ 1 + j5^0 <= i3^0 /\ 1 + k1^0 <= j5^0 /\ flag211^0 = 0, {flag211^0 -> 1, ir4^0 -> -1 + j5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l2, 1 + j5^0 <= flag211^0 + ir4^0 /\ 1 + j5^0 <= i3^0 /\ flag211^0 = 0 /\ j5^0 = k1^0, {flag211^0 -> 1, ir4^0 -> -1 + j5^0, l6^0 -> i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l12, j5^0 <= ir4^0 /\ flag211^0 = 0, {i3^0 -> 1 + i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l12, l10, j5^0 <= ir4^0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + ir4^0 <= k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + k1^0 <= ir4^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, ir4^0 = k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, 1 + ir4^0 <= k1^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, 1 + k1^0 <= ir4^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, 1 + flag211^0 = 0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + ir4^0 <= k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + k1^0 <= ir4^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, ir4^0 = k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, 1 + ir4^0 <= k1^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, 1 + k1^0 <= ir4^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + ir4^0 <= k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + k1^0 <= ir4^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, ir4^0 = k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, 1 + ir4^0 <= k1^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, 1 + k1^0 <= ir4^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, 1 + flag211^0 = 0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + ir4^0 <= k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, 1 + k1^0 <= ir4^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l2, ir4^0 = k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, 1 + ir4^0 <= k1^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, 1 + k1^0 <= ir4^0 /\ 1 + flag211^0 = 0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, 1 + flag211^0 = 0 /\ ir4^0 = k1^0, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
Checking unfeasibility...
Time used: 4.10229

Checking conditional termination of SCC {l2, l10, l12, l17}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.028297s
Ranking function: 2 - flag211^0 + ir4^0 - k1^0
New Graphs: 
Transitions:
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l12, 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l12, 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l12, 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l12, 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l12, 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l12, 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l12, 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l12, 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
<l2, l2, 0 <= flag211^0 /\ ir4^0 <= l6^0 /\ flag211^0 <= 1 /\ flag10^0 = 0, {flag10^0 -> 1, rest remain the same}>
<l2, l2, 0 <= flag211^0 /\ flag211^0 <= 1 /\ flag10^0 = 0 /\ ir4^0 = 1 + l6^0, {flag10^0 -> 1, rest remain the same}>
<l2, l2, 0 <= flag211^0 /\ flag211^0 <= 1 /\ flag10^0 = 0 /\ ir4^0 = 1 + l6^0, {flag10^0 -> 1, rest remain the same}>
<l10, l10, 1 + j5^0 <= flag211^0 + ir4^0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>
<l10, l12, 1 + j5^0 <= flag211^0 + ir4^0 /\ i3^0 <= j5^0 /\ flag211^0 = 0, {i3^0 -> 1 + i3^0, rest remain the same}>
<l10, l2, 1 + j5^0 <= flag211^0 + ir4^0 /\ 1 + j5^0 <= i3^0 /\ 1 + j5^0 <= k1^0 /\ flag211^0 = 0, {flag211^0 -> 1, l6^0 -> i3^0, rest remain the same}>
<l12, l12, j5^0 <= ir4^0 /\ flag211^0 = 0, {i3^0 -> 1 + i3^0, rest remain the same}>
<l12, l10, j5^0 <= ir4^0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>
Variables:
flag10^0, flag211^0, i3^0, ir4^0, j5^0, k1^0, l6^0
Checking conditional termination of SCC {l2, l10, l12}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.021246s
Ranking function: 1 - flag10^0 - flag211^0
New Graphs: 
Transitions:
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l12, 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l12, 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l12, 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l12, 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l12, 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l12, 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l12, 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l12, 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
<l10, l10, 1 + j5^0 <= flag211^0 + ir4^0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>
<l10, l12, 1 + j5^0 <= flag211^0 + ir4^0 /\ i3^0 <= j5^0 /\ flag211^0 = 0, {i3^0 -> 1 + i3^0, rest remain the same}>
<l10, l2, 1 + j5^0 <= flag211^0 + ir4^0 /\ 1 + j5^0 <= i3^0 /\ 1 + j5^0 <= k1^0 /\ flag211^0 = 0, {flag211^0 -> 1, l6^0 -> i3^0, rest remain the same}>
<l12, l12, j5^0 <= ir4^0 /\ flag211^0 = 0, {i3^0 -> 1 + i3^0, rest remain the same}>
<l12, l10, j5^0 <= ir4^0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>
Variables:
flag10^0, flag211^0, i3^0, ir4^0, j5^0, k1^0, l6^0
Checking conditional termination of SCC {l2, l10, l12}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.018792s
Ranking function: 1 - flag211^0
New Graphs: 
Transitions:
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
<l2, l2, 1 + ir4^0 <= k1^0 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>
Variables:
flag10^0, flag211^0, i3^0, ir4^0, j5^0, k1^0, l6^0
Transitions:
<l10, l10, 1 + j5^0 <= flag211^0 + ir4^0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>
<l10, l12, 1 + j5^0 <= flag211^0 + ir4^0 /\ i3^0 <= j5^0 /\ flag211^0 = 0, {i3^0 -> 1 + i3^0, rest remain the same}>
<l12, l12, j5^0 <= ir4^0 /\ flag211^0 = 0, {i3^0 -> 1 + i3^0, rest remain the same}>
<l12, l10, j5^0 <= ir4^0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>
Variables:
flag211^0, i3^0, ir4^0, j5^0
Checking conditional termination of SCC {l2}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008480s
Ranking function: -2 - flag10^0 - flag211^0 + (3 / 2)*ir4^0 + (~(3) / 2)*l6^0
New Graphs: 
Transitions:
<l10, l10, 1 + j5^0 <= flag211^0 + ir4^0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>
<l10, l12, 1 + j5^0 <= flag211^0 + ir4^0 /\ i3^0 <= j5^0 /\ flag211^0 = 0, {i3^0 -> 1 + i3^0, rest remain the same}>
<l12, l12, j5^0 <= ir4^0 /\ flag211^0 = 0, {i3^0 -> 1 + i3^0, rest remain the same}>
<l12, l10, j5^0 <= ir4^0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>
Variables:
flag211^0, i3^0, ir4^0, j5^0
Checking conditional termination of SCC {l10, l12}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003509s
Ranking function: -1 - flag211^0 - i3^0 + ir4^0
New Graphs: 
Transitions:
<l12, l12, j5^0 <= ir4^0 /\ flag211^0 = 0, {i3^0 -> 1 + i3^0, rest remain the same}>
Variables:
flag211^0, i3^0, ir4^0, j5^0
Transitions:
<l10, l10, 1 + j5^0 <= flag211^0 + ir4^0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>
Variables:
flag211^0, ir4^0, j5^0
Checking conditional termination of SCC {l12}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000945s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002500s
[14496 : 14605]
[14496 : 14606]
Successful child: 14605
[ 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: 
<l2, l17, 0 <= flag211^0 /\ flag211^0 <= 1 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l17, 0 <= flag211^0 /\ flag211^0 <= 1 /\ 2 + l6^0 <= ir4^0 /\ flag10^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, flag211^0 + ir4^0 <= l6^0 /\ 0 <= flag211^0 /\ ir4^0 <= l6^0 /\ flag211^0 <= 1 /\ flag10^0 = 0, {flag10^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 0 <= flag211^0 /\ flag211^0 <= 1 /\ flag10^0 = 0 /\ ir4^0 = 1 + l6^0, {flag10^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l2, l2, 0 <= flag211^0 /\ flag211^0 <= 1 /\ flag10^0 = 0 /\ ir4^0 = 1 + l6^0, {flag10^0 -> 1, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l10, 1 + j5^0 <= flag211^0 + ir4^0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l12, 1 + j5^0 <= flag211^0 + ir4^0 /\ i3^0 <= j5^0 /\ flag211^0 = 0, {i3^0 -> 1 + i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l2, 1 + j5^0 <= flag211^0 + ir4^0 /\ 1 + j5^0 <= i3^0 /\ 1 + j5^0 <= k1^0 /\ flag211^0 = 0, {flag211^0 -> 1, l6^0 -> i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l2, 1 + j5^0 <= flag211^0 + ir4^0 /\ 1 + j5^0 <= i3^0 /\ 1 + k1^0 <= j5^0 /\ flag211^0 = 0, {flag211^0 -> 1, ir4^0 -> -1 + j5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l10, l2, 1 + j5^0 <= flag211^0 + ir4^0 /\ 1 + j5^0 <= i3^0 /\ flag211^0 = 0 /\ j5^0 = k1^0, {flag211^0 -> 1, ir4^0 -> -1 + j5^0, l6^0 -> i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l12, l12, j5^0 <= ir4^0 /\ flag211^0 = 0, {i3^0 -> 1 + i3^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l12, l10, j5^0 <= ir4^0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, 1 + ir4^0 <= k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, 1 + k1^0 <= ir4^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, ir4^0 = k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, 1 + ir4^0 <= k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, 1 + k1^0 <= ir4^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, ir4^0 = k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, 1 + ir4^0 <= k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, 1 + k1^0 <= ir4^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, ir4^0 = k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, 1 + ir4^0 <= k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, 1 + k1^0 <= ir4^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l2, ir4^0 = k1^0 /\ flag211^0 = 1, {i3^0 -> 1 + l6^0, ir4^0 -> -1 + ir4^0, j5^0 -> ir4^0, l6^0 -> 1 + l6^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l17, l12, flag211^0 = 0, {i3^0 -> 2 + l6^0, j5^0 -> ir4^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l12, l12, j5^0 <= ir4^0 /\ flag211^0 = 0, {i3^0 -> 1 + i3^0, rest remain the same}>
New Graphs: 
Transitions:
<l10, l10, 1 + j5^0 <= flag211^0 + ir4^0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>
Variables:
flag211^0, ir4^0, j5^0
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000669s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002428s
[14496 : 14610]
[14496 : 14611]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010080s
Time used: 0.010077

LOG: SAT solveNonLinear - Elapsed time: 0.024175s
Cost: 1; Total time: 0.023397
Termination implied by a set of invariant(s):
Invariant at l2: 1 <= flag10^0 + flag211^0 + l6^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 <= flag10^0 + flag211^0 + l6^0 /\ flag211^0 + ir4^0 <= l6^0 /\ 0 <= flag211^0 /\ ir4^0 <= l6^0 /\ flag211^0 <= 1 /\ flag10^0 = 0, {flag10^0 -> 1, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
Quasi-ranking function: 50000 - ir4^0 + j5^0
New Graphs: 
Transitions:
<l10, l10, 1 + j5^0 <= flag211^0 + ir4^0 /\ 50001 + j5^0 <= ir4^0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>
Variables:
flag211^0, ir4^0, j5^0
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000766s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002792s
[14496 : 14615]
[14496 : 14616]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010315s
Time used: 0.010267

LOG: SAT solveNonLinear - Elapsed time: 0.025823s
Cost: 1; Total time: 0.024885
Termination implied by a set of invariant(s):
Invariant at l2: 1 + flag211^0 <= flag10^0 + l6^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + flag211^0 <= flag10^0 + l6^0 /\ 1 <= flag10^0 + flag211^0 + l6^0 /\ flag211^0 + ir4^0 <= l6^0 /\ 0 <= flag211^0 /\ ir4^0 <= l6^0 /\ flag211^0 <= 1 /\ flag10^0 = 0, {flag10^0 -> 1, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
Quasi-ranking function: 50000 + flag211^0 - ir4^0 + j5^0
New Graphs: 
Transitions:
<l10, l10, 1 + j5^0 <= flag211^0 + ir4^0 /\ 50001 + flag211^0 + j5^0 <= ir4^0 /\ 50001 + j5^0 <= ir4^0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>
Variables:
flag211^0, ir4^0, j5^0
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000861s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003214s
[14496 : 14620]
[14496 : 14621]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.009323s
Time used: 0.00928

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + flag211^0 <= flag10^0 + l6^0 /\ 1 <= flag10^0 + flag211^0 + l6^0 /\ flag211^0 + ir4^0 <= l6^0 /\ 0 <= flag211^0 /\ ir4^0 <= l6^0 /\ 0 <= 1 + flag10^0 + flag211^0 /\ flag211^0 <= 1 /\ flag10^0 = 0, {flag10^0 -> 1, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
Quasi-ranking function: 50000 - flag211^0 - ir4^0 + j5^0
New Graphs: 
Transitions:
<l10, l10, 50001 + flag211^0 + j5^0 <= ir4^0 /\ 50001 + j5^0 <= flag211^0 + ir4^0 /\ 50001 + j5^0 <= ir4^0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>
Variables:
flag211^0, ir4^0, j5^0
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000869s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003280s
[14496 : 14625]
[14496 : 14626]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.011644s
Time used: 0.01164

LOG: SAT solveNonLinear - Elapsed time: 0.026976s
Cost: 1; Total time: 0.026008
Termination implied by a set of invariant(s):
Invariant at l2: 0 <= flag10^0 + flag211^0 + l6^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + flag211^0 <= flag10^0 + l6^0 /\ 1 <= flag10^0 + flag211^0 + l6^0 /\ flag211^0 + ir4^0 <= l6^0 /\ 0 <= flag211^0 /\ ir4^0 <= l6^0 /\ 0 <= 1 + flag10^0 + flag211^0 /\ flag211^0 <= 1 /\ flag10^0 = 0, {flag10^0 -> 1, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
Quasi-ranking function: 50000 + flag211^0 + j5^0
New Graphs: 
Transitions:
<l10, l10, 50001 + flag211^0 + j5^0 <= ir4^0 /\ 50001 + flag211^0 + j5^0 <= 0 /\ 50001 + j5^0 <= flag211^0 + ir4^0 /\ 50001 + j5^0 <= ir4^0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>
Variables:
flag211^0, ir4^0, j5^0
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.000974s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003782s
[14496 : 14630]
[14496 : 14631]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012521s
Time used: 0.01248

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + flag211^0 <= flag10^0 + l6^0 /\ 1 <= flag10^0 + flag211^0 + l6^0 /\ flag211^0 + ir4^0 <= l6^0 /\ 0 <= flag211^0 /\ ir4^0 <= l6^0 /\ 0 <= 1 + flag10^0 + flag211^0 /\ 0 <= 1 + flag10^0 + l6^0 /\ flag211^0 <= 1 /\ flag10^0 = 0, {flag10^0 -> 1, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
Quasi-ranking function: 50000 - flag211^0 + j5^0
New Graphs: 
Transitions:
<l10, l10, 50001 + flag211^0 + j5^0 <= ir4^0 /\ 50001 + flag211^0 + j5^0 <= 0 /\ 50001 + j5^0 <= flag211^0 + ir4^0 /\ 50001 + j5^0 <= flag211^0 /\ 50001 + j5^0 <= ir4^0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>
Variables:
flag211^0, ir4^0, j5^0
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001068s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004114s
[14496 : 14635]
[14496 : 14636]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.008855s
Time used: 0.008851

LOG: SAT solveNonLinear - Elapsed time: 0.025528s
Cost: 1; Total time: 0.024501
Quasi-ranking function: 50000 + j5^0
New Graphs: 
Transitions:
<l10, l10, 50001 + flag211^0 + j5^0 <= ir4^0 /\ 50001 + flag211^0 + j5^0 <= 0 /\ 50001 + j5^0 <= flag211^0 + ir4^0 /\ 50001 + j5^0 <= flag211^0 /\ 50001 + j5^0 <= ir4^0 /\ 50001 + j5^0 <= 0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>
Variables:
flag211^0, ir4^0, j5^0
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001132s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004560s
[14496 : 14640]
[14496 : 14641]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.010653s
Time used: 0.01065

LOG: SAT solveNonLinear - Elapsed time: 0.027552s
Cost: 1; Total time: 0.026424
Termination implied by a set of invariant(s):
Invariant at l2: flag10^0 + flag211^0 <= l6^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + flag211^0 <= flag10^0 + l6^0 /\ 1 <= flag10^0 + flag211^0 + l6^0 /\ flag10^0 + flag211^0 <= l6^0 /\ flag211^0 + ir4^0 <= l6^0 /\ 0 <= flag211^0 /\ ir4^0 <= l6^0 /\ 0 <= 1 + flag10^0 + flag211^0 /\ 0 <= 1 + flag10^0 + l6^0 /\ flag211^0 <= 1 /\ flag10^0 = 0, {flag10^0 -> 1, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
Quasi-ranking function: 50000 + flag211^0 + ir4^0 + j5^0
New Graphs: 
Transitions:
<l10, l10, 50001 + flag211^0 + ir4^0 + j5^0 <= 0 /\ 50001 + flag211^0 + j5^0 <= ir4^0 /\ 50001 + flag211^0 + j5^0 <= 0 /\ 50001 + j5^0 <= flag211^0 + ir4^0 /\ 50001 + j5^0 <= flag211^0 /\ 50001 + j5^0 <= ir4^0 /\ 50001 + j5^0 <= 0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>
Variables:
flag211^0, ir4^0, j5^0
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001236s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004773s
[14496 : 14645]
[14496 : 14646]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012914s
Time used: 0.012882

LOG: SAT solveNonLinear - Elapsed time: 0.029226s
Cost: 1; Total time: 0.027979
Termination implied by a set of invariant(s):
Invariant at l2: 0 <= flag10^0 + flag211^0 + l6^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + flag211^0 <= flag10^0 + l6^0 /\ 1 <= flag10^0 + flag211^0 + l6^0 /\ flag10^0 + flag211^0 <= l6^0 /\ flag211^0 + ir4^0 <= l6^0 /\ 0 <= flag211^0 /\ ir4^0 <= l6^0 /\ 0 <= 1 + flag10^0 + flag211^0 /\ 0 <= 1 + flag10^0 + l6^0 /\ flag211^0 <= 1 /\ flag10^0 = 0, {flag10^0 -> 1, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
Quasi-ranking function: 50000 - flag211^0 + ir4^0 + j5^0
New Graphs: 
Transitions:
<l10, l10, 50001 + flag211^0 + ir4^0 + j5^0 <= 0 /\ 50001 + flag211^0 + j5^0 <= ir4^0 /\ 50001 + flag211^0 + j5^0 <= 0 /\ 50001 + ir4^0 + j5^0 <= flag211^0 /\ 50001 + j5^0 <= flag211^0 + ir4^0 /\ 50001 + j5^0 <= flag211^0 /\ 50001 + j5^0 <= ir4^0 /\ 50001 + j5^0 <= 0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>
Variables:
flag211^0, ir4^0, j5^0
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001345s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005460s
[14496 : 14650]
[14496 : 14651]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.012420s
Time used: 0.012392

LOG: SAT solveNonLinear - Elapsed time: 0.029611s
Cost: 1; Total time: 0.028444
Termination implied by a set of invariant(s):
Invariant at l2: flag10^0 + flag211^0 <= l6^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l2, l2, 1 + flag211^0 <= flag10^0 + l6^0 /\ 1 <= flag10^0 + flag211^0 + l6^0 /\ flag10^0 + flag211^0 <= l6^0 /\ flag211^0 + ir4^0 <= l6^0 /\ 0 <= flag211^0 /\ ir4^0 <= l6^0 /\ 0 <= 1 + flag10^0 + flag211^0 /\ 0 <= 1 + flag10^0 + l6^0 /\ flag211^0 <= 1 /\ flag10^0 = 0, {flag10^0 -> 1, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
Quasi-ranking function: 50000 + ir4^0 + j5^0
New Graphs: 
Transitions:
<l10, l10, 50001 + flag211^0 + ir4^0 + j5^0 <= 0 /\ 50001 + flag211^0 + j5^0 <= ir4^0 /\ 50001 + flag211^0 + j5^0 <= 0 /\ 50001 + ir4^0 + j5^0 <= flag211^0 /\ 50001 + j5^0 <= flag211^0 + ir4^0 /\ 50001 + j5^0 <= flag211^0 /\ 50001 + ir4^0 + j5^0 <= 0 /\ 50001 + j5^0 <= ir4^0 /\ 50001 + j5^0 <= 0 /\ flag211^0 = 0, {j5^0 -> -1 + j5^0, rest remain the same}>
Variables:
flag211^0, ir4^0, j5^0
Checking conditional termination of SCC {l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001430s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005742s
[14496 : 14655]
[14496 : 14656]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

LOG: RETURN solveNonLinearGetFirstSolution - Elapsed time: 0.013612s
Time used: 0.012635
Termination failed. Trying to show unreachability...
Proving unreachability of entry: <l0, l2, __const_20^0 = undef584 /\ flag10^0 = undef577 /\ flag211^0 = undef577 /\ ir4^0 = undef584 /\ undef577 = 0 /\ l6^0 = 1, {all remain the same}>

LOG: CALL check - Post:1 <= 0 - Process 1
* Exit transition: <l0, l2, __const_20^0 = undef584 /\ flag10^0 = undef577 /\ flag211^0 = undef577 /\ ir4^0 = undef584 /\ undef577 = 0 /\ l6^0 = 1, {all remain the same}>
* Postcondition  : 1 <= 0

LOG: CALL solveLinear

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

LOG: RETURN check - Elapsed time: 0.004358s
Cannot prove unreachability

[14496 : 14660]
[14496 : 14663]
Successful child: 14663

Program does NOT terminate