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₀: f1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉) → f1(X₀, X₁, K, L, M, X₅, X₆, X₇, X₈, X₉) :|: 1+X₀ ≤ X₁
t₁: f1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉) → f300(X₀, X₁, K, L, X₄, M, X₆, X₇, X₈, X₉) :|: X₁ ≤ X₀
t₂: f2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉) → f1(X₀, X₁, X₂, X₃, X₄, X₅, K, L, M, N)

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 f300

Problem after Preprocessing

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

Found invariant X₁ ≤ X₀ for location f300

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

All Bounds

Timebounds

Overall timebound:inf {Infinity}
t₅: inf {Infinity}
t₆: 1 {O(1)}
t₇: 1 {O(1)}

Costbounds

Overall costbound: inf {Infinity}
t₅: inf {Infinity}
t₆: 1 {O(1)}
t₇: 1 {O(1)}

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)}