Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars: D
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₁: l1(X₀, X₁, X₂) → l1(X₀-1, D, X₂) :|: 1 ≤ D ∧ 0 ≤ X₀
t₂: l1(X₀, X₁, X₂) → l1(X₀-1, D, X₂) :|: D+1 ≤ 0 ∧ 0 ≤ X₀
t₃: l1(X₀, X₁, X₂) → l1(X₀, 0, X₂) :|: 0 ≤ X₀
t₄: l1(X₀, X₁, X₂) → l2(X₀, X₁, D) :|: X₀+1 ≤ 0
Eliminate variables {X₁,X₂} that do not contribute to the problem
Found invariant 1+X₀ ≤ 0 for location l2
Start: l0
Program_Vars: X₀
Temp_Vars: D
Locations: l0, l1, l2
Transitions:
t₁₂: l0(X₀) → l1(X₀)
t₁₃: l1(X₀) → l1(X₀-1) :|: 1 ≤ D ∧ 0 ≤ X₀
t₁₄: l1(X₀) → l1(X₀-1) :|: D+1 ≤ 0 ∧ 0 ≤ X₀
t₁₅: l1(X₀) → l1(X₀) :|: 0 ≤ X₀
t₁₆: l1(X₀) → l2(X₀) :|: X₀+1 ≤ 0
Cut unsatisfiable transition t₁₃₈: n_l1___1→l2
Found invariant 1+X₀ ≤ 0 for location l2
Found invariant 0 ≤ 1+X₀ for location n_l1___2
Found invariant 0 ≤ 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₀: 3⋅X₀+1 {O(n)}
t₁₄, X₀: 3⋅X₀+1 {O(n)}
t₁₅, X₀: 3⋅X₀+1 {O(n)}
t₁₆, X₀: 7⋅X₀+2 {O(n)}