Trying to load file: main.koat

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

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

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


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


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


Computing complexity for remaining 1 transitions.

  Found configuration with infinitely models for cost: 2+B+2*A
  and guard: A>=1 && 0>=0 && B+A>=1:
  B: Pos, A: Pos

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


The final runtime is determined by this resulting transition:
  Final Guard: A>=1 && 0>=0 && B+A>=1
  Final Cost:  2+B+2*A

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),?)