2 * Copyright (C) 2014, United States Government, as represented by the
3 * Administrator of the National Aeronautics and Space Administration.
6 * The Java Pathfinder core (jpf-core) platform is licensed under the
7 * Apache License, Version 2.0 (the "License"); you may not use this file except
8 * in compliance with the License. You may obtain a copy of the License at
10 * http://www.apache.org/licenses/LICENSE-2.0.
12 * Unless required by applicable law or agreed to in writing, software
13 * distributed under the License is distributed on an "AS IS" BASIS,
14 * WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
15 * See the License for the specific language governing permissions and
16 * limitations under the License.
18 package gov.nasa.jpf.listener;
20 import gov.nasa.jpf.Config;
21 import gov.nasa.jpf.JPF;
22 import gov.nasa.jpf.ListenerAdapter;
23 import gov.nasa.jpf.search.Search;
24 import gov.nasa.jpf.jvm.bytecode.*;
25 import gov.nasa.jpf.vm.*;
26 import gov.nasa.jpf.vm.bytecode.ReadInstruction;
27 import gov.nasa.jpf.vm.bytecode.WriteInstruction;
28 import gov.nasa.jpf.vm.choice.IntChoiceFromSet;
29 import gov.nasa.jpf.vm.choice.IntIntervalGenerator;
31 import java.io.PrintWriter;
34 // TODO: Fix for Groovy's model-checking
35 // TODO: This is a setter to change the values of the ChoiceGenerator to implement POR
37 * Simple tool to log state changes.
39 * This DPOR implementation is augmented by the algorithm presented in this SPIN paper:
40 * http://spinroot.com/spin/symposia/ws08/spin2008_submission_33.pdf
42 * The algorithm is presented on page 11 of the paper. Basically, we create a graph G
43 * (i.e., visible operation dependency graph)
44 * that maps inter-related threads/sub-programs that trigger state changes.
45 * The key to this approach is that we evaluate graph G in every iteration/recursion to
46 * only update the backtrack sets of the threads/sub-programs that are reachable in graph G
47 * from the currently running thread/sub-program.
49 public class DPORStateReducer extends ListenerAdapter {
51 // Information printout fields for verbose mode
52 private boolean verboseMode;
53 private boolean stateReductionMode;
54 private final PrintWriter out;
55 private String detail;
58 private Transition transition;
60 // DPOR-related fields
62 private Integer[] choices;
63 private Integer[] refChoices; // Second reference to a copy of choices (choices may be modified for fair scheduling)
64 private int choiceCounter;
65 private int maxEventChoice;
66 // Data structure to track the events seen by each state to track cycles (containing all events) for termination
67 private HashSet<Integer> currVisitedStates; // States being visited in the current execution
68 private HashSet<Integer> justVisitedStates; // States just visited in the previous choice/event
69 private HashSet<Integer> prevVisitedStates; // States visited in the previous execution
70 private HashMap<Integer, HashSet<Integer>> stateToEventMap;
71 // Data structure to analyze field Read/Write accesses and conflicts
72 private HashMap<Integer, LinkedList<Integer[]>> backtrackMap; // Track created backtracking points
73 private PriorityQueue<Integer> backtrackStateQ; // Heap that returns the latest state
74 private ArrayList<BacktrackPoint> backtrackPointList; // Record backtrack points (CG, state Id, and choice)
75 private HashMap<Integer, HashSet<Integer>> conflictPairMap; // Record conflicting events
76 private HashSet<String> doneBacktrackSet; // Record state ID and trace already constructed
77 private HashMap<Integer, ReadWriteSet> readWriteFieldsMap; // Record fields that are accessed
78 private HashMap<Integer, RestorableVMState> restorableStateMap; // Maps state IDs to the restorable state object
80 // Visible operation dependency graph implementation (SPIN paper) related fields
81 private int prevChoiceValue;
82 private HashMap<Integer, HashSet<Integer>> vodGraphMap; // Visible operation dependency graph (VOD graph)
85 private boolean isBooleanCGFlipped;
86 private boolean isEndOfExecution;
88 public DPORStateReducer(Config config, JPF jpf) {
89 verboseMode = config.getBoolean("printout_state_transition", false);
90 stateReductionMode = config.getBoolean("activate_state_reduction", true);
92 out = new PrintWriter(System.out, true);
96 isBooleanCGFlipped = false;
97 restorableStateMap = new HashMap<>();
98 initializeStatesVariables();
102 public void stateRestored(Search search) {
104 id = search.getStateId();
105 depth = search.getDepth();
106 transition = search.getTransition();
108 out.println("\n==> DEBUG: The state is restored to state with id: " + id + " -- Transition: " + transition +
109 " and depth: " + depth + "\n");
114 public void searchStarted(Search search) {
116 out.println("\n==> DEBUG: ----------------------------------- search started" + "\n");
121 public void stateAdvanced(Search search) {
123 id = search.getStateId();
124 depth = search.getDepth();
125 transition = search.getTransition();
126 if (search.isNewState()) {
132 if (search.isEndState()) {
133 out.println("\n==> DEBUG: This is the last state!\n");
136 out.println("\n==> DEBUG: The state is forwarded to state with id: " + id + " with depth: " + depth +
137 " which is " + detail + " Transition: " + transition + "\n");
139 if (stateReductionMode) {
140 updateStateInfo(search);
145 public void stateBacktracked(Search search) {
147 id = search.getStateId();
148 depth = search.getDepth();
149 transition = search.getTransition();
152 out.println("\n==> DEBUG: The state is backtracked to state with id: " + id + " -- Transition: " + transition +
153 " and depth: " + depth + "\n");
155 if (stateReductionMode) {
156 updateStateInfo(search);
161 public void searchFinished(Search search) {
163 out.println("\n==> DEBUG: ----------------------------------- search finished" + "\n");
168 public void choiceGeneratorRegistered(VM vm, ChoiceGenerator<?> nextCG, ThreadInfo currentThread, Instruction executedInstruction) {
169 if (stateReductionMode) {
170 // Initialize with necessary information from the CG
171 if (nextCG instanceof IntChoiceFromSet) {
172 IntChoiceFromSet icsCG = (IntChoiceFromSet) nextCG;
173 if (!isEndOfExecution) {
174 // Check if CG has been initialized, otherwise initialize it
175 Integer[] cgChoices = icsCG.getAllChoices();
176 // Record the events (from choices)
177 if (choices == null) {
179 // Make a copy of choices as reference
180 refChoices = copyChoices(choices);
181 // Record the max event choice (the last element of the choice array)
182 maxEventChoice = choices[choices.length - 1];
184 icsCG.setNewValues(choices);
186 // Use a modulo since choiceCounter is going to keep increasing
187 int choiceIndex = choiceCounter % choices.length;
188 icsCG.advance(choices[choiceIndex]);
190 // Set done all CGs while transitioning to a new execution
198 public void choiceGeneratorAdvanced(VM vm, ChoiceGenerator<?> currentCG) {
200 if (stateReductionMode) {
201 // Check the boolean CG and if it is flipped, we are resetting the analysis
202 if (currentCG instanceof BooleanChoiceGenerator) {
203 if (!isBooleanCGFlipped) {
204 isBooleanCGFlipped = true;
206 // Allocate new objects for data structure when the boolean is flipped from "false" to "true"
207 initializeStatesVariables();
210 // Check every choice generated and ensure fair scheduling!
211 if (currentCG instanceof IntChoiceFromSet) {
212 IntChoiceFromSet icsCG = (IntChoiceFromSet) currentCG;
213 // If this is a new CG then we need to update data structures
214 resetStatesForNewExecution(icsCG, vm);
215 // If we don't see a fair scheduling of events/choices then we have to enforce it
216 fairSchedulingAndBacktrackPoint(icsCG, vm);
217 // Map state to event
218 mapStateToEvent(icsCG.getNextChoice());
219 // Update the VOD graph always with the latest
220 updateVODGraph(icsCG.getNextChoice());
221 // Check if we have seen this state or this state contains cycles that involve all events
222 if (terminateCurrentExecution()) {
223 exploreNextBacktrackPoints(vm, icsCG);
225 justVisitedStates.clear();
232 public void instructionExecuted(VM vm, ThreadInfo ti, Instruction nextInsn, Instruction executedInsn) {
233 if (stateReductionMode) {
234 if (!isEndOfExecution) {
235 // Has to be initialized and a integer CG
236 ChoiceGenerator<?> cg = vm.getChoiceGenerator();
237 if (cg instanceof IntChoiceFromSet || cg instanceof IntIntervalGenerator) {
238 int currentChoice = choiceCounter - 1; // Accumulative choice w.r.t the current trace
239 if (currentChoice < 0) { // If choice is -1 then skip
242 currentChoice = checkAndAdjustChoice(currentChoice, vm);
243 // Record accesses from executed instructions
244 if (executedInsn instanceof JVMFieldInstruction) {
245 // Analyze only after being initialized
246 String fieldClass = ((JVMFieldInstruction) executedInsn).getFieldInfo().getFullName();
247 // We don't care about libraries
248 if (!isFieldExcluded(fieldClass)) {
249 analyzeReadWriteAccesses(executedInsn, fieldClass, currentChoice);
251 } else if (executedInsn instanceof INVOKEINTERFACE) {
252 // Handle the read/write accesses that occur through iterators
253 analyzeReadWriteAccesses(executedInsn, ti, currentChoice);
255 // Analyze conflicts from next instructions
256 if (nextInsn instanceof JVMFieldInstruction) {
257 // Skip the constructor because it is called once and does not have shared access with other objects
258 if (!nextInsn.getMethodInfo().getName().equals("<init>")) {
259 String fieldClass = ((JVMFieldInstruction) nextInsn).getFieldInfo().getFullName();
260 if (!isFieldExcluded(fieldClass)) {
261 // Check for conflict (go backward from current choice and get the first conflict)
262 for (int eventCounter = currentChoice - 1; eventCounter >= 0; eventCounter--) {
263 // Check for conflicts with Write fields for both Read and Write instructions
264 // Check and record a backtrack set for just once!
265 if (isConflictFound(nextInsn, eventCounter, currentChoice, fieldClass) &&
266 isNewConflict(currentChoice, eventCounter)) {
267 // Lines 4-8 of the algorithm in the paper page 11 (see the heading note above)
268 if (vm.isNewState() || isReachableInVODGraph(currentChoice)) {
269 createBacktrackingPoint(currentChoice, eventCounter);
286 // This class compactly stores Read and Write field sets
287 // We store the field name and its object ID
288 // Sharing the same field means the same field name and object ID
289 private class ReadWriteSet {
290 private HashMap<String, Integer> readSet;
291 private HashMap<String, Integer> writeSet;
293 public ReadWriteSet() {
294 readSet = new HashMap<>();
295 writeSet = new HashMap<>();
298 public void addReadField(String field, int objectId) {
299 readSet.put(field, objectId);
302 public void addWriteField(String field, int objectId) {
303 writeSet.put(field, objectId);
306 public boolean readFieldExists(String field) {
307 return readSet.containsKey(field);
310 public boolean writeFieldExists(String field) {
311 return writeSet.containsKey(field);
314 public int readFieldObjectId(String field) {
315 return readSet.get(field);
318 public int writeFieldObjectId(String field) {
319 return writeSet.get(field);
323 // This class compactly stores backtrack points: 1) backtrack state ID, and 2) backtracking choices
324 private class BacktrackPoint {
325 private IntChoiceFromSet backtrackCG; // CG at this backtrack point
326 private int stateId; // State at this backtrack point
327 private int choice; // Choice chosen at this backtrack point
329 public BacktrackPoint(IntChoiceFromSet cg, int stId, int cho) {
335 public IntChoiceFromSet getBacktrackCG() { return backtrackCG; }
337 public int getStateId() {
341 public int getChoice() {
347 private final static String DO_CALL_METHOD = "doCall";
348 // We exclude fields that come from libraries (Java and Groovy), and also the infrastructure
349 private final static String[] EXCLUDED_FIELDS_CONTAINS_LIST = {"_closure"};
350 private final static String[] EXCLUDED_FIELDS_ENDS_WITH_LIST =
351 // Groovy library created fields
352 {"stMC", "callSiteArray", "metaClass", "staticClassInfo", "__constructor__",
354 "sendEvent", "Object", "reference", "location", "app", "state", "log", "functionList", "objectList",
355 "eventList", "valueList", "settings", "printToConsole", "app1", "app2"};
356 private final static String[] EXCLUDED_FIELDS_STARTS_WITH_LIST =
357 // Java and Groovy libraries
358 { "java", "org", "sun", "com", "gov", "groovy"};
359 private final static String[] EXCLUDED_FIELDS_READ_WRITE_INSTRUCTIONS_STARTS_WITH_LIST = {"Event"};
360 private final static String GET_PROPERTY_METHOD =
361 "invokeinterface org.codehaus.groovy.runtime.callsite.CallSite.callGetProperty";
362 private final static String GROOVY_CALLSITE_LIB = "org.codehaus.groovy.runtime.callsite";
363 private final static String JAVA_INTEGER = "int";
364 private final static String JAVA_STRING_LIB = "java.lang.String";
367 private void fairSchedulingAndBacktrackPoint(IntChoiceFromSet icsCG, VM vm) {
368 // Check the next choice and if the value is not the same as the expected then force the expected value
369 int choiceIndex = choiceCounter % refChoices.length;
370 int nextChoice = icsCG.getNextChoice();
371 if (refChoices[choiceIndex] != nextChoice) {
372 int expectedChoice = refChoices[choiceIndex];
373 int currCGIndex = icsCG.getNextChoiceIndex();
374 if ((currCGIndex >= 0) && (currCGIndex < refChoices.length)) {
375 icsCG.setChoice(currCGIndex, expectedChoice);
378 // Record state ID and choice/event as backtrack point
379 backtrackPointList.add(new BacktrackPoint(icsCG, vm.getStateId(), refChoices[choiceIndex]));
382 private Integer[] copyChoices(Integer[] choicesToCopy) {
384 Integer[] copyOfChoices = new Integer[choicesToCopy.length];
385 System.arraycopy(choicesToCopy, 0, copyOfChoices, 0, choicesToCopy.length);
386 return copyOfChoices;
389 // --- Functions related to cycle detection
391 // Detect cycles in the current execution/trace
392 // We terminate the execution iff:
393 // (1) the state has been visited in the current execution
394 // (2) the state has one or more cycles that involve all the events
395 // With simple approach we only need to check for a re-visited state.
396 // Basically, we have to check that we have executed all events between two occurrences of such state.
397 private boolean containsCyclesWithAllEvents(int stId) {
399 // False if the state ID hasn't been recorded
400 if (!stateToEventMap.containsKey(stId)) {
403 HashSet<Integer> visitedEvents = stateToEventMap.get(stId);
404 // Check if this set contains all the event choices
405 // If not then this is not the terminating condition
406 for(int i=0; i<=maxEventChoice; i++) {
407 if (!visitedEvents.contains(i)) {
414 private void initializeStatesVariables() {
421 currVisitedStates = new HashSet<>();
422 justVisitedStates = new HashSet<>();
423 prevVisitedStates = new HashSet<>();
424 stateToEventMap = new HashMap<>();
426 backtrackMap = new HashMap<>();
427 backtrackStateQ = new PriorityQueue<>(Collections.reverseOrder());
428 backtrackPointList = new ArrayList<>();
429 conflictPairMap = new HashMap<>();
430 doneBacktrackSet = new HashSet<>();
431 readWriteFieldsMap = new HashMap<>();
433 prevChoiceValue = -1;
434 vodGraphMap = new HashMap<>();
436 isEndOfExecution = false;
439 private void mapStateToEvent(int nextChoiceValue) {
440 // Update all states with this event/choice
441 // This means that all past states now see this transition
442 Set<Integer> stateSet = stateToEventMap.keySet();
443 for(Integer stateId : stateSet) {
444 HashSet<Integer> eventSet = stateToEventMap.get(stateId);
445 eventSet.add(nextChoiceValue);
449 private boolean terminateCurrentExecution() {
450 // We need to check all the states that have just been visited
451 // Often a transition (choice/event) can result into forwarding/backtracking to a number of states
452 for(Integer stateId : justVisitedStates) {
453 if (prevVisitedStates.contains(stateId) || containsCyclesWithAllEvents(stateId)) {
460 private void updateStateInfo(Search search) {
461 // Update the state variables
462 // Line 19 in the paper page 11 (see the heading note above)
463 int stateId = search.getStateId();
464 currVisitedStates.add(stateId);
465 // Insert state ID into the map if it is new
466 if (!stateToEventMap.containsKey(stateId)) {
467 HashSet<Integer> eventSet = new HashSet<>();
468 stateToEventMap.put(stateId, eventSet);
470 justVisitedStates.add(stateId);
471 // Store restorable state object for this state (always store the latest)
472 RestorableVMState restorableState = search.getVM().getRestorableState();
473 restorableStateMap.put(stateId, restorableState);
476 // --- Functions related to Read/Write access analysis on shared fields
478 private void addNewBacktrackPoint(int stateId, Integer[] newChoiceList) {
479 // Insert backtrack point to the right state ID
480 LinkedList<Integer[]> backtrackList;
481 if (backtrackMap.containsKey(stateId)) {
482 backtrackList = backtrackMap.get(stateId);
484 backtrackList = new LinkedList<>();
485 backtrackMap.put(stateId, backtrackList);
487 backtrackList.addFirst(newChoiceList);
488 // Add to priority queue
489 if (!backtrackStateQ.contains(stateId)) {
490 backtrackStateQ.add(stateId);
494 // Analyze Read/Write accesses that are directly invoked on fields
495 private void analyzeReadWriteAccesses(Instruction executedInsn, String fieldClass, int currentChoice) {
496 // Do the analysis to get Read and Write accesses to fields
497 ReadWriteSet rwSet = getReadWriteSet(currentChoice);
498 int objectId = ((JVMFieldInstruction) executedInsn).getFieldInfo().getClassInfo().getClassObjectRef();
499 // Record the field in the map
500 if (executedInsn instanceof WriteInstruction) {
501 // Exclude certain field writes because of infrastructure needs, e.g., Event class field writes
502 for (String str : EXCLUDED_FIELDS_READ_WRITE_INSTRUCTIONS_STARTS_WITH_LIST) {
503 if (fieldClass.startsWith(str)) {
507 rwSet.addWriteField(fieldClass, objectId);
508 } else if (executedInsn instanceof ReadInstruction) {
509 rwSet.addReadField(fieldClass, objectId);
513 // Analyze Read accesses that are indirect (performed through iterators)
514 // These accesses are marked by certain bytecode instructions, e.g., INVOKEINTERFACE
515 private void analyzeReadWriteAccesses(Instruction instruction, ThreadInfo ti, int currentChoice) {
517 INVOKEINTERFACE insn = (INVOKEINTERFACE) instruction;
518 if (insn.toString().startsWith(GET_PROPERTY_METHOD) &&
519 insn.getMethodInfo().getName().equals(DO_CALL_METHOD)) {
520 // Extract info from the stack frame
521 StackFrame frame = ti.getTopFrame();
522 int[] frameSlots = frame.getSlots();
523 // Get the Groovy callsite library at index 0
524 ElementInfo eiCallsite = VM.getVM().getHeap().get(frameSlots[0]);
525 if (!eiCallsite.getClassInfo().getName().startsWith(GROOVY_CALLSITE_LIB)) {
528 // Get the iterated object whose property is accessed
529 ElementInfo eiAccessObj = VM.getVM().getHeap().get(frameSlots[1]);
530 if (eiAccessObj == null) {
533 // We exclude library classes (they start with java, org, etc.) and some more
534 String objClassName = eiAccessObj.getClassInfo().getName();
535 if (excludeThisForItStartsWith(EXCLUDED_FIELDS_STARTS_WITH_LIST, objClassName) ||
536 excludeThisForItStartsWith(EXCLUDED_FIELDS_READ_WRITE_INSTRUCTIONS_STARTS_WITH_LIST, objClassName)) {
539 // Extract fields from this object and put them into the read write
540 int numOfFields = eiAccessObj.getNumberOfFields();
541 for(int i=0; i<numOfFields; i++) {
542 FieldInfo fieldInfo = eiAccessObj.getFieldInfo(i);
543 if (fieldInfo.getType().equals(JAVA_STRING_LIB) || fieldInfo.getType().equals(JAVA_INTEGER)) {
544 String fieldClass = fieldInfo.getFullName();
545 ReadWriteSet rwSet = getReadWriteSet(currentChoice);
546 int objectId = fieldInfo.getClassInfo().getClassObjectRef();
547 // Record the field in the map
548 rwSet.addReadField(fieldClass, objectId);
554 private int checkAndAdjustChoice(int currentChoice, VM vm) {
555 // If current choice is not the same, then this is caused by the firing of IntIntervalGenerator
556 // for certain method calls in the infrastructure, e.g., eventSince()
557 int currChoiceInd = currentChoice % refChoices.length;
558 int currChoiceFromCG = 0;
559 ChoiceGenerator<?> currentCG = vm.getChoiceGenerator();
560 // This is the main event CG
561 if (currentCG instanceof IntChoiceFromSet) {
562 currChoiceFromCG = currChoiceInd;
564 // This is the interval CG used in device handlers
565 ChoiceGenerator<?> parentCG = ((IntIntervalGenerator) currentCG).getPreviousChoiceGenerator();
566 currChoiceFromCG = ((IntChoiceFromSet) parentCG).getNextChoiceIndex();
568 if (currChoiceInd != currChoiceFromCG) {
569 currentChoice = (currentChoice - currChoiceInd) + currChoiceFromCG;
571 return currentChoice;
574 private void createBacktrackingPoint(int currentChoice, int confEvtNum) {
576 // Create a new list of choices for backtrack based on the current choice and conflicting event number
577 // E.g. if we have a conflict between 1 and 3, then we create the list {3, 1, 0, 2}
578 // for the original set {0, 1, 2, 3}
579 Integer[] newChoiceList = new Integer[refChoices.length];
580 // Put the conflicting event numbers first and reverse the order
581 int actualCurrCho = currentChoice % refChoices.length;
582 // We use the actual choices here in case they have been modified/adjusted by the fair scheduling method
583 newChoiceList[0] = choices[actualCurrCho];
584 newChoiceList[1] = backtrackPointList.get(confEvtNum).getChoice();
585 // Put the rest of the event numbers into the array starting from the minimum to the upper bound
586 for (int i = 0, j = 2; i < refChoices.length; i++) {
587 if (refChoices[i] != newChoiceList[0] && refChoices[i] != newChoiceList[1]) {
588 newChoiceList[j] = refChoices[i];
592 // Get the backtrack CG for this backtrack point
593 int stateId = backtrackPointList.get(confEvtNum).getStateId();
594 // Check if this trace has been done starting from this state
595 if (isTraceAlreadyConstructed(newChoiceList, stateId)) {
598 //BacktrackPoint backtrackPoint = new BacktrackPoint(backtrackCG, newChoiceList);
599 addNewBacktrackPoint(stateId, newChoiceList);
602 private boolean excludeThisForItContains(String[] excludedStrings, String className) {
603 for (String excludedField : excludedStrings) {
604 if (className.contains(excludedField)) {
611 private boolean excludeThisForItEndsWith(String[] excludedStrings, String className) {
612 for (String excludedField : excludedStrings) {
613 if (className.endsWith(excludedField)) {
620 private boolean excludeThisForItStartsWith(String[] excludedStrings, String className) {
621 for (String excludedField : excludedStrings) {
622 if (className.startsWith(excludedField)) {
629 private void exploreNextBacktrackPoints(VM vm, IntChoiceFromSet icsCG) {
631 // We can start exploring the next backtrack point after the current CG is advanced at least once
632 if (choiceCounter > 0) {
633 // Check if we are reaching the end of our execution: no more backtracking points to explore
634 // cgMap, backtrackMap, backtrackStateQ are updated simultaneously (checking backtrackStateQ is enough)
635 if (!backtrackStateQ.isEmpty()) {
636 // Set done all the other backtrack points
637 for (BacktrackPoint backtrackPoint : backtrackPointList) {
638 backtrackPoint.getBacktrackCG().setDone();
640 // Reset the next backtrack point with the latest state
641 int hiStateId = backtrackStateQ.peek();
642 // Restore the state first if necessary
643 if (vm.getStateId() != hiStateId) {
644 RestorableVMState restorableState = restorableStateMap.get(hiStateId);
645 vm.restoreState(restorableState);
647 // Set the backtrack CG
648 IntChoiceFromSet backtrackCG = (IntChoiceFromSet) vm.getChoiceGenerator();
649 setBacktrackCG(hiStateId, backtrackCG);
651 // Set done this last CG (we save a few rounds)
654 // Save all the visited states when starting a new execution of trace
655 prevVisitedStates.addAll(currVisitedStates);
656 currVisitedStates.clear();
657 // This marks a transitional period to the new CG
658 isEndOfExecution = true;
662 private ReadWriteSet getReadWriteSet(int currentChoice) {
663 // Do the analysis to get Read and Write accesses to fields
665 // We already have an entry
666 if (readWriteFieldsMap.containsKey(currentChoice)) {
667 rwSet = readWriteFieldsMap.get(currentChoice);
668 } else { // We need to create a new entry
669 rwSet = new ReadWriteSet();
670 readWriteFieldsMap.put(currentChoice, rwSet);
675 private boolean isConflictFound(Instruction nextInsn, int eventCounter, int currentChoice, String fieldClass) {
677 int actualCurrCho = currentChoice % refChoices.length;
678 // Skip if this event does not have any Read/Write set or the two events are basically the same event (number)
679 if (!readWriteFieldsMap.containsKey(eventCounter) ||
680 choices[actualCurrCho] == backtrackPointList.get(eventCounter).getChoice()) {
683 ReadWriteSet rwSet = readWriteFieldsMap.get(eventCounter);
684 int currObjId = ((JVMFieldInstruction) nextInsn).getFieldInfo().getClassInfo().getClassObjectRef();
685 // Check for conflicts with Write fields for both Read and Write instructions
686 if (((nextInsn instanceof WriteInstruction || nextInsn instanceof ReadInstruction) &&
687 rwSet.writeFieldExists(fieldClass) && rwSet.writeFieldObjectId(fieldClass) == currObjId) ||
688 (nextInsn instanceof WriteInstruction && rwSet.readFieldExists(fieldClass) &&
689 rwSet.readFieldObjectId(fieldClass) == currObjId)) {
695 private boolean isFieldExcluded(String field) {
696 // Check against "starts-with", "ends-with", and "contains" list
697 if (excludeThisForItStartsWith(EXCLUDED_FIELDS_STARTS_WITH_LIST, field) ||
698 excludeThisForItEndsWith(EXCLUDED_FIELDS_ENDS_WITH_LIST, field) ||
699 excludeThisForItContains(EXCLUDED_FIELDS_CONTAINS_LIST, field)) {
706 private boolean isNewConflict(int currentEvent, int eventNumber) {
707 HashSet<Integer> conflictSet;
708 if (!conflictPairMap.containsKey(currentEvent)) {
709 conflictSet = new HashSet<>();
710 conflictPairMap.put(currentEvent, conflictSet);
712 conflictSet = conflictPairMap.get(currentEvent);
714 // If this conflict has been recorded before, we return false because
715 // we don't want to save this backtrack point twice
716 if (conflictSet.contains(eventNumber)) {
719 // If it hasn't been recorded, then do otherwise
720 conflictSet.add(eventNumber);
724 private boolean isTraceAlreadyConstructed(Integer[] choiceList, int stateId) {
725 // Concatenate state ID and only the first event in the string, e.g., "1:1 for the trace 10234 at state 1"
726 // TODO: THIS IS AN OPTIMIZATION!
727 // This is the optimized version because after we execute, e.g., the trace 1:10234, we don't need to try
728 // another trace that starts with event 1 at state 1, e.g., the trace 1:13024
729 // The second time this event 1 is explored, it will generate the same state as the first one
730 StringBuilder sb = new StringBuilder();
733 sb.append(choiceList[0]);
734 // Check if the trace has been constructed as a backtrack point for this state
735 if (doneBacktrackSet.contains(sb.toString())) {
738 doneBacktrackSet.add(sb.toString());
742 private void resetStatesForNewExecution(IntChoiceFromSet icsCG, VM vm) {
743 if (choices == null || choices != icsCG.getAllChoices()) {
744 // Reset state variables
746 choices = icsCG.getAllChoices();
747 refChoices = copyChoices(choices);
748 // Clearing data structures
749 conflictPairMap.clear();
750 readWriteFieldsMap.clear();
751 stateToEventMap.clear();
752 isEndOfExecution = false;
753 backtrackPointList.clear();
757 private void setBacktrackCG(int stateId, IntChoiceFromSet backtrackCG) {
758 // Set a backtrack CG based on a state ID
759 LinkedList<Integer[]> backtrackChoices = backtrackMap.get(stateId);
760 backtrackCG.setNewValues(backtrackChoices.removeLast()); // Get the last from the queue
761 backtrackCG.setStateId(stateId);
763 // Remove from the queue if we don't have more backtrack points for that state
764 if (backtrackChoices.isEmpty()) {
765 backtrackMap.remove(stateId);
766 backtrackStateQ.remove(stateId);
770 // --- Functions related to the visible operation dependency graph implementation discussed in the SPIN paper
772 // This method checks whether a choice is reachable in the VOD graph from a reference choice (BFS algorithm)
773 //private boolean isReachableInVODGraph(int checkedChoice, int referenceChoice) {
774 private boolean isReachableInVODGraph(int currentChoice) {
775 // Extract previous and current events
776 int choiceIndex = currentChoice % refChoices.length;
777 int prevChoIndex = (currentChoice - 1) % refChoices.length;
778 int currEvent = refChoices[choiceIndex];
779 int prevEvent = refChoices[prevChoIndex];
780 // Record visited choices as we search in the graph
781 HashSet<Integer> visitedChoice = new HashSet<>();
782 visitedChoice.add(prevEvent);
783 LinkedList<Integer> nodesToVisit = new LinkedList<>();
784 // If the state doesn't advance as the threads/sub-programs are executed (basically there is no new state),
785 // there is a chance that the graph doesn't have new nodes---thus this check will return a null.
786 if (vodGraphMap.containsKey(prevEvent)) {
787 nodesToVisit.addAll(vodGraphMap.get(prevEvent));
788 while(!nodesToVisit.isEmpty()) {
789 int choice = nodesToVisit.getFirst();
790 if (choice == currEvent) {
793 if (visitedChoice.contains(choice)) { // If there is a loop then we don't find it
796 // Continue searching
797 visitedChoice.add(choice);
798 HashSet<Integer> choiceNextNodes = vodGraphMap.get(choice);
799 if (choiceNextNodes != null) {
800 // Add only if there is a mapping for next nodes
801 for (Integer nextNode : choiceNextNodes) {
803 if (nextNode == choice) {
806 nodesToVisit.addLast(nextNode);
814 private void updateVODGraph(int currChoiceValue) {
815 // Update the graph when we have the current choice value
816 HashSet<Integer> choiceSet;
817 if (vodGraphMap.containsKey(prevChoiceValue)) {
818 // If the key already exists, just retrieve it
819 choiceSet = vodGraphMap.get(prevChoiceValue);
821 // Create a new entry
822 choiceSet = new HashSet<>();
823 vodGraphMap.put(prevChoiceValue, choiceSet);
825 choiceSet.add(currChoiceValue);
826 prevChoiceValue = currChoiceValue;