Proving unreachability using bounded model checking

Trace based reachability verification for statecharts

“…For the first two states, the paths that we obtained turned out to be an extension of the corresponding candidate traces. This could not be obtained by [3], [2] as they could not scale to these states due to the number of states in the model. For states 3 and 4, the paths produced were spurious.…”

“…We have implemented our abstraction technique as a part of our Statemate analysis tool [3], [2]. For our experiments, we used a Statemate model of an ECU that controls the back door functionality of a car.…”

“…The model has 108 concurrent statecharts with a total of 407 basic states. The techniques in [3], [2] showed reachability of 367 basic states by producing traces (counterexamples) but failed to scale to the remaining 40 states. For our experimentation, we randomly chose 4 states out of these 40 and used the traces produced for the 367 states to construct the abstract models.…”

“…Industry models typically have a large number of concurrent components causing the state-space to grow exponentially. Due to this state explosion problem, model checkers often do not scale to real world models [2]. In this paper, we present what we believe to be the first trace-based verification technique aimed at containing the state explosion problem for Statemate statecharts.…”