Пример #1
0
    lbool get_consequences_core(expr_ref_vector const& asms, expr_ref_vector const& vars, expr_ref_vector& consequences) override {
        datatype_util dt(m);
        bv_util bv(m);
        expr_ref_vector bvars(m), conseq(m), bounds(m);

        // ensure that enumeration variables that 
        // don't occur in the constraints
        // are also internalized.
        for (expr* v : vars) {
            expr_ref tmp(m.mk_eq(v, v), m);
            proof_ref proof(m);
            m_rewriter(tmp, tmp, proof);            
        }
        m_rewriter.flush_side_constraints(bounds);
        m_solver->assert_expr(bounds);

        // translate enumeration constants to bit-vectors.
        for (expr* v : vars) {
            func_decl* f = nullptr;
            if (is_app(v) && is_uninterp_const(v) && m_rewriter.enum2bv().find(to_app(v)->get_decl(), f)) {
                bvars.push_back(m.mk_const(f));
            }
            else {
                bvars.push_back(v);
            }
        }
        lbool r = m_solver->get_consequences(asms, bvars, consequences);

        // translate bit-vector consequences back to enumeration types
        for (unsigned i = 0; i < consequences.size(); ++i) {
            expr* a = nullptr, *b = nullptr, *u = nullptr, *v = nullptr;
            func_decl* f;
            rational num;
            unsigned bvsize;
            VERIFY(m.is_implies(consequences[i].get(), a, b));
            if (m.is_eq(b, u, v) && is_uninterp_const(u) && m_rewriter.bv2enum().find(to_app(u)->get_decl(), f) && bv.is_numeral(v, num, bvsize)) {
                SASSERT(num.is_unsigned());
                expr_ref head(m);
                ptr_vector<func_decl> const& enums = *dt.get_datatype_constructors(f->get_range());
                if (enums.size() > num.get_unsigned()) {
                    head = m.mk_eq(m.mk_const(f), m.mk_const(enums[num.get_unsigned()]));
                    consequences[i] = m.mk_implies(a, head);
                }
            }
        }
        return r;
    }
Пример #2
0
Файл: str.c Проект: xdave/xsps
/* Returns new string with all ${FOO} vars replaced from getbenv() */
char *
breplace(const char *input)
{
	size_t i, input_len, tmp_len;
	const char *env;
	char *item, *tmp = NULL, *replacement = NULL;

	/* Copy input to output if this is a useless call */
	if ((strstr(input, "${") == NULL))
	    return xstrcpy(input);

	str_t to_replace;
	to_replace.size = 0;
	to_replace.items = xmalloc(sizeof(char *) * to_replace.size);

	bvars(&to_replace, input);
	input_len = strlen(input);
	replacement = xmalloc(input_len + 1);
	replacement = strncpy(replacement, input, input_len);
	replacement[input_len] = '\0';

	if (to_replace.size > 0) {
		for (i = 0; i < to_replace.size; i++) {
			item = to_replace.items[i];
			env = getbenv(item);
			tmp = str_replace(replacement, item, env);
			tmp_len = strlen(tmp);
			free(replacement);
			replacement = xmalloc(tmp_len + 1);
			replacement = strncpy(replacement, tmp, tmp_len);
			replacement[tmp_len] = '\0';
			/* NOTE: 'tmp' is free()'d by the strmgr. */
			free(item);
		}
	}
	free(to_replace.items);
	return str_add_nocopy(replacement);
}