crypto/bn/bn_gf2m.c:1231: error: BUFFER_OVERRUN_L3
  Offset: [1, +oo] Size: [0, +oo] by call to `BN_GF2m_mod_solve_quad_arr`.
Showing all 14 steps of the trace


crypto/bn/bn_gf2m.c:1220:21: Call
1218.   {
1219.       int ret = 0;
1220.       const int max = BN_num_bits(p) + 1;
                            ^
1221.       int *arr = NULL;
1222.       bn_check_top(a);

crypto/bn/bn_lib.c:221:9: Assignment
  219.   
  220.       if (BN_is_zero(a))
  221.           return 0;
                 ^
  222.       return ((i * BN_BITS2) + BN_num_bits_word(a->d[i]));
  223.   }

crypto/bn/bn_gf2m.c:1220:5: Assignment
1218.   {
1219.       int ret = 0;
1220.       const int max = BN_num_bits(p) + 1;
            ^
1221.       int *arr = NULL;
1222.       bn_check_top(a);

crypto/bn/bn_gf2m.c:1224:16: Call
1222.       bn_check_top(a);
1223.       bn_check_top(p);
1224.       if ((arr = OPENSSL_malloc(sizeof(*arr) * max)) == NULL)
                       ^
1225.           goto err;
1226.       ret = BN_GF2m_poly2arr(p, arr, max);

crypto/mem.c:125:9: Assignment
  123.   
  124.       if (num <= 0)
  125.           return NULL;
                 ^
  126.   
  127.       allow_customize = 0;

crypto/bn/bn_gf2m.c:1224:10: Assignment
1222.       bn_check_top(a);
1223.       bn_check_top(p);
1224.       if ((arr = OPENSSL_malloc(sizeof(*arr) * max)) == NULL)
                 ^
1225.           goto err;
1226.       ret = BN_GF2m_poly2arr(p, arr, max);

crypto/bn/bn_gf2m.c:1231:11: Call
1229.           goto err;
1230.       }
1231.       ret = BN_GF2m_mod_solve_quad_arr(r, a, arr, ctx);
                  ^
1232.       bn_check_top(r);
1233.    err:

crypto/bn/bn_gf2m.c:1112:1: Parameter `*p`
  1110.    * 0. Uses algorithms A.4.7 and A.4.6 from IEEE P1363.
  1111.    */
  1112. > int BN_GF2m_mod_solve_quad_arr(BIGNUM *r, const BIGNUM *a_, const int p[],
  1113.                                  BN_CTX *ctx)
  1114.   {

crypto/bn/bn_gf2m.c:1133:10: Call
  1131.           goto err;
  1132.   
  1133.       if (!BN_GF2m_mod_arr(a, a_, p))
                   ^
  1134.           goto err;
  1135.   

crypto/bn/bn_gf2m.c:409:14: <Offset trace>
407.           z[j] = 0;
408.   
409.           for (k = 1; p[k] != 0; k++) {
                    ^
410.               /* reducing component t^p[k] */
411.               n = p[0] - p[k];

crypto/bn/bn_gf2m.c:409:14: Assignment
    407.           z[j] = 0;
    408.   
    409.           for (k = 1; p[k] != 0; k++) {
                        ^
    410.               /* reducing component t^p[k] */
    411.               n = p[0] - p[k];

crypto/bn/bn_gf2m.c:371:1: <Length trace>
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:371:1: Parameter `*p`
    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:409:21: Array access: Offset: [1, +oo] Size: [0, +oo] by call to `BN_GF2m_mod_solve_quad_arr` 
    407.           z[j] = 0;
    408.   
    409.           for (k = 1; p[k] != 0; k++) {
                               ^
    410.               /* reducing component t^p[k] */
    411.               n = p[0] - p[k];
