Trying to load file: main.koat

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

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


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


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


Computing complexity for remaining 1 transitions.

  Found configuration with infinitely models for cost: 2+A
  and guard: A>=0 && B^3>=C:
  B: Pos, C: Both, A: Pos

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


The final runtime is determined by this resulting transition:
  Final Guard: A>=0 && B^3>=C
  Final Cost:  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),?)