Start: l0
Program_Vars: X₀
Temp_Vars: B
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀) → l1(B)
t₁: l1(X₀) → l1(X₀+1) :|: X₀ ≤ 3 ∧ 1 ≤ X₀
t₂: l1(X₀) → l1(1) :|: X₀ ≤ 0 ∧ X₀ ≤ 3
t₃: l1(X₀) → l2(X₀) :|: 4 ≤ X₀
Found invariant 4 ≤ X₀ for location l2
Start: l0
Program_Vars: X₀
Temp_Vars: B
Locations: l0, l1, l2
Transitions:
t₀: l0(X₀) → l1(B)
t₁: l1(X₀) → l1(X₀+1) :|: X₀ ≤ 3 ∧ 1 ≤ X₀
t₂: l1(X₀) → l1(1) :|: X₀ ≤ 0 ∧ X₀ ≤ 3
t₃: l1(X₀) → l2(X₀) :|: 4 ≤ X₀
knowledge_propagation leads to new time bound 1 {O(1)} for transition t₂: l1(X₀) → l1(1) :|: X₀ ≤ 0 ∧ X₀ ≤ 3
Cut unsatisfiable transition t₅₅: n_l1___1→l2
Cut unsatisfiable transition t₅₆: n_l1___2→l2
Found invariant 4 ≤ X₀ for location l2
Found invariant X₀ ≤ 1 ∧ 1 ≤ X₀ for location n_l1___2
Found invariant X₀ ≤ 4 ∧ 2 ≤ X₀ for location n_l1___3
Found invariant X₀ ≤ 2 ∧ 2 ≤ X₀ for location n_l1___1
new bound:
17 {O(1)}
MPRF:
n_l1___3 [5-X₀ ]
new bound:
17 {O(1)}
cfr-program:
Start: l0
Program_Vars: X₀
Temp_Vars: B
Locations: l0, l1, l2, n_l1___1, n_l1___2, n_l1___3
Transitions:
t₀: l0(X₀) → l1(B)
t₃: l1(X₀) → l2(X₀) :|: 4 ≤ X₀
t₄₇: l1(X₀) → n_l1___2(1) :|: X₀ ≤ 0
t₄₈: l1(X₀) → n_l1___3(X₀+1) :|: 1 ≤ X₀ ∧ X₀ ≤ 3
t₄₄: n_l1___1(X₀) → n_l1___3(X₀+1) :|: X₀ ≤ 3 ∧ 1 ≤ X₀ ∧ 1 ≤ X₀ ∧ X₀ ≤ 3 ∧ 2 ≤ X₀ ∧ X₀ ≤ 4 ∧ 1 ≤ X₀ ∧ X₀ ≤ 3 ∧ X₀ ≤ 2 ∧ 2 ≤ X₀
t₄₅: n_l1___2(X₀) → n_l1___1(X₀+1) :|: X₀ ≤ 3 ∧ 1 ≤ X₀ ∧ 1 ≤ X₀ ∧ X₀ ≤ 3 ∧ X₀ ≤ 1 ∧ 1 ≤ X₀ ∧ 1 ≤ X₀ ∧ X₀ ≤ 3 ∧ X₀ ≤ 1 ∧ 1 ≤ X₀
t₅₇: n_l1___3(X₀) → l2(X₀) :|: 4 ≤ X₀ ∧ X₀ ≤ 4 ∧ 2 ≤ X₀
t₄₆: n_l1___3(X₀) → n_l1___3(X₀+1) :|: 1 ≤ X₀ ∧ 2 ≤ X₀ ∧ X₀ ≤ 4 ∧ 1 ≤ X₀ ∧ X₀ ≤ 3 ∧ X₀ ≤ 4 ∧ 2 ≤ X₀
Overall timebound:24 {O(1)}
t₀: 1 {O(1)}
t₃: 1 {O(1)}
t₄₇: 1 {O(1)}
t₄₈: 1 {O(1)}
t₄₄: 1 {O(1)}
t₄₅: 1 {O(1)}
t₄₆: 17 {O(1)}
t₅₇: 1 {O(1)}
Overall costbound: 24 {O(1)}
t₀: 1 {O(1)}
t₃: 1 {O(1)}
t₄₇: 1 {O(1)}
t₄₈: 1 {O(1)}
t₄₄: 1 {O(1)}
t₄₅: 1 {O(1)}
t₄₆: 17 {O(1)}
t₅₇: 1 {O(1)}
t₄₇, X₀: 1 {O(1)}
t₄₈, X₀: 4 {O(1)}
t₄₄, X₀: 3 {O(1)}
t₄₅, X₀: 2 {O(1)}
t₄₆, X₀: 4 {O(1)}
t₅₇, X₀: 4 {O(1)}