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