Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C
Locations: l0, l1, l2, l3, l4, l5, l6, l7, l8
Transitions:
t₀: l0(X₀, X₁) → l7(X₀, X₁)
t₈: l1(X₀, X₁) → l2(X₀, X₁) :|: X₀ ≤ X₁
t₇: l1(X₀, X₁) → l5(X₀, X₁) :|: X₁+1 ≤ X₀
t₁₀: l2(X₀, X₁) → l3(X₀-1, X₁)
t₃: l3(X₀, X₁) → l4(X₀, X₁) :|: 0 ≤ X₀
t₄: l3(X₀, X₁) → l6(X₀, X₁) :|: X₀+1 ≤ 0
t₅: l4(X₀, X₁) → l1(X₀, 1) :|: 2 ≤ X₀
t₆: l4(X₀, X₁) → l2(X₀, C) :|: X₀ ≤ 1
t₉: l5(X₀, X₁) → l1(X₀, 2⋅X₁)
t₁₁: l6(X₀, X₁) → l8(X₀, X₁)
t₁: l7(X₀, X₁) → l3(X₀, X₁) :|: 0 ≤ X₀
t₂: l7(X₀, X₁) → l6(X₀, X₁) :|: X₀+1 ≤ 0
Found invariant 0 ≤ X₀ for location l2
Found invariant 1+X₀ ≤ 0 for location l6
Found invariant 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location l5
Found invariant 1+X₀ ≤ 0 for location l8
Found invariant 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location l1
Found invariant 0 ≤ X₀ for location l4
Found invariant 0 ≤ 1+X₀ for location l3
Start: l0
Program_Vars: X₀, X₁
Temp_Vars: C
Locations: l0, l1, l2, l3, l4, l5, l6, l7, l8
Transitions:
t₀: l0(X₀, X₁) → l7(X₀, X₁)
t₈: l1(X₀, X₁) → l2(X₀, X₁) :|: X₀ ≤ X₁ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀
t₇: l1(X₀, X₁) → l5(X₀, X₁) :|: X₁+1 ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀
t₁₀: l2(X₀, X₁) → l3(X₀-1, X₁) :|: 0 ≤ X₀
t₃: l3(X₀, X₁) → l4(X₀, X₁) :|: 0 ≤ X₀ ∧ 0 ≤ 1+X₀
t₄: l3(X₀, X₁) → l6(X₀, X₁) :|: X₀+1 ≤ 0 ∧ 0 ≤ 1+X₀
t₅: l4(X₀, X₁) → l1(X₀, 1) :|: 2 ≤ X₀ ∧ 0 ≤ X₀
t₆: l4(X₀, X₁) → l2(X₀, C) :|: X₀ ≤ 1 ∧ 0 ≤ X₀
t₉: l5(X₀, X₁) → l1(X₀, 2⋅X₁) :|: 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀
t₁₁: l6(X₀, X₁) → l8(X₀, X₁) :|: 1+X₀ ≤ 0
t₁: l7(X₀, X₁) → l3(X₀, X₁) :|: 0 ≤ X₀
t₂: l7(X₀, X₁) → l6(X₀, X₁) :|: X₀+1 ≤ 0
Cut unsatisfiable transition t₄: l3→l6
Found invariant X₀ ≤ 1 ∧ 0 ≤ X₀ for location n_l2___7
Found invariant 1+X₀ ≤ 0 for location l6
Found invariant 0 ≤ X₀ for location n_l4___9
Found invariant X₁ ≤ 1 ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l5___6
Found invariant X₁ ≤ 1 ∧ 1+X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 3 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l1___8
Found invariant X₀ ≤ 0 ∧ 0 ≤ X₀ for location n_l4___1
Found invariant 1+X₀ ≤ 0 for location l8
Found invariant 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ 2 ≤ X₀ for location n_l1___5
Found invariant X₀ ≤ 0 ∧ 0 ≤ 1+X₀ for location n_l3___2
Found invariant 0 ≤ X₀ for location l3
Found invariant 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l2___4
Found invariant 1+X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 5 ≤ X₀+X₁ ∧ 3 ≤ X₀ for location n_l5___3
Overall timebound:inf {Infinity}
t₀: 1 {O(1)}
t₇: inf {Infinity}
t₈: inf {Infinity}
t₁₀: inf {Infinity}
t₃: inf {Infinity}
t₄: 1 {O(1)}
t₅: inf {Infinity}
t₆: inf {Infinity}
t₉: inf {Infinity}
t₁₁: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
Overall costbound: inf {Infinity}
t₀: 1 {O(1)}
t₇: inf {Infinity}
t₈: inf {Infinity}
t₁₀: inf {Infinity}
t₃: inf {Infinity}
t₄: 1 {O(1)}
t₅: inf {Infinity}
t₆: inf {Infinity}
t₉: inf {Infinity}
t₁₁: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 1 {O(1)}
t₀, X₀: X₀ {O(n)}
t₀, X₁: X₁ {O(n)}
t₇, X₀: X₀+2 {O(n)}
t₈, X₀: X₀+2 {O(n)}
t₁₀, X₀: X₀+2 {O(n)}
t₃, X₀: X₀+2 {O(n)}
t₄, X₀: 1 {O(1)}
t₅, X₀: X₀+2 {O(n)}
t₅, X₁: 1 {O(1)}
t₆, X₀: 1 {O(1)}
t₉, X₀: X₀+2 {O(n)}
t₁₁, X₀: X₀+1 {O(n)}
t₁, X₀: X₀ {O(n)}
t₁, X₁: X₁ {O(n)}
t₂, X₀: X₀ {O(n)}
t₂, X₁: X₁ {O(n)}