crypto/mem.c:248: error: INTEGER_OVERFLOW_L2
  ([0, +oo] - 1):unsigned64 by call to `lh_delete`.
Showing all 4 steps of the trace


crypto/mem.c:248:13: Call
246.   		CRYPTO_w_lock(CRYPTO_LOCK_MALLOC);
247.   		m.addr=addr;
248.   		mp=(MEM *)lh_delete(mh,(char *)&m);
                   ^
249.   		if (mp != NULL)
250.   			Free(mp);

crypto/lhash/lhash.c:231:1: <LHS trace>
229.   	}
230.   
231. > char *lh_delete(LHASH *lh, char *data)
232.   	{
233.   	unsigned long hash;

crypto/lhash/lhash.c:231:1: Parameter `lh->num_items`
  229.   	}
  230.   
  231. > char *lh_delete(LHASH *lh, char *data)
  232.   	{
  233.   	unsigned long hash;

crypto/lhash/lhash.c:254:2: Binary operation: ([0, +oo] - 1):unsigned64 by call to `lh_delete` 
  252.   		}
  253.   
  254.   	lh->num_items--;
          ^
  255.   	if ((lh->num_nodes > MIN_NODES) &&
  256.   		(lh->down_load >= (lh->num_items*LH_LOAD_MULT/lh->num_nodes)))

char *lh_delete(LHASH *lh, char *data)
	{
	unsigned long hash;
	LHASH_NODE *nn,**rn;
	char *ret;
	lh->error=0;
	rn=getrn(lh,data,&hash);
	if (*rn == NULL)
		{
		lh->num_no_delete++;
		return(NULL);
		}
	else
		{
		nn= *rn;
		*rn=nn->next;
		ret=nn->data;
		Free((char *)nn);
		lh->num_delete++;
		}
	lh->num_items--;
	if ((lh->num_nodes > MIN_NODES) &&
		(lh->down_load >= (lh->num_items*LH_LOAD_MULT/lh->num_nodes)))
		contract(lh);
	return(ret);
	}
['void CRYPTO_dbg_free(void *addr)\n\t{\n\tMEM m,*mp;\n\tif ((mh_mode & CRYPTO_MEM_CHECK_ENABLE) && (mh != NULL))\n\t\t{\n\t\tMemCheck_off();\n\t\tCRYPTO_w_lock(CRYPTO_LOCK_MALLOC);\n\t\tm.addr=addr;\n\t\tmp=(MEM *)lh_delete(mh,(char *)&m);\n\t\tif (mp != NULL)\n\t\t\tFree(mp);\n\t\tCRYPTO_w_unlock(CRYPTO_LOCK_MALLOC);\n\t\tMemCheck_on();\n\t\t}\n\tfree_func(addr);\n\t}', 'char *lh_delete(LHASH *lh, char *data)\n\t{\n\tunsigned long hash;\n\tLHASH_NODE *nn,**rn;\n\tchar *ret;\n\tlh->error=0;\n\trn=getrn(lh,data,&hash);\n\tif (*rn == NULL)\n\t\t{\n\t\tlh->num_no_delete++;\n\t\treturn(NULL);\n\t\t}\n\telse\n\t\t{\n\t\tnn= *rn;\n\t\t*rn=nn->next;\n\t\tret=nn->data;\n\t\tFree((char *)nn);\n\t\tlh->num_delete++;\n\t\t}\n\tlh->num_items--;\n\tif ((lh->num_nodes > MIN_NODES) &&\n\t\t(lh->down_load >= (lh->num_items*LH_LOAD_MULT/lh->num_nodes)))\n\t\tcontract(lh);\n\treturn(ret);\n\t}']