Initial Problem

Start: f2
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉
Temp_Vars: K, L, M, N
Locations: f1, f2, f300
Transitions:
t₀: f2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉) → f300(K, L, M, N, X₄, X₅, X₆, X₇, X₈, X₉)
t₂: f300(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉) → f1(X₀, X₁, X₂, X₃, X₄, X₅, K, L, X₈, M) :|: X₅ ≤ X₄
t₁: f300(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉) → f300(X₀, X₁, X₂, X₃, X₄, X₅, K, L, M, X₉) :|: 1+X₄ ≤ X₅

Preprocessing

Eliminate variables [K; L; M; N; X₀; X₁; X₂; X₃; X₆; X₇; X₈; X₉] that do not contribute to the problem

Found invariant X₁ ≤ X₀ for location f1

Problem after Preprocessing

Start: f2
Program_Vars: X₀, X₁
Temp_Vars:
Locations: f1, f2, f300
Transitions:
t₇: f2(X₀, X₁) → f300(X₀, X₁)
t₈: f300(X₀, X₁) → f1(X₀, X₁) :|: X₁ ≤ X₀
t₉: f300(X₀, X₁) → f300(X₀, X₁) :|: 1+X₀ ≤ X₁

Found invariant X₁ ≤ X₀ for location f1

Found invariant 1+X₀ ≤ X₁ for location f300_v1

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₇: 1 {O(1)}
t₈: 1 {O(1)}
t₉: inf {Infinity}

Costbounds

Overall costbound: inf {Infinity}
t₇: 1 {O(1)}
t₈: 1 {O(1)}
t₉: inf {Infinity}

Sizebounds

t₇, X₀: X₀ {O(n)}
t₇, X₁: X₁ {O(n)}
t₈, X₀: X₀ {O(n)}
t₈, X₁: X₁ {O(n)}
t₉, X₀: X₀ {O(n)}
t₉, X₁: X₁ {O(n)}