// A gap of `length` positions under a linear model: each position scores `gap`. method LinearGapPenalty(length: int, gap: int) returns (result: int) requires length >= 0 ensures result == length * gap { result := length * gap; } // The same score, built one position at a time: the product is the model, not a shortcut. method LinearGapByPositions(length: int, gap: int) returns (score: int) requires length >= 0 ensures score == length * gap { score := 0; var i := 0; while i < length invariant 0 <= i <= length invariant score == i * gap { score := score + gap; i := i + 1; } }