Trying to load file: main.koat

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

Eliminating 2 self-loops for location eval
  Self-Loop 1 has the metering function: 1+B-C, resulting in the new transition 4.
  Found this metering function when nesting loops: -B+A,
  Found this metering function when nesting loops: -1-B+A,
  Removing the self-loops: 0 1.
Adding an epsilon transition (to model nonexecution of the loops): 5.

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


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


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


Computing complexity for remaining 1 transitions.

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

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


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

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