Trying to load file: main.koat

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

Eliminating 2 self-loops for location f
  Self-Loop 0 has the metering function: -B-C+A, resulting in the new transition 3.
  Self-Loop 1 has the metering function: -B-C+A, 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: f -> [2] : B'=-C+A, [ A>=1+B+C ], cost: -B-C+A
      4: f -> [2] : C'=-B+A, [ A>=1+B+C ], cost: -B-C+A
      2: start -> f : [], cost: 1


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


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


Computing complexity for remaining 2 transitions.

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