Constraint solver selection based on the transformer model

Symbolic execution generates test cases that cover all possible paths by symbolizing program code and executing program paths in symbolic form. However, this technique is not good in code coverage due to expensive constraint solving, which takes up most of the time of symbolic execution. In view of the problem that constraint solving takes too much time on certain path constraints, this paper proposes to select the best solver for path constraints based on transformer model, so as to minimize the overall solution time, effectively alleviate the problem of excessive solution time for constraint solving, and improve the efficiency and availability of symbolic execution.