test/bntest.c:748: error: BUFFER_OVERRUN_L3
  Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mul`.
Showing all 17 steps of the trace


test/bntest.c:712:9: Call
710.   
711.       for (i = 0; i < num0; i++) {
712.           BN_bntest_rand(a, 40 + i * 10, 0, 0);
               ^
713.           a->neg = rand_neg();
714.           BN_sqr(c, a, ctx);

crypto/bn/bn_rand.c:210:1: Parameter `*rnd->d`
  208.   }
  209.   
  210. > int BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom)
  211.   {
  212.       return bnrand(2, rnd, bits, top, bottom);

crypto/bn/bn_rand.c:212:12: Call
  210.   int BN_bntest_rand(BIGNUM *rnd, int bits, int top, int bottom)
  211.   {
  212.       return bnrand(2, rnd, bits, top, bottom);
                    ^
  213.   }
  214.   

crypto/bn/bn_rand.c:119:1: Parameter `*rnd->d`
    117.   #include <openssl/sha.h>
    118.   
    119. > static int bnrand(int pseudorand, BIGNUM *rnd, int bits, int top, int bottom)
    120.   {
    121.       unsigned char *buf = NULL;

test/bntest.c:748:5: Call
746.           BIO_puts(bp, "\n");
747.       }
748.       BN_mul(d, a, a, ctx);
           ^
749.       if (BN_cmp(c, d)) {
750.           fprintf(stderr, "Square test failed: BN_sqr and BN_mul produce "

crypto/bn/bn_mul.c:883:1: Parameter `*b->d`
  881.   #endif                          /* BN_RECURSION */
  882.   
  883. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  884.   {
  885.       int ret = 0;

crypto/bn/bn_mul.c:964:17: Call
  962.                   if (bn_wexpand(rr, k * 4) == NULL)
  963.                       goto err;
  964.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                         ^
  965.                                         j, al - j, bl - j, t->d);
  966.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:534:1: Parameter `n`
    532.    */
    533.   /* tnX may not be negative but less than n */
    534. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
    535.                              int tna, int tnb, BN_ULONG *t)
    536.   {

crypto/bn/bn_mul.c:548:10: Call
    546.       /* r=(a[0]-a[1])*(b[1]-b[0]) */
    547.       c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);
    548.       c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);
                    ^
    549.       neg = 0;
    550.       switch (c1 * 3 + c2) {

crypto/bn/bn_lib.c:782:1: Parameter `cl`
      780.    */
      781.   
      782. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
      783.   {
      784.       int n, i;

crypto/bn/bn_lib.c:799:12: Call
      797.           }
      798.       }
      799.       return bn_cmp_words(a, b, cl);
                        ^
      800.   }
      801.   

crypto/bn/bn_lib.c:755:1: <Offset trace>
753.   }
754.   
755. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
756.   {
757.       int i;

crypto/bn/bn_lib.c:755:1: Parameter `n`
        753.   }
        754.   
        755. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
        756.   {
        757.       int i;

crypto/bn/bn_lib.c:764:10: Assignment
        762.       if (aa != bb)
        763.           return ((aa > bb) ? 1 : -1);
        764.       for (i = n - 2; i >= 0; i--) {
                        ^
        765.           aa = a[i];
        766.           bb = b[i];

crypto/bn/bn_lib.c:755:1: <Length trace>
753.   }
754.   
755. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
756.   {
757.       int i;

crypto/bn/bn_lib.c:755:1: Parameter `*a`
        753.   }
        754.   
        755. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
        756.   {
        757.       int i;

crypto/bn/bn_lib.c:765:14: Array access: Offset: [8, +oo] (⇐ [8, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mul` 
        763.           return ((aa > bb) ? 1 : -1);
        764.       for (i = n - 2; i >= 0; i--) {
        765.           aa = a[i];
                            ^
        766.           bb = b[i];
        767.           if (aa != bb)
