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