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


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

crypto/bn/bn_ctx.c:284:5: Call
  282.       }
  283.       /* OK, make sure the returned bignum is "zero" */
  284.       BN_zero(ret);
             ^
  285.       ctx->used++;
  286.       CTXDBG_RET(ctx, ret);

crypto/bn/bn_lib.c:530:1: Parameter `*a->d`
    528.   }
    529.   
    530. > int BN_set_word(BIGNUM *a, BN_ULONG w)
    531.   {
    532.       bn_check_top(a);

crypto/bn/bn_gf2m.c:650:10: Call
648.           goto err;
649.   
650.       if (!BN_GF2m_mod(u, a, p))
                ^
651.           goto err;
652.       if (BN_is_zero(u))

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

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

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

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

crypto/bn/bn_lib.c:530:1: Parameter `*a->d`
      528.   }
      529.   
      530. > int BN_set_word(BIGNUM *a, BN_ULONG w)
      531.   {
      532.       bn_check_top(a);

crypto/bn/bn_lib.c:533:9: Call
      531.   {
      532.       bn_check_top(a);
      533.       if (bn_expand(a, (int)sizeof(BN_ULONG) * 8) == NULL)
                     ^
      534.           return (0);
      535.       a->neg = 0;

crypto/bn/bn_lib.c:390:1: Parameter `*b->d`
        388.    */
        389.   
        390. > BIGNUM *bn_expand2(BIGNUM *b, int words)
        391.   {
        392.       bn_check_top(b);

crypto/bn/bn_lib.c:395:23: Call
        393.   
        394.       if (words > b->dmax) {
        395.           BN_ULONG *a = bn_expand_internal(b, words);
                                     ^
        396.           if (!a)
        397.               return NULL;

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

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

crypto/bn/bn_lib.c:335:5: Assignment
          333.   
          334.   #if 1
          335.       B = b->d;
                     ^
          336.       /* Check if the previous number needs to be copied */
          337.       if (B != NULL) {

crypto/bn/bn_lib.c:352:18: Array access: Offset: [3, +oo] (⇐ [0, +oo] + 3) Size: [0, 8388607] by call to `BN_GF2m_mod` 
          350.               a1 = B[1];
          351.               a2 = B[2];
          352.               a3 = B[3];
                                  ^
          353.               A[0] = a0;
          354.               A[1] = a1;
