Skip to content
GitLab
Explore
Sign in
Primary navigation
Search or go to…
Project
B
BVExprSimplifier
Manage
Activity
Members
Labels
Plan
Issues
Issue boards
Milestones
Wiki
Requirements
Code
Merge requests
Repository
Branches
Commits
Tags
Repository graph
Compare revisions
Snippets
Locked files
Build
Pipelines
Jobs
Pipeline schedules
Test cases
Artifacts
Deploy
Releases
Container Registry
Model registry
Operate
Environments
Monitor
Incidents
Analyze
Value stream analytics
Contributor analytics
CI/CD analytics
Repository analytics
Code review analytics
Issue analytics
Insights
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
Martin Jonáš
BVExprSimplifier
Commits
491dc670
There was an error fetching the commit references. Please try again later.
Commit
491dc670
authored
8 years ago
by
Martin Jonas
Browse files
Options
Downloads
Patches
Plain Diff
Local counting & early break
parent
0ba80e38
No related branches found
No related tags found
No related merge requests found
Changes
3
Show whitespace changes
Inline
Side-by-side
Showing
3 changed files
UnconstrainedVariableSimplifier.cpp
+49
-8
49 additions, 8 deletions
UnconstrainedVariableSimplifier.cpp
UnconstrainedVariableSimplifier.h
+10
-3
10 additions, 3 deletions
UnconstrainedVariableSimplifier.h
main.cpp
+7
-2
7 additions, 2 deletions
main.cpp
with
66 additions
and
13 deletions
UnconstrainedVariableSimplifier.cpp
+
49
−
8
View file @
491dc670
...
@@ -4,11 +4,11 @@
...
@@ -4,11 +4,11 @@
using
namespace
std
;
using
namespace
std
;
using
namespace
z3
;
using
namespace
z3
;
pair
<
map
<
string
,
int
>
,
int
>
UnconstrainedVariableSimplifier
::
countVariableOccurences
(
z3
::
expr
e
,
vector
<
BoundVar
>
boundVars
)
pair
<
map
<
string
,
int
>
,
int
>
UnconstrainedVariableSimplifier
::
countVariableOccurences
(
z3
::
expr
e
,
vector
<
BoundVar
>
boundVars
,
bool
isPositive
=
true
)
{
{
map
<
string
,
int
>
varCounts
;
map
<
string
,
int
>
varCounts
;
auto
item
=
subformulaVariableCounts
.
find
((
Z3_ast
)
e
);
auto
item
=
subformulaVariableCounts
.
find
(
{
(
Z3_ast
)
e
,
isPositive
}
);
if
(
item
!=
subformulaVariableCounts
.
end
()
&&
(
subformulaMaxDeBruijnIndices
[(
Z3_ast
)
e
]
==
-
1
||
(
item
->
second
).
second
==
boundVars
))
if
(
item
!=
subformulaVariableCounts
.
end
()
&&
(
subformulaMaxDeBruijnIndices
[(
Z3_ast
)
e
]
==
-
1
||
(
item
->
second
).
second
==
boundVars
))
{
{
//probably can be return {varCounts, subformulaMaxDeBruijnIndices[(Z3_ast)e]};
//probably can be return {varCounts, subformulaMaxDeBruijnIndices[(Z3_ast)e]};
...
@@ -57,6 +57,13 @@ pair<map<string, int>, int> UnconstrainedVariableSimplifier::countVariableOccure
...
@@ -57,6 +57,13 @@ pair<map<string, int>, int> UnconstrainedVariableSimplifier::countVariableOccure
if
(
num
!=
0
)
if
(
num
!=
0
)
{
{
auto
decl_kind
=
e
.
decl
().
decl_kind
();
if
(
decl_kind
==
Z3_OP_NOT
)
{
return
countVariableOccurences
(
e
.
arg
(
0
),
boundVars
,
!
isPositive
);
}
for
(
unsigned
i
=
0
;
i
<
num
;
i
++
)
for
(
unsigned
i
=
0
;
i
<
num
;
i
++
)
{
{
auto
currentVarCounts
=
countVariableOccurences
(
e
.
arg
(
i
),
boundVars
);
auto
currentVarCounts
=
countVariableOccurences
(
e
.
arg
(
i
),
boundVars
);
...
@@ -69,6 +76,26 @@ pair<map<string, int>, int> UnconstrainedVariableSimplifier::countVariableOccure
...
@@ -69,6 +76,26 @@ pair<map<string, int>, int> UnconstrainedVariableSimplifier::countVariableOccure
varCounts
[
item
.
first
]
=
item
.
second
;
varCounts
[
item
.
first
]
=
item
.
second
;
}
}
else
else
{
BoundType
boundType
;
for
(
auto
&
boundVar
:
boundVars
)
{
if
(
std
::
get
<
0
>
(
boundVar
)
==
item
.
first
)
{
boundType
=
std
::
get
<
1
>
(
boundVar
);
break
;
}
}
if
(
countVariablesLocally
&&
((
boundType
==
EXISTENTIAL
&&
decl_kind
==
Z3_OP_OR
&&
isPositive
)
||
(
boundType
==
EXISTENTIAL
&&
decl_kind
==
Z3_OP_AND
&&
!
isPositive
)
||
(
boundType
==
UNIVERSAL
&&
decl_kind
==
Z3_OP_AND
&&
isPositive
)
||
(
boundType
==
UNIVERSAL
&&
decl_kind
==
Z3_OP_OR
&&
!
isPositive
)))
{
varCounts
[
item
.
first
]
=
max
(
singleVarCount
->
second
,
item
.
second
);
}
else
{
{
if
(
singleVarCount
->
second
+
item
.
second
>
1
)
if
(
singleVarCount
->
second
+
item
.
second
>
1
)
{
{
...
@@ -80,6 +107,7 @@ pair<map<string, int>, int> UnconstrainedVariableSimplifier::countVariableOccure
...
@@ -80,6 +107,7 @@ pair<map<string, int>, int> UnconstrainedVariableSimplifier::countVariableOccure
}
}
}
}
}
}
}
if
(
currentVarCounts
.
second
>
maxDeBruijnIndex
)
if
(
currentVarCounts
.
second
>
maxDeBruijnIndex
)
{
{
...
@@ -105,7 +133,6 @@ pair<map<string, int>, int> UnconstrainedVariableSimplifier::countVariableOccure
...
@@ -105,7 +133,6 @@ pair<map<string, int>, int> UnconstrainedVariableSimplifier::countVariableOccure
}
}
}
}
subformulaVariableCounts
.
insert
({(
Z3_ast
)
e
,
{
varCounts
,
boundVars
}});
subformulaMaxDeBruijnIndices
.
insert
({(
Z3_ast
)
e
,
maxDeBruijnIndex
});
subformulaMaxDeBruijnIndices
.
insert
({(
Z3_ast
)
e
,
maxDeBruijnIndex
});
return
{
varCounts
,
maxDeBruijnIndex
};
return
{
varCounts
,
maxDeBruijnIndex
};
}
}
...
@@ -115,7 +142,7 @@ pair<map<string, int>, int> UnconstrainedVariableSimplifier::countVariableOccure
...
@@ -115,7 +142,7 @@ pair<map<string, int>, int> UnconstrainedVariableSimplifier::countVariableOccure
int
numBound
=
Z3_get_quantifier_num_bound
(
*
context
,
ast
);
int
numBound
=
Z3_get_quantifier_num_bound
(
*
context
,
ast
);
BoundType
boundType
;
BoundType
boundType
;
if
(
true
)
//
isPositive
if
(
isPositive
)
{
{
boundType
=
Z3_is_quantifier_forall
(
*
context
,
ast
)
?
UNIVERSAL
:
EXISTENTIAL
;
boundType
=
Z3_is_quantifier_forall
(
*
context
,
ast
)
?
UNIVERSAL
:
EXISTENTIAL
;
}
}
...
@@ -149,7 +176,7 @@ pair<map<string, int>, int> UnconstrainedVariableSimplifier::countVariableOccure
...
@@ -149,7 +176,7 @@ pair<map<string, int>, int> UnconstrainedVariableSimplifier::countVariableOccure
}
}
auto
result
=
countVariableOccurences
(
e
.
body
(),
boundVars
);
auto
result
=
countVariableOccurences
(
e
.
body
(),
boundVars
);
subformulaVariableCounts
.
insert
({(
Z3_ast
)
e
,
{
result
.
first
,
boundVars
}});
subformulaVariableCounts
.
insert
({
{
(
Z3_ast
)
e
,
isPositive
},
{
result
.
first
,
boundVars
}});
subformulaMaxDeBruijnIndices
.
insert
({(
Z3_ast
)
e
,
result
.
second
});
subformulaMaxDeBruijnIndices
.
insert
({(
Z3_ast
)
e
,
result
.
second
});
return
result
;
return
result
;
}
}
...
@@ -160,6 +187,20 @@ pair<map<string, int>, int> UnconstrainedVariableSimplifier::countVariableOccure
...
@@ -160,6 +187,20 @@ pair<map<string, int>, int> UnconstrainedVariableSimplifier::countVariableOccure
void
UnconstrainedVariableSimplifier
::
SimplifyIte
()
void
UnconstrainedVariableSimplifier
::
SimplifyIte
()
{
{
bool
anyUnconstrained
=
false
;
for
(
auto
&
var
:
variableCounts
)
{
if
(
var
.
second
==
1
)
{
anyUnconstrained
=
true
;
}
}
if
(
!
anyUnconstrained
)
{
return
;
}
unsigned
oldHash
=
0
;
unsigned
oldHash
=
0
;
//expression = expression.simplify();
//expression = expression.simplify();
...
...
This diff is collapsed.
Click to expand it.
UnconstrainedVariableSimplifier.h
+
10
−
3
View file @
491dc670
...
@@ -17,7 +17,7 @@ public:
...
@@ -17,7 +17,7 @@ public:
this
->
context
=
&
ctx
;
this
->
context
=
&
ctx
;
std
::
vector
<
BoundVar
>
boundVars
;
std
::
vector
<
BoundVar
>
boundVars
;
variableCounts
=
countVariableOccurences
(
expression
,
boundVars
).
first
;
variableCounts
=
countVariableOccurences
(
expression
,
boundVars
,
true
).
first
;
}
}
void
PrintUnconstrained
()
void
PrintUnconstrained
()
...
@@ -47,13 +47,18 @@ public:
...
@@ -47,13 +47,18 @@ public:
void
SimplifyIte
();
void
SimplifyIte
();
z3
::
expr
CanonizeBoundVariables
(
const
z3
::
expr
&
);
z3
::
expr
CanonizeBoundVariables
(
const
z3
::
expr
&
);
void
SetCountVariablesLocally
(
bool
countVariablesLocally
)
{
this
->
countVariablesLocally
=
countVariablesLocally
;
}
private
:
private
:
z3
::
context
*
context
;
z3
::
context
*
context
;
z3
::
expr
expression
;
z3
::
expr
expression
;
typedef
std
::
tuple
<
std
::
string
,
BoundType
,
int
>
BoundVar
;
typedef
std
::
tuple
<
std
::
string
,
BoundType
,
int
>
BoundVar
;
std
::
map
<
const
Z3_ast
,
std
::
pair
<
std
::
map
<
std
::
string
,
int
>
,
std
::
vector
<
BoundVar
>>>
subformulaVariableCounts
;
std
::
map
<
std
::
pair
<
const
Z3_ast
,
bool
>
,
std
::
pair
<
std
::
map
<
std
::
string
,
int
>
,
std
::
vector
<
BoundVar
>>>
subformulaVariableCounts
;
std
::
map
<
const
Z3_ast
,
int
>
subformulaMaxDeBruijnIndices
;
std
::
map
<
const
Z3_ast
,
int
>
subformulaMaxDeBruijnIndices
;
std
::
map
<
std
::
string
,
int
>
variableCounts
;
std
::
map
<
std
::
string
,
int
>
variableCounts
;
...
@@ -62,7 +67,7 @@ private:
...
@@ -62,7 +67,7 @@ private:
cacheMapType
trueSimplificationCache
;
cacheMapType
trueSimplificationCache
;
cacheMapType
falseSimplificationCache
;
cacheMapType
falseSimplificationCache
;
std
::
pair
<
std
::
map
<
std
::
string
,
int
>
,
int
>
countVariableOccurences
(
z3
::
expr
,
std
::
vector
<
BoundVar
>
);
std
::
pair
<
std
::
map
<
std
::
string
,
int
>
,
int
>
countVariableOccurences
(
z3
::
expr
,
std
::
vector
<
BoundVar
>
,
bool
);
z3
::
expr
simplifyOnce
(
z3
::
expr
,
std
::
vector
<
BoundVar
>
,
bool
);
z3
::
expr
simplifyOnce
(
z3
::
expr
,
std
::
vector
<
BoundVar
>
,
bool
);
bool
isUnconstrained
(
z3
::
expr
,
const
std
::
vector
<
BoundVar
>&
);
bool
isUnconstrained
(
z3
::
expr
,
const
std
::
vector
<
BoundVar
>&
);
...
@@ -72,6 +77,8 @@ private:
...
@@ -72,6 +77,8 @@ private:
int
getNumberOfLeadingZeroes
(
const
z3
::
expr
&
);
int
getNumberOfLeadingZeroes
(
const
z3
::
expr
&
);
int
lastBound
=
0
;
int
lastBound
=
0
;
bool
countVariablesLocally
=
false
;
};
};
#endif // UNCONSTRAINEDVARIABLESIMPLIFIER_H
#endif // UNCONSTRAINEDVARIABLESIMPLIFIER_H
This diff is collapsed.
Click to expand it.
main.cpp
+
7
−
2
View file @
491dc670
...
@@ -20,24 +20,28 @@ int main(int argc, char* argv[])
...
@@ -20,24 +20,28 @@ int main(int argc, char* argv[])
{
{
static
struct
option
long_options
[]
=
{
static
struct
option
long_options
[]
=
{
{
"propagate-unconstrained"
,
no_argument
,
0
,
'p'
},
{
"propagate-unconstrained"
,
no_argument
,
0
,
'p'
},
{
"count-locally"
,
no_argument
,
0
,
'l'
},
{
"canonize"
,
no_argument
,
0
,
'c'
},
{
"canonize"
,
no_argument
,
0
,
'c'
},
{
"run-z3"
,
no_argument
,
0
,
'z'
},
{
"run-z3"
,
no_argument
,
0
,
'z'
},
{
0
,
0
,
0
,
0
}
{
0
,
0
,
0
,
0
}
};
};
bool
propagateUnconstrainedFlag
=
false
,
runZ3
=
false
,
canonize
=
false
;
bool
propagateUnconstrainedFlag
=
false
,
runZ3
=
false
,
canonize
=
false
,
countVariablesLocally
=
false
;
char
*
filename
;
char
*
filename
;
int
opt
=
0
;
int
opt
=
0
;
int
long_index
=
0
;
int
long_index
=
0
;
while
((
opt
=
getopt_long
(
argc
,
argv
,
"pzc"
,
long_options
,
&
long_index
))
!=
-
1
)
while
((
opt
=
getopt_long
(
argc
,
argv
,
"p
l
zc"
,
long_options
,
&
long_index
))
!=
-
1
)
{
{
switch
(
opt
)
switch
(
opt
)
{
{
case
'p'
:
case
'p'
:
propagateUnconstrainedFlag
=
true
;
propagateUnconstrainedFlag
=
true
;
break
;
break
;
case
'l'
:
countVariablesLocally
=
true
;
break
;
case
'z'
:
case
'z'
:
runZ3
=
true
;
runZ3
=
true
;
break
;
break
;
...
@@ -75,6 +79,7 @@ int main(int argc, char* argv[])
...
@@ -75,6 +79,7 @@ int main(int argc, char* argv[])
if
(
propagateUnconstrainedFlag
)
if
(
propagateUnconstrainedFlag
)
{
{
UnconstrainedVariableSimplifier
simplifier
(
ctx
,
e
);
UnconstrainedVariableSimplifier
simplifier
(
ctx
,
e
);
simplifier
.
SetCountVariablesLocally
(
countVariablesLocally
);
//simplifier.PrintUnconstrained();
//simplifier.PrintUnconstrained();
simplifier
.
SimplifyIte
();
simplifier
.
SimplifyIte
();
e
=
simplifier
.
GetExpr
();
e
=
simplifier
.
GetExpr
();
...
...
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