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₃) :|: 0 ≤ X₁
t₃: l1(X₀, X₁, X₂, X₃) → l4(X₀, X₁, X₂, X₃) :|: X₁ < 0
t₁: l2(X₀, X₁, X₂, X₃) → l1(0, 0, X₂, X₃)
t₄: l3(X₀, X₁, X₂, X₃) → l1(X₀+1, X₁+1, X₂, X₃) :|: X₀ ≤ 50
t₅: l3(X₀, X₁, X₂, X₃) → l1(X₀+1, X₁-1, X₂, X₃) :|: 50 < X₀
t₆: l4(X₀, X₁, X₂, X₃) → l5(X₀, X₁, X₂, X₃)
Eliminate variables {X₂,X₃} that do not contribute to the problem
Found invariant 1+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l5
Found invariant X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀ for location l1
Found invariant 1+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ X₀+X₁ ∧ 1 ≤ X₀ for location l4
Found invariant X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ 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₁) :|: 0 ≤ X₁ ∧ X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₁₆: l1(X₀, X₁) → l4(X₀, X₁) :|: X₁ < 0 ∧ X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₁₇: l2(X₀, X₁) → l1(0, 0)
t₁₈: l3(X₀, X₁) → l1(X₀+1, X₁+1) :|: X₀ ≤ 50 ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₁₉: l3(X₀, X₁) → l1(X₀+1, X₁-1) :|: 50 < X₀ ∧ X₁ ≤ X₀ ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ 0 ≤ X₀
t₂₀: l4(X₀, X₁) → l5(X₀, X₁) :|: 1+X₁ ≤ 0 ∧ 2+X₁ ≤ X₀ ∧ 0 ≤ 1+X₁ ∧ 0 ≤ X₀+X₁ ∧ 1 ≤ X₀
new bound:
51 {O(1)}
MPRF:
l3 [51-X₀ ]
l1 [51-X₀ ]
Found invariant 1 ≤ 0 for location l5
Found invariant 1 ≤ 0 for location l1
Found invariant 1 ≤ 0 for location l4
Found invariant 1 ≤ 0 for location l3
Found invariant 1 ≤ 0 for location l5
Found invariant X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location l1
Found invariant 1 ≤ 0 for location l4
Found invariant X₁ ≤ 0 ∧ X₁ ≤ X₀ ∧ X₀+X₁ ≤ 0 ∧ 0 ≤ X₁ ∧ 0 ≤ X₀+X₁ ∧ X₀ ≤ X₁ ∧ X₀ ≤ 0 ∧ 0 ≤ X₀ for location l3
Termination: true
Formula:
relevant size-bounds w.r.t. t₁₈:
X₀: 51 {O(1)}
X₁: 51 {O(1)}
Runtime-bound of t₁₈: 51 {O(1)}
Results in: 15810 {O(1)}
Termination: true
Formula:
relevant size-bounds w.r.t. t₁₇:
X₀: 0 {O(1)}
X₁: 0 {O(1)}
Runtime-bound of t₁₇: 1 {O(1)}
Results in: 106 {O(1)}
relevant size-bounds w.r.t. t₁₈:
X₀: 51 {O(1)}
X₁: 51 {O(1)}
Runtime-bound of t₁₈: 51 {O(1)}
Results in: 15810 {O(1)}
relevant size-bounds w.r.t. t₁₇:
X₀: 0 {O(1)}
X₁: 0 {O(1)}
Runtime-bound of t₁₇: 1 {O(1)}
Results in: 106 {O(1)}
Overall timebound:31887 {O(1)}
t₁₄: 1 {O(1)}
t₁₅: 15916 {O(1)}
t₁₆: 1 {O(1)}
t₁₇: 1 {O(1)}
t₁₈: 51 {O(1)}
t₁₉: 15916 {O(1)}
t₂₀: 1 {O(1)}
Overall costbound: 31887 {O(1)}
t₁₄: 1 {O(1)}
t₁₅: 15916 {O(1)}
t₁₆: 1 {O(1)}
t₁₇: 1 {O(1)}
t₁₈: 51 {O(1)}
t₁₉: 15916 {O(1)}
t₂₀: 1 {O(1)}
t₁₄, X₀: X₀ {O(n)}
t₁₄, X₁: X₁ {O(n)}
t₁₅, X₀: 15967 {O(1)}
t₁₅, X₁: 52 {O(1)}
t₁₆, X₀: 15967 {O(1)}
t₁₆, X₁: 1 {O(1)}
t₁₇, X₀: 0 {O(1)}
t₁₇, X₁: 0 {O(1)}
t₁₈, X₀: 51 {O(1)}
t₁₈, X₁: 51 {O(1)}
t₁₉, X₀: 15967 {O(1)}
t₁₉, X₁: 52 {O(1)}
t₂₀, X₀: 15967 {O(1)}
t₂₀, X₁: 1 {O(1)}