|
| 1 | +package io.ksmt.utils |
| 2 | + |
| 3 | +import io.ksmt.KContext |
| 4 | +import io.ksmt.expr.KDivArithExpr |
| 5 | +import io.ksmt.expr.KExistentialQuantifier |
| 6 | +import io.ksmt.expr.KExpr |
| 7 | +import io.ksmt.expr.KFunctionApp |
| 8 | +import io.ksmt.expr.KMulArithExpr |
| 9 | +import io.ksmt.expr.KPowerArithExpr |
| 10 | +import io.ksmt.expr.KUniversalQuantifier |
| 11 | +import io.ksmt.expr.transformer.KNonRecursiveTransformer |
| 12 | +import io.ksmt.solver.KTheory |
| 13 | +import io.ksmt.solver.KTheory.Array |
| 14 | +import io.ksmt.solver.KTheory.BV |
| 15 | +import io.ksmt.solver.KTheory.FP |
| 16 | +import io.ksmt.solver.KTheory.LIA |
| 17 | +import io.ksmt.solver.KTheory.LRA |
| 18 | +import io.ksmt.solver.KTheory.NIA |
| 19 | +import io.ksmt.solver.KTheory.NRA |
| 20 | +import io.ksmt.solver.KTheory.UF |
| 21 | +import io.ksmt.sort.KArithSort |
| 22 | +import io.ksmt.sort.KArray2Sort |
| 23 | +import io.ksmt.sort.KArray3Sort |
| 24 | +import io.ksmt.sort.KArrayNSort |
| 25 | +import io.ksmt.sort.KArraySort |
| 26 | +import io.ksmt.sort.KBoolSort |
| 27 | +import io.ksmt.sort.KBvSort |
| 28 | +import io.ksmt.sort.KFpRoundingModeSort |
| 29 | +import io.ksmt.sort.KFpSort |
| 30 | +import io.ksmt.sort.KIntSort |
| 31 | +import io.ksmt.sort.KRealSort |
| 32 | +import io.ksmt.sort.KSort |
| 33 | +import io.ksmt.sort.KSortVisitor |
| 34 | +import io.ksmt.sort.KUninterpretedSort |
| 35 | + |
| 36 | +class KExprTheoryRequirement(ctx: KContext) : KNonRecursiveTransformer(ctx) { |
| 37 | + val usedTheories = hashSetOf<KTheory>() |
| 38 | + |
| 39 | + var hasQuantifiers: Boolean = false |
| 40 | + private set |
| 41 | + |
| 42 | + private val sortRequirementCollector = Sort2TheoryRequirement() |
| 43 | + |
| 44 | + override fun <T : KSort> transformExpr(expr: KExpr<T>): KExpr<T> { |
| 45 | + expr.sort.accept(sortRequirementCollector) |
| 46 | + return super.transformExpr(expr) |
| 47 | + } |
| 48 | + |
| 49 | + override fun <T : KSort> transform(expr: KFunctionApp<T>): KExpr<T> { |
| 50 | + if (expr.args.isNotEmpty()) { |
| 51 | + usedTheories += UF |
| 52 | + } |
| 53 | + return super.transform(expr) |
| 54 | + } |
| 55 | + |
| 56 | + override fun transform(expr: KExistentialQuantifier): KExpr<KBoolSort> { |
| 57 | + hasQuantifiers = true |
| 58 | + return super.transform(expr) |
| 59 | + } |
| 60 | + |
| 61 | + override fun transform(expr: KUniversalQuantifier): KExpr<KBoolSort> { |
| 62 | + hasQuantifiers = true |
| 63 | + return super.transform(expr) |
| 64 | + } |
| 65 | + |
| 66 | + override fun <T : KArithSort> transform(expr: KMulArithExpr<T>): KExpr<T> { |
| 67 | + usedTheories += if (expr.sort is KIntSort) NIA else NRA |
| 68 | + return super.transform(expr) |
| 69 | + } |
| 70 | + |
| 71 | + override fun <T : KArithSort> transform(expr: KDivArithExpr<T>): KExpr<T> { |
| 72 | + usedTheories += if (expr.sort is KIntSort) NIA else NRA |
| 73 | + return super.transform(expr) |
| 74 | + } |
| 75 | + |
| 76 | + override fun <T : KArithSort> transform(expr: KPowerArithExpr<T>): KExpr<T> { |
| 77 | + usedTheories += if (expr.sort is KIntSort) NIA else NRA |
| 78 | + return super.transform(expr) |
| 79 | + } |
| 80 | + |
| 81 | + private inner class Sort2TheoryRequirement : KSortVisitor<Unit> { |
| 82 | + override fun visit(sort: KBoolSort) { |
| 83 | + } |
| 84 | + |
| 85 | + override fun visit(sort: KIntSort) { |
| 86 | + usedTheories += LIA |
| 87 | + } |
| 88 | + |
| 89 | + override fun visit(sort: KRealSort) { |
| 90 | + usedTheories += LRA |
| 91 | + } |
| 92 | + |
| 93 | + override fun <S : KBvSort> visit(sort: S) { |
| 94 | + usedTheories += BV |
| 95 | + } |
| 96 | + |
| 97 | + override fun <S : KFpSort> visit(sort: S) { |
| 98 | + usedTheories += FP |
| 99 | + } |
| 100 | + |
| 101 | + override fun <D : KSort, R : KSort> visit(sort: KArraySort<D, R>) { |
| 102 | + usedTheories += Array |
| 103 | + sort.range.accept(this) |
| 104 | + sort.domainSorts.forEach { it.accept(this) } |
| 105 | + } |
| 106 | + |
| 107 | + override fun <D0 : KSort, D1 : KSort, R : KSort> visit(sort: KArray2Sort<D0, D1, R>) { |
| 108 | + usedTheories += Array |
| 109 | + sort.range.accept(this) |
| 110 | + sort.domainSorts.forEach { it.accept(this) } |
| 111 | + } |
| 112 | + |
| 113 | + override fun <D0 : KSort, D1 : KSort, D2 : KSort, R : KSort> visit(sort: KArray3Sort<D0, D1, D2, R>) { |
| 114 | + usedTheories += Array |
| 115 | + sort.range.accept(this) |
| 116 | + sort.domainSorts.forEach { it.accept(this) } |
| 117 | + } |
| 118 | + |
| 119 | + override fun <R : KSort> visit(sort: KArrayNSort<R>) { |
| 120 | + usedTheories += Array |
| 121 | + sort.range.accept(this) |
| 122 | + sort.domainSorts.forEach { it.accept(this) } |
| 123 | + } |
| 124 | + |
| 125 | + override fun visit(sort: KFpRoundingModeSort) { |
| 126 | + usedTheories += FP |
| 127 | + } |
| 128 | + |
| 129 | + override fun visit(sort: KUninterpretedSort) { |
| 130 | + usedTheories += UF |
| 131 | + } |
| 132 | + } |
| 133 | +} |
0 commit comments