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 16 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:283:5: Call
  281.       }
  282.       /* OK, make sure the returned bignum is "zero" */
  283.       BN_zero(ret);
             ^
  284.       ctx->used++;
  285.       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_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:389:14: Call
    387.        */
    388.       if (a != r) {
    389.           if (!bn_wexpand(r, a->top))
                        ^
    390.               return 0;
    391.           for (j = 0; j < a->top; j++) {

crypto/bn/bn_lib.c:1071:1: Parameter `*a->d`
      1069.   }
      1070.   
      1071. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      1072.   {
      1073.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:1073:37: Call
      1071.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
      1072.   {
      1073.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                  ^
      1074.   }
      1075.   

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;
