 Some types of termination analysis can automatically generate or imply the existence of a termination proof.An example of a programming language construct which may or may not terminate is a loop, as they can be run repeatedly.Loops implemented using a counter variable as typically found in data processing algorithms will usually terminate, demonstrated by the pseudocode example below