Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: start
      0: merge -> merge : A'=-1+A, [ A>=1 && B>=1 ], cost: 1
      1: merge -> merge : B'=-1+B, [ A>=1 && B>=1 ], cost: 1
      2: start -> merge : [], cost: 1

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

Removed all Self-loops using metering functions (where possible):
  Start location: start
      3: merge -> [2] : A'=0, [ A>=1 && B>=1 ], cost: A
      4: merge -> [2] : B'=0, [ A>=1 && B>=1 ], cost: B
      2: start -> merge : [], cost: 1


Applied chaining over branches and pruning:
  Start location: start
      5: start -> [2] : A'=0, [ A>=1 && B>=1 ], cost: 1+A
      6: start -> [2] : B'=0, [ A>=1 && B>=1 ], cost: 1+B


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


Computing complexity for remaining 2 transitions.

  Found configuration with infinitely models for cost: 1+A
  and guard: A>=1 && B>=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 && B>=1
  Final Cost:  1+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),?)