crypto/bn/bn_gf2m.c:649: error: BUFFER_OVERRUN_L3
  Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_GF2m_mod`.
Showing all 20 steps of the trace


crypto/bn/bn_gf2m.c:640:14: Call
638.       BN_CTX_start(ctx);
639.   
640.       if ((b = BN_CTX_get(ctx)) == NULL)
                    ^
641.           goto err;
642.       if ((c = BN_CTX_get(ctx)) == NULL)

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_gf2m.c:649:10: Call
647.           goto err;
648.   
649.       if (!BN_GF2m_mod(u, a, p))
                ^
650.           goto err;
651.       if (BN_is_zero(u))

crypto/bn/bn_gf2m.c:468:1: Parameter `*r->d`
  466.    * BN_GF2m_mod_arr function.
  467.    */
  468. > int BN_GF2m_mod(BIGNUM *r, const BIGNUM *a, const BIGNUM *p)
  469.   {
  470.       int ret = 0;

crypto/bn/bn_gf2m.c:479:11: Call
  477.           return 0;
  478.       }
  479.       ret = BN_GF2m_mod_arr(r, a, arr);
                   ^
  480.       bn_check_top(r);
  481.       return ret;

crypto/bn/bn_gf2m.c:370:1: Parameter `*r->d`
    368.   
    369.   /* Performs modular reduction of a and store result in r.  r could be a. */
    370. > int BN_GF2m_mod_arr(BIGNUM *r, const BIGNUM *a, const int p[])
    371.   {
    372.       int j, k;

crypto/bn/bn_gf2m.c:380:9: Call
    378.       if (!p[0]) {
    379.           /* reduction mod 1 => return 0 */
    380.           BN_zero(r);
                   ^
    381.           return 1;
    382.       }

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_lcl.h:785:12: Call
        783.           return a;
        784.   
        785.       return bn_expand2((a),(bits+BN_BITS2-1)/BN_BITS2);
                          ^
        786.   }
        787.   

crypto/bn/bn_lib.c:380:1: Parameter `*b->d`
          378.    */
          379.   
          380. > BIGNUM *bn_expand2(BIGNUM *b, int words)
          381.   {
          382.       bn_check_top(b);

crypto/bn/bn_lib.c:385:23: Call
          383.   
          384.       if (words > b->dmax) {
          385.           BN_ULONG *a = bn_expand_internal(b, words);
                                       ^
          386.           if (!a)
          387.               return NULL;

crypto/bn/bn_lib.c:299:1: <Length trace>
297.   /* This is used by bn_expand2() */
298.   /* The caller MUST check that words > b->dmax before calling this */
299. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
300.   {
301.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:299:1: Parameter `*b->d`
            297.   /* This is used by bn_expand2() */
            298.   /* The caller MUST check that words > b->dmax before calling this */
            299. > static BN_ULONG *bn_expand_internal(const BIGNUM *b, int words)
            300.   {
            301.       BN_ULONG *A, *a = NULL;

crypto/bn/bn_lib.c:325:5: Assignment
            323.   
            324.   #if 1
            325.       B = b->d;
                       ^
            326.       /* Check if the previous number needs to be copied */
            327.       if (B != NULL) {

crypto/bn/bn_lib.c:342:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_GF2m_mod` 
            340.               a1 = B[1];
            341.               a2 = B[2];
            342.               a3 = B[3];
                                    ^
            343.               A[0] = a0;
            344.               A[1] = a1;
