crypto/bn/bn_recp.c:69: 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_recp.c:62:14: Call
60.   
61.       BN_CTX_start(ctx);
62.       if ((a = BN_CTX_get(ctx)) == NULL)
                   ^
63.           goto err;
64.       if (y != NULL) {

crypto/bn/bn_ctx.c:229:5: Call
  227.       }
  228.       /* OK, make sure the returned bignum is "zero" */
  229.       BN_zero(ret);
             ^
  230.       ctx->used++;
  231.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:393:1: Parameter `*a->d`
    391.   }
    392.   
    393. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    394.   {
    395.       bn_check_top(a);

crypto/bn/bn_lib.c:396:9: Call
    394.   {
    395.       bn_check_top(a);
    396.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                   ^
    397.           return (0);
    398.       a->neg = 0;

crypto/bn/bn_lcl.h:660:1: Parameter `*a->d`
      658.                            const BIGNUM *add, const BIGNUM *rem, BN_CTX *ctx);
      659.   
      660. > static ossl_inline BIGNUM *bn_expand(BIGNUM *a, int bits)
      661.   {
      662.       if (bits > (INT_MAX - BN_BITS2 + 1))

crypto/bn/bn_recp.c:69:18: Call
67.                   goto err;
68.           } else {
69.               if (!BN_mul(a, x, y, ctx))
                       ^
70.                   goto err;
71.           }

crypto/bn/bn_mul.c:495:1: Parameter `a->top`
  493.   #endif                          /* BN_RECURSION */
  494.   
  495. > int BN_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, BN_CTX *ctx)
  496.   {
  497.       int ret = 0;

crypto/bn/bn_mul.c:512:5: Assignment
  510.       bn_check_top(r);
  511.   
  512.       al = a->top;
             ^
  513.       bl = b->top;
  514.   

crypto/bn/bn_mul.c:575:17: Call
  573.                   if (bn_wexpand(rr, k * 4) == NULL)
  574.                       goto err;
  575.                   bn_mul_part_recursive(rr->d, a->d, b->d,
                         ^
  576.                                         j, al - j, bl - j, t->d);
  577.               } else {            /* al <= j || bl <= j */

crypto/bn/bn_mul.c:320:1: Parameter `n`
    318.    */
    319.   /* tnX may not be negative but less than n */
    320. > void bn_mul_part_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n,
    321.                              int tna, int tnb, BN_ULONG *t)
    322.   {

crypto/bn/bn_mul.c:380:9: Call
    378.       } else {
    379.           p = &(t[n2 * 2]);
    380.           bn_mul_recursive(&(t[n2]), t, &(t[n]), n, 0, 0, p);
                   ^
    381.           bn_mul_recursive(r, a, b, n, 0, 0, p);
    382.           i = n / 2;

crypto/bn/bn_mul.c:173:1: Parameter `*b`
      171.    */
      172.   /* dnX may not be positive, but n2/2+dnX has to be */
      173. > void bn_mul_recursive(BN_ULONG *r, BN_ULONG *a, BN_ULONG *b, int n2,
      174.                         int dna, int dnb, BN_ULONG *t)
      175.   {

crypto/bn/bn_mul.c:207:10: Call
      205.       /* r=(a[0]-a[1])*(b[1]-b[0]) */
      206.       c1 = bn_cmp_part_words(a, &(a[n]), tna, n - tna);
      207.       c2 = bn_cmp_part_words(&(b[n]), b, tnb, tnb - n);
                      ^
      208.       zero = neg = 0;
      209.       switch (c1 * 3 + c2) {

crypto/bn/bn_lib.c:733:1: Parameter `cl`
        731.    */
        732.   
        733. > int bn_cmp_part_words(const BN_ULONG *a, const BN_ULONG *b, int cl, int dl)
        734.   {
        735.       int n, i;

crypto/bn/bn_lib.c:750:12: Call
        748.           }
        749.       }
        750.       return bn_cmp_words(a, b, cl);
                          ^
        751.   }
        752.   

crypto/bn/bn_lib.c:706:1: <Offset trace>
704.   }
705.   
706. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
707.   {
708.       int i;

crypto/bn/bn_lib.c:706:1: Parameter `n`
          704.   }
          705.   
          706. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          707.   {
          708.       int i;

crypto/bn/bn_lib.c:715:10: Assignment
          713.       if (aa != bb)
          714.           return ((aa > bb) ? 1 : -1);
          715.       for (i = n - 2; i >= 0; i--) {
                          ^
          716.           aa = a[i];
          717.           bb = b[i];

crypto/bn/bn_lib.c:706:1: <Length trace>
704.   }
705.   
706. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
707.   {
708.       int i;

crypto/bn/bn_lib.c:706:1: Parameter `*b`
          704.   }
          705.   
          706. > int bn_cmp_words(const BN_ULONG *a, const BN_ULONG *b, int n)
          707.   {
          708.       int i;

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