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)}