Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂) → l2(X₀, X₁, X₂)
t₂: l1(X₀, X₁, X₂) → l3(X₀, X₁, X₂) :|: 0 ≤ X₀
t₃: l1(X₀, X₁, X₂) → l4(X₀, X₁, X₂) :|: X₀ < 0
t₁: l2(X₀, X₁, X₂) → l1(X₂, X₁, X₂)
t₄: l3(X₀, X₁, X₂) → l1(X₀+5, X₁, X₂)
t₅: l4(X₀, X₁, X₂) → l5(X₀, X₁, X₂)
Eliminate variables {X₁} that do not contribute to the problem
Found invariant 1+X₂ ≤ 0 ∧ X₂ ≤ X₀ ∧ 2+X₀+X₂ ≤ 0 ∧ 1+X₀ ≤ 0 for location l5
Found invariant X₂ ≤ X₀ for location l1
Found invariant 1+X₂ ≤ 0 ∧ X₂ ≤ X₀ ∧ 2+X₀+X₂ ≤ 0 ∧ 1+X₀ ≤ 0 for location l4
Found invariant X₂ ≤ X₀ ∧ 0 ≤ X₀ for location l3
Start: l0
Program_Vars: X₀, X₂
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₁₂: l0(X₀, X₂) → l2(X₀, X₂)
t₁₃: l1(X₀, X₂) → l3(X₀, X₂) :|: 0 ≤ X₀ ∧ X₂ ≤ X₀
t₁₄: l1(X₀, X₂) → l4(X₀, X₂) :|: X₀ < 0 ∧ X₂ ≤ X₀
t₁₅: l2(X₀, X₂) → l1(X₂, X₂)
t₁₆: l3(X₀, X₂) → l1(X₀+5, X₂) :|: X₂ ≤ X₀ ∧ 0 ≤ X₀
t₁₇: l4(X₀, X₂) → l5(X₀, X₂) :|: 1+X₂ ≤ 0 ∧ X₂ ≤ X₀ ∧ 2+X₀+X₂ ≤ 0 ∧ 1+X₀ ≤ 0
Found invariant X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 0 ≤ X₀+X₂ ∧ X₀ ≤ X₂ ∧ 0 ≤ X₀ for location n_l3___3
Found invariant 5+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 5 ≤ X₀+X₂ ∧ 5 ≤ X₀ for location n_l1___2
Found invariant 1+X₂ ≤ 0 ∧ X₂ ≤ X₀ ∧ 2+X₀+X₂ ≤ 0 ∧ X₀ ≤ X₂ ∧ 1+X₀ ≤ 0 for location l5
Found invariant X₂ ≤ X₀ ∧ X₀ ≤ X₂ for location l1
Found invariant 1+X₂ ≤ 0 ∧ X₂ ≤ X₀ ∧ 2+X₀+X₂ ≤ 0 ∧ X₀ ≤ X₂ ∧ 1+X₀ ≤ 0 for location l4
Found invariant 5+X₂ ≤ X₀ ∧ 0 ≤ X₂ ∧ 5 ≤ X₀+X₂ ∧ 5 ≤ X₀ for location n_l3___1
Overall timebound:inf {Infinity}
t₁₂: 1 {O(1)}
t₁₃: inf {Infinity}
t₁₄: 1 {O(1)}
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₁₅: 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)}
t₁₅, X₂: X₂ {O(n)}
t₁₆, X₂: X₂ {O(n)}
t₁₇, X₀: X₂ {O(n)}
t₁₇, X₂: X₂ {O(n)}