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


crypto/bn/bn_gf2m.c:1090:21: Call
1088.   {
1089.       int ret = 0;
1090.       const int max = BN_num_bits(p) + 1;
                            ^
1091.       int *arr = NULL;
1092.       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:1090:5: Assignment
1088.   {
1089.       int ret = 0;
1090.       const int max = BN_num_bits(p) + 1;
            ^
1091.       int *arr = NULL;
1092.       bn_check_top(a);

crypto/bn/bn_gf2m.c:1094:16: Call
1092.       bn_check_top(a);
1093.       bn_check_top(p);
1094.       if ((arr = OPENSSL_malloc(sizeof(*arr) * max)) == NULL)
                       ^
1095.           goto err;
1096.       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:1094:10: Assignment
1092.       bn_check_top(a);
1093.       bn_check_top(p);
1094.       if ((arr = OPENSSL_malloc(sizeof(*arr) * max)) == NULL)
                 ^
1095.           goto err;
1096.       ret = BN_GF2m_poly2arr(p, arr, max);

crypto/bn/bn_gf2m.c:1101:11: Call
1099.           goto err;
1100.       }
1101.       ret = BN_GF2m_mod_sqrt_arr(r, a, arr, ctx);
                  ^
1102.       bn_check_top(r);
1103.    err:

crypto/bn/bn_gf2m.c:1053:1: Parameter `*p`
  1051.    * r could be a. Uses exponentiation as in algorithm A.4.1 from IEEE P1363.
  1052.    */
  1053. > int BN_GF2m_mod_sqrt_arr(BIGNUM *r, const BIGNUM *a, const int p[],
  1054.                            BN_CTX *ctx)
  1055.   {

crypto/bn/bn_gf2m.c:1073:11: Call
  1071.       if (!BN_set_bit(u, p[0] - 1))
  1072.           goto err;
  1073.       ret = BN_GF2m_mod_exp_arr(r, a, u, p, ctx);
                    ^
  1074.       bn_check_top(r);
  1075.   

crypto/bn/bn_gf2m.c:980:1: Parameter `*p`
    978.    * P1363.
    979.    */
    980. > int BN_GF2m_mod_exp_arr(BIGNUM *r, const BIGNUM *a, const BIGNUM *b,
    981.                           const int p[], BN_CTX *ctx)
    982.   {

crypto/bn/bn_gf2m.c:999:10: Call
    997.           goto err;
    998.   
    999.       if (!BN_GF2m_mod_arr(u, a, p))
                     ^
    1000.           goto err;
    1001.   

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_sqrt_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];
