quantifiers over logic types do not restrict to valid instances
ID0002497: This issue was created automatically from Mantis Issue 2497. Further discussion may take place here.
|Plug-in > wp
|Fixed in Version
When I quantify over an unsigned char, the resulting formula uses the is_uint8 predicate to ensure that it only considers valid uint8s. However, if I define a logic type that contains an unsigned char, there is no corresponding is_ predicate for the logic type:
//@ type logic_type_with_u8 = value(unsigned char);
This type is represented in the generated formula as an unbounded int rather than an unsigned char. This means that quantifying over the logic type includes more values than are allowed - for example,
\forall logic_type_with_u8 l has to prove that the predicate is true even for values that won't fit in a u8.
As a concrete example, I expect the following to hold, but it does not:
lemma u8_is_valid: \forall logic_type_with_u8 n; \exists unsigned char u; n == value(u);
Additional Information :
PS. I could not test on the latest version from git - how do I get (read-only) access to the git repository?
Steps To Reproduce :
Download file logic_type_is_valid.c and run with WP:
frama-c -wp logic_type_is_valid.c
The lemma in this file should hold, but does not.