Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars: G
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l1(G, G, X₂, X₃, X₄, X₅)
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀, X₁, X₂, X₃, G, X₅) :|: 1+X₂ ≤ X₃
t₂: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, G) :|: X₃ ≤ X₂
Eliminate variables {G,X₀,X₁,X₄,X₅} that do not contribute to the problem
Found invariant X₁ ≤ X₀ for location l2
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₇: l0(X₀, X₁) → l1(X₀, X₁)
t₈: l1(X₀, X₁) → l1(X₀, X₁) :|: 1+X₀ ≤ X₁
t₉: l1(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ X₀
Found invariant X₁ ≤ X₀ for location l2
Found invariant 1+X₀ ≤ X₁ for location n_l1___1
Overall timebound:inf {Infinity}
t₇: 1 {O(1)}
t₈: inf {Infinity}
t₉: 1 {O(1)}
Overall costbound: inf {Infinity}
t₇: 1 {O(1)}
t₈: inf {Infinity}
t₉: 1 {O(1)}
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)}