Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
F
frama-c
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Deploy
Releases
Container Registry
Model registry
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
Repository analytics
Model experiments
Help
Help
Support
GitLab documentation
Compare GitLab plans
Community forum
Contribute to GitLab
Provide feedback
Keyboard shortcuts
?
Snippets
Groups
Projects
Show more breadcrumbs
pub
frama-c
Commits
d69deaaa
Commit
d69deaaa
authored
6 years ago
by
Fonenantsoa Maurica
Committed by
Fonenantsoa Maurica
6 years ago
Browse files
Options
Downloads
Patches
Plain Diff
Julien's review no.2: useless singleton test
parent
83ef442a
No related branches found
No related tags found
No related merge requests found
Changes
1
Hide whitespace changes
Inline
Side-by-side
Showing
1 changed file
src/plugins/e-acsl/quantif.ml
+5
-5
5 additions, 5 deletions
src/plugins/e-acsl/quantif.ml
with
5 additions
and
5 deletions
src/plugins/e-acsl/quantif.ml
+
5
−
5
View file @
d69deaaa
...
@@ -115,10 +115,10 @@ let rec has_empty_quantif_with_false_negative = function
...
@@ -115,10 +115,10 @@ let rec has_empty_quantif_with_false_negative = function
|
(
t1
,
rel1
,
_
,
rel2
,
t2
)
::
guards
->
|
(
t1
,
rel1
,
_
,
rel2
,
t2
)
::
guards
->
let
i1
=
Interval
.
infer
t1
in
let
i1
=
Interval
.
infer
t1
in
let
i2
=
Interval
.
infer
t2
in
let
i2
=
Interval
.
infer
t2
in
if
Ival
.
is_singleton_int
i1
&&
Ival
.
is_singleton_int
i2
the
n
let
lower_bound
,
_
=
Ival
.
min_and_max
i1
i
n
(* we know the precise values of the bounds *)
let
_
,
upper_bound
=
Ival
.
min_and_max
i2
in
let
lower_bound
,
_
=
Misc
.
finite_min_and_max
i1
in
match
lower_bound
,
upper_bound
with
let
upper_bound
,
_
=
Misc
.
finite_min_and_max
i2
in
|
Some
lower_bound
,
Some
upper_bound
->
let
res
=
match
rel1
,
rel2
with
let
res
=
match
rel1
,
rel2
with
|
Rle
,
Rle
->
lower_bound
>
upper_bound
|
Rle
,
Rle
->
lower_bound
>
upper_bound
|
Rle
,
Rlt
|
Rlt
,
Rle
->
lower_bound
>=
upper_bound
|
Rle
,
Rlt
|
Rlt
,
Rle
->
lower_bound
>=
upper_bound
...
@@ -126,7 +126,7 @@ let rec has_empty_quantif_with_false_negative = function
...
@@ -126,7 +126,7 @@ let rec has_empty_quantif_with_false_negative = function
|
_
->
assert
false
|
_
->
assert
false
in
in
res
(* case 1 *)
||
has_empty_quantif_with_false_negative
guards
res
(* case 1 *)
||
has_empty_quantif_with_false_negative
guards
else
|
None
,
_
|
_
,
None
->
has_empty_quantif_with_false_negative
guards
has_empty_quantif_with_false_negative
guards
let
()
=
Typing
.
compute_quantif_guards_ref
:=
compute_quantif_guards
let
()
=
Typing
.
compute_quantif_guards_ref
:=
compute_quantif_guards
...
...
This diff is collapsed.
Click to expand it.
Preview
0%
Loading
Try again
or
attach a new file
.
Cancel
You are about to add
0
people
to the discussion. Proceed with caution.
Finish editing this message first!
Save comment
Cancel
Please
register
or
sign in
to comment