Initial Problem

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

Preprocessing

Eliminate variables [G; X₀; X₁; X₄; X₅] that do not contribute to the problem

Found invariant X₁ ≤ X₀ for location f300

Problem after Preprocessing

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

Found invariant X₁ ≤ X₀ for location f300

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

All Bounds

Timebounds

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

Costbounds

Overall costbound: inf {Infinity}
t₇: 1 {O(1)}
t₈: inf {Infinity}
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)}