1 files changed, 2 insertions, 2 deletions
diff --git a/Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/patterns/RelationDeclarationIndexer.xtend b/Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/patterns/RelationDeclarationIndexer.xtend
index f384cd50..cef707c5 100644
--- a/Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/patterns/RelationDeclarationIndexer.xtend
+++ b/Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/patterns/RelationDeclarationIndexer.xtend
@@ -90,13 +90,13 @@ class RelationDeclarationIndexer {
                                // There are "numberOfExistingReferences" currently existing instances of the reference from the source,
                                // the upper bound of the multiplicity should be considered.
                                numberOfExistingReferences == count «referRelation(relation,"source","_",Modality.MUST)»
-                                check(numberOfExistingReferences < «upperMultiplicities.get(relation)»);
+                                numberOfExistingReferences != «upperMultiplicities.get(relation)»;
                        «ENDIF»
                        «IF inverseRelations.containsKey(relation) && upperMultiplicities.containsKey(inverseRelations.get(relation))»
                                // There are "numberOfExistingReferences" currently existing instances of the reference to the target,
                                // the upper bound of the opposite reference multiplicity should be considered.
                                numberOfExistingOppositeReferences == count «base.referRelation(inverseRelations.get(relation),"target","_",Modality.MUST,fqn2PQuery)»
-                                check(numberOfExistingOppositeReferences < «upperMultiplicities.get(inverseRelations.get(relation))»);
+                                numberOfExistingOppositeReferences != «upperMultiplicities.get(inverseRelations.get(relation))»;
                        «ENDIF»
                        «IF containments.contains(relation)»
                                // The reference is containment, then a new reference cannot be create if:

diff --git a/Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/patterns/RelationDeclarationIndexer.xtend b/Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/patterns/RelationDeclarationIndexer.xtend index f384cd50..cef707c5 100644 --- a/Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/patterns/RelationDeclarationIndexer.xtend +++ b/Solvers/VIATRA-Solver/hu.bme.mit.inf.dslreasoner.viatrasolver.logic2viatra/src/hu/bme/mit/inf/dslreasoner/viatrasolver/logic2viatra/patterns/RelationDeclarationIndexer.xtend
@@ -90,13 +90,13 @@ class RelationDeclarationIndexer {
90	// There are "numberOfExistingReferences" currently existing instances of the reference from the source,	90	// There are "numberOfExistingReferences" currently existing instances of the reference from the source,
91	// the upper bound of the multiplicity should be considered.	91	// the upper bound of the multiplicity should be considered.
92	numberOfExistingReferences == count «referRelation(relation,"source","_",Modality.MUST)»	92	numberOfExistingReferences == count «referRelation(relation,"source","_",Modality.MUST)»
93	check(numberOfExistingReferences < «upperMultiplicities.get(relation)»);	93	numberOfExistingReferences != «upperMultiplicities.get(relation)»;
94	«ENDIF»	94	«ENDIF»
95	«IF inverseRelations.containsKey(relation) && upperMultiplicities.containsKey(inverseRelations.get(relation))»	95	«IF inverseRelations.containsKey(relation) && upperMultiplicities.containsKey(inverseRelations.get(relation))»
96	// There are "numberOfExistingReferences" currently existing instances of the reference to the target,	96	// There are "numberOfExistingReferences" currently existing instances of the reference to the target,
97	// the upper bound of the opposite reference multiplicity should be considered.	97	// the upper bound of the opposite reference multiplicity should be considered.
98	numberOfExistingOppositeReferences == count «base.referRelation(inverseRelations.get(relation),"target","_",Modality.MUST,fqn2PQuery)»	98	numberOfExistingOppositeReferences == count «base.referRelation(inverseRelations.get(relation),"target","_",Modality.MUST,fqn2PQuery)»
99	check(numberOfExistingOppositeReferences < «upperMultiplicities.get(inverseRelations.get(relation))»);	99	numberOfExistingOppositeReferences != «upperMultiplicities.get(inverseRelations.get(relation))»;
100	«ENDIF»	100	«ENDIF»
101	«IF containments.contains(relation)»	101	«IF containments.contains(relation)»
102	// The reference is containment, then a new reference cannot be create if:	102	// The reference is containment, then a new reference cannot be create if: