crypto/bn/bn_mont.c:157: error: BUFFER_OVERRUN_L3
  Offset: [9, +oo] (⇐ [9, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mul`.
Showing all 21 steps of the trace


crypto/bn/bn_mont.c:148:11: Call
146.   
147.       BN_CTX_start(ctx);
148.       tmp = BN_CTX_get(ctx);
                 ^
149.       if (tmp == NULL)
150.           goto err;

crypto/bn/bn_ctx.c:275:5: Call
  273.       }
  274.       /* OK, make sure the returned bignum is "zero" */
  275.       BN_zero(ret);
             ^
  276.       ctx->used++;
  277.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:520:1: Parameter `*a->d`
    518.   }
    519.   
    520. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    521.   {
    522.       bn_check_top(a);

crypto/bn/bn_lib.c:523:9: Call
    521.   {
    522.       bn_check_top(a);
    523.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    524.           return (0);
    525.       a->neg = 0;

crypto/bn/bn_lcl.h:777:1: Parameter `*a->d`
      775.   int bn_probable_prime_dh_coprime(BIGNUM *rnd, int bits, BN_CTX *ctx);
      776.   
      777. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      778.   {
      779.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/bn/bn_mont.c:157:14: Call
155.               goto err;
156.       } else {
157.           if (!BN_mul(tmp, a, b, ctx))
                    ^
158.               goto err;
159.       }

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

crypto/bn/bn_mul.c:899:5: Assignment
  897.       bn_check_top(r);
  898.   
  899.       al = a->top;
             ^
  900.       bl = b->top;
  901.   

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

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

crypto/bn/bn_mul.c:596:9: Call
    594.       } else {
    595.           p = &(t[n2 * 2]);
    596.           bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);
                   ^
    597.           bn_mul_recursive(r, a, b, n, 0, 0, p);
    598.           i = n / 2;

crypto/bn/bn_mul.c:386:1: Parameter `*b`
      384.    */
      385.   /* dnX may not be positive, but n2/2+dnX has to be */
      386. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
      387.                         int dna, int dnb, BN_ULONG *t)
      388.   {

crypto/bn/bn_mul.c:420:10: Call
      418.       /* r=(a[0]-a[1])*(b[1]-b[0]) */
      419.       c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);
      420.       c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);
                      ^
      421.       zero = neg = 0;
      422.       switch (c1 * 3 + c2) {

crypto/bn/bn_lib.c:858:1: Parameter `cl`
        856.    */
        857.   
        858. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
        859.   {
        860.       int n, i;

crypto/bn/bn_lib.c:875:12: Call
        873.           }
        874.       }
        875.       return bn_cmp_words(a, b, cl);
                          ^
        876.   }
        877.   

crypto/bn/bn_lib.c:831:1: <Offset trace>
829.   }
830.   
831. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
832.   {
833.       int i;

crypto/bn/bn_lib.c:831:1: Parameter `n`
          829.   }
          830.   
          831. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          832.   {
          833.       int i;

crypto/bn/bn_lib.c:840:10: Assignment
          838.       if (aa != bb)
          839.           return ((aa > bb) ? 1 : -1);
          840.       for (i = n - 2; i >= 0; i--) {
                          ^
          841.           aa = a[i];
          842.           bb = b[i];

crypto/bn/bn_lib.c:831:1: <Length trace>
829.   }
830.   
831. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
832.   {
833.       int i;

crypto/bn/bn_lib.c:831:1: Parameter `*b`
          829.   }
          830.   
          831. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          832.   {
          833.       int i;

crypto/bn/bn_lib.c:842:14: Array access: Offset: [9, +oo] (⇐ [9, +oo] + [0, +oo]) Size: [0, 8388607] by call to `BN_mul` 
          840.       for (i = n - 2; i >= 0; i--) {
          841.           aa = a[i];
          842.           bb = b[i];
                              ^
          843.           if (aa != bb)
          844.               return ((aa > bb) ? 1 : -1);
