Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars: nondef.0
Locations: l0, l1, l2, l3, l4, l5, l6, l7, l8
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄) → l8(X₀, X₁, X₂, X₃, X₄)
t₂: l2(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₂, X₃, X₄) :|: 0 < X₀ ∧ X₀ < 100
t₃: l2(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: X₀ ≤ 0
t₄: l2(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: 100 ≤ X₀
t₆: l3(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: X₀ < 2⋅X₁+10
t₅: l3(X₀, X₁, X₂, X₃, X₄) → l6(X₀, X₁, X₂, X₃, X₄) :|: 2⋅X₁+10 ≤ X₀
t₁₁: l4(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁, X₂, X₃, X₄)
t₁₀: l5(X₀, X₁, X₂, X₃, X₄) → l2(X₂, X₀, X₂, X₃, X₄)
t₇: l6(X₀, X₁, X₂, X₃, X₄) → l7(X₀, X₁, X₂, X₃, X₄)
t₉: l7(X₀, X₁, X₂, X₃, X₄) → l5(X₀, X₁, nondef.0, X₃, X₄)
t₁: l8(X₀, X₁, X₂, X₃, X₄) → l2(X₄, X₃, X₂, X₃, X₄)
Found invariant X₁ ≤ 44 ∧ X₁ ≤ 43+X₀ ∧ X₀+X₁ ≤ 143 ∧ X₀ ≤ 99 ∧ 1 ≤ X₀ for location l6
Found invariant X₁ ≤ 44 ∧ X₁ ≤ 43+X₀ ∧ X₀+X₁ ≤ 143 ∧ X₀ ≤ 99 ∧ 1 ≤ X₀ for location l7
Found invariant X₁ ≤ 44 ∧ X₁ ≤ 43+X₀ ∧ X₀+X₁ ≤ 143 ∧ X₀ ≤ 99 ∧ 1 ≤ X₀ for location l5
Found invariant X₀ ≤ 99 ∧ 1 ≤ X₀ for location l3
Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄
Temp_Vars: nondef.0
Locations: l0, l1, l2, l3, l4, l5, l6, l7, l8
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄) → l8(X₀, X₁, X₂, X₃, X₄)
t₂: l2(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₂, X₃, X₄) :|: 0 < X₀ ∧ X₀ < 100
t₃: l2(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: X₀ ≤ 0
t₄: l2(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: 100 ≤ X₀
t₆: l3(X₀, X₁, X₂, X₃, X₄) → l4(X₀, X₁, X₂, X₃, X₄) :|: X₀ < 2⋅X₁+10 ∧ X₀ ≤ 99 ∧ 1 ≤ X₀
t₅: l3(X₀, X₁, X₂, X₃, X₄) → l6(X₀, X₁, X₂, X₃, X₄) :|: 2⋅X₁+10 ≤ X₀ ∧ X₀ ≤ 99 ∧ 1 ≤ X₀
t₁₁: l4(X₀, X₁, X₂, X₃, X₄) → l1(X₀, X₁, X₂, X₃, X₄)
t₁₀: l5(X₀, X₁, X₂, X₃, X₄) → l2(X₂, X₀, X₂, X₃, X₄) :|: X₁ ≤ 44 ∧ X₁ ≤ 43+X₀ ∧ X₀+X₁ ≤ 143 ∧ X₀ ≤ 99 ∧ 1 ≤ X₀
t₇: l6(X₀, X₁, X₂, X₃, X₄) → l7(X₀, X₁, X₂, X₃, X₄) :|: X₁ ≤ 44 ∧ X₁ ≤ 43+X₀ ∧ X₀+X₁ ≤ 143 ∧ X₀ ≤ 99 ∧ 1 ≤ X₀
t₉: l7(X₀, X₁, X₂, X₃, X₄) → l5(X₀, X₁, nondef.0, X₃, X₄) :|: X₁ ≤ 44 ∧ X₁ ≤ 43+X₀ ∧ X₀+X₁ ≤ 143 ∧ X₀ ≤ 99 ∧ 1 ≤ X₀
t₁: l8(X₀, X₁, X₂, X₃, X₄) → l2(X₄, X₃, X₂, X₃, X₄)
new bound:
2⋅X₃+90 {O(n)}
new bound:
2⋅X₃+90 {O(n)}
new bound:
2⋅X₃+90 {O(n)}
new bound:
2⋅X₃+90 {O(n)}
knowledge_propagation leads to new time bound 2⋅X₃+91 {O(n)} for transition t₂: l2(X₀, X₁, X₂, X₃, X₄) → l3(X₀, X₁, X₂, X₃, X₄) :|: 0 < X₀ ∧ X₀ < 100
Overall timebound:10⋅X₃+457 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 2⋅X₃+91 {O(n)}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
t₅: 2⋅X₃+90 {O(n)}
t₆: 1 {O(1)}
t₇: 2⋅X₃+90 {O(n)}
t₉: 2⋅X₃+90 {O(n)}
t₁₀: 2⋅X₃+90 {O(n)}
t₁₁: 1 {O(1)}
Overall costbound: 10⋅X₃+457 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: 2⋅X₃+91 {O(n)}
t₃: 1 {O(1)}
t₄: 1 {O(1)}
t₅: 2⋅X₃+90 {O(n)}
t₆: 1 {O(1)}
t₇: 2⋅X₃+90 {O(n)}
t₉: 2⋅X₃+90 {O(n)}
t₁₀: 2⋅X₃+90 {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₄: 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₀: 99 {O(1)}
t₂, X₁: X₃+99 {O(n)}
t₂, X₃: X₃ {O(n)}
t₂, X₄: X₄ {O(n)}
t₃, X₁: X₃+99 {O(n)}
t₃, X₃: 2⋅X₃ {O(n)}
t₃, X₄: 2⋅X₄ {O(n)}
t₄, X₁: X₃+99 {O(n)}
t₄, X₃: 2⋅X₃ {O(n)}
t₄, X₄: 2⋅X₄ {O(n)}
t₅, X₀: 99 {O(1)}
t₅, X₁: X₃+99 {O(n)}
t₅, X₃: X₃ {O(n)}
t₅, X₄: X₄ {O(n)}
t₆, X₀: 99 {O(1)}
t₆, X₁: X₃+99 {O(n)}
t₆, X₃: X₃ {O(n)}
t₆, X₄: X₄ {O(n)}
t₇, X₀: 99 {O(1)}
t₇, X₁: X₃+99 {O(n)}
t₇, X₃: X₃ {O(n)}
t₇, X₄: X₄ {O(n)}
t₉, X₀: 99 {O(1)}
t₉, X₁: X₃+99 {O(n)}
t₉, X₃: X₃ {O(n)}
t₉, X₄: X₄ {O(n)}
t₁₀, X₁: 99 {O(1)}
t₁₀, X₃: X₃ {O(n)}
t₁₀, X₄: X₄ {O(n)}
t₁₁, X₁: 3⋅X₃+297 {O(n)}
t₁₁, X₃: 5⋅X₃ {O(n)}
t₁₁, X₄: 5⋅X₄ {O(n)}