AliasDarteFeautrierGonnord-SAS2010-nestedLoop_false-no-overflow.c

/*
 * Program used in the experimental evaluation of the following paper.
 * 2010SAS - Alias,Darte,Feautrier,Gonnord, Multi-dimensional Rankings, Program Termination, and Complexity Bounds of Flowchart Programs
 *
 * Date: 2014
 * Author: Caterina Urban
 */

typedef enum {false, true} bool;

extern int __VERIFIER_nondet_int(void);

int main() {
    int i, j, k, m, n, N;
	i = __VERIFIER_nondet_int();
	j = __VERIFIER_nondet_int();
	k = __VERIFIER_nondet_int();
	n = __VERIFIER_nondet_int();
	m = __VERIFIER_nondet_int();
	N = __VERIFIER_nondet_int();
	if (0 <= n && 0 <= m && 0 <= N) {
		i = 0;
		while (i < n) {
			j = 0;
			while (j < m) {
				j = j + 1;
				k = i;
				while (k < N) {
					k = k + 1;
                }
				i = k;
			}
			// i will overflow e.g. for i=0,j=0,k=0,n=1,m=1,N=INT_MAX
			i = i + 1;
		}
	}
	return 0;
}