Added array analysis (computes paths used to add elements/tuples to sets/relations.

[repair.git] / Repair / RepairCompiler / MCC / IR / GraphAnalysis.java

diff --git a/Repair/RepairCompiler/MCC/IR/GraphAnalysis.java b/Repair/RepairCompiler/MCC/IR/GraphAnalysis.java
index e89898ab62dd372a5d02c6a083b023df6c156812..1e5a0ce0a2a6e97dc75e4c7da7b30e0e0b4fa98d 100755 (executable)
--- a/Repair/RepairCompiler/MCC/IR/GraphAnalysis.java
+++ b/Repair/RepairCompiler/MCC/IR/GraphAnalysis.java
@@ -33,7 +33,7 @@ public class GraphAnalysis {
            couldremove.addAll(termination.conjunctions);
            couldremove.addAll(termination.updatenodes);
            couldremove.addAll(termination.consequencenodes);
-           couldremove.retainAll(cycles);
+           couldremove.retainAll(nodes);
 
            /* Look for constraints which can only be satisfied one way */