crypto/ec/ecp_oct.c:132: error: BUFFER_OVERRUN_L3
  Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mod_mul`.
Showing all 15 steps of the trace


crypto/ec/ecp_oct.c:91:12: Call
89.   
90.       BN_CTX_start(ctx);
91.       tmp1 = BN_CTX_get(ctx);
                 ^
92.       tmp2 = BN_CTX_get(ctx);
93.       x = BN_CTX_get(ctx);

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/ec/ecp_oct.c:132:18: Call
130.               if (!group->meth->field_decode(group, tmp2, group->a, ctx))
131.                   goto err;
132.               if (!BN_mod_mul(tmp2, tmp2, x, group->field, ctx))
                        ^
133.                   goto err;
134.           } else {

crypto/bn/bn_mod.c:178:1: Parameter `*b->d`
  176.   
  177.   /* slow but works */
  178. > int BN_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b, const BIGNUM *m,
  179.                  BN_CTX *ctx)
  180.   {

crypto/bn/bn_mod.c:195:14: Call
  193.               goto err;
  194.       } else {
  195.           if (!BN_mul(t, a, b, ctx))
                      ^
  196.               goto err;
  197.       }

crypto/bn/bn_mul.c:882:1: Parameter `*b->d`
    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: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 `*b`
      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:541:9: Call
      539.   
      540.       if (n < 8) {
      541.           bn_mul_normal(r, a, n + tna, b, n + tnb);
                     ^
      542.           return;
      543.       }

crypto/bn/bn_mul.c:1036:1: <Length trace>
1034.   }
1035.   
1036. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
1037.   {
1038.       BN_ULONG *rr;

crypto/bn/bn_mul.c:1036:1: Parameter `*b`
        1034.   }
        1035.   
        1036. > void bn_mul_normal(BN_ULONG *r, BN_ULONG *a, int na, BN_ULONG *b, int nb)
        1037.   {
        1038.       BN_ULONG *rr;

crypto/bn/bn_mul.c:1071:50: Array access: Offset: [4, +oo] (⇐ [0, +oo] + 4) Size: [0, 8388607] by call to `BN_mod_mul` 
        1069.           if (--nb <= 0)
        1070.               return;
        1071.           rr[4] = bn_mul_add_words(&(r[4]), a, na, b[4]);
                                                                 ^
        1072.           rr += 4;
        1073.           r += 4;
