/**
* Gets the ranks of elements in the given array
*
* @param array the array for which we need the ranks
* @param tolerance tolerance value within which two values are considered equal
*/
public static double[] getRanks(double[] array, double tolerance) {
int i, j, n = array.length;
ArrayList<Pair<Double, Integer>> valuesAndIndices = new ArrayList<Pair<Double, Integer>>(n);
double[] ranks = new double[n];
if (n == 0) return ranks;
for (i = 0; i < n; i++) {
valuesAndIndices.add(Pair.create(array[i], i));
}
Collections.sort(
valuesAndIndices,
new Comparator<Pair<Double, Integer>>() {
public int compare(Pair<Double, Integer> foo, Pair<Double, Integer> bar) {
return foo.getLeft().compareTo(bar.getLeft());
}
});
int sumRanks = 0;
int dupCount = 1;
Pair<Double, Integer> prev = valuesAndIndices.get(0);
for (i = 1; i < n; i++) {
Pair<Double, Integer> curr = valuesAndIndices.get(i);
if (Math.abs(curr.getLeft() - prev.getLeft()) < tolerance) {
dupCount++;
sumRanks += i;
} else {
double rank = (double) sumRanks / dupCount + 1;
for (j = i - dupCount; j < i; j++) ranks[valuesAndIndices.get(j).getRight()] = rank;
dupCount = 1;
sumRanks = i;
}
prev = curr;
}
double rank = (double) sumRanks / dupCount + 1;
for (j = n - dupCount; j < n; j++) ranks[valuesAndIndices.get(j).getRight()] = rank;
return ranks;
}
public boolean equals(Object obj) {
if (obj == null) {
return false;
}
if (!(obj instanceof Pair)) {
return false;
} else {
Pair pair = (Pair) obj;
return left.equals(pair.getLeft()) && right.equals(pair.getRight());
}
}
@Test
public void test_flatMap_null_right() {
// prepare
final String left = "foo";
Pair<String> pair = new Pair<>(left, null);
// action
Pair<Integer> result =
pair.flatMap(
(l, r) -> {
final int lengthL = (l == null ? 0 : l.length());
final int lengthR = (r == null ? 0 : r.length());
Pair<Integer> tmp = new Pair<>(lengthL, lengthR);
reverse(tmp);
return tmp;
});
// check
assertEquals(left.length(), result.getRight().intValue());
assertEquals(0, result.getLeft().intValue());
}
private <T> void reverse(Pair<T> pair) {
final T left = pair.getLeft();
pair.setLeft(pair.getRight());
pair.setRight(left);
}
@Override
public int compare(Pair<String, Integer> o1, Pair<String, Integer> o2) {
return o1.getLeft().compareTo(o2.getLeft());
}
@Override
public boolean equals(Object o) {
if (!(o instanceof Pair)) return false;
Pair pairo = (Pair) o;
return this.left.equals(pairo.getLeft()) && this.right.equals(pairo.getRight());
}
@Override
public void run() {
Runtime runtime = Runtime.getRuntime();
// Jakstab Algorithm
System.out.println("Starting CPA algorithm.");
AbstractState start = cpa.initStartState(transformerFactory.getInitialLocation());
worklist.add(start);
reached.add(start);
if (art != null) art.setRoot(start);
// Set up precisions
Precision precision = cpa.initPrecision(transformerFactory.getInitialLocation(), null);
Map<Location, Precision> precisionMap = new HashMap<Location, Precision>();
precisionMap.put(start.getLocation(), precision);
int steps = 0;
statesVisited = 0;
final int stepThreshold = 1000;
long startTime = System.currentTimeMillis();
long lastSteps = 0;
long lastTime = 0;
while (!worklist.isEmpty() && !stop && (!failFast || isSound())) {
statesVisited++;
if (++steps == stepThreshold) {
// Helps limit memory usage
long now = System.currentTimeMillis();
System.gc();
long gcTime = System.currentTimeMillis() - now;
logger.debug("Time for GC: " + gcTime + "ms");
now = System.currentTimeMillis();
long duration = Math.max(1, now - lastTime);
long speed = (1000L * (statesVisited - lastSteps) / duration);
// speed = Math.min(speed, 1000);
logger.warn(
"*** Reached "
+ reached.size()
+ " states, processed "
+ statesVisited
+ " states after "
+ (now - startTime)
+ "ms, at "
+ speed
+ " states/second"
+ (transformerFactory instanceof ResolvingTransformerFactory
? ", " + program.getInstructionCount() + " instructions."
: "."));
logger.info(
String.format(
" Allocated heap memory: %.2f MByte",
(runtime.totalMemory() - runtime.freeMemory()) / (1024.0 * 1024.0)));
steps = 0;
// StatsPlotter.plot((now - startTime) + "\t" + statesVisited
// +"\t" + program.getInstructionCount() + "\t" + gcTime + "\t"
// + speed);
lastSteps = statesVisited;
lastTime = now;
if (Options.timeout.getValue() > 0
&& (System.currentTimeMillis() - startTime > Options.timeout.getValue() * 1000)) {
logger.error("Timeout after " + Options.timeout.getValue() + "s!");
stop = true;
}
}
// We need the state before precision refinement for building the
// ART
AbstractState unadjustedState = worklist.pick();
/*
* if (unadjustedState.getLocation().getAddress().toString().equals(
* "0x00401189") //||
* unadjustedState.getLocation().getAddress().toString
* ().equals("0x0040119b") ||
* unadjustedState.getLocation().getAddress
* ().toString().equals("0x00401078") ||
* unadjustedState.getLocation(
* ).getAddress().toString().equals("0x0040100a") )
* System.out.println("Debug " +
* unadjustedState.getLocation().getAddress().toString());
*/
precision = precisionMap.get(unadjustedState.getLocation());
Pair<AbstractState, Precision> pair = cpa.prec(unadjustedState, precision, reached);
// Warning: The refined a is not stored in "reached", only used for
// successor calculation
AbstractState a = pair.getLeft();
/*
* CompositeState a1 = (CompositeState) a; BasedNumberValuation a2 =
* (BasedNumberValuation)a1.getComponent(1); if
* (a2.getStore().isTop()) System.out.println("Debug TOP Value");
*/
precision = pair.getRight();
precisionMap.put(a.getLocation(), precision);
// logger.debug("Picked from worklist: " + a.getIdentifier());
// getTransformers() and post() might throw exceptions
try {
// For each outgoing edge
// if (a.isTop())
// System.out.println("Debug TOP");
/*
* if
* (a.getLocation().getAddress().toString().equals("0x004106cd")
* ||
* (a.getLocation().getAddress().toString().equals("0x00410498")
* && a.getLocation().getIndex() >= 0))
* System.out.println("Debug Transformer Factory:" +
* a.getLocation().getAddress().toString());
*/
// Set<CFAEdge> s = transformerFactory.getTransformers(a);
// System.out.println("Debug Transformer Factory:" +
// a.getLocation().getAddress().toString());
for (CFAEdge cfaEdge : transformerFactory.getTransformers(a)) {
Precision targetPrecision = precisionMap.get(cfaEdge.getTarget());
if (targetPrecision == null) {
targetPrecision = cpa.initPrecision(cfaEdge.getTarget(), cfaEdge.getTransformer());
precisionMap.put(cfaEdge.getTarget(), targetPrecision);
}
// Prefix everything by current location for easier
// debugging
// Logger.setGlobalPrefix(cfaEdge.getSource().toString());
// if
// (cfaEdge.getSource().getAddress().toString().equals("0x00401027")
// &&
// cfaEdge.getTarget().getAddress().toString().equals("0x0040102e"))
// System.out.println("Debug Edge");
// Calculate the set of abstract successors
Set<AbstractState> successors = cpa.post(a, cfaEdge, targetPrecision);
if (successors.isEmpty()) {
logger.debug("No successors along edge " + cfaEdge + ", reached halt?");
continue;
}
// logger.debug("via edge " + cfaEdge.toString() + " " +
// successors.size() + " successors.");
// Process every successor
for (AbstractState succ : successors) {
// logger.debug("Processing new post state: " +
// succ.getIdentifier());
// Try to merge the new state with an existing one
Set<AbstractState> statesToRemove = new FastSet<AbstractState>();
Set<AbstractState> statesToAdd = new FastSet<AbstractState>();
for (AbstractState r : reached.where(0, ((CompositeState) succ).getComponent(0))) {
AbstractState merged = cpa.merge(succ, r, targetPrecision);
if (!merged.equals(r)) {
// logger.debug("Merge of " +
// succ.getIdentifier() + " and " +
// r.getIdentifier() + " produced new state " +
// merged.getIdentifier());
statesToRemove.add(r);
statesToAdd.add(merged);
}
}
// replace the old state in worklist and reached with
// the merged version
for (AbstractState r : statesToRemove) {
reached.remove(r);
worklist.remove(r);
// art.remove(r);
}
for (AbstractState r : statesToAdd) {
// Only add r to the worklist if it hasn't been
// reached yet
if (reached.add(r)) {
worklist.add(r);
if (art != null) art.addChild(unadjustedState, r);
}
}
// if not stopped add to worklist
if (!cpa.stop(succ, reached, targetPrecision)
|| this.program.checkSMPos(((CompositeState) succ).getLocation().getAddress())) {
worklist.add(succ);
reached.add(succ);
if (art != null) art.addChild(unadjustedState, succ);
}
}
// end for each outgoing edge
}
} catch (StateException e) {
if (e.getState() == null) {
e.setState(a);
}
if (art != null && !unadjustedState.equals(e.getState()))
art.addChild(unadjustedState, e.getState());
throw e;
}
}
long endTime = System.currentTimeMillis();
if (endTime - startTime > 0) {
logger.info(
"Processed "
+ statesVisited
+ " states at "
+ (1000L * statesVisited / (endTime - startTime))
+ " states/second");
logger.info(
String.format(
"Allocated heap memory: %.2f MByte",
(runtime.totalMemory() - runtime.freeMemory()) / (1024.0 * 1024.0)));
}
completed = worklist.isEmpty();
}
