Start: l0
Program_Vars: X₀, X₁, X₂
Temp_Vars: D
Locations: l0, l1, l2
Transitions:
t₂: l0(X₀, X₁, X₂) → l1(X₀, X₁, X₂)
t₀: l1(X₀, X₁, X₂) → l1(1+X₀, X₁, X₂) :|: 1+X₀ ≤ X₁
t₁: l1(X₀, X₁, X₂) → l2(X₀, X₁, D) :|: X₁ ≤ X₀
Eliminate variables {D,X₂} that do not contribute to the problem
Found invariant X₁ ≤ X₀ for location l2
Start: l0
Program_Vars: X₀, X₁
Temp_Vars:
Locations: l0, l1, l2
Transitions:
t₇: l0(X₀, X₁) → l1(X₀, X₁)
t₈: l1(X₀, X₁) → l1(1+X₀, X₁) :|: 1+X₀ ≤ X₁
t₉: l1(X₀, X₁) → l2(X₀, X₁) :|: X₁ ≤ X₀
Found invariant X₁ ≤ X₀ for location l2
Termination: true
Formula:
relevant size-bounds w.r.t. t₇:
X₀: X₀ {O(n)}
X₁: X₁ {O(n)}
Runtime-bound of t₇: 1 {O(1)}
Results in: 2⋅X₀+2⋅X₁+4 {O(n)}
Overall timebound:2⋅X₀+2⋅X₁+6 {O(n)}
t₇: 1 {O(1)}
t₈: 2⋅X₀+2⋅X₁+4 {O(n)}
t₉: 1 {O(1)}
Overall costbound: 2⋅X₀+2⋅X₁+6 {O(n)}
t₇: 1 {O(1)}
t₈: 2⋅X₀+2⋅X₁+4 {O(n)}
t₉: 1 {O(1)}
t₇, X₀: X₀ {O(n)}
t₇, X₁: X₁ {O(n)}
t₈, X₀: 2⋅X₁+3⋅X₀+4 {O(n)}
t₈, X₁: X₁ {O(n)}
t₉, X₀: 2⋅X₁+4⋅X₀+4 {O(n)}
t₉, X₁: 2⋅X₁ {O(n)}