From eef4d3b16789e19c35be38e012d45540a226eca1 Mon Sep 17 00:00:00 2001
From: OszkarSemerath <semerath@mit.bme.hu>
Date: Tue, 8 Aug 2023 20:18:12 +0200
Subject: Unused condition simplified.

---
 .../store/statecoding/stateequivalence/CombinationNodePairing.java     | 3 +--
 1 file changed, 1 insertion(+), 2 deletions(-)

diff --git a/subprojects/store/src/main/java/tools/refinery/store/statecoding/stateequivalence/CombinationNodePairing.java b/subprojects/store/src/main/java/tools/refinery/store/statecoding/stateequivalence/CombinationNodePairing.java
index 2877bd0f..decff1d5 100644
--- a/subprojects/store/src/main/java/tools/refinery/store/statecoding/stateequivalence/CombinationNodePairing.java
+++ b/subprojects/store/src/main/java/tools/refinery/store/statecoding/stateequivalence/CombinationNodePairing.java
@@ -57,8 +57,7 @@ public class CombinationNodePairing implements NodePairing {
 		for (var permutation : previousPermutations) {
 			for (int pos = 0; pos <= max; pos++) {
 				int[] newPermutation = new int[max + 1];
-				if (pos >= 0)
-					System.arraycopy(permutation, 0, newPermutation, 0, pos);
+				System.arraycopy(permutation, 0, newPermutation, 0, pos);
 				newPermutation[pos] = max;
 				if (max - (pos + 1) >= 0)
 					System.arraycopy(permutation, pos + 1, newPermutation, pos + 1 + 1, max - (pos + 1));
-- 
cgit v1.2.3-70-g09d2