source: CIVL/examples/arithmetic/multiplicationInLoopCondition.cvl@ 289a368

1.23 2.0 main test-branch
Last change on this file since 289a368 was 289a368, checked in by Manchun Zheng <zmanchun@…>, 12 years ago

add a test of the CIVL model that introduces an ArrayIndexOutOfBounds exception in SARL, which might be a bug in clj.

git-svn-id: svn://vsl.cis.udel.edu/civl/trunk@455 fb995dde-84ed-4084-dfe6-e5aef3e2452c

  • Property mode set to 100644
File size: 203 bytes
Line 
1$input int N;
2$input int M;
3$assume N > 0 && N < 3;
4$assume M > 0 && M < 3;
5
6void main() {
7 int k = M*N;
8 int a[k];
9
10 for (int i = 0; i < k; i++) {
11 a[i] = i;
12 if(i == 200)
13 break;
14 }
15}
Note: See TracBrowser for help on using the repository browser.