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


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


YES

Solver Timeout: 4
Global Timeout: 300
Maximum number of concurrent processes: 900
No parsing errors!
Init Location: 0
Transitions:
<l0, l18, true>
<l1, l2, ((0 + n^0) <= (0 + r^0))>
<l1, l3, ((1 + r^0) <= (0 + n^0))>
<l4, l1, true, par{c^0 -> (~(1) + c^0)}>
<l5, l1, ((0 + f^0) <= 0) /\ (0 <= (0 + f^0))>
<l5, l4, (1 <= (0 + f^0))>
<l5, l4, ((1 + f^0) <= 0)>
<l6, l5, (2 <= (0 + c^0))>
<l6, l5, ((1 + c^0) <= 1)>
<l6, l7, ((0 + c^0) <= 1) /\ (1 <= (0 + c^0))>
<l7, l8, true>
<l9, l10, (0 <= (0 + s^0))>
<l9, l7, ((1 + s^0) <= 0)>
<l11, l9, true, par{d^0 -> 1, s^0 -> ((0 + (~(1) * c^0)) + s^0)}>
<l12, l11, (1 <= (0 + f^0))>
<l12, l11, ((1 + f^0) <= 0)>
<l12, l11, ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)), par{c^0 -> (~(1) + c^0), f^0 -> 1}>
<l10, l6, (undef100 = undef100), par{n^0 -> undef100}>
<l13, l11, (3 <= (0 + d^0))>
<l13, l11, ((1 + d^0) <= 2)>
<l13, l12, ((0 + d^0) <= 2) /\ (2 <= (0 + d^0))>
<l2, l7, ((0 + r^0) <= (0 + n^0))>
<l2, l13, ((1 + n^0) <= (0 + r^0))>
<l14, l10, ((0 + s^0) <= 255)>
<l14, l7, (256 <= (0 + s^0))>
<l15, l14, true, par{d^0 -> 2, s^0 -> ((0 + c^0) + s^0)}>
<l16, l15, (1 <= (0 + f^0))>
<l16, l15, ((1 + f^0) <= 0)>
<l16, l15, ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)), par{c^0 -> (~(1) + c^0), f^0 -> 1}>
<l3, l15, (2 <= (0 + d^0))>
<l3, l15, ((1 + d^0) <= 1)>
<l3, l16, ((0 + d^0) <= 1) /\ (1 <= (0 + d^0))>
<l17, l10, true, par{c^0 -> 4, d^0 -> 0, f^0 -> 0}>
<l18, l17, true>

Fresh variables:
undef100, 

Undef variables:
undef100, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

Preprocessed LLVMGraph
Init Location: 0
Transitions:
<l0, l10, (c^0 = 4) /\ (d^0 = 0) /\ (f^0 = 0)>
<l3, l10, (2 <= (0 + d^0)) /\ ((0 + ((0 + c^0) + s^0)) <= 255), par{d^0 -> 2, s^0 -> ((0 + c^0) + s^0)}>
<l3, l8, (2 <= (0 + d^0)) /\ (256 <= (0 + ((0 + c^0) + s^0))), par{d^0 -> 2, s^0 -> ((0 + c^0) + s^0)}>
<l3, l10, ((1 + d^0) <= 1) /\ ((0 + ((0 + c^0) + s^0)) <= 255), par{d^0 -> 2, s^0 -> ((0 + c^0) + s^0)}>
<l3, l8, ((1 + d^0) <= 1) /\ (256 <= (0 + ((0 + c^0) + s^0))), par{d^0 -> 2, s^0 -> ((0 + c^0) + s^0)}>
<l3, l10, ((0 + d^0) <= 1) /\ (1 <= (0 + d^0)) /\ (1 <= (0 + f^0)) /\ ((0 + ((0 + c^0) + s^0)) <= 255), par{d^0 -> 2, s^0 -> ((0 + c^0) + s^0)}>
<l3, l8, ((0 + d^0) <= 1) /\ (1 <= (0 + d^0)) /\ (1 <= (0 + f^0)) /\ (256 <= (0 + ((0 + c^0) + s^0))), par{d^0 -> 2, s^0 -> ((0 + c^0) + s^0)}>
<l3, l10, ((0 + d^0) <= 1) /\ (1 <= (0 + d^0)) /\ ((1 + f^0) <= 0) /\ ((0 + ((0 + c^0) + s^0)) <= 255), par{d^0 -> 2, s^0 -> ((0 + c^0) + s^0)}>
<l3, l8, ((0 + d^0) <= 1) /\ (1 <= (0 + d^0)) /\ ((1 + f^0) <= 0) /\ (256 <= (0 + ((0 + c^0) + s^0))), par{d^0 -> 2, s^0 -> ((0 + c^0) + s^0)}>
<l3, l10, ((0 + d^0) <= 1) /\ (1 <= (0 + d^0)) /\ ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)) /\ ((0 + ((0 + (~(1) + c^0)) + s^0)) <= 255), par{c^0 -> (~(1) + c^0), d^0 -> 2, f^0 -> 1, s^0 -> ((0 + (~(1) + c^0)) + s^0)}>
<l3, l8, ((0 + d^0) <= 1) /\ (1 <= (0 + d^0)) /\ ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)) /\ (256 <= (0 + ((0 + (~(1) + c^0)) + s^0))), par{c^0 -> (~(1) + c^0), d^0 -> 2, f^0 -> 1, s^0 -> ((0 + (~(1) + c^0)) + s^0)}>
<l10, l8, (undef100 = undef100) /\ (2 <= (0 + c^0)) /\ ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)) /\ ((0 + undef100) <= (0 + r^0)) /\ ((0 + r^0) <= (0 + undef100))>
<l10, l13, (undef100 = undef100) /\ (2 <= (0 + c^0)) /\ ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)) /\ ((0 + undef100) <= (0 + r^0)) /\ ((1 + undef100) <= (0 + r^0))>
<l10, l3, (undef100 = undef100) /\ (2 <= (0 + c^0)) /\ ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)) /\ ((1 + r^0) <= (0 + undef100))>
<l10, l8, (undef100 = undef100) /\ (2 <= (0 + c^0)) /\ (1 <= (0 + f^0)) /\ ((0 + undef100) <= (0 + r^0)) /\ ((0 + r^0) <= (0 + undef100)), par{c^0 -> (~(1) + c^0)}>
<l10, l13, (undef100 = undef100) /\ (2 <= (0 + c^0)) /\ (1 <= (0 + f^0)) /\ ((0 + undef100) <= (0 + r^0)) /\ ((1 + undef100) <= (0 + r^0)), par{c^0 -> (~(1) + c^0)}>
<l10, l3, (undef100 = undef100) /\ (2 <= (0 + c^0)) /\ (1 <= (0 + f^0)) /\ ((1 + r^0) <= (0 + undef100)), par{c^0 -> (~(1) + c^0)}>
<l10, l8, (undef100 = undef100) /\ (2 <= (0 + c^0)) /\ ((1 + f^0) <= 0) /\ ((0 + undef100) <= (0 + r^0)) /\ ((0 + r^0) <= (0 + undef100)), par{c^0 -> (~(1) + c^0)}>
<l10, l13, (undef100 = undef100) /\ (2 <= (0 + c^0)) /\ ((1 + f^0) <= 0) /\ ((0 + undef100) <= (0 + r^0)) /\ ((1 + undef100) <= (0 + r^0)), par{c^0 -> (~(1) + c^0)}>
<l10, l3, (undef100 = undef100) /\ (2 <= (0 + c^0)) /\ ((1 + f^0) <= 0) /\ ((1 + r^0) <= (0 + undef100)), par{c^0 -> (~(1) + c^0)}>
<l10, l8, (undef100 = undef100) /\ ((1 + c^0) <= 1) /\ ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)) /\ ((0 + undef100) <= (0 + r^0)) /\ ((0 + r^0) <= (0 + undef100))>
<l10, l13, (undef100 = undef100) /\ ((1 + c^0) <= 1) /\ ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)) /\ ((0 + undef100) <= (0 + r^0)) /\ ((1 + undef100) <= (0 + r^0))>
<l10, l3, (undef100 = undef100) /\ ((1 + c^0) <= 1) /\ ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)) /\ ((1 + r^0) <= (0 + undef100))>
<l10, l8, (undef100 = undef100) /\ ((1 + c^0) <= 1) /\ (1 <= (0 + f^0)) /\ ((0 + undef100) <= (0 + r^0)) /\ ((0 + r^0) <= (0 + undef100)), par{c^0 -> (~(1) + c^0)}>
<l10, l13, (undef100 = undef100) /\ ((1 + c^0) <= 1) /\ (1 <= (0 + f^0)) /\ ((0 + undef100) <= (0 + r^0)) /\ ((1 + undef100) <= (0 + r^0)), par{c^0 -> (~(1) + c^0)}>
<l10, l3, (undef100 = undef100) /\ ((1 + c^0) <= 1) /\ (1 <= (0 + f^0)) /\ ((1 + r^0) <= (0 + undef100)), par{c^0 -> (~(1) + c^0)}>
<l10, l8, (undef100 = undef100) /\ ((1 + c^0) <= 1) /\ ((1 + f^0) <= 0) /\ ((0 + undef100) <= (0 + r^0)) /\ ((0 + r^0) <= (0 + undef100)), par{c^0 -> (~(1) + c^0)}>
<l10, l13, (undef100 = undef100) /\ ((1 + c^0) <= 1) /\ ((1 + f^0) <= 0) /\ ((0 + undef100) <= (0 + r^0)) /\ ((1 + undef100) <= (0 + r^0)), par{c^0 -> (~(1) + c^0)}>
<l10, l3, (undef100 = undef100) /\ ((1 + c^0) <= 1) /\ ((1 + f^0) <= 0) /\ ((1 + r^0) <= (0 + undef100)), par{c^0 -> (~(1) + c^0)}>
<l10, l8, (undef100 = undef100) /\ ((0 + c^0) <= 1) /\ (1 <= (0 + c^0))>
<l13, l10, (3 <= (0 + d^0)) /\ (0 <= (0 + ((0 + (~(1) * c^0)) + s^0))), par{d^0 -> 1, s^0 -> ((0 + (~(1) * c^0)) + s^0)}>
<l13, l8, (3 <= (0 + d^0)) /\ ((1 + ((0 + (~(1) * c^0)) + s^0)) <= 0), par{d^0 -> 1, s^0 -> ((0 + (~(1) * c^0)) + s^0)}>
<l13, l10, ((1 + d^0) <= 2) /\ (0 <= (0 + ((0 + (~(1) * c^0)) + s^0))), par{d^0 -> 1, s^0 -> ((0 + (~(1) * c^0)) + s^0)}>
<l13, l8, ((1 + d^0) <= 2) /\ ((1 + ((0 + (~(1) * c^0)) + s^0)) <= 0), par{d^0 -> 1, s^0 -> ((0 + (~(1) * c^0)) + s^0)}>
<l13, l10, ((0 + d^0) <= 2) /\ (2 <= (0 + d^0)) /\ (1 <= (0 + f^0)) /\ (0 <= (0 + ((0 + (~(1) * c^0)) + s^0))), par{d^0 -> 1, s^0 -> ((0 + (~(1) * c^0)) + s^0)}>
<l13, l8, ((0 + d^0) <= 2) /\ (2 <= (0 + d^0)) /\ (1 <= (0 + f^0)) /\ ((1 + ((0 + (~(1) * c^0)) + s^0)) <= 0), par{d^0 -> 1, s^0 -> ((0 + (~(1) * c^0)) + s^0)}>
<l13, l10, ((0 + d^0) <= 2) /\ (2 <= (0 + d^0)) /\ ((1 + f^0) <= 0) /\ (0 <= (0 + ((0 + (~(1) * c^0)) + s^0))), par{d^0 -> 1, s^0 -> ((0 + (~(1) * c^0)) + s^0)}>
<l13, l8, ((0 + d^0) <= 2) /\ (2 <= (0 + d^0)) /\ ((1 + f^0) <= 0) /\ ((1 + ((0 + (~(1) * c^0)) + s^0)) <= 0), par{d^0 -> 1, s^0 -> ((0 + (~(1) * c^0)) + s^0)}>
<l13, l10, ((0 + d^0) <= 2) /\ (2 <= (0 + d^0)) /\ ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)) /\ (0 <= (0 + ((0 + (~(1) * (~(1) + c^0))) + s^0))), par{c^0 -> (~(1) + c^0), d^0 -> 1, f^0 -> 1, s^0 -> ((0 + (~(1) * (~(1) + c^0))) + s^0)}>
<l13, l8, ((0 + d^0) <= 2) /\ (2 <= (0 + d^0)) /\ ((0 + f^0) <= 0) /\ (0 <= (0 + f^0)) /\ ((1 + ((0 + (~(1) * (~(1) + c^0))) + s^0)) <= 0), par{c^0 -> (~(1) + c^0), d^0 -> 1, f^0 -> 1, s^0 -> ((0 + (~(1) * (~(1) + c^0))) + s^0)}>

Fresh variables:
undef100, 

Undef variables:
undef100, 

Abstraction variables:

Exit nodes:

Accepting locations:

Asserts:

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

Init Location: 0
Graph 0:
Transitions:
Variables:

Graph 1:
Transitions:
<l3, l10, 2 <= d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l10, d^0 <= 0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l10, 1 <= f^0 /\ c^0 + s^0 <= 255 /\ d^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l10, 1 + f^0 <= 0 /\ c^0 + s^0 <= 255 /\ d^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l10, c^0 + s^0 <= 256 /\ f^0 = 0 /\ d^0 = 1, {c^0 -> -1 + c^0, d^0 -> 2, f^0 -> 1, s^0 -> -1 + c^0 + s^0, rest remain the same}>
<l10, l13, 1 + undef100 <= r^0 /\ 2 <= c^0 /\ f^0 = 0, {all remain the same}>
<l10, l3, 1 + r^0 <= undef100 /\ 2 <= c^0 /\ f^0 = 0, {all remain the same}>
<l10, l13, 1 <= f^0 /\ 1 + undef100 <= r^0 /\ 2 <= c^0, {c^0 -> -1 + c^0, rest remain the same}>
<l10, l3, 1 <= f^0 /\ 1 + r^0 <= undef100 /\ 2 <= c^0, {c^0 -> -1 + c^0, rest remain the same}>
<l10, l13, 1 + f^0 <= 0 /\ 1 + undef100 <= r^0 /\ 2 <= c^0, {c^0 -> -1 + c^0, rest remain the same}>
<l10, l3, 1 + f^0 <= 0 /\ 1 + r^0 <= undef100 /\ 2 <= c^0, {c^0 -> -1 + c^0, rest remain the same}>
<l10, l13, c^0 <= 0 /\ 1 + undef100 <= r^0 /\ f^0 = 0, {all remain the same}>
<l10, l3, c^0 <= 0 /\ 1 + r^0 <= undef100 /\ f^0 = 0, {all remain the same}>
<l10, l13, c^0 <= 0 /\ 1 <= f^0 /\ 1 + undef100 <= r^0, {c^0 -> -1 + c^0, rest remain the same}>
<l10, l3, c^0 <= 0 /\ 1 <= f^0 /\ 1 + r^0 <= undef100, {c^0 -> -1 + c^0, rest remain the same}>
<l10, l13, c^0 <= 0 /\ 1 + f^0 <= 0 /\ 1 + undef100 <= r^0, {c^0 -> -1 + c^0, rest remain the same}>
<l10, l3, c^0 <= 0 /\ 1 + f^0 <= 0 /\ 1 + r^0 <= undef100, {c^0 -> -1 + c^0, rest remain the same}>
<l13, l10, c^0 <= s^0 /\ 3 <= d^0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l13, l10, c^0 <= s^0 /\ d^0 <= 1, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l13, l10, c^0 <= s^0 /\ 1 <= f^0 /\ d^0 = 2, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l13, l10, c^0 <= s^0 /\ 1 + f^0 <= 0 /\ d^0 = 2, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l13, l10, c^0 <= 1 + s^0 /\ f^0 = 0 /\ d^0 = 2, {c^0 -> -1 + c^0, d^0 -> 1, f^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>
Variables:
c^0, d^0, s^0, f^0, r^0

Graph 2:
Transitions:
Variables:

Precedence: 
Graph 0

Graph 1
<l0, l10, d^0 = 0 /\ f^0 = 0 /\ c^0 = 4, {all remain the same}>

Graph 2
<l3, l8, 2 <= d^0 /\ 256 <= c^0 + s^0, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l8, d^0 <= 0 /\ 256 <= c^0 + s^0, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l8, 1 <= f^0 /\ 256 <= c^0 + s^0 /\ d^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l8, 1 + f^0 <= 0 /\ 256 <= c^0 + s^0 /\ d^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l8, 257 <= c^0 + s^0 /\ f^0 = 0 /\ d^0 = 1, {c^0 -> -1 + c^0, d^0 -> 2, f^0 -> 1, s^0 -> -1 + c^0 + s^0, rest remain the same}>
<l10, l8, 2 <= c^0 /\ f^0 = 0 /\ r^0 = undef100, {all remain the same}>
<l10, l8, 1 <= f^0 /\ 2 <= c^0 /\ r^0 = undef100, {c^0 -> -1 + c^0, rest remain the same}>
<l10, l8, 1 + f^0 <= 0 /\ 2 <= c^0 /\ r^0 = undef100, {c^0 -> -1 + c^0, rest remain the same}>
<l10, l8, c^0 <= 0 /\ f^0 = 0 /\ r^0 = undef100, {all remain the same}>
<l10, l8, c^0 <= 0 /\ 1 <= f^0 /\ r^0 = undef100, {c^0 -> -1 + c^0, rest remain the same}>
<l10, l8, c^0 <= 0 /\ 1 + f^0 <= 0 /\ r^0 = undef100, {c^0 -> -1 + c^0, rest remain the same}>
<l10, l8, c^0 = 1, {all remain the same}>
<l13, l8, 1 + s^0 <= c^0 /\ 3 <= d^0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l13, l8, 1 + s^0 <= c^0 /\ d^0 <= 1, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l13, l8, 1 + s^0 <= c^0 /\ 1 <= f^0 /\ d^0 = 2, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l13, l8, 1 + s^0 <= c^0 /\ 1 + f^0 <= 0 /\ d^0 = 2, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l13, l8, 2 + s^0 <= c^0 /\ f^0 = 0 /\ d^0 = 2, {c^0 -> -1 + c^0, d^0 -> 1, f^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>

Map Locations to Subgraph:
( 0 , 0 )
( 3 , 1 )
( 8 , 2 )
( 10 , 1 )
( 13 , 1 )

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

Proving termination of subgraph 0
Proving termination of subgraph 1
Checking unfeasibility...
Time used: 0.344004
Some transition disabled by a set of invariant(s):
Invariant at l3: 0 <= f^0
Invariant at l10: 0 <= f^0
Invariant at l13: 0 <= f^0

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l10, l3, c^0 <= 0 /\ 1 + f^0 <= 0 /\ 1 + r^0 <= undef100, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 0 <= f^0 /\ 2 <= d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, d^0 <= 0 /\ 0 <= f^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 1 <= f^0 /\ c^0 + s^0 <= 255 /\ d^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
It's unfeasible. Removing transition: 
<l3, l10, 1 + f^0 <= 0 /\ c^0 + s^0 <= 255 /\ d^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, c^0 + s^0 <= 256 /\ f^0 = 0 /\ d^0 = 1, {c^0 -> -1 + c^0, d^0 -> 2, f^0 -> 1, s^0 -> -1 + c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, 1 + undef100 <= r^0 /\ 2 <= c^0 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 1 + r^0 <= undef100 /\ 2 <= c^0 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, 1 <= f^0 /\ 1 + undef100 <= r^0 /\ 2 <= c^0, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 1 <= f^0 /\ 1 + r^0 <= undef100 /\ 2 <= c^0, {c^0 -> -1 + c^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, l13, 1 + f^0 <= 0 /\ 1 + undef100 <= r^0 /\ 2 <= c^0, {c^0 -> -1 + c^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, l3, 1 + f^0 <= 0 /\ 1 + r^0 <= undef100 /\ 2 <= c^0, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, c^0 <= 0 /\ 1 + undef100 <= r^0 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, c^0 <= 0 /\ 1 + r^0 <= undef100 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, c^0 <= 0 /\ 1 <= f^0 /\ 1 + undef100 <= r^0, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, c^0 <= 0 /\ 1 <= f^0 /\ 1 + r^0 <= undef100, {c^0 -> -1 + c^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, l13, c^0 <= 0 /\ 1 + f^0 <= 0 /\ 1 + undef100 <= r^0, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, c^0 <= s^0 /\ 0 <= f^0 /\ 3 <= d^0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, c^0 <= s^0 /\ 0 <= f^0 /\ d^0 <= 1, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, c^0 <= s^0 /\ 1 <= f^0 /\ d^0 = 2, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, c^0 <= 1 + s^0 /\ f^0 = 0 /\ d^0 = 2, {c^0 -> -1 + c^0, d^0 -> 1, f^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>
Checking unfeasibility...
Time used: 2.14451
Some transition disabled by a set of invariant(s):
Invariant at l10: d^0 <= 2
Invariant at l13: d^0 <= 2

Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l13, l10, c^0 <= s^0 /\ 0 <= f^0 /\ 3 <= d^0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

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

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

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, 1 + undef100 <= r^0 /\ 2 <= c^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 1 + r^0 <= undef100 /\ 2 <= c^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, 1 <= f^0 /\ 1 + undef100 <= r^0 /\ 2 <= c^0 /\ d^0 <= 2, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 1 <= f^0 /\ 1 + r^0 <= undef100 /\ 2 <= c^0 /\ d^0 <= 2, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, c^0 <= 0 /\ 1 + undef100 <= r^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, c^0 <= 0 /\ 1 + r^0 <= undef100 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, c^0 <= 0 /\ 1 <= f^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 2, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, c^0 <= 0 /\ 1 <= f^0 /\ 1 + r^0 <= undef100 /\ d^0 <= 2, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, c^0 <= s^0 /\ 0 <= f^0 /\ d^0 <= 1, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, c^0 <= s^0 /\ 1 <= f^0 /\ d^0 = 2, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, c^0 <= 1 + s^0 /\ f^0 = 0 /\ d^0 = 2, {c^0 -> -1 + c^0, d^0 -> 1, f^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>
Checking unfeasibility...
Time used: 4.10115

Checking conditional termination of SCC {l3, l10, l13}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.029028s
Ranking function: -7*f^0
It's unfeasible after collapsing. Removing transition: 
<l10, l10, 1 <= 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
It's unfeasible after collapsing. Removing transition: 
<l10, l10, 1 <= 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
New Graphs: 
Transitions:
<l3, l10, 0 <= f^0 /\ 2 <= d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l10, d^0 <= 0 /\ 0 <= f^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l10, 1 <= f^0 /\ c^0 + s^0 <= 255 /\ d^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l10, l10, c^0 <= s^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ 2 <= c^0 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l10, l3, 1 + r^0 <= undef100 /\ 2 <= c^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>
<l10, l10, 1 <= f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ d^0 <= 1 /\ 2 <= c^0, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>
<l10, l10, 1 <= f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ 2 <= c^0 /\ d^0 = 2, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>
<l10, l3, 1 <= f^0 /\ 1 + r^0 <= undef100 /\ 2 <= c^0 /\ d^0 <= 2, {c^0 -> -1 + c^0, rest remain the same}>
<l10, l10, c^0 <= 0 /\ c^0 <= s^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l10, l3, c^0 <= 0 /\ 1 + r^0 <= undef100 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>
<l10, l10, c^0 <= 0 /\ 1 <= f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ d^0 <= 1, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>
<l10, l10, c^0 <= 0 /\ 1 <= f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ d^0 = 2, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>
<l10, l3, c^0 <= 0 /\ 1 <= f^0 /\ 1 + r^0 <= undef100 /\ d^0 <= 2, {c^0 -> -1 + c^0, rest remain the same}>
Variables:
c^0, d^0, f^0, r^0, s^0
Checking conditional termination of SCC {l3, l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.010021s
Ranking function: -5 + (5 / 2)*c^0
New Graphs: 
Transitions:
<l3, l10, 0 <= f^0 /\ 2 <= d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l10, d^0 <= 0 /\ 0 <= f^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l10, 1 <= f^0 /\ c^0 + s^0 <= 255 /\ d^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l10, l10, c^0 <= s^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ 2 <= c^0 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l10, l3, 1 + r^0 <= undef100 /\ 2 <= c^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>
<l10, l10, c^0 <= 0 /\ c^0 <= s^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l10, l3, c^0 <= 0 /\ 1 + r^0 <= undef100 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>
<l10, l10, c^0 <= 0 /\ 1 <= f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ d^0 <= 1, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>
<l10, l10, c^0 <= 0 /\ 1 <= f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ d^0 = 2, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>
<l10, l3, c^0 <= 0 /\ 1 <= f^0 /\ 1 + r^0 <= undef100 /\ d^0 <= 2, {c^0 -> -1 + c^0, rest remain the same}>
Variables:
c^0, d^0, f^0, r^0, s^0
Checking conditional termination of SCC {l3, l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.005554s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.307504s
[20785 : 20882]
[20785 : 20883]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001754s
Time used: 1.00175

LOG: SAT solveNonLinear - Elapsed time: 1.542324s
Cost: 1; Total time: 1.53456
Termination implied by a set of invariant(s):
Invariant at l3: 0 <= 1 + d^0
Invariant at l10: 0 <= 1 + d^0
Invariant at l13: 0 <= 1 + f^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 0 <= f^0 /\ 2 <= d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, d^0 <= 0 /\ 0 <= f^0 /\ 0 <= 1 + d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 1 <= f^0 /\ c^0 + s^0 <= 255 /\ d^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, c^0 + s^0 <= 256 /\ f^0 = 0 /\ d^0 = 1, {c^0 -> -1 + c^0, d^0 -> 2, f^0 -> 1, s^0 -> -1 + c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, 1 + undef100 <= r^0 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, 1 <= f^0 /\ 1 + undef100 <= r^0 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ d^0 <= 2, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 1 <= f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ d^0 <= 2, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, c^0 <= 0 /\ 1 + undef100 <= r^0 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, c^0 <= 0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, c^0 <= 0 /\ 1 <= f^0 /\ 1 + undef100 <= r^0 /\ 0 <= 1 + d^0 /\ d^0 <= 2, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, c^0 <= 0 /\ 1 <= f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, c^0 <= s^0 /\ 0 <= f^0 /\ d^0 <= 1, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, c^0 <= s^0 /\ 1 <= f^0 /\ d^0 = 2, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, c^0 <= 1 + s^0 /\ f^0 = 0 /\ d^0 = 2, {c^0 -> -1 + c^0, d^0 -> 1, f^0 -> 1, s^0 -> 1 - c^0 + s^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
Strengthening transition (result): 
<l3, l10, 0 <= f^0 /\ 2 <= d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, d^0 <= 0 /\ 0 <= f^0 /\ 0 <= 1 + d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 1 <= f^0 /\ c^0 + s^0 <= 255 /\ d^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, c^0 <= s^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, c^0 <= 0 /\ c^0 <= s^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, c^0 <= 0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, c^0 <= 0 /\ 1 <= f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, c^0 <= 0 /\ 1 <= f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ d^0 = 2, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, c^0 <= 0 /\ 1 <= f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2, {c^0 -> -1 + c^0, rest remain the same}>
Quasi-ranking function: 50000 + c^0
New Graphs: 
Transitions:
<l3, l10, 0 <= f^0 /\ 2 <= d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l10, d^0 <= 0 /\ 0 <= f^0 /\ 0 <= 1 + d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l10, 1 <= f^0 /\ c^0 + s^0 <= 255 /\ d^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l10, l10, c^0 <= s^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l10, l3, 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>
<l10, l10, c^0 <= 0 /\ c^0 <= s^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l10, l3, c^0 <= 0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>
<l10, l10, 1 <= f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ 50001 + c^0 <= 0, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>
<l10, l10, 1 <= f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ 50001 + c^0 <= 0 /\ d^0 = 2, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>
<l10, l3, 1 <= f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ 50001 + c^0 <= 0, {c^0 -> -1 + c^0, rest remain the same}>
Variables:
c^0, d^0, f^0, r^0, s^0
Checking conditional termination of SCC {l3, l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.006322s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.783774s
[20785 : 20887]
[20785 : 20888]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.001848s
Time used: 1.00185

LOG: SAT solveNonLinear - Elapsed time: 1.432471s
Cost: 1; Total time: 1.42332
Termination implied by a set of invariant(s):
Invariant at l3: 0 <= 1 + d^0
Invariant at l10: 0 <= d^0 + f^0
Invariant at l13: 0 <= d^0 + f^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 0 <= f^0 /\ 2 <= d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, d^0 <= 0 /\ 0 <= f^0 /\ 0 <= 1 + d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 1 <= f^0 /\ c^0 + s^0 <= 255 /\ d^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, c^0 + s^0 <= 256 /\ f^0 = 0 /\ d^0 = 1, {c^0 -> -1 + c^0, d^0 -> 2, f^0 -> 1, s^0 -> -1 + c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, 0 <= d^0 + f^0 /\ 1 <= f^0 /\ 1 + undef100 <= r^0 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ d^0 <= 2, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 0 <= d^0 + f^0 /\ 1 <= f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ d^0 <= 2, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, c^0 <= 0 /\ 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, c^0 <= 0 /\ 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, c^0 <= 0 /\ 0 <= d^0 + f^0 /\ 1 <= f^0 /\ 1 + undef100 <= r^0 /\ 0 <= 1 + d^0 /\ d^0 <= 2, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, c^0 <= 0 /\ 0 <= d^0 + f^0 /\ 1 <= f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ 0 <= f^0 /\ d^0 <= 1, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ 1 <= f^0 /\ d^0 = 2, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, 0 <= d^0 + f^0 /\ c^0 <= 1 + s^0 /\ f^0 = 0 /\ d^0 = 2, {c^0 -> -1 + c^0, d^0 -> 1, f^0 -> 1, s^0 -> 1 - c^0 + s^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
Strengthening transition (result): 
<l3, l10, 0 <= f^0 /\ 2 <= d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, d^0 <= 0 /\ 0 <= f^0 /\ 0 <= 1 + d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 1 <= f^0 /\ c^0 + s^0 <= 255 /\ d^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, c^0 <= 0 /\ c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, c^0 <= 0 /\ 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, 0 <= d^0 + f^0 /\ 1 <= f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ 50001 + c^0 <= 0, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, 0 <= d^0 + f^0 /\ 1 <= f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ 50001 + c^0 <= 0 /\ d^0 = 2, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 0 <= d^0 + f^0 /\ 1 <= f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ 50001 + c^0 <= 0, {c^0 -> -1 + c^0, rest remain the same}>
Quasi-ranking function: 50000 + c^0 + f^0
New Graphs: 
Transitions:
<l3, l10, 0 <= f^0 /\ 2 <= d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l10, d^0 <= 0 /\ 0 <= f^0 /\ 0 <= 1 + d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l10, 1 <= f^0 /\ c^0 + s^0 <= 255 /\ d^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l10, l10, c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l10, l3, 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>
<l10, l10, c^0 <= 0 /\ c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l10, l3, c^0 <= 0 /\ 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>
<l10, l10, 0 <= d^0 + f^0 /\ 1 <= f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ 50001 + c^0 <= 0 /\ 50001 + c^0 + f^0 <= 0, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>
<l10, l10, 0 <= d^0 + f^0 /\ 1 <= f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ 50001 + c^0 <= 0 /\ 50001 + c^0 + f^0 <= 0 /\ d^0 = 2, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>
<l10, l3, 0 <= d^0 + f^0 /\ 1 <= f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ 50001 + c^0 <= 0 /\ 50001 + c^0 + f^0 <= 0, {c^0 -> -1 + c^0, rest remain the same}>
Variables:
c^0, d^0, f^0, r^0, s^0
Checking conditional termination of SCC {l3, l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.007691s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 1.358896s
[20785 : 20892]
[20785 : 20893]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 1.002227s
Time used: 1.00221

LOG: SAT solveNonLinear - Elapsed time: 1.403230s
Cost: 1; Total time: 1.3934
Termination implied by a set of invariant(s):
Invariant at l3: f^0 <= 1
Invariant at l10: f^0 <= 1
Invariant at l13: f^0 <= 1
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 0 <= f^0 /\ f^0 <= 1 /\ 2 <= d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, d^0 <= 0 /\ 0 <= f^0 /\ 0 <= 1 + d^0 /\ f^0 <= 1 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, c^0 + s^0 <= 255 /\ d^0 = 1 /\ f^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, c^0 + s^0 <= 256 /\ f^0 = 0 /\ d^0 = 1, {c^0 -> -1 + c^0, d^0 -> 2, f^0 -> 1, s^0 -> -1 + c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ d^0 <= 2 /\ f^0 = 1, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ d^0 <= 2 /\ f^0 = 1, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, c^0 <= 0 /\ 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, c^0 <= 0 /\ 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, c^0 <= 0 /\ 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ f^0 = 1, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, c^0 <= 0 /\ 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ f^0 = 1, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ 0 <= f^0 /\ d^0 <= 1 /\ f^0 <= 1, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ f^0 = 1 /\ d^0 = 2, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, 0 <= d^0 + f^0 /\ c^0 <= 1 + s^0 /\ f^0 = 0 /\ d^0 = 2, {c^0 -> -1 + c^0, d^0 -> 1, f^0 -> 1, s^0 -> 1 - c^0 + s^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
Strengthening transition (result): 
<l3, l10, 0 <= f^0 /\ f^0 <= 1 /\ 2 <= d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, d^0 <= 0 /\ 0 <= f^0 /\ 0 <= 1 + d^0 /\ f^0 <= 1 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, c^0 + s^0 <= 255 /\ d^0 = 1 /\ f^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, c^0 <= 0 /\ c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, c^0 <= 0 /\ 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ 50001 + c^0 <= 0 /\ 50001 + c^0 + f^0 <= 0 /\ f^0 = 1, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ 50001 + c^0 <= 0 /\ 50001 + c^0 + f^0 <= 0 /\ f^0 = 1 /\ d^0 = 2, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ 50001 + c^0 <= 0 /\ 50001 + c^0 + f^0 <= 0 /\ f^0 = 1, {c^0 -> -1 + c^0, rest remain the same}>
Quasi-ranking function: 50000 + c^0 - f^0
New Graphs: 
Transitions:
<l3, l10, 0 <= f^0 /\ f^0 <= 1 /\ 2 <= d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l10, d^0 <= 0 /\ 0 <= f^0 /\ 0 <= 1 + d^0 /\ f^0 <= 1 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l10, c^0 + s^0 <= 255 /\ d^0 = 1 /\ f^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l10, l10, c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l10, l3, 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>
<l10, l10, c^0 <= 0 /\ c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l10, l3, c^0 <= 0 /\ 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>
<l10, l10, 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ 50001 + c^0 <= 0 /\ 50001 + c^0 + f^0 <= 0 /\ 50001 + c^0 <= f^0 /\ f^0 = 1, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>
<l10, l10, 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ 50001 + c^0 <= 0 /\ 50001 + c^0 + f^0 <= 0 /\ 50001 + c^0 <= f^0 /\ f^0 = 1 /\ d^0 = 2, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>
<l10, l3, 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ 50001 + c^0 <= 0 /\ 50001 + c^0 + f^0 <= 0 /\ 50001 + c^0 <= f^0 /\ f^0 = 1, {c^0 -> -1 + c^0, rest remain the same}>
Variables:
c^0, d^0, f^0, r^0, s^0
Checking conditional termination of SCC {l3, l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.008343s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 1.271744s
[20785 : 20897]
[20785 : 20898]
Solving with 1 template(s).

LOG: CALL solveNonLinearGetFirstSolution

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

LOG: CALL solveNonLinearGetNextSolution

LOG: RETURN solveNonLinearGetNextSolution - Elapsed time: 0.934888s
Time used: 0.934875

LOG: SAT solveNonLinear - Elapsed time: 1.464519s
Cost: 0; Total time: 1.4539
Termination implied by a set of invariant(s):
Invariant at l3: 2 <= c^0 + f^0
Invariant at l10: 2 <= c^0 + f^0
Invariant at l13: 2 <= c^0 + f^0
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 0 <= f^0 /\ f^0 <= 1 /\ 2 <= c^0 + f^0 /\ 2 <= d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, d^0 <= 0 /\ 0 <= f^0 /\ 0 <= 1 + d^0 /\ f^0 <= 1 /\ 2 <= c^0 + f^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 2 <= c^0 + f^0 /\ c^0 + s^0 <= 255 /\ d^0 = 1 /\ f^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 2 <= c^0 + f^0 /\ c^0 + s^0 <= 256 /\ f^0 = 0 /\ d^0 = 1, {c^0 -> -1 + c^0, d^0 -> 2, f^0 -> 1, s^0 -> -1 + c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ 2 <= c^0 + f^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ 2 <= c^0 + f^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ 2 <= c^0 + f^0 /\ d^0 <= 2 /\ f^0 = 1, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ 2 <= c^0 + f^0 /\ d^0 <= 2 /\ f^0 = 1, {c^0 -> -1 + c^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, l13, c^0 <= 0 /\ 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ f^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: 
<l10, l3, c^0 <= 0 /\ 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ f^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: 
<l10, l13, c^0 <= 0 /\ 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ f^0 = 1, {c^0 -> -1 + c^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, l3, c^0 <= 0 /\ 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ f^0 = 1, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ 0 <= f^0 /\ d^0 <= 1 /\ f^0 <= 1 /\ 2 <= c^0 + f^0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ 2 <= c^0 + f^0 /\ f^0 = 1 /\ d^0 = 2, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, 0 <= d^0 + f^0 /\ c^0 <= 1 + s^0 /\ 2 <= c^0 + f^0 /\ f^0 = 0 /\ d^0 = 2, {c^0 -> -1 + c^0, d^0 -> 1, f^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>
[ Termination Graph ]
Strengthening and disabling transitions...
> It's unfeasible. Removing transition: 
<l10, l10, 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ 50001 + c^0 <= 0 /\ 50001 + c^0 + f^0 <= 0 /\ 50001 + c^0 <= f^0 /\ f^0 = 1 /\ d^0 = 2, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 0 <= f^0 /\ f^0 <= 1 /\ 2 <= c^0 + f^0 /\ 2 <= d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, d^0 <= 0 /\ 0 <= f^0 /\ 0 <= 1 + d^0 /\ f^0 <= 1 /\ 2 <= c^0 + f^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 2 <= c^0 + f^0 /\ c^0 + s^0 <= 255 /\ d^0 = 1 /\ f^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ 2 <= c^0 + f^0 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ 2 <= c^0 + f^0 /\ d^0 <= 2 /\ f^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: 
<l10, l10, c^0 <= 0 /\ c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^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, l3, c^0 <= 0 /\ 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ f^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: 
<l10, l10, 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ c^0 <= 1 + s^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ 50001 + c^0 <= 0 /\ 50001 + c^0 + f^0 <= 0 /\ 50001 + c^0 <= f^0 /\ f^0 = 1, {c^0 -> ((0 + ~(1)) + 0) + c^0, d^0 -> 1, s^0 -> 1 - c^0 + s^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, l3, 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ d^0 <= 2 /\ 50001 + c^0 <= 0 /\ 50001 + c^0 + f^0 <= 0 /\ 50001 + c^0 <= f^0 /\ f^0 = 1, {c^0 -> -1 + c^0, rest remain the same}>
New Graphs: 
Transitions:
<l3, l10, 0 <= f^0 /\ f^0 <= 1 /\ 2 <= c^0 + f^0 /\ 2 <= d^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l10, d^0 <= 0 /\ 0 <= f^0 /\ 0 <= 1 + d^0 /\ f^0 <= 1 /\ 2 <= c^0 + f^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l3, l10, 2 <= c^0 + f^0 /\ c^0 + s^0 <= 255 /\ d^0 = 1 /\ f^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l10, l10, c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ 2 <= c^0 + f^0 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l10, l3, 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2 <= c^0 /\ 2 <= c^0 + f^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>
Variables:
c^0, d^0, f^0, r^0, s^0
Checking conditional termination of SCC {l3, l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003870s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.217571s
[20785 : 20902]
[20785 : 20903]
Successful child: 20902
[ Invariant Graph ]
Strengthening and disabling transitions...

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 0 <= f^0 /\ f^0 <= 1 /\ 2 <= c^0 + f^0 /\ c^0 + s^0 <= 255 /\ d^0 = 2, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, d^0 <= 0 /\ 0 <= f^0 /\ 0 <= 1 + d^0 /\ f^0 <= 1 /\ 2 <= c^0 + f^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 2 <= c^0 + f^0 /\ c^0 + s^0 <= 255 /\ d^0 = 1 /\ f^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 2 <= c^0 + f^0 /\ c^0 + s^0 <= 256 /\ f^0 = 0 /\ d^0 = 1, {c^0 -> -1 + c^0, d^0 -> 2, f^0 -> 1, s^0 -> -1 + c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ 0 <= 1 + d^0 /\ 2*f^0 <= 1 + d^0 /\ 2 <= c^0 /\ 2 <= c^0 + f^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2*f^0 <= 1 + d^0 /\ 2 <= c^0 /\ 2 <= c^0 + f^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l13, 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ 0 <= 1 + d^0 /\ 2*f^0 <= 1 + d^0 /\ 2 <= c^0 /\ 2 <= c^0 + f^0 /\ d^0 <= 2 /\ f^0 = 1, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2*f^0 <= 1 + d^0 /\ 2 <= c^0 /\ 2 <= c^0 + f^0 /\ d^0 <= 2 /\ f^0 = 1, {c^0 -> -1 + c^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, c^0 <= s^0 /\ 0 <= d^0 /\ 0 <= d^0 + f^0 /\ 0 <= f^0 /\ d^0 <= 1 /\ f^0 <= 1 /\ 2 <= c^0 + f^0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ 2 <= c^0 + f^0 /\ f^0 = 1 /\ d^0 = 2, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l13, l10, 0 <= d^0 + f^0 /\ c^0 <= 1 + s^0 /\ 2 <= c^0 + f^0 /\ f^0 = 0 /\ d^0 = 2, {c^0 -> -1 + c^0, d^0 -> 1, f^0 -> 1, s^0 -> 1 - c^0 + s^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
Strengthening transition (result): 
<l3, l10, 0 <= f^0 /\ f^0 <= 1 /\ 2 <= c^0 + f^0 /\ c^0 + s^0 <= 255 /\ d^0 = 2, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, d^0 <= 0 /\ 0 <= f^0 /\ 0 <= 1 + d^0 /\ f^0 <= 1 /\ 2 <= c^0 + f^0 /\ c^0 + s^0 <= 255, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l3, l10, 2 <= c^0 + f^0 /\ c^0 + s^0 <= 255 /\ d^0 = 1 /\ f^0 = 1, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l10, c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ 2*f^0 <= 1 + d^0 /\ 2 <= c^0 /\ 2 <= c^0 + f^0 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>

LOG: CALL solverLinear in Graph for feasibility

LOG: RETURN solveLinear in Graph for feasibility
Strengthening transition (result): 
<l10, l3, 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2*f^0 <= 1 + d^0 /\ 2 <= c^0 /\ 2 <= c^0 + f^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>
Ranking function: c^0 - d^0 + 2*f^0
New Graphs: 
Transitions:
<l3, l10, 0 <= f^0 /\ f^0 <= 1 /\ 2 <= c^0 + f^0 /\ c^0 + s^0 <= 255 /\ d^0 = 2, {d^0 -> 2, s^0 -> c^0 + s^0, rest remain the same}>
<l10, l10, c^0 <= s^0 /\ 0 <= d^0 + f^0 /\ 1 + undef100 <= r^0 /\ d^0 <= 1 /\ 0 <= 1 + d^0 /\ 2*f^0 <= 1 + d^0 /\ 2 <= c^0 /\ 2 <= c^0 + f^0 /\ f^0 = 0, {d^0 -> 1, s^0 -> -c^0 + s^0, rest remain the same}>
<l10, l3, 0 <= d^0 + f^0 /\ 1 + r^0 <= undef100 /\ 0 <= 1 + d^0 /\ 2*f^0 <= 1 + d^0 /\ 2 <= c^0 /\ 2 <= c^0 + f^0 /\ d^0 <= 2 /\ f^0 = 0, {all remain the same}>
Variables:
c^0, d^0, f^0, r^0, s^0
Checking conditional termination of SCC {l3, l10}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.002580s

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.024930s
[20785 : 20907]
[20785 : 20908]
Successful child: 20908
Ranking function: -c^0 + s^0
Ranking function and negation of Quasi-Invariant applied
New Graphs: 
Transitions:
<l3, l3, 1 + r^0 <= undef100 /\ 2 <= c^0 /\ 2 <= c^0 + f^0 /\ c^0 + s^0 <= 255 /\ f^0 = 0 /\ d^0 = 2, {d^0 -> 2, s^0 -> ((0 + 0) + 0) + c^0 + s^0, rest remain the same}>
Variables:
c^0, d^0, f^0, r^0, s^0
Checking conditional termination of SCC {l3}...

LOG: CALL solveLinear

LOG: RETURN solveLinear - Elapsed time: 0.003132s
Ranking function: (255 / 2) + (~(1) / 2)*c^0 + (~(1) / 2)*s^0
New Graphs: 
INVARIANTS: 
3: 0 <= 1 + d^0 , 
10: 0 <= 1 + d^0 , 
13: 0 <= 1 + f^0 , 
Quasi-INVARIANTS to narrow Graph: 
3: 
10: 
13: 
INVARIANTS: 
3: 0 <= 1 + d^0 , 
10: 0 <= d^0 + f^0 , 
13: 0 <= d^0 + f^0 , 
Quasi-INVARIANTS to narrow Graph: 
3: 
10: 
13: 
INVARIANTS: 
3: f^0 <= 1 , 
10: f^0 <= 1 , 
13: f^0 <= 1 , 
Quasi-INVARIANTS to narrow Graph: 
3: 
10: 
13: 
INVARIANTS: 
3: 2 <= c^0 + f^0 , 
10: 2 <= c^0 + f^0 , 
13: 2 <= c^0 + f^0 , 
Quasi-INVARIANTS to narrow Graph: 
3: 
10: 
13: 
INVARIANTS: 
3: d^0 <= 2 , 
10: 2*f^0 <= 1 + d^0 , 
13: 0 <= d^0 , 
Quasi-INVARIANTS to narrow Graph: 
3: 
10: 
13: 
Proving termination of subgraph 2
Analyzing SCC {l8}...
No cycles found.

Program Terminates