Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: l0
      0: l0 -> l1 : A'=0, [], cost: 1
      1: l1 -> l1 : A'=1+A, B'=-1+B, [ B>=1 ], cost: 1
      2: l1 -> l2 : [ 0>=B ], cost: 1


Simplified the transitions:
  Start location: l0
      0: l0 -> l1 : A'=0, [], cost: 1
      1: l1 -> l1 : A'=1+A, B'=-1+B, [ B>=1 ], cost: 1

Eliminating 1 self-loops for location l1
  Self-Loop 1 has the metering function: B, resulting in the new transition 3.
  Removing the self-loops: 1.

Removed all Self-loops using metering functions (where possible):
  Start location: l0
      0: l0 -> l1 : A'=0, [], cost: 1
      3: l1 -> [3] : A'=B+A, B'=0, [ B>=1 ], cost: B


Applied simple chaining:
  Start location: l0
      0: l0 -> [3] : A'=B, B'=0, [ B>=1 ], cost: 1+B


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: l0
      0: l0 -> [3] : A'=B, B'=0, [ B>=1 ], cost: 1+B


Computing complexity for remaining 1 transitions.

  Found configuration with infinitely models for cost: 1+B
  and guard: B>=1:
  B: Pos

Found new complexity n^1, because: Found infinity configuration.


The final runtime is determined by this resulting transition:
  Final Guard: B>=1
  Final Cost:  1+B

Obtained the following complexity w.r.t. the length of the input n:
  Complexity class: n^1
  Complexity value: 1

WORST_CASE(Omega(n^1),?)