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


crypto/bn/bn_gf2m.c:996:14: Call
994.   
995.       BN_CTX_start(ctx);
996.       if ((u = BN_CTX_get(ctx)) == NULL)
                    ^
997.           goto err;
998.   

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:1007:18: Call
1005.               goto err;
1006.           if (BN_is_bit_set(b, i)) {
1007.               if (!BN_GF2m_mod_mul_arr(u, u, a, p, ctx))
                         ^
1008.                   goto err;
1009.           }

crypto/bn/bn_gf2m.c:489:1: Parameter `*r->d`
  487.    * the result in r.  r could be a or b; a could be b.
  488.    */
  489. > int BN_GF2m_mod_mul_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  490.                           const int p[], BN_CTX *ctx)
  491.   {

crypto/bn/bn_gf2m.c:500:16: Call
  498.   
  499.       if (a == b) {
  500.           return BN_GF2m_mod_sqr_arr(r, a, p, ctx);
                        ^
  501.       }
  502.   

crypto/bn/bn_gf2m.c:568:1: Parameter `*r->d`
    566.   
    567.   /* Square a, reduce the result mod p, and store it in a.  r could be a. */
    568. > int BN_GF2m_mod_sqr_arr(BIGNUM *r, const BIGNUM *a, const int p[],
    569.                           BN_CTX *ctx)
    570.   {

crypto/bn/bn_gf2m.c:588:10: Call
    586.       s->top = 2 * a->top;
    587.       bn_correct_top(s);
    588.       if (!BN_GF2m_mod_arr(r, s, p))
                    ^
    589.           goto err;
    590.       bn_check_top(r);

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