2 // errorcheck -0 -d=ssa/prove/debug=1
6 func f0a(a []int) int {
8 for i := range a { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
9 x += a[i] // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
14 func f0b(a []int) int {
16 for i := range a { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
17 b := a[i:] // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
23 func f0c(a []int) int {
25 for i := range a { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
26 b := a[:i+1] // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
32 func f1(a []int) int {
34 for _, i := range a { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
40 func f2(a []int) int {
42 for i := 1; i < len(a); i++ { // ERROR "Induction variable: limits \[1,\?\), increment 1$"
43 x += a[i] // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
48 func f4(a [10]int) int {
50 for i := 0; i < len(a); i += 2 { // ERROR "Induction variable: limits \[0,10\), increment 2$"
51 x += a[i] // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
56 func f5(a [10]int) int {
58 for i := -10; i < len(a); i += 2 { // ERROR "Induction variable: limits \[-10,10\), increment 2$"
65 for i := range a { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
66 b := a[0:i] // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$" "(\([0-9]+\) )?Proved Geq64$"
71 func g0a(a string) int {
73 for i := 0; i < len(a); i++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
74 x += int(a[i]) // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
79 func g0b(a string) int {
81 for i := 0; len(a) > i; i++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
82 x += int(a[i]) // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
87 func g0c(a string) int {
89 for i := len(a); i > 0; i-- { // ERROR "Induction variable: limits \(0,\?\], increment 1$"
90 x += int(a[i-1]) // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
95 func g0d(a string) int {
97 for i := len(a); 0 < i; i-- { // ERROR "Induction variable: limits \(0,\?\], increment 1$"
98 x += int(a[i-1]) // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
103 func g0e(a string) int {
105 for i := len(a) - 1; i >= 0; i-- { // ERROR "Induction variable: limits \[0,\?\], increment 1$"
106 x += int(a[i]) // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
111 func g0f(a string) int {
113 for i := len(a) - 1; 0 <= i; i-- { // ERROR "Induction variable: limits \[0,\?\], increment 1$"
114 x += int(a[i]) // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
122 for i := 0; i < len(a); i += 2 { // ERROR "Induction variable: limits \[0,10\), increment 2$"
123 x += int(a[i]) // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
131 for i := 0; i < len(a); i += 2 { // ERROR "Induction variable: limits \[0,10\), increment 2$"
133 if a[i] == 'e' { // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
142 a := "this string has length 25"
143 for i := 0; i < len(a); i += 5 { // ERROR "Induction variable: limits \[0,25\), increment 5$"
144 useString(a[i:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
150 for i := 0; i < len(a); i++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
151 useString(a[i+1:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
156 for i := 0; i < len(a); i++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
157 useString(a[:i+1]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
163 for i := range c { // ERROR "Induction variable: limits \[0,128\), increment 1$"
164 c[i] = byte(i) // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
169 for i := range a[:128] { // ERROR "Induction variable: limits \[0,128\), increment 1$"
174 func k0(a [100]int) [100]int {
175 for i := 10; i < 90; i++ { // ERROR "Induction variable: limits \[10,90\), increment 1$"
177 a[i-10] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
178 a[i-5] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
179 a[i] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
180 a[i+5] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
181 a[i+10] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
187 func k1(a [100]int) [100]int {
188 for i := 10; i < 90; i++ { // ERROR "Induction variable: limits \[10,90\), increment 1$"
189 useSlice(a[:i-11]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
190 useSlice(a[:i-10]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
191 useSlice(a[:i-5]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
192 useSlice(a[:i]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$" "(\([0-9]+\) )?Proved Geq64$"
193 useSlice(a[:i+5]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
194 useSlice(a[:i+10]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
195 useSlice(a[:i+11]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
202 func k2(a [100]int) [100]int {
203 for i := 10; i < 90; i++ { // ERROR "Induction variable: limits \[10,90\), increment 1$"
205 useSlice(a[i-10:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
206 useSlice(a[i-5:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
207 useSlice(a[i:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
208 useSlice(a[i+5:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
209 useSlice(a[i+10:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
210 useSlice(a[i+11:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
216 func k3(a [100]int) [100]int {
217 for i := -10; i < 90; i++ { // ERROR "Induction variable: limits \[-10,90\), increment 1$"
219 a[i+10] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
225 func k3neg(a [100]int) [100]int {
226 for i := 89; i > -11; i-- { // ERROR "Induction variable: limits \(-11,89\], increment 1$"
228 a[i+10] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
234 func k3neg2(a [100]int) [100]int {
235 for i := 89; i >= -10; i-- { // ERROR "Induction variable: limits \[-10,89\], increment 1$"
237 a[i+10] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
243 func k4(a [100]int) [100]int {
245 for i := min; i < min+50; i++ { // ERROR "Induction variable: limits \[-9223372036854775808,-9223372036854775758\), increment 1$"
246 a[i-min] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
251 func k5(a [100]int) [100]int {
253 for i := max - 50; i < max; i++ { // ERROR "Induction variable: limits \[9223372036854775757,9223372036854775807\), increment 1$"
254 a[i-max+50] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
255 a[i-(max-70)] = i // ERROR "(\([0-9]+\) )?Proved IsInBounds$"
261 // tests overflow of max-min
262 a := int64(9223372036854774057)
267 panic("invalid test: modulos should differ")
270 for i := b; i < a; i += z {
271 // No induction variable is possible because i will overflow a first iteration.
276 func nobce2(a string) {
277 for i := int64(0); i < int64(len(a)); i++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
278 useString(a[i:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
280 for i := int64(0); i < int64(len(a))-31337; i++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
281 useString(a[i:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
283 for i := int64(0); i < int64(len(a))+int64(-1<<63); i++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
284 useString(a[i:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
286 j := int64(len(a)) - 123
287 for i := int64(0); i < j+123+int64(-1<<63); i++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
288 useString(a[i:]) // ERROR "(\([0-9]+\) )?Proved IsSliceInBounds$"
290 for i := int64(0); i < j+122+int64(-1<<63); i++ { // ERROR "Induction variable: limits \[0,\?\), increment 1$"
291 // len(a)-123+122+MinInt overflows when len(a) == 0, so a bound check is needed here
296 func nobce3(a [100]int64) [100]int64 {
297 min := int64((-1) << 63)
298 max := int64((1 << 63) - 1)
299 for i := min; i < max; i++ { // ERROR "Induction variable: limits \[-9223372036854775808,9223372036854775807\), increment 1$"
305 func issue26116a(a []int) {
306 // There is no induction variable here. The comparison is in the wrong direction.
307 for i := 3; i > 6; i++ {
310 for i := 7; i < 3; i-- {
316 func useString(a string) {
320 func useSlice(a []int) {