Trying to load file: main.koat

Initial Control flow graph problem:
  Start location: f0
      0: f0 -> f15 : A'=0, B'=free, C'=free_1, D'=0, [], cost: 1
      1: f15 -> f15 : D'=1+D, [ 49>=D ], cost: 1
     12: f15 -> f25 : E'=0, [ D>=50 ], cost: 1
      2: f25 -> f25 : E'=1+E, [ 49>=E ], cost: 1
     11: f25 -> f33 : A'=0, [ E>=50 ], cost: 1
      3: f33 -> f33 : A'=1+A, [ 49>=A ], cost: 1
     10: f33 -> f42 : F'=0, [ A>=50 ], cost: 1
      4: f42 -> f42 : F'=1+F, [ 49>=F ], cost: 1
      9: f42 -> f52 : G'=0, [ F>=50 ], cost: 1
      5: f52 -> f52 : G'=1+G, [ 49>=G ], cost: 1
      8: f52 -> f60 : A'=0, [ G>=50 ], cost: 1
      6: f60 -> f60 : A'=1+A, [ 49>=A ], cost: 1
      7: f60 -> f69 : [ A>=50 ], cost: 1


Simplified the transitions:
  Start location: f0
      0: f0 -> f15 : A'=0, B'=free, C'=free_1, D'=0, [], cost: 1
      1: f15 -> f15 : D'=1+D, [ 49>=D ], cost: 1
     12: f15 -> f25 : E'=0, [ D>=50 ], cost: 1
      2: f25 -> f25 : E'=1+E, [ 49>=E ], cost: 1
     11: f25 -> f33 : A'=0, [ E>=50 ], cost: 1
      3: f33 -> f33 : A'=1+A, [ 49>=A ], cost: 1
     10: f33 -> f42 : F'=0, [ A>=50 ], cost: 1
      4: f42 -> f42 : F'=1+F, [ 49>=F ], cost: 1
      9: f42 -> f52 : G'=0, [ F>=50 ], cost: 1
      5: f52 -> f52 : G'=1+G, [ 49>=G ], cost: 1
      8: f52 -> f60 : A'=0, [ G>=50 ], cost: 1
      6: f60 -> f60 : A'=1+A, [ 49>=A ], cost: 1

Eliminating 1 self-loops for location f15
  Self-Loop 1 has the metering function: 50-D, resulting in the new transition 13.
  Removing the self-loops: 1.
Eliminating 1 self-loops for location f25
  Self-Loop 2 has the metering function: 50-E, resulting in the new transition 14.
  Removing the self-loops: 2.
Eliminating 1 self-loops for location f33
  Self-Loop 3 has the metering function: 50-A, resulting in the new transition 15.
  Removing the self-loops: 3.
Eliminating 1 self-loops for location f42
  Self-Loop 4 has the metering function: 50-F, resulting in the new transition 16.
  Removing the self-loops: 4.
Eliminating 1 self-loops for location f52
  Self-Loop 5 has the metering function: 50-G, resulting in the new transition 17.
  Removing the self-loops: 5.
Eliminating 1 self-loops for location f60
  Self-Loop 6 has the metering function: 50-A, resulting in the new transition 18.
  Removing the self-loops: 6.

Removed all Self-loops using metering functions (where possible):
  Start location: f0
      0: f0 -> f15 : A'=0, B'=free, C'=free_1, D'=0, [], cost: 1
     13: f15 -> [8] : D'=50, [ 49>=D ], cost: 50-D
     14: f25 -> [9] : E'=50, [ 49>=E ], cost: 50-E
     15: f33 -> [10] : A'=50, [ 49>=A ], cost: 50-A
     16: f42 -> [11] : F'=50, [ 49>=F ], cost: 50-F
     17: f52 -> [12] : G'=50, [ 49>=G ], cost: 50-G
     18: f60 -> [13] : A'=50, [ 49>=A ], cost: 50-A
     12: [8] -> f25 : E'=0, [ D>=50 ], cost: 1
     11: [9] -> f33 : A'=0, [ E>=50 ], cost: 1
     10: [10] -> f42 : F'=0, [ A>=50 ], cost: 1
      9: [11] -> f52 : G'=0, [ F>=50 ], cost: 1
      8: [12] -> f60 : A'=0, [ G>=50 ], cost: 1


Applied simple chaining:
  Start location: f0
      0: f0 -> [13] : A'=50, B'=free, C'=free_1, D'=50, E'=50, F'=50, G'=50, [ 49>=0 && 50>=50 && 49>=0 && 50>=50 && 49>=0 && 50>=50 && 49>=0 && 50>=50 && 49>=0 && 50>=50 && 49>=0 ], cost: 306


Final control flow graph problem, now checking costs for infinitely many models:
  Start location: f0
      0: f0 -> [13] : A'=50, B'=free, C'=free_1, D'=50, E'=50, F'=50, G'=50, [ 49>=0 && 50>=50 && 49>=0 && 50>=50 && 49>=0 && 50>=50 && 49>=0 && 50>=50 && 49>=0 && 50>=50 && 49>=0 ], cost: 306


Computing complexity for remaining 1 transitions.

Found new complexity const, because: const cost.


The final runtime is determined by this resulting transition:
  Final Guard: 49>=0 && 50>=50 && 49>=0 && 50>=50 && 49>=0 && 50>=50 && 49>=0 && 50>=50 && 49>=0 && 50>=50 && 49>=0
  Final Cost:  306

Obtained the following complexity w.r.t. the length of the input n:
  Complexity class: const
  Complexity value: 0

WORST_CASE(Omega(1),?)