         any-new? (some identity (doall (map #(add-new-vv-edge! var dst-val %) edges)))]
 ;    (when any-new? (println "adding edges" edges "for" src-val "-->" dst-val))
 ;    (gv/graphviz-el edges)
-    (when-not (or (seq edges) (= src-val dst-val))
-      (println "Warning: trying to induce impossible path from" src-val "to" dst-val))
+;    (when-not (or (seq edges) (= src-val dst-val))
+;      (println "Warning: trying to induce impossible path from" src-val "to" dst-val))
 ;    (util/assert-is (or (seq edges) (= src-val dst-val)) "%s" [src-val dst-val])
     (reset! src?-atom true)
     (when any-new? 


;; TODO: check cyclic behavior of vv-hla, make sure it's OK.
 ; (may fail to do all deductions for new init-sets.)

;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;; Utilities ;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;;


              *hla-cache*     (HashMap.)
              *forward-reachability-cache* (HashMap.)
              *backward-reachability-cache* (HashMap.)
              *good-edge-cache* (HashMap.)
              ]
;      (println "VVS"  *var-val-sets*)
      (let [goal-action (util/safe-singleton (get-in *extended-dtgs* [sas/goal-var-name sas/goal-false-val sas/goal-true-val]))
