Failed tests bash -c "./test 6 2" etc.

[github-actions]

This issue is generated by Vulcan for commit: e8ed22b

Coverage: 82.05 percent

Click here for a list of target sources

src/BranchChecker_avl.c

There is(are) 5/9 failed test(s)

Click here for the failed test commands

1. [FAILED] bash -c "./test 6 1"

2. [FAILED] bash -c "./test 6 2"

3. [FAILED] bash -c "./test 6 6"

4. [FAILED] bash -c "./test 6 7"

5. [FAILED] bash -c "./test 6 8"

---

Click here for FL information

Clicking on the link, you take the page with code highlighted.

• Here is most suspicious code piece.
  

  Vulcan-Demo-Basic/src/BranchChecker_avl.c

  Line 184 in e8ed22b

  node->Left->Parent = node->Parent;

  
  Recommend debugging here.
  Click below the collapsed section for more FL information.

Click here for more FL

---

Suspicious score: 0.83

Vulcan-Demo-Basic/src/BranchChecker_avl.c

Line 185 in e8ed22b

node = node->Left;

---

Suspicious score: 0.71

Vulcan-Demo-Basic/src/BranchChecker_avl.c

Line 173 in e8ed22b

node->Right = Delete(node->Right, data);

---

Suspicious score: 0.71

Vulcan-Demo-Basic/src/BranchChecker_avl.c

Line 174 in e8ed22b

node = AVLSet(node);

---

Suspicious score: 0.71

Vulcan-Demo-Basic/src/BranchChecker_avl.c

Line 182 in e8ed22b

else if (node->Left != NULL) //Original: node->Left != NULL && node->Right == NULL

---

2 patch(es) generaetd by vulcan

plausible patch diff info

---

--- __backup0	2023-01-02 01:54:40.235033445 +0000
+++ src/BranchChecker_avl.c	2023-01-02 01:54:59.515325955 +0000
@@ -179,38 +179,27 @@
         {
             node = NULL;
         }
-        else if (node->Left != NULL) //Original: node->Left != NULL && node->Right == NULL
-        {
-            node->Left->Parent = node->Parent;
-            node = node->Left;
-        }
-        else if (node->Left == NULL && node->Right != NULL)
-        {
-            node->Right->Parent = node->Parent;
-            node = node->Right;
-        }
-        else
-        {
-            Node* deleteNode = node;
-            Node* minNode = GetMinNode(node->Right, deleteNode);
-
-            minNode->Parent = node->Parent;
-
-            minNode->Left = deleteNode->Left;
-            if (deleteNode->Left != NULL)
-            {
-                deleteNode->Left->Parent = minNode;
-            }
-
-            minNode->Right = deleteNode->Right;
-            if (deleteNode->Right != NULL)
-            {
-                deleteNode->Right->Parent = minNode;
-            }
-
-            node = minNode;
-            free(deleteNode);
-        }
+        else if ((node->Left != ((void *)0)) && !(node->Right != 0)) {
+    node->Left->Parent = node->Parent;
+    node = node->Left;
+} else if (node->Left == ((void *)0) && node->Right != ((void *)0)) {
+    node->Right->Parent = node->Parent;
+    node = node->Right;
+} else {
+    Node *deleteNode = node;
+    Node *minNode = GetMinNode(node->Right, deleteNode);
+    minNode->Parent = node->Parent;
+    minNode->Left = deleteNode->Left;
+    if (deleteNode->Left != ((void *)0)) {
+        deleteNode->Left->Parent = minNode;
+    }
+    minNode->Right = deleteNode->Right;
+    if (deleteNode->Right != ((void *)0)) {
+        deleteNode->Right->Parent = minNode;
+    }
+    node = minNode;
+    free(deleteNode);
+}
     }
 
     return node;
@@ -246,4 +235,4 @@
     }
     Inorder(node, result);
     return result;
-}
\ No newline at end of file
+}

---

--- __backup0	2023-01-02 01:54:40.235033445 +0000
+++ src/BranchChecker_avl.c	2023-01-02 01:54:59.515325955 +0000
@@ -179,38 +179,27 @@
         {
             node = NULL;
         }
-        else if (node->Left != NULL) //Original: node->Left != NULL && node->Right == NULL
-        {
-            node->Left->Parent = node->Parent;
-            node = node->Left;
-        }
-        else if (node->Left == NULL && node->Right != NULL)
-        {
-            node->Right->Parent = node->Parent;
-            node = node->Right;
-        }
-        else
-        {
-            Node* deleteNode = node;
-            Node* minNode = GetMinNode(node->Right, deleteNode);
-
-            minNode->Parent = node->Parent;
-
-            minNode->Left = deleteNode->Left;
-            if (deleteNode->Left != NULL)
-            {
-                deleteNode->Left->Parent = minNode;
-            }
-
-            minNode->Right = deleteNode->Right;
-            if (deleteNode->Right != NULL)
-            {
-                deleteNode->Right->Parent = minNode;
-            }
-
-            node = minNode;
-            free(deleteNode);
-        }
+        else if ((node->Left != ((void *)0)) && !(node->Right > 0)) {
+    node->Left->Parent = node->Parent;
+    node = node->Left;
+} else if (node->Left == ((void *)0) && node->Right != ((void *)0)) {
+    node->Right->Parent = node->Parent;
+    node = node->Right;
+} else {
+    Node *deleteNode = node;
+    Node *minNode = GetMinNode(node->Right, deleteNode);
+    minNode->Parent = node->Parent;
+    minNode->Left = deleteNode->Left;
+    if (deleteNode->Left != ((void *)0)) {
+        deleteNode->Left->Parent = minNode;
+    }
+    minNode->Right = deleteNode->Right;
+    if (deleteNode->Right != ((void *)0)) {
+        deleteNode->Right->Parent = minNode;
+    }
+    node = minNode;
+    free(deleteNode);
+}
     }
 
     return node;
@@ -246,4 +235,4 @@
     }
     Inorder(node, result);
     return result;
-}
\ No newline at end of file
+}