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