Examples with AcyclicityConstraint com.dat3m.dartagnan.solver.caat.constraints.AcyclicityConstraint used on opensource projects

Example 1 with AcyclicityConstraint

use of com.dat3m.dartagnan.solver.caat.constraints.AcyclicityConstraint in project Dat3M by hernanponcedeleon.

the class Reasoner method computeViolationReasons.

// ========================== Reason computation ==========================
public DNF<CAATLiteral> computeViolationReasons(Constraint constraint) {
    if (!constraint.checkForViolations()) {
        return DNF.FALSE();
    }
    CAATPredicate pred = constraint.getConstrainedPredicate();
    Collection<? extends Collection<? extends Derivable>> violations = constraint.getViolations();
    List<Conjunction<CAATLiteral>> reasonList = new ArrayList<>(violations.size());
    if (constraint instanceof AcyclicityConstraint) {
        // For acyclicity constraints, it is likely that we encounter the same
        // edge multiple times (as it can be part of different cycles)
        // so we memoize the computed reasons and reuse them if possible.
        final RelationGraph constrainedGraph = (RelationGraph) pred;
        final int mapSize = violations.stream().mapToInt(Collection::size).sum() * 4 / 3;
        final Map<Edge, Conjunction<CAATLiteral>> reasonMap = new HashMap<>(mapSize);
        for (Collection<Edge> violation : (Collection<Collection<Edge>>) violations) {
            Conjunction<CAATLiteral> reason = violation.stream().map(edge -> reasonMap.computeIfAbsent(edge, key -> computeReason(constrainedGraph, key))).reduce(Conjunction.TRUE(), Conjunction::and);
            reasonList.add(reason);
        }
    } else {
        for (Collection<? extends Derivable> violation : violations) {
            Conjunction<CAATLiteral> reason = violation.stream().map(edge -> computeReason(pred, edge)).reduce(Conjunction.TRUE(), Conjunction::and);
            reasonList.add(reason);
        }
    }
    return new DNF<>(reasonList);
}

Example 2 with AcyclicityConstraint

use of com.dat3m.dartagnan.solver.caat.constraints.AcyclicityConstraint in project Dat3M by hernanponcedeleon.

the class ExecutionGraph method getOrCreateConstraintFromAxiom.

// =======================================================
// =================== Reading the WMM ====================
private Constraint getOrCreateConstraintFromAxiom(Axiom axiom) {
    if (constraintMap.containsKey(axiom)) {
        return constraintMap.get(axiom);
    }
    Constraint constraint;
    RelationGraph innerGraph = getOrCreateGraphFromRelation(axiom.getRelation());
    if (axiom.isAcyclicity()) {
        constraint = new AcyclicityConstraint(innerGraph);
    } else if (axiom.isEmptiness()) {
        constraint = new EmptinessConstraint(innerGraph);
    } else if (axiom.isIrreflexivity()) {
        constraint = new IrreflexivityConstraint(innerGraph);
    } else {
        throw new UnsupportedOperationException("The axiom " + axiom + " is not recognized.");
    }
    constraintMap.put(axiom, constraint);
    return constraint;
}