DfsSearcher

ElementMissed InstructionsCov.Missed BranchesCov.MissedCxtyMissedLinesMissedMethods
Total838 of 1,37639%147 of 20427%1201482053593146
isFairCycle(int)2040%400%2121434311
printStack(PrintStream, boolean, boolean)1210%280%1515282811
seekFromTop()10917161%282041%2025206501
writeStack(PrintStream)590%80%55181811
determinePreemptibility(StackEntry, Collection, Object)480%80%55151511
printStack(PrintStream)350%40%33101011
proceedToNewState()295967%101254%71232001
debugStates(String)230%20%226611
search(Object)215271%2466%2451801
printSummary(PrintStream)180%n/a115511
debugPrintStack(String, boolean)16420%1150%123501
DfsSearcher(EnablerIF, StateManager, StatePredicateIF, GMCConfiguration, PrintStream)138887%3350%3433201
restrictDepth()110%n/a113311
setDebugOut(PrintStream)110%20%224411
expand()106085%3562%3512201
stackOutOfBound()8538%3125%230101
debug(String)7436%1150%122401
unboundDepth()70%n/a113311
boundDepth(int)70%n/a113311
resetState(SequentialNode)70%n/a113311
checkStackTrace(StackEntry)63083%2466%241701
setName(String)40%n/a112211
setMinimize(boolean)40%n/a112211
setPreemptionBound(int)40%n/a112211
setFairCycleCheck(boolean)40%n/a112211
setReportCycleAsViolation(boolean)40%n/a112211
numOfSearchNodeSaved()40%n/a111111
search()33592%1583%141901
predicate()30%n/a111111
name()30%n/a111111
isDepthBounded()30%n/a111111
getMinimize()30%n/a111111
reportCycleAsViolation()30%n/a111111
fairCycleCheck()30%n/a111111
cycleFound()30%n/a111111
stack()30%n/a111111
debugging()30%n/a111111
getDebugOut()30%n/a111111
numStatesSeen()30%n/a111111
numTransitions()30%n/a111111
numStatesMatched()30%n/a111111
currentState()1083%1150%121301
DfsSearcher(EnablerIF, StateManager, StatePredicateIF, GMCConfiguration)8100%n/a010201
updateMinimumStackIndex(StackEntry, int)7100%n/a010301
setDebugging(boolean)4100%n/a010201
static {...}100%n/a010101