Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀
Temp_Vars: L, M, N
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₇: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l1(1, X₁, X₂, X₃, X₄, X₅, L, M, X₈, X₉, X₁₀) :|: M ≤ 0
t₈: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l1(1, X₁, X₂, X₃, X₄, X₅, L, 0, 1, M, M) :|: 1 ≤ M ∧ 1 ≤ N
t₉: l0(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l2(1, X₁, X₂, X₃, X₄, X₅, L, 0, 1, M, M) :|: M ≤ 0 ∧ 1 ≤ N
t₀: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) :|: X₀ ≤ 0
t₆: l1(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l3(0, X₁, L, X₃, X₄, L, X₆, X₇, X₈, X₉, X₁₀) :|: 1 ≤ X₀
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l2(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀)
t₃: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l2(X₀, L, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) :|: 1 ≤ X₀
t₄: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l2(X₀, M, X₂, L, L, X₅, X₆, X₇, X₈, X₉, X₁₀) :|: X₀ ≤ 0 ∧ L ≤ 999+X₂
t₅: l3(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l2(1, M, X₂, L, L, X₅, X₆, X₇, X₈, X₉, X₁₀) :|: X₀ ≤ 0 ∧ X₂+1000 ≤ L
t₂: l5(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀) → l4(X₀, X₁, X₂, X₃, X₄, X₅, X₆, X₇, X₈, X₉, X₁₀)
Cut unreachable locations [l4; l5] from the program graph
Cut unsatisfiable transition t₀: l1→l3
Cut unsatisfiable transition t₃: l3→l2
Eliminate variables {X₁,X₃,X₄,X₅,X₆,X₇,X₈,X₉,X₁₀} that do not contribute to the problem
Found invariant X₀ ≤ 1 ∧ 0 ≤ X₀ for location l2
Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location l1
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l3
Start: l0
Program_Vars: X₀, X₁
Temp_Vars: L, M, N
Locations: l0, l1, l2, l3
Transitions:
t₁₈: l0(X₀, X₁) → l1(1, X₁) :|: M ≤ 0
t₁₉: l0(X₀, X₁) → l1(1, X₁) :|: 1 ≤ M ∧ 1 ≤ N
t₂₀: l0(X₀, X₁) → l2(1, X₁) :|: M ≤ 0 ∧ 1 ≤ N
t₂₁: l1(X₀, X₁) → l3(0, L) :|: 1 ≤ X₀ ∧ X₀ ≤ 1 ∧ 1 ≤ X₀
t₂₂: l2(X₀, X₁) → l2(X₀, X₁) :|: X₀ ≤ 1 ∧ 0 ≤ X₀
t₂₃: l3(X₀, X₁) → l2(X₀, X₁) :|: X₀ ≤ 0 ∧ L ≤ 999+X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀
t₂₄: l3(X₀, X₁) → l2(1, X₁) :|: X₀ ≤ 0 ∧ X₁+1000 ≤ L ∧ X₀ ≤ 0 ∧ 0 ≤ X₀
Found invariant X₀ ≤ 1 ∧ 0 ≤ X₀ for location l2
Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location l1
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location l3
Overall timebound:inf {Infinity}
t₁₈: 1 {O(1)}
t₁₉: 1 {O(1)}
t₂₀: 1 {O(1)}
t₂₁: 1 {O(1)}
t₂₂: inf {Infinity}
t₂₃: 1 {O(1)}
t₂₄: 1 {O(1)}
Overall costbound: inf {Infinity}
t₁₈: 1 {O(1)}
t₁₉: 1 {O(1)}
t₂₀: 1 {O(1)}
t₂₁: 1 {O(1)}
t₂₂: inf {Infinity}
t₂₃: 1 {O(1)}
t₂₄: 1 {O(1)}
t₁₈, X₀: 1 {O(1)}
t₁₈, X₁: X₁ {O(n)}
t₁₉, X₀: 1 {O(1)}
t₁₉, X₁: X₁ {O(n)}
t₂₀, X₀: 1 {O(1)}
t₂₀, X₁: X₁ {O(n)}
t₂₁, X₀: 0 {O(1)}
t₂₂, X₀: 1 {O(1)}
t₂₃, X₀: 0 {O(1)}
t₂₄, X₀: 1 {O(1)}