test/bntest.c:1335: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, 8388607] by call to `BN_GF2m_mod_mul`.
Showing all 10 steps of the trace


test/bntest.c:1335:13: Call
1333.           BN_bntest_rand(d, 1024, 0, 0);
1334.           for (j = 0; j < 2; j++) {
1335.               BN_GF2m_mod_mul(e, a, c, b[j], ctx);
                    ^
1336.               BN_GF2m_add(f, a, d);
1337.               BN_GF2m_mod_mul(g, f, c, b[j], ctx);

crypto/bn/bn_gf2m.c:544:1: Parameter `r->top`
  542.    * BN_GF2m_mod_mul_arr function.
  543.    */
  544. > int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  545.                       const BIGNUM *p, BN_CTX *ctx)
  546.   {

test/bntest.c:1335:13: Call
1333.           BN_bntest_rand(d, 1024, 0, 0);
1334.           for (j = 0; j < 2; j++) {
1335.               BN_GF2m_mod_mul(e, a, c, b[j], ctx);
                    ^
1336.               BN_GF2m_add(f, a, d);
1337.               BN_GF2m_mod_mul(g, f, c, b[j], ctx);

crypto/bn/bn_gf2m.c:544:1: Parameter `*b->d`
  542.    * BN_GF2m_mod_mul_arr function.
  543.    */
  544. > int BN_GF2m_mod_mul(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
  545.                       const BIGNUM *p, BN_CTX *ctx)
  546.   {

crypto/bn/bn_gf2m.c:560:11: Call
  558.           goto err;
  559.       }
  560.       ret = BN_GF2m_mod_mul_arr(r, a, b, arr, ctx);
                   ^
  561.       bn_check_top(r);
  562.    err:

crypto/bn/bn_gf2m.c:489:1: <Offset trace>
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:489:1: Parameter `b->top`
    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:489:1: <Length trace>
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:489:1: Parameter `*b->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:517:40: Array access: Offset: [1, +oo] Size: [0, 8388607] by call to `BN_GF2m_mod_mul` 
    515.       for (j = 0; j < b->top; j += 2) {
    516.           y0 = b->d[j];
    517.           y1 = ((j + 1) == b->top) ? 0 : b->d[j + 1];
                                                  ^
    518.           for (i = 0; i < a->top; i += 2) {
    519.               x0 = a->d[i];
