ARCHTEST. Version 3. 950114.
by W. W. Collier, mpdiag@acm.org.
08:40:04.625 950411
Default answers to the following questions are shown in brackets.
Specify how to generate the data to be analyzed.
1. Execute real multiprocessing code to generate data.
2. Execute the real mp code, but with only one processor.
3. Generate data randomly with errors.
4. Generate data randomly, but without errors.
5. Use static data with errors.
6. Use static data without errors.
(Choices 2-6 are for debugging.) Choice [1]: 1
Enter the number of processors (from 2 to 8) [2]: 2
Define logical length of arrays (max=500000) [200000]: 200000
The following tests can be run:
2 3 4 5 6 7 8 9 10 11 12 13 14
310 610
220 320 420 520 620 720
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Note added July 1996.
The numbering scheme for some tests was changed in late 1995.
The numbers for the following tests have not changed.
200 300 400 500 600 700 800 900
Two tests, 310 and 610, have been deleted. They created
extraneous cache traffic in a fixed format in order to see if that
introduced relaxed behavior. Currently, any test can have extraneous
cache traffic introduced in a random fashion by setting run time
parameters.
The names of these tests have been changed
220 320 420 520 620 720
to
210 310 410 510 610 710
The change in numbers should cause little confusion in
interpreting the results. The relaxation that a test seeks to detect
is determined only by the initial digit in its number. See the file
ANALYSIS to understand the relaxations that each of the tests seeks
to detect.
- - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - - -
Specify which tests to run [all]: all
Synchronize the start of test processes? [n]: n
Parameters for this run:
Type of run: 1. Execute real multiprocessing code to generate data.
Output file name: axbit_01.out.
Number of processors: 2.
Length of the arrays: 200000.
Synchronize processes: n.
Test(s) to run: 200 220 300 310 320 400 420 500 520 600 610 620 700 720 800 900 1000 1100 1200 1300 1400 1500
================================================================================
Test T200. Seek a violation of A(CMP,RO,WO).
Seek 2.1. U[i] > U[i+2]
Seek 2.2. U[2i+1] > U[2i+2]
Seek 2.3. U[21] > U[2i+1] + 1
Start execution of Test 200 at: 08:44:53.234 950411
End execution of Test 200 at: 08:44:53.328 950411
i U V X Y
0 4056 0 0 0
19999 24074 0 0 0
39998 41937 0 0 0
59997 59834 0 0 0
79996 78854 0 0 0
99995 97819 0 0 0
119994 112952 0 0 0
139993 131978 0 0 0
159992 150440 0 0 0
179991 168105 0 0 0
199990 184941 0 0 0
Start analysis of Test 2 at: 08:44:53.375 950411
End analysis of Test 2 at: 08:44:53.437 950411
Analysis of T2 data:
i U V X Y
================================================================================
Test T220. Seek a violation of A(CMP,RO,WO).
Seek 2.1. U[i] > U[i+2]
Seek 2.2. U[2i+1] > U[2i+2]
Seek 2.3. U[21] > U[2i+1] + 1
Start execution of Test 220 at: 08:44:53.734 950411
End execution of Test 220 at: 08:44:53.843 950411
i U V X Y
0 4041 0 0 0
19999 22550 0 0 0
39998 39317 0 0 0
59997 56949 0 0 0
79996 76059 0 0 0
99995 92737 0 0 0
119994 110475 0 0 0
139993 128102 0 0 0
159992 145590 0 0 0
179991 163066 0 0 0
199990 181065 0 0 0
Start analysis of Test 2 at: 08:44:53.953 950411
End analysis of Test 2 at: 08:44:54.015 950411
Analysis of T2 data:
i U V X Y
================================================================================
The number of processors (2) is too few to run Test T300.
================================================================================
The number of processors (2) is too few to run Test T310.
================================================================================
The number of processors (2) is too few to run Test T320.
================================================================================
Test T400. Seek a violation of A(CMP,PO).
Seek 4.1. U[i] < j and V[j] < i. d1 = V[ U[i]+1 ] - i < 0.
Seek 4.2. V[i] < j and U[j] < i. d2 = U[ V[i]+1 ] - i < 0.
Seek 4.3. U[i] > j and V[j] > i. d3 = i - V[ U[i]-1 ] < 0.
Seek 4.4. V[i] > j and U[j] > i. d4 = i - U[ V[i]-1 ] < 0.
Start execution of Test 400 at: 08:44:54.343 950411
End execution of Test 400 at: 08:44:54.500 950411
i U V X Y
0 0 4320 0 0
19999 16557 23176 0 0
39998 37917 41944 0 0
59997 59784 60210 0 0
79996 82102 78158 0 0
99995 103426 96953 0 0
119994 125344 115146 0 0
139993 148040 133142 0 0
159992 170237 150767 0 0
179991 192409 168391 0 0
199990 199999 186753 0 0
Start analysis of Test 4/7 at: 08:44:54.546 950411
Error 4.2. v[ 22703] = 25582 < 25583 and u[ 25583] = 22702 < 22703
Error 4.1. u[ 25583] = 22702 < 22703 and v[ 22703] = 25582 < 25583
Error 4.2. v[ 52430] = 53325 < 53326 and u[ 53326] = 52429 < 52430
Error 4.1. u[ 53326] = 52429 < 52430 and v[ 52430] = 53325 < 53326
Error 4.2. v[ 61708] = 61923 < 61924 and u[ 61924] = 61707 < 61708
Error 4.1. u[ 61924] = 61707 < 61708 and v[ 61708] = 61923 < 61924
End analysis of Test 4/7 at: 08:44:54.625 950411
Analysis of T4 data:
d1 = v[ u[i]+1 ] - i;
d2 = u[ v[i]+1 ] - i;
d3 = i - v[ u[i]-1 ];
d4 = i - u[ v[i]-1 ];
i U V d1 d2 d3 d4
22700 19522 25581 0 2 2 131
22701 19523 25581 0 1 2 132
22702 19524 25582 0 0 2 133
22703 19525 25582 0 -1 2 134
22704 19526 25584 0 1 2 2
22705 19527 25584 0 0 2 3
22706 19528 25585 0 0 2 2
25580 22569 28319 1 0 38 2
25581 22569 28320 0 0 39 2
25582 22702 28321 0 0 1 2
25583 22702 28322 -1 0 2 2
25584 22704 28323 0 0 2 2
25585 22705 28324 0 0 1 2
25586 22706 28325 0 0 2 2
52427 51449 53324 0 2 2 118
52428 51450 53324 0 1 2 119
52429 51451 53325 0 0 2 120
52430 51452 53325 0 -1 2 121
52431 51453 53327 0 1 2 2
52432 51454 53327 0 0 2 3
52433 51455 53328 0 0 2 2
53323 52309 54218 1 0 38 2
53324 52309 54219 0 0 39 2
53325 52429 54220 0 0 1 2
53326 52429 54221 -1 0 2 2
53327 52431 54222 0 0 2 2
53328 52432 54223 0 0 1 2
53329 52433 54224 0 0 2 2
61705 61625 61784 0 0 2 2
61706 61626 61785 0 0 2 2
61707 61627 61923 0 0 2 1
61708 61628 61923 0 -1 2 2
61709 61629 61925 0 0 2 2
61710 61630 61926 0 0 2 1
61711 61631 61927 0 0 2 2
61921 61706 61983 2 0 137 2
61922 61706 61984 1 0 138 2
61923 61707 61985 0 0 138 2
61924 61707 61986 -1 0 139 2
61925 61709 61987 1 0 2 2
61926 61709 61988 0 0 3 2
61927 61710 61989 0 0 2 2
================================================================================
Test T420. Seek a violation of A(CMP,PO).
Seek 4.1. U[i] < j and V[j] < i. d1 = V[ U[i]+1 ] - i < 0.
Seek 4.2. V[i] < j and U[j] < i. d2 = U[ V[i]+1 ] - i < 0.
Seek 4.3. U[i] > j and V[j] > i. d3 = i - V[ U[i]-1 ] < 0.
Seek 4.4. V[i] > j and U[j] > i. d4 = i - U[ V[i]-1 ] < 0.
Start execution of Test 420 at: 08:44:55.093 950411
End execution of Test 420 at: 08:44:55.234 950411
i U V X Y
0 0 4310 0 0
19999 16575 23422 0 0
39998 36573 42565 0 0
59997 58287 61708 0 0
79996 80000 79991 0 0
99995 101293 98818 0 0
119994 122057 118090 0 0
139993 143571 137020 0 0
159992 164174 155669 0 0
179991 184971 175010 0 0
199990 199999 194363 0 0
Start analysis of Test 4/7 at: 08:44:55.421 950411
Error 4.2. v[ 2] = 4338 < 4339 and u[ 4339] = 1 < 2
Error 4.2. v[ 4] = 4340 < 4341 and u[ 4341] = 3 < 4
Error 4.2. v[ 6] = 4342 < 4343 and u[ 4343] = 5 < 6
Error 4.2. v[ 8] = 4344 < 4345 and u[ 4345] = 7 < 8
Error 4.2. v[ 10] = 4346 < 4347 and u[ 4347] = 9 < 10
Error 4.2. v[ 12] = 4348 < 4349 and u[ 4349] = 11 < 12
End analysis of Test 4/7 at: 08:44:55.437 950411
Analysis of T4 data:
d1 = v[ u[i]+1 ] - i;
d2 = u[ v[i]+1 ] - i;
d3 = i - v[ u[i]-1 ];
d4 = i - u[ v[i]-1 ];
i U V d1 d2 d3 d4
0 0 4310 4338 0 2097152 0
1 0 4338 4337 0 2097152 1
2 0 4338 4336 -1 2097152 2
3 0 4340 4335 0 2097152 2
4 0 4340 4334 -1 2097152 3
5 0 4342 4333 0 2097152 2
6 0 4342 4332 -1 2097152 3
7 0 4344 4331 0 2097152 2
8 0 4344 4330 -1 2097152 3
9 0 4346 4329 0 2097152 2
10 0 4346 4328 -1 2097152 3
11 0 4348 4327 0 2097152 2
12 0 4348 4326 -1 2097152 3
13 0 4350 4325 0 2097152 2
14 0 4350 4324 -1 2097152 3
15 0 4352 4323 0 2097152 2
4336 0 8672 2 -1 2097152 3
4337 0 8674 1 0 2097152 2
4338 1 8674 0 -1 28 3
4339 1 8676 -1 0 29 2
4340 3 8676 0 -1 2 3
4341 3 8678 -1 0 3 2
4342 5 8678 0 -1 2 3
4343 5 8680 -1 0 3 2
4344 7 8680 0 -1 2 3
4345 7 8682 -1 0 3 2
4346 9 8682 0 -1 2 3
4347 9 8684 -1 0 3 2
4348 11 8684 0 -1 2 3
4349 11 8686 -1 0 3 2
4350 13 8686 0 -1 2 3
4351 13 8688 -1 0 3 2
4352 15 8688 0 -1 2 3
================================================================================
The number of processors (2) is too few to run Test T500.
================================================================================
The number of processors (2) is too few to run Test T520.
================================================================================
The number of processors (2) is too few to run Test T600.
================================================================================
The number of processors (2) is too few to run Test T610.
================================================================================
The number of processors (2) is too few to run Test T620.
================================================================================
Test T700. Seek a violation of A(CMP,UPO,RO,WO,WA).
Seek 7.1. U[i] < j and V[j] < i. d1 = V[ U[i]+1 ] - i < 0.
Seek 7.2. V[i] < j and U[j] < i. d2 = U[ V[i]+1 ] - i < 0.
Seek 7.3. U[i] > j and V[j] > i. d3 = i - V[ U[i]-1 ] < 0.
Seek 7.4. V[i] > j and U[j] > i. d4 = i - U[ V[i]-1 ] < 0.
Start execution of Test 700 at: 08:44:55.921 950411
End execution of Test 700 at: 08:44:56.125 950411
i U V X Y
0 0 4212 199999 199999
19999 15981 23862 0 0
39998 39140 40855 0 0
59997 60954 59041 0 0
79996 82802 77323 0 0
99995 104646 96076 0 0
119994 126004 114237 0 0
139993 148989 132189 0 0
159992 170833 150109 0 0
179991 192137 168423 0 0
199990 199999 187057 0 0
Start analysis of Test 4/7 at: 08:44:56.171 950411
End analysis of Test 4/7 at: 08:44:56.343 950411
Analysis of T7 data:
d1 = v[ u[i]+1 ] - i;
d2 = u[ v[i]+1 ] - i;
d3 = i - v[ u[i]-1 ];
d4 = i - u[ v[i]-1 ];
i U V d1 d2 d3 d4
================================================================================
Test T720. Seek a violation of A(CMP,UPO,RO,WO,WA).
Seek 7.1. U[i] < j and V[j] < i. d1 = V[ U[i]+1 ] - i < 0.
Seek 7.2. V[i] < j and U[j] < i. d2 = U[ V[i]+1 ] - i < 0.
Seek 7.3. U[i] > j and V[j] > i. d3 = i - V[ U[i]-1 ] < 0.
Seek 7.4. V[i] > j and U[j] > i. d4 = i - U[ V[i]-1 ] < 0.
Start execution of Test 720 at: 08:44:56.671 950411
End execution of Test 720 at: 08:44:56.859 950411
i U V X Y
0 0 4298 199999 0
19999 16062 23331 0 0
39998 37274 42725 0 0
59997 60027 59967 0 0
79996 82884 77424 0 0
99995 104777 95493 0 0
119994 128546 113958 0 0
139993 150735 129616 0 0
159992 172586 148613 0 0
179991 196061 165968 0 0
199990 199999 183687 0 0
Start analysis of Test 4/7 at: 08:44:57.046 950411
End analysis of Test 4/7 at: 08:44:57.218 950411
Analysis of T7 data:
d1 = v[ u[i]+1 ] - i;
d2 = u[ v[i]+1 ] - i;
d3 = i - v[ u[i]-1 ];
d4 = i - u[ v[i]-1 ];
i U V d1 d2 d3 d4
================================================================================
Test T8. Seek a violation of A(CMP,UPO,CON).
Start execution of Test 800 at: 08:44:57.531 950411
End execution of Test 800 at: 08:44:57.687 950411
i w[i][0] w[i][1] w[i][2] w[i][3]
0 0 82080 2 3
19999 199990 199991 199992 199993
39998 399980 399981 399982 399983
59997 599970 599971 599972 599973
79996 799960 799961 799962 799963
99995 999950 999951 999952 999953
119994 1199940 1199941 1199942 1199943
139993 1399930 1399931 1399932 1399933
159992 1599920 1599921 1599922 1599923
179991 1799910 1799911 1799912 1799913
199990 1999900 1999901 1999902 1999903
Start analysis of Test 8 at: 08:44:58.203 950411
End analysis of Test 8 at: 08:45:01.875 950411
Analysis of T8 data:
i w[][0] w[][1] w[][2] w[][3]
Save output from Test 8? [n]
================================================================================
The number of processors (2) is too few to run Test T900.
================================================================================
Test T1000. Seek a critsec failure.
Seek 10. Operand A != 0.
Start execution of Test 1000 at: 08:45:02.187 950411
End execution of Test 1000 at: 08:45:02.203 950411
================================================================================
Failing tests: 400 420.
Run this job another time? [y] n