Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁) → l2(X₀, X₁)
t₂: l1(X₀, X₁) → l3(X₀, X₁) :|: 1 < X₀
t₃: l1(X₀, X₁) → l4(X₀, X₁) :|: X₀ ≤ 1
t₁: l2(X₀, X₁) → l1(X₁, X₁)
t₄: l3(X₀, X₁) → l1(2⋅X₀, X₁)
t₅: l4(X₀, X₁) → l5(X₀, X₁)
Found invariant X₁ ≤ 1 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 2 ∧ X₀ ≤ 1 for location l5
Found invariant X₁ ≤ X₀ for location l1
Found invariant X₁ ≤ 1 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 2 ∧ X₀ ≤ 1 for location l4
Found invariant X₁ ≤ X₀ ∧ 2 ≤ X₀ for location l3
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2, l3, l4, l5
Transitions:
t₀: l0(X₀, X₁) → l2(X₀, X₁)
t₂: l1(X₀, X₁) → l3(X₀, X₁) :|: 1 < X₀ ∧ X₁ ≤ X₀
t₃: l1(X₀, X₁) → l4(X₀, X₁) :|: X₀ ≤ 1 ∧ X₁ ≤ X₀
t₁: l2(X₀, X₁) → l1(X₁, X₁)
t₄: l3(X₀, X₁) → l1(2⋅X₀, X₁) :|: X₁ ≤ X₀ ∧ 2 ≤ X₀
t₅: l4(X₀, X₁) → l5(X₀, X₁) :|: X₁ ≤ 1 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 2 ∧ X₀ ≤ 1
Found invariant X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 4 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ 2 ≤ X₀ for location n_l3___3
Found invariant 2+X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 6 ≤ X₀+X₁ ∧ 4 ≤ X₀ for location n_l1___2
Found invariant X₁ ≤ 1 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 2 ∧ X₀ ≤ X₁ ∧ X₀ ≤ 1 for location l5
Found invariant X₁ ≤ X₀ ∧ X₀ ≤ X₁ for location l1
Found invariant X₁ ≤ 1 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 2 ∧ X₀ ≤ X₁ ∧ X₀ ≤ 1 for location l4
Found invariant 2+X₁ ≤ X₀ ∧ 2 ≤ X₁ ∧ 6 ≤ X₀+X₁ ∧ 4 ≤ 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₁: X₁ {O(n)}