Initial Problem

Start: evaleasy2start
Program_Vars: X₀
Temp_Vars:
Locations: evaleasy2bb1in, evaleasy2bbin, evaleasy2entryin, evaleasy2returnin, evaleasy2start, evaleasy2stop
Transitions:
t₂: evaleasy2bb1in(X₀) → evaleasy2bbin(X₀) :|: 1 ≤ X₀
t₃: evaleasy2bb1in(X₀) → evaleasy2returnin(X₀) :|: X₀ ≤ 0
t₄: evaleasy2bbin(X₀) → evaleasy2bb1in(X₀-1)
t₁: evaleasy2entryin(X₀) → evaleasy2bb1in(X₀)
t₅: evaleasy2returnin(X₀) → evaleasy2stop(X₀)
t₀: evaleasy2start(X₀) → evaleasy2entryin(X₀)

Preprocessing

Found invariant 1 ≤ X₀ for location evaleasy2bbin

Found invariant X₀ ≤ 0 for location evaleasy2returnin

Found invariant X₀ ≤ 0 for location evaleasy2stop

Problem after Preprocessing

Start: evaleasy2start
Program_Vars: X₀
Temp_Vars:
Locations: evaleasy2bb1in, evaleasy2bbin, evaleasy2entryin, evaleasy2returnin, evaleasy2start, evaleasy2stop
Transitions:
t₂: evaleasy2bb1in(X₀) → evaleasy2bbin(X₀) :|: 1 ≤ X₀
t₃: evaleasy2bb1in(X₀) → evaleasy2returnin(X₀) :|: X₀ ≤ 0
t₄: evaleasy2bbin(X₀) → evaleasy2bb1in(X₀-1) :|: 1 ≤ X₀
t₁: evaleasy2entryin(X₀) → evaleasy2bb1in(X₀)
t₅: evaleasy2returnin(X₀) → evaleasy2stop(X₀) :|: X₀ ≤ 0
t₀: evaleasy2start(X₀) → evaleasy2entryin(X₀)

MPRF for transition t₂: evaleasy2bb1in(X₀) → evaleasy2bbin(X₀) :|: 1 ≤ X₀ of depth 1:

new bound:

X₀ {O(n)}

• evaleasy2bb1in: [X₀]
• evaleasy2bbin: [X₀-1]

MPRF for transition t₄: evaleasy2bbin(X₀) → evaleasy2bb1in(X₀-1) :|: 1 ≤ X₀ of depth 1:

new bound:

X₀ {O(n)}

• evaleasy2bb1in: [X₀]
• evaleasy2bbin: [X₀]

All Bounds

Timebounds

Overall timebound:2⋅X₀+4 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₀ {O(n)}
t₃: 1 {O(1)}
t₄: X₀ {O(n)}
t₅: 1 {O(1)}

Costbounds

Overall costbound: 2⋅X₀+4 {O(n)}
t₀: 1 {O(1)}
t₁: 1 {O(1)}
t₂: X₀ {O(n)}
t₃: 1 {O(1)}
t₄: X₀ {O(n)}
t₅: 1 {O(1)}

Sizebounds

t₀, X₀: X₀ {O(n)}
t₁, X₀: X₀ {O(n)}
t₂, X₀: X₀ {O(n)}
t₃, X₀: 2⋅X₀ {O(n)}
t₄, X₀: X₀ {O(n)}
t₅, X₀: 2⋅X₀ {O(n)}