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


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


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l59, true>
<l1, l2, ((0 + n^0) <= (0 + ni^0))>
<l1, l3, ((1 + ni^0) <= (0 + n^0)), par{nj^0 -> 0}>
<l4, l5, true>
<l6, l7, true, par{bCols^0 -> (0 + tmp___3^0), ni2^0 -> (1 + ni2^0)}>
<l8, l6, true, par{tmp___3^0 -> 1}>
<l9, l8, true>
<l9, l6, true, par{tmp___3^0 -> 0}>
<l9, l8, true>
<l10, l6, ((0 + bCols^0) <= 0) /\ (0 <= (0 + bCols^0)), par{tmp___3^0 -> 0}>
<l10, l9, (1 <= (0 + bCols^0))>
<l10, l9, ((1 + bCols^0) <= 0)>
<l11, l4, ((0 + n2^0) <= (0 + ni2^0)), par{ni1^0 -> (1 + ni1^0)}>
<l11, l10, ((1 + ni2^0) <= (0 + n2^0))>
<l5, l12, ((~(1) + n2^0) <= (0 + ni1^0)), par{nj^0 -> (1 + nj^0)}>
<l5, l7, ((1 + ni1^0) <= (~(1) + n2^0)), par{ni2^0 -> (1 + ni1^0)}>
<l7, l11, true>
<l13, l14, ((0 + n2^0) <= (0 + nj^0)), par{ni^0 -> 0}>
<l13, l4, ((1 + nj^0) <= (0 + n2^0)), par{ni1^0 -> 0}>
<l14, l1, true>
<l15, l16, true, par{bRows^0 -> (0 + tmp___2^0), nj2^0 -> (1 + nj2^0)}>
<l17, l15, true, par{tmp___2^0 -> 1}>
<l18, l17, true>
<l18, l15, true, par{tmp___2^0 -> 0}>
<l18, l17, true>
<l19, l15, ((0 + bRows^0) <= 0) /\ (0 <= (0 + bRows^0)), par{tmp___2^0 -> 0}>
<l19, l18, (1 <= (0 + bRows^0))>
<l19, l18, ((1 + bRows^0) <= 0)>
<l20, l21, ((0 + n2^0) <= (0 + nj2^0)), par{nj1^0 -> (1 + nj1^0)}>
<l20, l19, ((1 + nj2^0) <= (0 + n2^0))>
<l3, l22, true>
<l23, l24, ((~(1) + n2^0) <= (0 + nj1^0)), par{ni^0 -> (1 + ni^0)}>
<l23, l16, ((1 + nj1^0) <= (~(1) + n2^0)), par{nj2^0 -> (1 + nj1^0)}>
<l25, l12, ((0 + n2^0) <= (0 + ni^0)), par{nj^0 -> 0}>
<l25, l21, ((1 + ni^0) <= (0 + n2^0)), par{nj1^0 -> 0}>
<l26, l27, true>
<l28, l29, true, par{bDomain^0 -> (0 + tmp___1^0), nj^0 -> (1 + nj^0)}>
<l30, l28, true, par{tmp___1^0 -> 0}>
<l30, l28, true, par{tmp___1^0 -> 1}>
<l31, l28, true, par{tmp___1^0 -> 0}>
<l31, l30, true>
<l32, l28, ((0 + bDomain^0) <= 0) /\ (0 <= (0 + bDomain^0)), par{tmp___1^0 -> 0}>
<l32, l31, (1 <= (0 + bDomain^0))>
<l32, l31, ((1 + bDomain^0) <= 0)>
<l33, l34, ((0 + n2^0) <= (0 + nj^0)), par{ni^0 -> (1 + ni^0)}>
<l33, l32, ((1 + nj^0) <= (0 + n2^0))>
<l35, l36, true>
<l37, l24, ((0 + n2^0) <= (0 + ni^0)), par{ni^0 -> 0}>
<l37, l29, ((1 + ni^0) <= (0 + n2^0)), par{nj^0 -> 0}>
<l38, l39, true>
<l40, l41, ((0 + n2^0) <= (0 + nj^0)), par{ni^0 -> (1 + ni^0)}>
<l40, l42, ((1 + nj^0) <= (0 + n2^0)) /\ (undef1168 = undef1168), par{nj^0 -> (1 + nj^0), tmp___0^0 -> undef1168}>
<l43, l34, ((0 + n2^0) <= (0 + ni^0)), par{ni^0 -> 0}>
<l43, l42, ((1 + ni^0) <= (0 + n2^0)), par{nj^0 -> 0}>
<l44, l45, true>
<l41, l43, true>
<l42, l40, true>
<l34, l37, true>
<l29, l33, true>
<l46, l47, true>
<l48, l46, true, par{tmp___5^0 -> 0}>
<l49, l46, ((0 + bSquares^0) <= 0) /\ (0 <= (0 + bSquares^0)), par{tmp___5^0 -> 1}>
<l49, l48, (1 <= (0 + bSquares^0))>
<l49, l48, ((1 + bSquares^0) <= 0)>
<l50, l46, ((0 + bCols^0) <= 0) /\ (0 <= (0 + bCols^0)), par{tmp___5^0 -> 1}>
<l50, l49, (1 <= (0 + bCols^0))>
<l50, l49, ((1 + bCols^0) <= 0)>
<l51, l46, ((0 + bRows^0) <= 0) /\ (0 <= (0 + bRows^0)), par{tmp___5^0 -> 1}>
<l51, l50, (1 <= (0 + bRows^0))>
<l51, l50, ((1 + bRows^0) <= 0)>
<l2, l46, ((0 + bDomain^0) <= 0) /\ (0 <= (0 + bDomain^0)), par{tmp___5^0 -> 1}>
<l2, l51, (1 <= (0 + bDomain^0))>
<l2, l51, ((1 + bDomain^0) <= 0)>
<l24, l25, true>
<l52, l44, true, par{nl2^0 -> (1 + nl2^0)}>
<l21, l23, true>
<l53, l52, true, par{bSquares^0 -> (0 + tmp___4^0)}>
<l54, l53, true, par{tmp___4^0 -> 1}>
<l55, l54, true>
<l55, l53, true, par{tmp___4^0 -> 0}>
<l55, l54, true>
<l56, l53, ((0 + bSquares^0) <= 0) /\ (0 <= (0 + bSquares^0)), par{tmp___4^0 -> 0}>
<l56, l55, (1 <= (0 + bSquares^0))>
<l56, l55, ((1 + bSquares^0) <= 0)>
<l57, l52, true>
<l57, l56, true>
<l45, l38, ((0 + n^0) <= (0 + nl2^0)), par{nk2^0 -> (1 + nk2^0)}>
<l45, l57, ((1 + nl2^0) <= (0 + n^0))>
<l39, l35, ((0 + n^0) <= (0 + nk2^0)), par{nl1^0 -> (1 + nl1^0)}>
<l39, l44, ((1 + nk2^0) <= (0 + n^0)), par{nl2^0 -> 0}>
<l16, l20, true>
<l36, l26, ((0 + n^0) <= (0 + nl1^0)), par{nk1^0 -> (1 + nk1^0)}>
<l36, l38, ((1 + nl1^0) <= (0 + n^0)), par{nk2^0 -> 0}>
<l27, l3, ((0 + n^0) <= (0 + nk1^0)), par{nj^0 -> (1 + nj^0)}>
<l27, l35, ((1 + nk1^0) <= (0 + n^0)), par{nl1^0 -> 0}>
<l22, l14, ((0 + n^0) <= (0 + nj^0)), par{ni^0 -> (1 + ni^0)}>
<l22, l26, ((1 + nj^0) <= (0 + n^0)), par{nk1^0 -> 0}>
<l12, l13, true>
<l58, l41, (undef2236 = undef2236) /\ (undef2248 = undef2248), par{bCols^0 -> 1, bDomain^0 -> 1, bRows^0 -> 1, bSquares^0 -> 1, n2^0 -> undef2236, n^0 -> 3, ni^0 -> 0, tmp^0 -> undef2248}>
<l59, l58, true>

Fresh variables:
undef1168, undef2236, undef2248, 

Undef variables:
undef1168, undef2236, undef2248, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l24, (bCols^0 = 1) /\ (bDomain^0 = 1) /\ (bRows^0 = 1) /\ (bSquares^0 = 1) /\ (n2^0 = undef2236) /\ (3 = 3) /\ (ni^0 = 0) /\ (undef2236 = undef2236) /\ (undef2248 = undef2248) /\ ((0 + undef2236) <= (0 + 0)) /\ ((0 + undef2236) <= (0 + 0))>
<l0, l42, (bCols^0 = 1) /\ (bDomain^0 = 1) /\ (bRows^0 = 1) /\ (bSquares^0 = 1) /\ (n2^0 = undef2236) /\ (3 = 3) /\ (ni^0 = 0) /\ (undef2236 = undef2236) /\ (undef2248 = undef2248) /\ ((1 + 0) <= (0 + undef2236)), par{nj^0 -> 0}>
<l7, l12, ((0 + n2^0) <= (0 + ni2^0)) /\ ((~(1) + n2^0) <= (0 + (1 + ni1^0))), par{ni1^0 -> (1 + ni1^0), nj^0 -> (1 + nj^0)}>
<l7, l7, ((0 + n2^0) <= (0 + ni2^0)) /\ ((1 + (1 + ni1^0)) <= (~(1) + n2^0)), par{ni1^0 -> (1 + ni1^0), ni2^0 -> (1 + (1 + ni1^0))}>
<l7, l7, ((1 + ni2^0) <= (0 + n2^0)) /\ ((0 + bCols^0) <= 0) /\ (0 <= (0 + bCols^0)), par{bCols^0 -> (0 + 0), ni2^0 -> (1 + ni2^0)}>
<l7, l7, ((1 + ni2^0) <= (0 + n2^0)) /\ (1 <= (0 + bCols^0)), par{bCols^0 -> (0 + 1), ni2^0 -> (1 + ni2^0)}>
<l7, l7, ((1 + ni2^0) <= (0 + n2^0)) /\ (1 <= (0 + bCols^0)), par{bCols^0 -> (0 + 0), ni2^0 -> (1 + ni2^0)}>
<l7, l7, ((1 + ni2^0) <= (0 + n2^0)) /\ (1 <= (0 + bCols^0)), par{bCols^0 -> (0 + 1), ni2^0 -> (1 + ni2^0)}>
<l7, l7, ((1 + ni2^0) <= (0 + n2^0)) /\ ((1 + bCols^0) <= 0), par{bCols^0 -> (0 + 1), ni2^0 -> (1 + ni2^0)}>
<l7, l7, ((1 + ni2^0) <= (0 + n2^0)) /\ ((1 + bCols^0) <= 0), par{bCols^0 -> (0 + 0), ni2^0 -> (1 + ni2^0)}>
<l7, l7, ((1 + ni2^0) <= (0 + n2^0)) /\ ((1 + bCols^0) <= 0), par{bCols^0 -> (0 + 1), ni2^0 -> (1 + ni2^0)}>
<l12, l26, ((0 + n2^0) <= (0 + nj^0)) /\ ((1 + 0) <= (0 + 3)) /\ ((1 + 0) <= (0 + 3)), par{ni^0 -> 0, nj^0 -> 0, nk1^0 -> 0}>
<l12, l12, ((1 + nj^0) <= (0 + n2^0)) /\ ((~(1) + n2^0) <= (0 + 0)), par{ni1^0 -> 0, nj^0 -> (1 + nj^0)}>
<l12, l7, ((1 + nj^0) <= (0 + n2^0)) /\ ((1 + 0) <= (~(1) + n2^0)), par{ni1^0 -> 0, ni2^0 -> (1 + 0)}>
<l16, l24, ((0 + n2^0) <= (0 + nj2^0)) /\ ((~(1) + n2^0) <= (0 + (1 + nj1^0))), par{ni^0 -> (1 + ni^0), nj1^0 -> (1 + nj1^0)}>
<l16, l16, ((0 + n2^0) <= (0 + nj2^0)) /\ ((1 + (1 + nj1^0)) <= (~(1) + n2^0)), par{nj1^0 -> (1 + nj1^0), nj2^0 -> (1 + (1 + nj1^0))}>
<l16, l16, ((1 + nj2^0) <= (0 + n2^0)) /\ ((0 + bRows^0) <= 0) /\ (0 <= (0 + bRows^0)), par{bRows^0 -> (0 + 0), nj2^0 -> (1 + nj2^0)}>
<l16, l16, ((1 + nj2^0) <= (0 + n2^0)) /\ (1 <= (0 + bRows^0)), par{bRows^0 -> (0 + 1), nj2^0 -> (1 + nj2^0)}>
<l16, l16, ((1 + nj2^0) <= (0 + n2^0)) /\ (1 <= (0 + bRows^0)), par{bRows^0 -> (0 + 0), nj2^0 -> (1 + nj2^0)}>
<l16, l16, ((1 + nj2^0) <= (0 + n2^0)) /\ (1 <= (0 + bRows^0)), par{bRows^0 -> (0 + 1), nj2^0 -> (1 + nj2^0)}>
<l16, l16, ((1 + nj2^0) <= (0 + n2^0)) /\ ((1 + bRows^0) <= 0), par{bRows^0 -> (0 + 1), nj2^0 -> (1 + nj2^0)}>
<l16, l16, ((1 + nj2^0) <= (0 + n2^0)) /\ ((1 + bRows^0) <= 0), par{bRows^0 -> (0 + 0), nj2^0 -> (1 + nj2^0)}>
<l16, l16, ((1 + nj2^0) <= (0 + n2^0)) /\ ((1 + bRows^0) <= 0), par{bRows^0 -> (0 + 1), nj2^0 -> (1 + nj2^0)}>
<l24, l12, ((0 + n2^0) <= (0 + ni^0)), par{nj^0 -> 0}>
<l24, l24, ((1 + ni^0) <= (0 + n2^0)) /\ ((~(1) + n2^0) <= (0 + 0)), par{ni^0 -> (1 + ni^0), nj1^0 -> 0}>
<l24, l16, ((1 + ni^0) <= (0 + n2^0)) /\ ((1 + 0) <= (~(1) + n2^0)), par{nj1^0 -> 0, nj2^0 -> (1 + 0)}>
<l26, l47, ((0 + 3) <= (0 + nk1^0)) /\ ((0 + 3) <= (0 + (1 + nj^0))) /\ ((0 + 3) <= (0 + (1 + ni^0))) /\ ((0 + bDomain^0) <= 0) /\ (0 <= (0 + bDomain^0)), par{ni^0 -> (1 + ni^0), nj^0 -> (1 + nj^0)}>
<l26, l47, ((0 + 3) <= (0 + nk1^0)) /\ ((0 + 3) <= (0 + (1 + nj^0))) /\ ((0 + 3) <= (0 + (1 + ni^0))) /\ (1 <= (0 + bDomain^0)) /\ ((0 + bRows^0) <= 0) /\ (0 <= (0 + bRows^0)), par{ni^0 -> (1 + ni^0), nj^0 -> (1 + nj^0)}>
<l26, l50, ((0 + 3) <= (0 + nk1^0)) /\ ((0 + 3) <= (0 + (1 + nj^0))) /\ ((0 + 3) <= (0 + (1 + ni^0))) /\ (1 <= (0 + bDomain^0)) /\ (1 <= (0 + bRows^0)), par{ni^0 -> (1 + ni^0), nj^0 -> (1 + nj^0)}>
<l26, l50, ((0 + 3) <= (0 + nk1^0)) /\ ((0 + 3) <= (0 + (1 + nj^0))) /\ ((0 + 3) <= (0 + (1 + ni^0))) /\ (1 <= (0 + bDomain^0)) /\ ((1 + bRows^0) <= 0), par{ni^0 -> (1 + ni^0), nj^0 -> (1 + nj^0)}>
<l26, l47, ((0 + 3) <= (0 + nk1^0)) /\ ((0 + 3) <= (0 + (1 + nj^0))) /\ ((0 + 3) <= (0 + (1 + ni^0))) /\ ((1 + bDomain^0) <= 0) /\ ((0 + bRows^0) <= 0) /\ (0 <= (0 + bRows^0)), par{ni^0 -> (1 + ni^0), nj^0 -> (1 + nj^0)}>
<l26, l50, ((0 + 3) <= (0 + nk1^0)) /\ ((0 + 3) <= (0 + (1 + nj^0))) /\ ((0 + 3) <= (0 + (1 + ni^0))) /\ ((1 + bDomain^0) <= 0) /\ (1 <= (0 + bRows^0)), par{ni^0 -> (1 + ni^0), nj^0 -> (1 + nj^0)}>
<l26, l50, ((0 + 3) <= (0 + nk1^0)) /\ ((0 + 3) <= (0 + (1 + nj^0))) /\ ((0 + 3) <= (0 + (1 + ni^0))) /\ ((1 + bDomain^0) <= 0) /\ ((1 + bRows^0) <= 0), par{ni^0 -> (1 + ni^0), nj^0 -> (1 + nj^0)}>
<l26, l26, ((0 + 3) <= (0 + nk1^0)) /\ ((0 + 3) <= (0 + (1 + nj^0))) /\ ((1 + (1 + ni^0)) <= (0 + 3)) /\ ((1 + 0) <= (0 + 3)), par{ni^0 -> (1 + ni^0), nj^0 -> 0, nk1^0 -> 0}>
<l26, l26, ((0 + 3) <= (0 + nk1^0)) /\ ((1 + (1 + nj^0)) <= (0 + 3)), par{nj^0 -> (1 + nj^0), nk1^0 -> 0}>
<l26, l38, ((1 + nk1^0) <= (0 + 3)) /\ ((1 + 0) <= (0 + 3)), par{nk2^0 -> 0, nl1^0 -> 0}>
<l29, l24, ((0 + n2^0) <= (0 + nj^0)) /\ ((0 + n2^0) <= (0 + (1 + ni^0))), par{ni^0 -> 0}>
<l29, l29, ((0 + n2^0) <= (0 + nj^0)) /\ ((1 + (1 + ni^0)) <= (0 + n2^0)), par{ni^0 -> (1 + ni^0), nj^0 -> 0}>
<l29, l29, ((1 + nj^0) <= (0 + n2^0)) /\ ((0 + bDomain^0) <= 0) /\ (0 <= (0 + bDomain^0)), par{bDomain^0 -> (0 + 0), nj^0 -> (1 + nj^0)}>
<l29, l29, ((1 + nj^0) <= (0 + n2^0)) /\ (1 <= (0 + bDomain^0)), par{bDomain^0 -> (0 + 0), nj^0 -> (1 + nj^0)}>
<l29, l29, ((1 + nj^0) <= (0 + n2^0)) /\ (1 <= (0 + bDomain^0)), par{bDomain^0 -> (0 + 0), nj^0 -> (1 + nj^0)}>
<l29, l29, ((1 + nj^0) <= (0 + n2^0)) /\ (1 <= (0 + bDomain^0)), par{bDomain^0 -> (0 + 1), nj^0 -> (1 + nj^0)}>
<l29, l29, ((1 + nj^0) <= (0 + n2^0)) /\ ((1 + bDomain^0) <= 0), par{bDomain^0 -> (0 + 0), nj^0 -> (1 + nj^0)}>
<l29, l29, ((1 + nj^0) <= (0 + n2^0)) /\ ((1 + bDomain^0) <= 0), par{bDomain^0 -> (0 + 0), nj^0 -> (1 + nj^0)}>
<l29, l29, ((1 + nj^0) <= (0 + n2^0)) /\ ((1 + bDomain^0) <= 0), par{bDomain^0 -> (0 + 1), nj^0 -> (1 + nj^0)}>
<l38, l26, ((0 + 3) <= (0 + nk2^0)) /\ ((0 + 3) <= (0 + (1 + nl1^0))), par{nk1^0 -> (1 + nk1^0), nl1^0 -> (1 + nl1^0)}>
<l38, l38, ((0 + 3) <= (0 + nk2^0)) /\ ((1 + (1 + nl1^0)) <= (0 + 3)), par{nk2^0 -> 0, nl1^0 -> (1 + nl1^0)}>
<l38, l44, ((1 + nk2^0) <= (0 + 3)), par{nl2^0 -> 0}>
<l42, l24, ((0 + n2^0) <= (0 + nj^0)) /\ ((0 + n2^0) <= (0 + (1 + ni^0))) /\ ((0 + n2^0) <= (0 + 0)), par{ni^0 -> 0}>
<l42, l29, ((0 + n2^0) <= (0 + nj^0)) /\ ((0 + n2^0) <= (0 + (1 + ni^0))) /\ ((1 + 0) <= (0 + n2^0)), par{ni^0 -> 0, nj^0 -> 0}>
<l42, l42, ((0 + n2^0) <= (0 + nj^0)) /\ ((1 + (1 + ni^0)) <= (0 + n2^0)), par{ni^0 -> (1 + ni^0), nj^0 -> 0}>
<l42, l42, ((1 + nj^0) <= (0 + n2^0)) /\ (undef1168 = undef1168), par{nj^0 -> (1 + nj^0)}>
<l44, l38, ((0 + 3) <= (0 + nl2^0)), par{nk2^0 -> (1 + nk2^0)}>
<l44, l44, ((1 + nl2^0) <= (0 + 3)), par{nl2^0 -> (1 + nl2^0)}>
<l44, l44, ((1 + nl2^0) <= (0 + 3)) /\ ((0 + bSquares^0) <= 0) /\ (0 <= (0 + bSquares^0)), par{bSquares^0 -> (0 + 0), nl2^0 -> (1 + nl2^0)}>
<l44, l44, ((1 + nl2^0) <= (0 + 3)) /\ (1 <= (0 + bSquares^0)), par{bSquares^0 -> (0 + 1), nl2^0 -> (1 + nl2^0)}>
<l44, l44, ((1 + nl2^0) <= (0 + 3)) /\ (1 <= (0 + bSquares^0)), par{bSquares^0 -> (0 + 0), nl2^0 -> (1 + nl2^0)}>
<l44, l44, ((1 + nl2^0) <= (0 + 3)) /\ (1 <= (0 + bSquares^0)), par{bSquares^0 -> (0 + 1), nl2^0 -> (1 + nl2^0)}>
<l44, l44, ((1 + nl2^0) <= (0 + 3)) /\ ((1 + bSquares^0) <= 0), par{bSquares^0 -> (0 + 1), nl2^0 -> (1 + nl2^0)}>
<l44, l44, ((1 + nl2^0) <= (0 + 3)) /\ ((1 + bSquares^0) <= 0), par{bSquares^0 -> (0 + 0), nl2^0 -> (1 + nl2^0)}>
<l44, l44, ((1 + nl2^0) <= (0 + 3)) /\ ((1 + bSquares^0) <= 0), par{bSquares^0 -> (0 + 1), nl2^0 -> (1 + nl2^0)}>
<l50, l47, ((0 + bCols^0) <= 0) /\ (0 <= (0 + bCols^0))>
<l50, l47, (1 <= (0 + bCols^0)) /\ ((0 + bSquares^0) <= 0) /\ (0 <= (0 + bSquares^0))>
<l50, l47, (1 <= (0 + bCols^0)) /\ (1 <= (0 + bSquares^0))>
<l50, l47, (1 <= (0 + bCols^0)) /\ ((1 + bSquares^0) <= 0)>
<l50, l47, ((1 + bCols^0) <= 0) /\ ((0 + bSquares^0) <= 0) /\ (0 <= (0 + bSquares^0))>
<l50, l47, ((1 + bCols^0) <= 0) /\ (1 <= (0 + bSquares^0))>
<l50, l47, ((1 + bCols^0) <= 0) /\ ((1 + bSquares^0) <= 0)>

Fresh variables:
undef1168, undef2236, undef2248, 

Undef variables:
undef1168, undef2236, undef2248, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l42, l42, n2^0 <= nj^0 /\ 2 + ni^0 <= n2^0, {ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}>
<l42, l42, 1 + nj^0 <= n2^0, {nj^0 -> 1 + nj^0, rest remain the same}>
Variables:
n2^0, ni^0, nj^0

Graph 2:
Transitions:
<l29, l29, n2^0 <= nj^0 /\ 2 + ni^0 <= n2^0, {ni^0 -> 1 + ni^0, nj^0 -> 0, rest remain the same}>
<l29, l29, 1 + nj^0 <= n2^0 /\ bDomain^0 = 0, {bDomain^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}>
<l29, l29, 1 <= bDomain^0 /\ 1 + nj^0 <= n2^0, {bDomain^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}>
<l29, l29, 1 <= bDomain^0 /\ 1 + nj^0 <= n2^0, {bDomain^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}>
<l29, l29, 1 <= bDomain^0 /\ 1 + nj^0 <= n2^0, {bDomain^0 -> 1, nj^0 -> 1 + nj^0, rest remain the same}>
<l29, l29, 1 + bDomain^0 <= 0 /\ 1 + nj^0 <= n2^0, {bDomain^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}>
<l29, l29, 1 + bDomain^0 <= 0 /\ 1 + nj^0 <= n2^0, {bDomain^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}>
<l29, l29, 1 + bDomain^0 <= 0 /\ 1 + nj^0 <= n2^0, {bDomain^0 -> 1, nj^0 -> 1 + nj^0, rest remain the same}>
Variables:
n2^0, ni^0, nj^0, bDomain^0

Graph 3:
Transitions:
<l16, l24, n2^0 <= nj2^0 /\ n2^0 <= 2 + nj1^0, {ni^0 -> 1 + ni^0, nj1^0 -> 1 + nj1^0, rest remain the same}>
<l16, l16, n2^0 <= nj2^0 /\ 3 + nj1^0 <= n2^0, {nj1^0 -> 1 + nj1^0, nj2^0 -> 2 + nj1^0, rest remain the same}>
<l16, l16, 1 + nj2^0 <= n2^0 /\ bRows^0 = 0, {bRows^0 -> 0, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 <= bRows^0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 1, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 <= bRows^0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 0, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 <= bRows^0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 1, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 + bRows^0 <= 0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 1, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 + bRows^0 <= 0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 0, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 + bRows^0 <= 0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 1, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l24, l24, 1 + ni^0 <= n2^0 /\ n2^0 <= 1, {ni^0 -> 1 + ni^0, nj1^0 -> 0, rest remain the same}>
<l24, l16, 1 + ni^0 <= n2^0 /\ 2 <= n2^0, {nj1^0 -> 0, nj2^0 -> 1, rest remain the same}>
Variables:
n2^0, ni^0, nj1^0, nj2^0, bRows^0

Graph 4:
Transitions:
<l7, l12, n2^0 <= ni2^0 /\ n2^0 <= 2 + ni1^0, {ni1^0 -> 1 + ni1^0, nj^0 -> 1 + nj^0, rest remain the same}>
<l7, l7, n2^0 <= ni2^0 /\ 3 + ni1^0 <= n2^0, {ni1^0 -> 1 + ni1^0, ni2^0 -> 2 + ni1^0, rest remain the same}>
<l7, l7, 1 + ni2^0 <= n2^0 /\ bCols^0 = 0, {bCols^0 -> 0, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 <= bCols^0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 1, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 <= bCols^0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 0, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 <= bCols^0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 1, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 + bCols^0 <= 0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 1, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 + bCols^0 <= 0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 0, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 + bCols^0 <= 0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 1, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l12, l12, 1 + nj^0 <= n2^0 /\ n2^0 <= 1, {ni1^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}>
<l12, l7, 1 + nj^0 <= n2^0 /\ 2 <= n2^0, {ni1^0 -> 0, ni2^0 -> 1, rest remain the same}>
Variables:
n2^0, ni1^0, ni2^0, nj^0, bCols^0

Graph 5:
Transitions:
<l26, l26, ni^0 <= 1 /\ 3 <= nk1^0 /\ 2 <= nj^0, {ni^0 -> 1 + ni^0, nj^0 -> 0, nk1^0 -> 0, rest remain the same}>
<l26, l26, nj^0 <= 1 /\ 3 <= nk1^0, {nj^0 -> 1 + nj^0, nk1^0 -> 0, rest remain the same}>
<l26, l38, nk1^0 <= 2, {nk2^0 -> 0, nl1^0 -> 0, rest remain the same}>
<l38, l26, 3 <= nk2^0 /\ 2 <= nl1^0, {nk1^0 -> 1 + nk1^0, nl1^0 -> 1 + nl1^0, rest remain the same}>
<l38, l38, nl1^0 <= 1 /\ 3 <= nk2^0, {nk2^0 -> 0, nl1^0 -> 1 + nl1^0, rest remain the same}>
<l38, l44, nk2^0 <= 2, {nl2^0 -> 0, rest remain the same}>
<l44, l38, 3 <= nl2^0, {nk2^0 -> 1 + nk2^0, rest remain the same}>
<l44, l44, nl2^0 <= 2, {nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, nl2^0 <= 2 /\ bSquares^0 = 0, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 <= bSquares^0 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 <= bSquares^0 /\ nl2^0 <= 2, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 <= bSquares^0 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 + bSquares^0 <= 0 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 + bSquares^0 <= 0 /\ nl2^0 <= 2, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 + bSquares^0 <= 0 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
Variables:
ni^0, nj^0, nk1^0, nk2^0, nl1^0, nl2^0, bSquares^0

Graph 6:
Transitions:
Variables:

Graph 7:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l42, 1 <= undef2236 /\ n2^0 = undef2236 /\ ni^0 = 0 /\ bCols^0 = 1 /\ bDomain^0 = 1 /\ bRows^0 = 1 /\ bSquares^0 = 1, {nj^0 -> 0, rest remain the same}>

Graph 2
<l42, l29, n2^0 <= nj^0 /\ 1 <= n2^0 /\ n2^0 <= 1 + ni^0, {ni^0 -> 0, nj^0 -> 0, rest remain the same}>

Graph 3
<l0, l24, undef2236 <= 0 /\ n2^0 = undef2236 /\ ni^0 = 0 /\ bCols^0 = 1 /\ bDomain^0 = 1 /\ bRows^0 = 1 /\ bSquares^0 = 1, {all remain the same}>
<l29, l24, n2^0 <= nj^0 /\ n2^0 <= 1 + ni^0, {ni^0 -> 0, rest remain the same}>
<l42, l24, n2^0 <= 0 /\ n2^0 <= nj^0 /\ n2^0 <= 1 + ni^0, {ni^0 -> 0, rest remain the same}>

Graph 4
<l24, l12, n2^0 <= ni^0, {nj^0 -> 0, rest remain the same}>

Graph 5
<l12, l26, n2^0 <= nj^0, {ni^0 -> 0, nj^0 -> 0, nk1^0 -> 0, rest remain the same}>

Graph 6
<l26, l50, 1 <= bDomain^0 /\ 1 <= bRows^0 /\ 3 <= nk1^0 /\ 2 <= ni^0 /\ 2 <= nj^0, {ni^0 -> 1 + ni^0, nj^0 -> 1 + nj^0, rest remain the same}>
<l26, l50, 1 <= bDomain^0 /\ 1 + bRows^0 <= 0 /\ 3 <= nk1^0 /\ 2 <= ni^0 /\ 2 <= nj^0, {ni^0 -> 1 + ni^0, nj^0 -> 1 + nj^0, rest remain the same}>
<l26, l50, 1 + bDomain^0 <= 0 /\ 1 <= bRows^0 /\ 3 <= nk1^0 /\ 2 <= ni^0 /\ 2 <= nj^0, {ni^0 -> 1 + ni^0, nj^0 -> 1 + nj^0, rest remain the same}>
<l26, l50, 1 + bDomain^0 <= 0 /\ 1 + bRows^0 <= 0 /\ 3 <= nk1^0 /\ 2 <= ni^0 /\ 2 <= nj^0, {ni^0 -> 1 + ni^0, nj^0 -> 1 + nj^0, rest remain the same}>

Graph 7
<l26, l47, 3 <= nk1^0 /\ 2 <= ni^0 /\ 2 <= nj^0 /\ bDomain^0 = 0, {ni^0 -> 1 + ni^0, nj^0 -> 1 + nj^0, rest remain the same}>
<l26, l47, 1 <= bDomain^0 /\ 3 <= nk1^0 /\ 2 <= ni^0 /\ 2 <= nj^0 /\ bRows^0 = 0, {ni^0 -> 1 + ni^0, nj^0 -> 1 + nj^0, rest remain the same}>
<l26, l47, 1 + bDomain^0 <= 0 /\ 3 <= nk1^0 /\ 2 <= ni^0 /\ 2 <= nj^0 /\ bRows^0 = 0, {ni^0 -> 1 + ni^0, nj^0 -> 1 + nj^0, rest remain the same}>
<l50, l47, bCols^0 = 0, {all remain the same}>
<l50, l47, 1 <= bCols^0 /\ bSquares^0 = 0, {all remain the same}>
<l50, l47, 1 <= bCols^0 /\ 1 <= bSquares^0, {all remain the same}>
<l50, l47, 1 <= bCols^0 /\ 1 + bSquares^0 <= 0, {all remain the same}>
<l50, l47, 1 + bCols^0 <= 0 /\ bSquares^0 = 0, {all remain the same}>
<l50, l47, 1 + bCols^0 <= 0 /\ 1 <= bSquares^0, {all remain the same}>
<l50, l47, 1 + bCols^0 <= 0 /\ 1 + bSquares^0 <= 0, {all remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 7 , 4 )
( 12 , 4 )
( 16 , 3 )
( 24 , 3 )
( 26 , 5 )
( 29 , 2 )
( 38 , 5 )
( 42 , 1 )
( 44 , 5 )
( 47 , 7 )
( 50 , 6 )

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

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

Checking conditional termination of SCC {l42}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002338s
Ranking function: -4 + 2*n2^0 - 2*ni^0
New Graphs: 
Transitions:
<l42, l42, 1 + nj^0 <= n2^0, {nj^0 -> 1 + nj^0, rest remain the same}>
Variables:
n2^0, nj^0
Checking conditional termination of SCC {l42}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.001466s
Ranking function: -1 + n2^0 - nj^0
New Graphs: 
Proving termination of subgraph 2
Checking unfeasibility...
Time used: 0.031359

Checking conditional termination of SCC {l29}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007447s
Ranking function: n2^0 - ni^0
New Graphs: 
Transitions:
<l29, l29, 1 + nj^0 <= n2^0 /\ bDomain^0 = 0, {bDomain^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}>
<l29, l29, 1 <= bDomain^0 /\ 1 + nj^0 <= n2^0, {bDomain^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}>
<l29, l29, 1 <= bDomain^0 /\ 1 + nj^0 <= n2^0, {bDomain^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}>
<l29, l29, 1 <= bDomain^0 /\ 1 + nj^0 <= n2^0, {bDomain^0 -> 1, nj^0 -> 1 + nj^0, rest remain the same}>
<l29, l29, 1 + bDomain^0 <= 0 /\ 1 + nj^0 <= n2^0, {bDomain^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}>
<l29, l29, 1 + bDomain^0 <= 0 /\ 1 + nj^0 <= n2^0, {bDomain^0 -> 0, nj^0 -> 1 + nj^0, rest remain the same}>
<l29, l29, 1 + bDomain^0 <= 0 /\ 1 + nj^0 <= n2^0, {bDomain^0 -> 1, nj^0 -> 1 + nj^0, rest remain the same}>
Variables:
bDomain^0, n2^0, nj^0
Checking conditional termination of SCC {l29}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004049s
Ranking function: -2 + 2*n2^0 - 2*nj^0
New Graphs: 
Proving termination of subgraph 3
Checking unfeasibility...
Time used: 1.23767

Checking conditional termination of SCC {l16, l24}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.018314s
Ranking function: 4 - 4*n2^0 - ni^0
New Graphs: 
Transitions:
<l16, l16, n2^0 <= nj2^0 /\ 2 <= n2^0 /\ 2 + ni^0 <= n2^0 /\ n2^0 <= 2 + nj1^0, {ni^0 -> ((0 + 1) + 0) + ni^0, nj1^0 -> 0, nj2^0 -> 1, rest remain the same}>
<l16, l16, n2^0 <= nj2^0 /\ 3 + nj1^0 <= n2^0, {nj1^0 -> 1 + nj1^0, nj2^0 -> 2 + nj1^0, rest remain the same}>
<l16, l16, 1 + nj2^0 <= n2^0 /\ bRows^0 = 0, {bRows^0 -> 0, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 <= bRows^0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 1, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 <= bRows^0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 0, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 <= bRows^0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 1, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 + bRows^0 <= 0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 1, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 + bRows^0 <= 0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 0, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 + bRows^0 <= 0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 1, nj2^0 -> 1 + nj2^0, rest remain the same}>
Variables:
bRows^0, n2^0, ni^0, nj1^0, nj2^0
Checking conditional termination of SCC {l16}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005838s
Ranking function: n2^0 - ni^0
New Graphs: 
Transitions:
<l16, l16, n2^0 <= nj2^0 /\ 3 + nj1^0 <= n2^0, {nj1^0 -> 1 + nj1^0, nj2^0 -> 2 + nj1^0, rest remain the same}>
<l16, l16, 1 + nj2^0 <= n2^0 /\ bRows^0 = 0, {bRows^0 -> 0, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 <= bRows^0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 1, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 <= bRows^0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 0, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 <= bRows^0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 1, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 + bRows^0 <= 0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 1, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 + bRows^0 <= 0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 0, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 + bRows^0 <= 0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 1, nj2^0 -> 1 + nj2^0, rest remain the same}>
Variables:
bRows^0, n2^0, nj1^0, nj2^0
Checking conditional termination of SCC {l16}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004718s
Ranking function: -3 + n2^0 - nj1^0
New Graphs: 
Transitions:
<l16, l16, 1 + nj2^0 <= n2^0 /\ bRows^0 = 0, {bRows^0 -> 0, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 <= bRows^0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 1, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 <= bRows^0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 0, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 <= bRows^0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 1, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 + bRows^0 <= 0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 1, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 + bRows^0 <= 0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 0, nj2^0 -> 1 + nj2^0, rest remain the same}>
<l16, l16, 1 + bRows^0 <= 0 /\ 1 + nj2^0 <= n2^0, {bRows^0 -> 1, nj2^0 -> 1 + nj2^0, rest remain the same}>
Variables:
bRows^0, n2^0, nj2^0
Checking conditional termination of SCC {l16}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004218s
Ranking function: -2 + 2*n2^0 - 2*nj2^0
New Graphs: 
Proving termination of subgraph 4
Checking unfeasibility...
Time used: 1.30652

Checking conditional termination of SCC {l7, l12}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.019172s
Ranking function: 4 - 4*n2^0 - nj^0
New Graphs: 
Transitions:
<l7, l7, n2^0 <= ni2^0 /\ 2 <= n2^0 /\ 2 + nj^0 <= n2^0 /\ n2^0 <= 2 + ni1^0, {ni1^0 -> 0, ni2^0 -> 1, nj^0 -> ((0 + 1) + 0) + nj^0, rest remain the same}>
<l7, l7, n2^0 <= ni2^0 /\ 3 + ni1^0 <= n2^0, {ni1^0 -> 1 + ni1^0, ni2^0 -> 2 + ni1^0, rest remain the same}>
<l7, l7, 1 + ni2^0 <= n2^0 /\ bCols^0 = 0, {bCols^0 -> 0, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 <= bCols^0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 1, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 <= bCols^0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 0, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 <= bCols^0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 1, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 + bCols^0 <= 0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 1, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 + bCols^0 <= 0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 0, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 + bCols^0 <= 0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 1, ni2^0 -> 1 + ni2^0, rest remain the same}>
Variables:
bCols^0, n2^0, ni1^0, ni2^0, nj^0
Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006148s
Ranking function: n2^0 - nj^0
New Graphs: 
Transitions:
<l7, l7, n2^0 <= ni2^0 /\ 3 + ni1^0 <= n2^0, {ni1^0 -> 1 + ni1^0, ni2^0 -> 2 + ni1^0, rest remain the same}>
<l7, l7, 1 + ni2^0 <= n2^0 /\ bCols^0 = 0, {bCols^0 -> 0, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 <= bCols^0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 1, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 <= bCols^0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 0, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 <= bCols^0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 1, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 + bCols^0 <= 0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 1, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 + bCols^0 <= 0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 0, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 + bCols^0 <= 0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 1, ni2^0 -> 1 + ni2^0, rest remain the same}>
Variables:
bCols^0, n2^0, ni1^0, ni2^0
Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004949s
Ranking function: -3 + n2^0 - ni1^0
New Graphs: 
Transitions:
<l7, l7, 1 + ni2^0 <= n2^0 /\ bCols^0 = 0, {bCols^0 -> 0, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 <= bCols^0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 1, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 <= bCols^0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 0, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 <= bCols^0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 1, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 + bCols^0 <= 0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 1, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 + bCols^0 <= 0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 0, ni2^0 -> 1 + ni2^0, rest remain the same}>
<l7, l7, 1 + bCols^0 <= 0 /\ 1 + ni2^0 <= n2^0, {bCols^0 -> 1, ni2^0 -> 1 + ni2^0, rest remain the same}>
Variables:
bCols^0, n2^0, ni2^0
Checking conditional termination of SCC {l7}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.004452s
Ranking function: -2 + 2*n2^0 - 2*ni2^0
New Graphs: 
Proving termination of subgraph 5
Checking unfeasibility...
Time used: 2.56458

Checking conditional termination of SCC {l26, l38, l44}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.029259s
Ranking function: 1 - ni^0
New Graphs: 
Transitions:
<l26, l26, nj^0 <= 1 /\ 3 <= nk1^0, {nj^0 -> 1 + nj^0, nk1^0 -> 0, rest remain the same}>
<l26, l38, nk1^0 <= 2, {nk2^0 -> 0, nl1^0 -> 0, rest remain the same}>
<l38, l26, 3 <= nk2^0 /\ 2 <= nl1^0, {nk1^0 -> 1 + nk1^0, nl1^0 -> 1 + nl1^0, rest remain the same}>
<l38, l38, nl1^0 <= 1 /\ 3 <= nk2^0, {nk2^0 -> 0, nl1^0 -> 1 + nl1^0, rest remain the same}>
<l38, l44, nk2^0 <= 2, {nl2^0 -> 0, rest remain the same}>
<l44, l38, 3 <= nl2^0, {nk2^0 -> 1 + nk2^0, rest remain the same}>
<l44, l44, nl2^0 <= 2, {nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, nl2^0 <= 2 /\ bSquares^0 = 0, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 <= bSquares^0 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 <= bSquares^0 /\ nl2^0 <= 2, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 <= bSquares^0 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 + bSquares^0 <= 0 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 + bSquares^0 <= 0 /\ nl2^0 <= 2, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 + bSquares^0 <= 0 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
Variables:
bSquares^0, nj^0, nk1^0, nk2^0, nl1^0, nl2^0
Checking conditional termination of SCC {l26, l38, l44}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008093s
Ranking function: 1 - nj^0
New Graphs: 
Transitions:
<l26, l38, nk1^0 <= 2, {nk2^0 -> 0, nl1^0 -> 0, rest remain the same}>
<l38, l26, 3 <= nk2^0 /\ 2 <= nl1^0, {nk1^0 -> 1 + nk1^0, nl1^0 -> 1 + nl1^0, rest remain the same}>
<l38, l38, nl1^0 <= 1 /\ 3 <= nk2^0, {nk2^0 -> 0, nl1^0 -> 1 + nl1^0, rest remain the same}>
<l38, l44, nk2^0 <= 2, {nl2^0 -> 0, rest remain the same}>
<l44, l38, 3 <= nl2^0, {nk2^0 -> 1 + nk2^0, rest remain the same}>
<l44, l44, nl2^0 <= 2, {nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, nl2^0 <= 2 /\ bSquares^0 = 0, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 <= bSquares^0 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 <= bSquares^0 /\ nl2^0 <= 2, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 <= bSquares^0 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 + bSquares^0 <= 0 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 + bSquares^0 <= 0 /\ nl2^0 <= 2, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 + bSquares^0 <= 0 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
Variables:
bSquares^0, nk1^0, nk2^0, nl1^0, nl2^0
Checking conditional termination of SCC {l26, l38, l44}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005002s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.083860s
[27167 : 27168]
[27167 : 27169]
Successful child: 27169
Ranking function: -2 + 2*bSquares^0
Ranking function and negation of Quasi-Invariant applied
New Graphs: 
Transitions:
<l26, l38, nk1^0 <= 2, {nk2^0 -> 0, nl1^0 -> 0, rest remain the same}>
<l38, l26, 3 <= nk2^0 /\ 2 <= nl1^0, {nk1^0 -> 1 + nk1^0, nl1^0 -> 1 + nl1^0, rest remain the same}>
<l38, l38, nl1^0 <= 1 /\ 3 <= nk2^0, {nk2^0 -> 0, nl1^0 -> 1 + nl1^0, rest remain the same}>
<l38, l44, nk2^0 <= 2, {nl2^0 -> 0, rest remain the same}>
<l44, l38, 3 <= nl2^0, {nk2^0 -> 1 + nk2^0, rest remain the same}>
<l44, l44, nl2^0 <= 2, {nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, nl2^0 <= 2 /\ bSquares^0 = 0, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 <= bSquares^0 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 <= bSquares^0 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 + bSquares^0 <= 0 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 + bSquares^0 <= 0 /\ nl2^0 <= 2, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 + bSquares^0 <= 0 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
Variables:
bSquares^0, nk1^0, nk2^0, nl1^0, nl2^0
Checking conditional termination of SCC {l26, l38, l44}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005056s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.046476s
[27167 : 27173]
[27167 : 27174]
Successful child: 27174
Ranking function: -bSquares^0
Ranking function and negation of Quasi-Invariant applied
New Graphs: 
Transitions:
<l26, l38, nk1^0 <= 2, {nk2^0 -> 0, nl1^0 -> 0, rest remain the same}>
<l38, l26, 3 <= nk2^0 /\ 2 <= nl1^0, {nk1^0 -> 1 + nk1^0, nl1^0 -> 1 + nl1^0, rest remain the same}>
<l38, l38, nl1^0 <= 1 /\ 3 <= nk2^0, {nk2^0 -> 0, nl1^0 -> 1 + nl1^0, rest remain the same}>
<l38, l44, nk2^0 <= 2, {nl2^0 -> 0, rest remain the same}>
<l44, l38, 3 <= nl2^0, {nk2^0 -> 1 + nk2^0, rest remain the same}>
<l44, l44, nl2^0 <= 2, {nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, nl2^0 <= 2 /\ bSquares^0 = 0, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 <= bSquares^0 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 <= bSquares^0 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
Variables:
bSquares^0, nk1^0, nk2^0, nl1^0, nl2^0
Checking conditional termination of SCC {l26, l38, l44}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003855s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.029018s
[27167 : 27178]
[27167 : 27179]
Successful child: 27178
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l38, l26, 3 <= nk2^0 /\ 2 <= nl1^0 /\ nk1^0 <= 2, {nk1^0 -> 1 + nk1^0, nl1^0 -> 1 + nl1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l38, l38, nl1^0 <= 1 /\ 3 <= nk2^0 /\ nk1^0 <= 2, {nk2^0 -> 0, nl1^0 -> 1 + nl1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l38, l44, nk1^0 <= 2 /\ nk2^0 <= 2, {nl2^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l38, 3 <= nl2^0 /\ nk1^0 <= 2, {nk2^0 -> 1 + nk2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, nk1^0 <= 2 /\ nl2^0 <= 2, {nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, nk1^0 <= 2 /\ nl2^0 <= 2 /\ bSquares^0 = 0, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, 1 <= bSquares^0 /\ nk1^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, 1 <= bSquares^0 /\ nk1^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, 1 <= bSquares^0 /\ nk1^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, 1 + bSquares^0 <= 0 /\ nk1^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, 1 + bSquares^0 <= 0 /\ nk1^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, 1 + bSquares^0 <= 0 /\ nk1^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l38, l26, 3 <= nk2^0 /\ 2 <= nl1^0 /\ nk1^0 <= 2, {nk1^0 -> 1 + nk1^0, nl1^0 -> 1 + nl1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l38, l38, nl1^0 <= 1 /\ 3 <= nk2^0 /\ nk1^0 <= 2, {nk2^0 -> 0, nl1^0 -> 1 + nl1^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l38, l44, nk1^0 <= 2 /\ nk2^0 <= 2, {nl2^0 -> 0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l38, 3 <= nl2^0 /\ nk1^0 <= 2, {nk2^0 -> 1 + nk2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, nk1^0 <= 2 /\ nl2^0 <= 2, {nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, nk1^0 <= 2 /\ nl2^0 <= 2 /\ bSquares^0 = 0, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, 1 <= bSquares^0 /\ nk1^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, 1 <= bSquares^0 /\ nk1^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
Ranking function: 2 - nk1^0
New Graphs: 
Transitions:
<l38, l38, nl1^0 <= 1 /\ 3 <= nk2^0 /\ nk1^0 <= 2, {nk2^0 -> 0, nl1^0 -> 1 + nl1^0, rest remain the same}>
<l38, l44, nk1^0 <= 2 /\ nk2^0 <= 2, {nl2^0 -> 0, rest remain the same}>
<l44, l38, 3 <= nl2^0 /\ nk1^0 <= 2, {nk2^0 -> 1 + nk2^0, rest remain the same}>
<l44, l44, nk1^0 <= 2 /\ nl2^0 <= 2, {nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, nk1^0 <= 2 /\ nl2^0 <= 2 /\ bSquares^0 = 0, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 <= bSquares^0 /\ nk1^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 <= bSquares^0 /\ nk1^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
Variables:
bSquares^0, nk1^0, nk2^0, nl1^0, nl2^0
Checking conditional termination of SCC {l38, l44}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007494s
Ranking function: 3 - nk1^0 - nl1^0
New Graphs: 
Transitions:
<l38, l44, nk1^0 <= 2 /\ nk2^0 <= 2, {nl2^0 -> 0, rest remain the same}>
<l44, l38, 3 <= nl2^0 /\ nk1^0 <= 2, {nk2^0 -> 1 + nk2^0, rest remain the same}>
<l44, l44, nk1^0 <= 2 /\ nl2^0 <= 2, {nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, nk1^0 <= 2 /\ nl2^0 <= 2 /\ bSquares^0 = 0, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 <= bSquares^0 /\ nk1^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 <= bSquares^0 /\ nk1^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
Variables:
bSquares^0, nk1^0, nk2^0, nl2^0
Checking conditional termination of SCC {l38, l44}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002856s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.019660s
[27167 : 27187]
[27167 : 27188]
Successful child: 27187
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l38, 3 <= nl2^0 /\ nk1^0 <= 2 /\ nk2^0 <= 2, {nk2^0 -> 1 + nk2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, nk1^0 <= 2 /\ nk2^0 <= 2 /\ nl2^0 <= 2, {nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, nk1^0 <= 2 /\ nk2^0 <= 2 /\ nl2^0 <= 2 /\ bSquares^0 = 0, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, 1 <= bSquares^0 /\ nk1^0 <= 2 /\ nk2^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, 1 <= bSquares^0 /\ nk1^0 <= 2 /\ nk2^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, 1 <= bSquares^0 /\ nk1^0 <= 2 /\ nk2^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, 1 + bSquares^0 <= 0 /\ nk1^0 <= 2 /\ nk2^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, 1 + bSquares^0 <= 0 /\ nk1^0 <= 2 /\ nk2^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, 1 + bSquares^0 <= 0 /\ nk1^0 <= 2 /\ nk2^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l38, 3 <= nl2^0 /\ nk1^0 <= 2 /\ nk2^0 <= 2, {nk2^0 -> 1 + nk2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, nk1^0 <= 2 /\ nk2^0 <= 2 /\ nl2^0 <= 2, {nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, nk1^0 <= 2 /\ nk2^0 <= 2 /\ nl2^0 <= 2 /\ bSquares^0 = 0, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, 1 <= bSquares^0 /\ nk1^0 <= 2 /\ nk2^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l44, l44, 1 <= bSquares^0 /\ nk1^0 <= 2 /\ nk2^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
Ranking function: 2 - nk2^0
New Graphs: 
Transitions:
<l44, l44, nk1^0 <= 2 /\ nk2^0 <= 2 /\ nl2^0 <= 2, {nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, nk1^0 <= 2 /\ nk2^0 <= 2 /\ nl2^0 <= 2 /\ bSquares^0 = 0, {bSquares^0 -> 0, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 <= bSquares^0 /\ nk1^0 <= 2 /\ nk2^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
<l44, l44, 1 <= bSquares^0 /\ nk1^0 <= 2 /\ nk2^0 <= 2 /\ nl2^0 <= 2, {bSquares^0 -> 1, nl2^0 -> 1 + nl2^0, rest remain the same}>
Variables:
bSquares^0, nk1^0, nk2^0, nl2^0
Checking conditional termination of SCC {l44}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006609s
Ranking function: 2 - nl2^0
New Graphs: 
INVARIANTS: 
38: nk1^0 <= 2 , 
44: nk1^0 <= 2 , 
Quasi-INVARIANTS to narrow Graph: 
38: 
44: 
INVARIANTS: 
44: nk2^0 <= 2 , 
Quasi-INVARIANTS to narrow Graph: 
44: 
Proving termination of subgraph 6
Analyzing SCC {l50}...
No cycles found.

Proving termination of subgraph 7
Analyzing SCC {l47}...
No cycles found.

Program Terminates