Start: l0
Program_Vars: X₀, X₁, X₂, X₃, X₄, X₅
Temp_Vars: G, H
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁, X₂, X₃, X₄, X₅) → l1(G, G, G, 0, X₄, X₅)
t₁: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l1(X₀, X₁, X₂, X₃+1, G, X₅) :|: X₃+1 ≤ X₂
t₁₁: l1(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, X₅) :|: X₂ ≤ X₃
t₂: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, G) :|: H+1 ≤ 0
t₃: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l2(X₀, X₁, X₂, X₃, X₄, G)
t₁₀: l2(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₂, X₃, X₄, X₅)
t₄: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₂, X₃, X₄, X₅) :|: H+1 ≤ G
t₅: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l3(X₀, X₁, X₂, X₃, X₄, X₅)
t₉: l3(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅)
t₆: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅) :|: H+1 ≤ G
t₇: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l4(X₀, X₁, X₂, X₃, X₄, X₅)
t₈: l4(X₀, X₁, X₂, X₃, X₄, X₅) → l5(X₀, X₁, X₂, X₃, X₄, X₅)
Eliminate variables {X₀,X₁,X₄,X₅} that do not contribute to the problem
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l2
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l5
Found invariant 0 ≤ X₁ for location l1
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l4
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l3
Start: l0
Program_Vars: X₀, X₁
Temp_Vars: G, H
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₂₇: l0(X₀, X₁) → l1(G, 0)
t₂₈: l1(X₀, X₁) → l1(X₀, X₁+1) :|: X₁+1 ≤ X₀ ∧ 0 ≤ X₁
t₂₉: l1(X₀, X₁) → l2(X₀, X₁) :|: X₀ ≤ X₁ ∧ 0 ≤ X₁
t₃₀: l2(X₀, X₁) → l2(X₀, X₁) :|: H+1 ≤ 0 ∧ 0 ≤ X₁ ∧ X₀ ≤ X₁
t₃₁: l2(X₀, X₁) → l2(X₀, X₁) :|: 0 ≤ X₁ ∧ X₀ ≤ X₁
t₃₂: l2(X₀, X₁) → l3(X₀, X₁) :|: 0 ≤ X₁ ∧ X₀ ≤ X₁
t₃₃: l3(X₀, X₁) → l3(X₀, X₁) :|: H+1 ≤ G ∧ 0 ≤ X₁ ∧ X₀ ≤ X₁
t₃₄: l3(X₀, X₁) → l3(X₀, X₁) :|: 0 ≤ X₁ ∧ X₀ ≤ X₁
t₃₅: l3(X₀, X₁) → l4(X₀, X₁) :|: 0 ≤ X₁ ∧ X₀ ≤ X₁
t₃₆: l4(X₀, X₁) → l4(X₀, X₁) :|: H+1 ≤ G ∧ 0 ≤ X₁ ∧ X₀ ≤ X₁
t₃₇: l4(X₀, X₁) → l4(X₀, X₁) :|: 0 ≤ X₁ ∧ X₀ ≤ X₁
t₃₈: l4(X₀, X₁) → l5(X₀, X₁) :|: 0 ≤ X₁ ∧ X₀ ≤ X₁
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l2
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l5
Found invariant X₁ ≤ 0 ∧ 0 ≤ X₁ for location l1
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l4
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l3
Found invariant X₁ ≤ X₀ ∧ 1 ≤ X₁ ∧ 2 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location n_l1___1
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l2
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l5
Found invariant 0 ≤ X₁ for location l1
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l4
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l3
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l2
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l5
Found invariant 0 ≤ X₁ for location l1
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l4
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l3
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l2
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l5
Found invariant 0 ≤ X₁ for location l1
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l4
Found invariant 0 ≤ X₁ ∧ X₀ ≤ X₁ for location l3
Overall timebound:inf {Infinity}
t₂₇: 1 {O(1)}
t₂₈: inf {Infinity}
t₂₉: 1 {O(1)}
t₃₀: inf {Infinity}
t₃₁: inf {Infinity}
t₃₂: 1 {O(1)}
t₃₃: inf {Infinity}
t₃₄: inf {Infinity}
t₃₅: 1 {O(1)}
t₃₆: inf {Infinity}
t₃₇: inf {Infinity}
t₃₈: 1 {O(1)}
Overall costbound: inf {Infinity}
t₂₇: 1 {O(1)}
t₂₈: inf {Infinity}
t₂₉: 1 {O(1)}
t₃₀: inf {Infinity}
t₃₁: inf {Infinity}
t₃₂: 1 {O(1)}
t₃₃: inf {Infinity}
t₃₄: inf {Infinity}
t₃₅: 1 {O(1)}
t₃₆: inf {Infinity}
t₃₇: inf {Infinity}
t₃₈: 1 {O(1)}
t₂₇, X₁: 0 {O(1)}