Initial Problem

Start: f2
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆
Temp_Vars: H, I
Locations: f1, f2, f300
Transitions:
t₀: f1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → f1(X₀, X₁, H, I, X₄, X₅, X₆) :|: 1+X₁ ≤ X₀
t₁: f1(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → f300(X₀, X₁, H, X₃, I, X₅, X₆) :|: X₀ ≤ X₁
t₂: f2(X₀, X₁, X₂, X₃, X₄, X₅, X₆) → f1(X₀, X₁, X₂, X₃, X₄, H, H)

Preprocessing

Eliminate variables [H; I; 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)}