Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars:
Locations: l0, l1, l2, l3, l4
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄) → l2(X₀, X₁, X₂, X₃, X₄)
t₂: l1(X₀, X₁, X₂, X₃, X₄) → l1(X₁, X₀, X₂, X₃, X₄) :|: X₀+X₁ < 100
t₃: l1(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₂, X₃, X₄) :|: 100 ≤ X₀+X₁
t₁: l2(X₀, X₁, X₂, X₃, X₄) → l1(13, 17, X₂, X₃, X₄)
t₄: l3(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄)
Cut unsatisfiable transition t₃: l1→l3
Cut unreachable locations [l3; l4] from the program graph
Eliminate variables {X₂,X₃,X₄} that do not contribute to the problem
Found invariant X₁ ≤ 17 ∧ X₁ ≤ 4+X₀ ∧ X₀+X₁ ≤ 30 ∧ 13 ≤ X₁ ∧ 30 ≤ X₀+X₁ ∧ X₀ ≤ 4+X₁ ∧ X₀ ≤ 17 ∧ 13 ≤ X₀ for location l1
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₁₁: l0(X₀, X₁) → l2(X₀, X₁)
t₁₂: l1(X₀, X₁) → l1(X₁, X₀) :|: X₀+X₁ < 100 ∧ X₁ ≤ 17 ∧ X₁ ≤ 4+X₀ ∧ X₀+X₁ ≤ 30 ∧ 13 ≤ X₁ ∧ 30 ≤ X₀+X₁ ∧ X₀ ≤ 4+X₁ ∧ X₀ ≤ 17 ∧ 13 ≤ X₀
t₁₃: l2(X₀, X₁) → l1(13, 17)
Found invariant X₁ ≤ 17 ∧ X₁ ≤ 4+X₀ ∧ X₀+X₁ ≤ 30 ∧ 17 ≤ X₁ ∧ 30 ≤ X₀+X₁ ∧ 4+X₀ ≤ X₁ ∧ X₀ ≤ 13 ∧ 13 ≤ X₀ for location l1
Found invariant X₁ ≤ 17 ∧ X₁ ≤ 4+X₀ ∧ X₀+X₁ ≤ 30 ∧ 13 ≤ X₁ ∧ 30 ≤ X₀+X₁ ∧ X₀ ≤ 4+X₁ ∧ X₀ ≤ 17 ∧ 13 ≤ 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₀: 17 {O(1)}
t₁₂, X₁: 17 {O(1)}
t₁₃, X₀: 13 {O(1)}
t₁₃, X₁: 17 {O(1)}