Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅)
t₃: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₄: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₁ < X₀
t₅: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₀ < X₁
t₁: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₅, X₄, X₂, X₃, X₄, X₅) :|: X₄ < X₅
t₂: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₅, X₅, X₂, X₃, X₄, X₅) :|: X₅ ≤ X₄
t₆: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀+1, X₄, X₂, X₃, X₄, X₅) :|: X₄ < X₀+1
t₇: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀+1, X₀+1, X₂, X₃, X₄, X₅) :|: X₀+1 ≤ X₄
t₈: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅)
Cut unsatisfiable transition t₅: l1→l4
Eliminate variables {X₂,X₃} that do not contribute to the problem
Found invariant X₃ ≤ X₀ ∧ X₁ ≤ X₂ ∧ 1+X₁ ≤ X₀ for location l5
Found invariant X₃ ≤ X₀ ∧ X₁ ≤ X₂ ∧ X₁ ≤ X₀ for location l1
Found invariant X₃ ≤ X₀ ∧ X₁ ≤ X₂ ∧ 1+X₁ ≤ X₀ for location l4
Found invariant X₃ ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ X₁ ≤ X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l3
Start: l0
Program_Vars: X₀, X₁, X₂, X₃
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₂₁: l0(X₀, X₁, X₂, X₃) → l2(X₀, X₁, X₂, X₃)
t₂₂: l1(X₀, X₁, X₂, X₃) → l3(X₀, X₁, X₂, X₃) :|: X₁ ≤ X₀ ∧ X₀ ≤ X₁ ∧ X₃ ≤ X₀ ∧ X₁ ≤ X₂ ∧ X₁ ≤ X₀
t₂₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₁ < X₀ ∧ X₃ ≤ X₀ ∧ X₁ ≤ X₂ ∧ X₁ ≤ X₀
t₂₄: l2(X₀, X₁, X₂, X₃) → l1(X₃, X₂, X₂, X₃) :|: X₂ < X₃
t₂₅: l2(X₀, X₁, X₂, X₃) → l1(X₃, X₃, X₂, X₃) :|: X₃ ≤ X₂
t₂₆: l3(X₀, X₁, X₂, X₃) → l1(X₀+1, X₂, X₂, X₃) :|: X₂ < X₀+1 ∧ X₃ ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ X₁ ≤ X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₂₇: l3(X₀, X₁, X₂, X₃) → l1(X₀+1, X₀+1, X₂, X₃) :|: X₀+1 ≤ X₂ ∧ X₃ ≤ X₂ ∧ X₃ ≤ X₁ ∧ X₃ ≤ X₀ ∧ X₁ ≤ X₂ ∧ X₀ ≤ X₂ ∧ X₁ ≤ X₀ ∧ X₀ ≤ X₁
t₂₈: l4(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃) :|: X₃ ≤ X₀ ∧ X₁ ≤ X₂ ∧ 1+X₁ ≤ X₀
new bound:
X₂+X₃+1 {O(n)}
new bound:
2⋅X₃+1 {O(n)}
new bound:
X₂+X₃+1 {O(n)}
Overall timebound:2⋅X₂+4⋅X₃+8 {O(n)}
t₂₁: 1 {O(1)}
t₂₂: X₂+X₃+1 {O(n)}
t₂₃: 1 {O(1)}
t₂₄: 1 {O(1)}
t₂₅: 1 {O(1)}
t₂₆: 2⋅X₃+1 {O(n)}
t₂₇: X₂+X₃+1 {O(n)}
t₂₈: 1 {O(1)}
Overall costbound: 2⋅X₂+4⋅X₃+8 {O(n)}
t₂₁: 1 {O(1)}
t₂₂: X₂+X₃+1 {O(n)}
t₂₃: 1 {O(1)}
t₂₄: 1 {O(1)}
t₂₅: 1 {O(1)}
t₂₆: 2⋅X₃+1 {O(n)}
t₂₇: X₂+X₃+1 {O(n)}
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₀: 2⋅X₃+X₂+1 {O(n)}
t₂₂, X₁: 3⋅X₃+X₂+2 {O(n)}
t₂₂, X₂: X₂ {O(n)}
t₂₂, X₃: X₃ {O(n)}
t₂₃, X₀: 3⋅X₃+X₂+2 {O(n)}
t₂₃, X₁: 2⋅X₂+3⋅X₃+2 {O(n)}
t₂₃, X₂: 2⋅X₂ {O(n)}
t₂₃, X₃: 2⋅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₀: 2⋅X₃+X₂+2 {O(n)}
t₂₆, X₁: 3⋅X₃+X₂+2 {O(n)}
t₂₆, X₂: X₂ {O(n)}
t₂₆, X₃: X₃ {O(n)}
t₂₇, X₀: 2⋅X₃+X₂+1 {O(n)}
t₂₇, X₁: 2⋅X₃+X₂+2 {O(n)}
t₂₇, X₂: X₂ {O(n)}
t₂₇, X₃: X₃ {O(n)}
t₂₈, X₀: 3⋅X₃+X₂+2 {O(n)}
t₂₈, X₁: 2⋅X₂+3⋅X₃+2 {O(n)}
t₂₈, X₂: 2⋅X₂ {O(n)}
t₂₈, X₃: 2⋅X₃ {O(n)}