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


crypto/bn/bn_gf2m.c:813:18: Call
811.       bn_check_top(xx);
812.       BN_CTX_start(ctx);
813.       if ((field = BN_CTX_get(ctx)) == NULL)
                        ^
814.           goto err;
815.       if (!BN_GF2m_arr2poly(p, field))

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:815:10: Call
813.       if ((field = BN_CTX_get(ctx)) == NULL)
814.           goto err;
815.       if (!BN_GF2m_arr2poly(p, field))
                ^
816.           goto err;
817.   

crypto/bn/bn_gf2m.c:1280:1: Parameter `*a->d`
  1278.    * bit-string.  The array must be terminated by -1.
  1279.    */
  1280. > int BN_GF2m_arr2poly(const int p[], BIGNUM *a)
  1281.   {
  1282.       int i;

crypto/bn/bn_gf2m.c:1285:5: Call
  1283.   
  1284.       bn_check_top(a);
  1285.       BN_zero(a);
              ^
  1286.       for (i = 0; p[i] != -1; i++) {
  1287.           if (BN_set_bit(a, p[i]) == 0)

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:1287:13: Call
  1285.       BN_zero(a);
  1286.       for (i = 0; p[i] != -1; i++) {
  1287.           if (BN_set_bit(a, p[i]) == 0)
                      ^
  1288.               return 0;
  1289.       }

crypto/bn/bn_lib.c:671:1: Parameter `*a->d`
    669.   }
    670.   
    671. > int BN_set_bit(BIGNUM *a, int n)
    672.   {
    673.       int i, j, k;

crypto/bn/bn_lib.c:681:13: Call
    679.       j = n % BN_BITS2;
    680.       if (a->top <= i) {
    681.           if (bn_wexpand(a, i + 1) == NULL)
                       ^
    682.               return (0);
    683.           for (k = a->top; k < i + 1; k++)

crypto/bn/bn_lib.c:995:1: Parameter `*a->d`
      993.   }
      994.   
      995. > BIGNUM *bn_wexpand(BIGNUM *a, int words)
      996.   {
      997.       return (words <= a->dmax) ? a : bn_expand2(a, words);

crypto/bn/bn_lib.c:997:37: Call
      995.   BIGNUM *bn_wexpand(BIGNUM *a, int words)
      996.   {
      997.       return (words <= a->dmax) ? a : bn_expand2(a, words);
                                                  ^
      998.   }
      999.   

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_arr2poly` 
          350.               a1 = B[1];
          351.               a2 = B[2];
          352.               a3 = B[3];
                                  ^
          353.               A[0] = a0;
          354.               A[1] = a1;
