1 // errorcheck -0 -d=ssa/prove/debug=1
9 func f0a(a []int) int {
11 for i := range a { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
12 x += a[i] // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
17 func f0b(a []int) int {
19 for i := range a { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
20 b := a[i:] // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
26 func f0c(a []int) int {
28 for i := range a { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
29 b := a[:i+1] // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
35 func f1(a []int) int {
37 for _, i := range a { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
43 func f2(a []int) int {
45 for i := 1; i < len(a); i++ { // ERROR "Induction variable: limits \[1,\?\), increment 1$"
46 x += a[i] // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
51 func f4(a [10]int) int {
53 for i := 0; i < len(a); i += 2 { // ERROR "Induction variable: limits \[0,8\], increment 2$"
54 x += a[i] // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
59 func f5(a [10]int) int {
61 for i := -10; i < len(a); i += 2 { // ERROR "Induction variable: limits \[-10,8\], increment 2$"
67 func f5_int32(a [10]int) int {
69 for i := int32(-10); i < int32(len(a)); i += 2 { // ERROR "Induction variable: limits \[-10,8\], increment 2$"
75 func f5_int16(a [10]int) int {
77 for i := int16(-10); i < int16(len(a)); i += 2 { // ERROR "Induction variable: limits \[-10,8\], increment 2$"
83 func f5_int8(a [10]int) int {
85 for i := int8(-10); i < int8(len(a)); i += 2 { // ERROR "Induction variable: limits \[-10,8\], increment 2$"
92 for i := range a { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
93 b := a[0:i] // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
98 func g0a(a string) int {
100 for i := 0; i < len(a); i++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
101 x += int(a[i]) // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
106 func g0b(a string) int {
108 for i := 0; len(a) > i; i++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
109 x += int(a[i]) // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
114 func g0c(a string) int {
116 for i := len(a); i > 0; i-- { // ERROR "Induction variable: limits \(0,\?\], increment 1$"
117 x += int(a[i-1]) // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
122 func g0d(a string) int {
124 for i := len(a); 0 < i; i-- { // ERROR "Induction variable: limits \(0,\?\], increment 1$"
125 x += int(a[i-1]) // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
130 func g0e(a string) int {
132 for i := len(a) - 1; i >= 0; i-- { // ERROR "Induction variable: limits \[0,\?\], increment 1$"
133 x += int(a[i]) // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
138 func g0f(a string) int {
140 for i := len(a) - 1; 0 <= i; i-- { // ERROR "Induction variable: limits \[0,\?\], increment 1$"
141 x += int(a[i]) // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
149 for i := 0; i < len(a); i += 2 { // ERROR "Induction variable: limits \[0,8\], increment 2$"
150 x += int(a[i]) // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
158 for i := 0; i < len(a); i += 2 { // ERROR "Induction variable: limits \[0,8\], increment 2$"
160 if a[i] == 'e' { // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
169 a := "this string has length 25"
170 for i := 0; i < len(a); i += 5 { // ERROR "Induction variable: limits \[0,20\], increment 5$"
171 useString(a[i:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
172 useString(a[:i+3]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
173 useString(a[:i+5]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
179 for i := 0; i < len(a); i++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
180 useString(a[i+1:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
185 for i := 0; i < len(a); i++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
186 useString(a[:i+1]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
192 for i := range c { // ERROR "Induction variable: limits \[0,128\), increment 1$"
193 c[i] = byte(i) // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
198 for i := range a[:128] { // ERROR "Induction variable: limits \[0,128\), increment 1$"
203 func k0(a [100]int) [100]int {
204 for i := 10; i < 90; i++ { // ERROR "Induction variable: limits \[10,90\), increment 1$"
205 if a[0] == 0xdeadbeef {
206 // This is a trick to prohibit sccp to optimize out the following out of bound check
210 a[i-10] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
211 a[i-5] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
212 a[i] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
213 a[i+5] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
214 a[i+10] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
220 func k1(a [100]int) [100]int {
221 for i := 10; i < 90; i++ { // ERROR "Induction variable: limits \[10,90\), increment 1$"
222 if a[0] == 0xdeadbeef {
223 // This is a trick to prohibit sccp to optimize out the following out of bound check
227 useSlice(a[:i-10]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
228 useSlice(a[:i-5]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
229 useSlice(a[:i]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
230 useSlice(a[:i+5]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
231 useSlice(a[:i+10]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
232 useSlice(a[:i+11]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
239 func k2(a [100]int) [100]int {
240 for i := 10; i < 90; i++ { // ERROR "Induction variable: limits \[10,90\), increment 1$"
241 if a[0] == 0xdeadbeef {
242 // This is a trick to prohibit sccp to optimize out the following out of bound check
246 useSlice(a[i-10:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
247 useSlice(a[i-5:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
248 useSlice(a[i:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
249 useSlice(a[i+5:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
250 useSlice(a[i+10:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
251 useSlice(a[i+11:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
257 func k3(a [100]int) [100]int {
258 for i := -10; i < 90; i++ { // ERROR "Induction variable: limits \[-10,90\), increment 1$"
259 if a[0] == 0xdeadbeef {
260 // This is a trick to prohibit sccp to optimize out the following out of bound check
264 a[i+10] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
270 func k3neg(a [100]int) [100]int {
271 for i := 89; i > -11; i-- { // ERROR "Induction variable: limits \(-11,89\], increment 1$"
272 if a[0] == 0xdeadbeef {
273 // This is a trick to prohibit sccp to optimize out the following out of bound check
277 a[i+10] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
283 func k3neg2(a [100]int) [100]int {
284 for i := 89; i >= -10; i-- { // ERROR "Induction variable: limits \[-10,89\], increment 1$"
285 if a[0] == 0xdeadbeef {
286 // This is a trick to prohibit sccp to optimize out the following out of bound check
290 a[i+10] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
296 func k4(a [100]int) [100]int {
298 for i := min; i < min+50; i++ { // ERROR "Induction variable: limits \[-9223372036854775808,-9223372036854775758\), increment 1$"
299 a[i-min] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
304 func k5(a [100]int) [100]int {
306 for i := max - 50; i < max; i++ { // ERROR "Induction variable: limits \[9223372036854775757,9223372036854775807\), increment 1$"
307 a[i-max+50] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
308 a[i-(max-70)] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
313 func d1(a [100]int) [100]int {
314 for i := 0; i < 100; i++ { // ERROR "Induction variable: limits \[0,100\), increment 1$"
315 for j := 0; j < i; j++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
316 a[j] = 0 // ERROR "Proved IsInBounds$"
317 a[j+1] = 0 // FIXME: this boundcheck should be eliminated
324 func d2(a [100]int) [100]int {
325 for i := 0; i < 100; i++ { // ERROR "Induction variable: limits \[0,100\), increment 1$"
326 for j := 0; i > j; j++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
327 a[j] = 0 // ERROR "Proved IsInBounds$"
328 a[j+1] = 0 // FIXME: this boundcheck should be eliminated
335 func d3(a [100]int) [100]int {
336 for i := 0; i <= 99; i++ { // ERROR "Induction variable: limits \[0,99\], increment 1$"
337 for j := 0; j <= i-1; j++ {
339 a[j+1] = 0 // ERROR "Proved IsInBounds$"
347 for i := int64(math.MaxInt64 - 9); i < math.MaxInt64-2; i += 4 { // ERROR "Induction variable: limits \[9223372036854775798,9223372036854775802\], increment 4$"
350 for i := int64(math.MaxInt64 - 8); i < math.MaxInt64-2; i += 4 { // ERROR "Induction variable: limits \[9223372036854775799,9223372036854775803\], increment 4$"
353 for i := int64(math.MaxInt64 - 7); i < math.MaxInt64-2; i += 4 {
356 for i := int64(math.MaxInt64 - 6); i < math.MaxInt64-2; i += 4 { // ERROR "Induction variable: limits \[9223372036854775801,9223372036854775801\], increment 4$"
359 for i := int64(math.MaxInt64 - 9); i <= math.MaxInt64-2; i += 4 { // ERROR "Induction variable: limits \[9223372036854775798,9223372036854775802\], increment 4$"
362 for i := int64(math.MaxInt64 - 8); i <= math.MaxInt64-2; i += 4 { // ERROR "Induction variable: limits \[9223372036854775799,9223372036854775803\], increment 4$"
365 for i := int64(math.MaxInt64 - 7); i <= math.MaxInt64-2; i += 4 {
368 for i := int64(math.MaxInt64 - 6); i <= math.MaxInt64-2; i += 4 {
374 for i := int64(math.MinInt64 + 9); i > math.MinInt64+2; i -= 4 { // ERROR "Induction variable: limits \[-9223372036854775803,-9223372036854775799\], increment 4"
377 for i := int64(math.MinInt64 + 8); i > math.MinInt64+2; i -= 4 { // ERROR "Induction variable: limits \[-9223372036854775804,-9223372036854775800\], increment 4"
380 for i := int64(math.MinInt64 + 7); i > math.MinInt64+2; i -= 4 {
383 for i := int64(math.MinInt64 + 6); i > math.MinInt64+2; i -= 4 { // ERROR "Induction variable: limits \[-9223372036854775802,-9223372036854775802\], increment 4"
386 for i := int64(math.MinInt64 + 9); i >= math.MinInt64+2; i -= 4 { // ERROR "Induction variable: limits \[-9223372036854775803,-9223372036854775799\], increment 4"
389 for i := int64(math.MinInt64 + 8); i >= math.MinInt64+2; i -= 4 { // ERROR "Induction variable: limits \[-9223372036854775804,-9223372036854775800\], increment 4"
392 for i := int64(math.MinInt64 + 7); i >= math.MinInt64+2; i -= 4 {
395 for i := int64(math.MinInt64 + 6); i >= math.MinInt64+2; i -= 4 {
401 // tests overflow of max-min
402 a := int64(9223372036854774057)
407 panic("invalid test: modulos should differ")
410 for i := b; i < a; i += z { // ERROR "Induction variable: limits \[-1547,9223372036854772720\], increment 1337"
415 func nobce2(a string) {
416 for i := int64(0); i < int64(len(a)); i++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
417 useString(a[i:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
419 for i := int64(0); i < int64(len(a))-31337; i++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
420 useString(a[i:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
422 for i := int64(0); i < int64(len(a))+int64(-1<<63); i++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
423 useString(a[i:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
425 j := int64(len(a)) - 123
426 for i := int64(0); i < j+123+int64(-1<<63); i++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
427 useString(a[i:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
429 for i := int64(0); i < j+122+int64(-1<<63); i++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
430 // len(a)-123+122+MinInt overflows when len(a) == 0, so a bound check is needed here
435 func nobce3(a [100]int64) [100]int64 {
436 min := int64((-1) << 63)
437 max := int64((1 << 63) - 1)
438 for i := min; i < max; i++ { // ERROR "Induction variable: limits \[-9223372036854775808,9223372036854775807\), increment 1$"
443 func issue26116a(a []int) {
444 // There is no induction variable here. The comparison is in the wrong direction.
445 for i := 3; i > 6; i++ {
448 for i := 7; i < 3; i-- {
453 func stride1(x *[7]int) int {
455 for i := 0; i <= 8; i += 3 { // ERROR "Induction variable: limits \[0,6\], increment 3"
456 s += x[i] // ERROR "Proved IsInBounds"
461 func stride2(x *[7]int) int {
463 for i := 0; i < 9; i += 3 { // ERROR "Induction variable: limits \[0,6\], increment 3"
464 s += x[i] // ERROR "Proved IsInBounds"
470 func useString(a string) {
474 func useSlice(a []int) {