[Javapathfinder-user] A heuristic search problem

[<jz...@st...>]

Hi,

I am testing this program:


public static void main(String[] args) {
    int x = Verify.random(10);
    int y = 0;
    Verify.interesing(x > 5);
    Verify.boring(x < 5);
    if(x > 5)
        y = 100;
    if(x < 5)
        y = 50;
    System.out.println("x, y: " x + " " + y);
}


and I have configured the search algorithms to be BFS:

search.class = gov.nasa.jpf.search.heuristic.HeuristicSearch
search.heuristic.class = gov.nasa.jpf.search.heuristic.BFSHeuristic


I expect the result to look like:
x, y: 6 100
x, y: 7 100
x, y: 8 100
x, y: 9 100
x, y: 10 100
x, y: 5 0
x, y: 1 50
x, y: 2 50
x, y: 3 50
x, y: 4 50

but the result actually is:

x, y: 1 50
x, y: 2 50
x, y: 3 50
x, y: 4 50
x, y: 5 0
x, y: 6 100
x, y: 7 100
x, y: 8 100
x, y: 9 100
x, y: 10 100

It seems that it is still using DFS search heuristics. Can anyone tell me
why?


Thank you.

J. Zhu