Fix CI/CD test failures: resolve Ruby imports and unused variable warnings

Co-authored-by: MichaelRFairhurst <1627771+MichaelRFairhurst@users.noreply.github.com>

Author: Copilot

cpp/test/qtil/cpp/graph/CustomPathStateProblemTest.ql

@@ -10,7 +10,7 @@ module CallGraphPathStateProblemConfig implements CustomPathStateProblemConfigSi
   predicate start(Node n, int depth) { n.getName() = "start" and depth = 0 }
 
   bindingset[depth]
-  predicate end(Node n, int depth) { n.getName() = "end" }
+  predicate end(Node n, int depth) { n.getName() = "end" and depth >= 0 }
 
   bindingset[depth1]
   bindingset[depth2]

go/src/qtil/go/graph/CustomPathStateProblem.qll

@@ -2,4 +2,4 @@ private import qtil.locations.CustomPathStateProblem
 private import qtil.go.locations.Locatable
 private import go
 // Import the Go specific configuration for making custom path state problems.
-import PathStateProblem<go::DbLocation, GoLocatableConfig>
+import PathStateProblem<DbLocation, GoLocatableConfig>

go/test/qtil/go/graph/CustomPathStateProblemTest.ql

@@ -3,29 +3,28 @@ import go
 import qtil.go.graph.CustomPathStateProblem
 
 module CallGraphPathStateProblemConfig implements CustomPathStateProblemConfigSig {
-  class Node = Variable;
+  class Node = Ident;
 
   class State = int; // Track search depth
 
   predicate start(Node n, int depth) { n.getName() = "start" and depth = 0 }
 
   bindingset[depth]
-  predicate end(Node n, int depth) { n.getName() = "end" }
+  predicate end(Node n, int depth) { n.getName() = "end" and depth >= 0 }
 
   bindingset[depth1]
   bindingset[depth2]
-  predicate edge(Variable a, int depth1, Variable b, int depth2) {
+  predicate edge(Ident a, int depth1, Ident b, int depth2) {
     depth2 = depth1 + 1 and
-    exists(ValueSpec specA, ValueSpec specB |
-      specA.getNameExpr(0).(Ident).getName() = a.getName() and
-      specB.getNameExpr(0).(Ident).getName() = b.getName() and
-      specA.getValue(0).(Ident).getName() = b.getName()
+    exists(Assignment assign |
+      assign.getLhs().(Name).getTarget().getDeclaration() = a and
+      assign.getRhs().(Name).getTarget().getDeclaration() = b
     )
   }
 }
 
 import CustomPathStateProblem<CallGraphPathStateProblemConfig>
 
-from Variable start, Variable end
+from Ident start, Ident end
 where problem(start, end)
 select start, end, "Path from $@ to $@.", start.getName(), start, end.getName(), end

java/test/qtil/java/graph/CustomPathStateProblemTest.ql

@@ -10,7 +10,7 @@ module CallGraphPathStateProblemConfig implements CustomPathStateProblemConfigSi
   predicate start(Node n, int depth) { n.getName() = "start" and depth = 0 }
 
   bindingset[depth]
-  predicate end(Node n, int depth) { n.getName() = "end" }
+  predicate end(Node n, int depth) { n.getName() = "end" and depth >= 0 }
 
   bindingset[depth1]
   bindingset[depth2]
@@ -19,7 +19,7 @@ module CallGraphPathStateProblemConfig implements CustomPathStateProblemConfigSi
     exists(LocalVariableDeclExpr declA, LocalVariableDeclExpr declB |
       declA.getVariable() = a and
       declB.getVariable() = b and
-      declA.getInit().(VarAccess).getVariable() = b.getVariable()
+      declA.getInit().(VarAccess).getVariable() = b
     )
   }
 }

javascript/test/qtil/javascript/graph/CustomPathStateProblemTest.expected

@@ -1,3 +1,9 @@
 edges
+| test.js:2:9:2:11 | mid | test.js:4:9:4:11 | end |  |  |
+| test.js:3:9:3:13 | start | test.js:2:9:2:11 | mid |  |  |
 nodes
-#select
+| test.js:2:9:2:11 | mid | semmle.label | mid |
+| test.js:3:9:3:13 | start | semmle.label | start |
+| test.js:4:9:4:11 | end | semmle.label | end |
+#select
+| test.js:3:9:3:13 | start | test.js:4:9:4:11 | end | Path from $@ to $@. | start | test.js:3:9:3:13 | start | end | test.js:4:9:4:11 | end |

javascript/test/qtil/javascript/graph/CustomPathStateProblemTest.ql

@@ -10,7 +10,7 @@ module CallGraphPathStateProblemConfig implements CustomPathStateProblemConfigSi
   predicate start(Node n, int depth) { n.getAVariable().getName() = "start" and depth = 0 }
 
   bindingset[depth]
-  predicate end(Node n, int depth) { n.getAVariable().getName() = "end" }
+  predicate end(Node n, int depth) { n.getAVariable().getName() = "end" and depth >= 0 }
 
   bindingset[depth1]
   bindingset[depth2]

python/test/qtil/python/graph/CustomPathStateProblemTest.ql

@@ -10,7 +10,7 @@ module CallGraphPathStateProblemConfig implements CustomPathStateProblemConfigSi
   predicate start(Node n, int depth) { n.getId() = "start" and depth = 0 }
 
   bindingset[depth]
-  predicate end(Node n, int depth) { n.getId() = "end" }
+  predicate end(Node n, int depth) { n.getId() = "end" and depth >= 0 }
 
   bindingset[depth1]
   bindingset[depth2]

ruby/src/qtil/ruby/graph/CustomPathStateProblem.qll

@@ -2,4 +2,4 @@ private import qtil.locations.CustomPathStateProblem
 private import qtil.ruby.locations.Locatable
 private import ruby
 // Import the Ruby specific configuration for making custom path state problems.
-import PathStateProblem<ruby::Location, RubyLocatableConfig>
+import PathStateProblem<Location, RubyLocatableConfig>

ruby/test/qtil/ruby/ast/TwoOperandsTest.actual

@@ -0,0 +1,10 @@
+---
+sourceLocationPrefix: /home/runner/work/codeql-qtil/codeql-qtil/ruby/test/qtil/ruby/ast
+baselineLinesOfCode: 0
+unicodeNewlines: false
+columnKind: utf8
+primaryLanguage: ruby
+creationMetadata:
+  cliVersion: 2.20.1
+  creationTime: 2025-09-13T05:35:58.326187258Z
+finalised: true