Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars: E
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁, X₂, X₃) → l1(X₀, X₁, X₂, X₃)
t₁: l1(X₀, X₁, X₂, X₃) → l1(1+X₀, X₁, E, X₃) :|: 1 ≤ E ∧ 1+X₀ ≤ X₁
t₂: l1(X₀, X₁, X₂, X₃) → l1(1+X₀, X₁, E, X₃) :|: E+1 ≤ 0 ∧ 1+X₀ ≤ X₁
t₃: l1(X₀, X₁, X₂, X₃) → l1(X₀, 1+X₁, 0, X₃) :|: 1+X₀ ≤ X₁
t₄: l1(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, E) :|: X₁ ≤ X₀
Eliminate variables {X₂,X₃} that do not contribute to the problem
Found invariant X₁ ≤ X₀ for location l2
Start: l0
Program_Vars: X₀, X₁
Temp_Vars: E
Locations: l0, l1, l2
Transitions:
t₁₁: l0(X₀, X₁) → l1(X₀, X₁)
t₁₂: l1(X₀, X₁) → l1(1+X₀, X₁) :|: 1 ≤ E ∧ 1+X₀ ≤ X₁
t₁₃: l1(X₀, X₁) → l1(1+X₀, X₁) :|: E+1 ≤ 0 ∧ 1+X₀ ≤ X₁
t₁₄: l1(X₀, X₁) → l1(X₀, 1+X₁) :|: 1+X₀ ≤ X₁
t₁₅: l1(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ X₀
Cut unsatisfiable transition t₁₀₇: n_l1___1→l2
Cut unsatisfiable transition t₁₀₈: n_l1___2→l2
Found invariant X₁ ≤ X₀ for location l2
Found invariant 2+X₀ ≤ X₁ for location n_l1___2
Found invariant X₀ ≤ X₁ for location n_l1___3
Found invariant 1+X₀ ≤ X₁ for location n_l1___1
Overall timebound:inf {Infinity}
t₁₁: 1 {O(1)}
t₁₂: inf {Infinity}
t₁₃: inf {Infinity}
t₁₄: inf {Infinity}
t₁₅: 1 {O(1)}
Overall costbound: inf {Infinity}
t₁₁: 1 {O(1)}
t₁₂: inf {Infinity}
t₁₃: inf {Infinity}
t₁₄: inf {Infinity}
t₁₅: 1 {O(1)}
t₁₁, X₀: X₀ {O(n)}
t₁₁, X₁: X₁ {O(n)}