./Ultimate.py --spec ../../sv-benchmarks/c/properties/unreach-call.prp --file ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version cf1a7837 Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/config/AutomizerReach.xml -i ../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 --- Real Ultimate output --- This is Ultimate 0.2.3-dev-cf1a783 [2023-11-12 02:08:23,728 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-12 02:08:23,809 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/config/svcomp-Reach-32bit-Automizer_Default.epf [2023-11-12 02:08:23,815 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-12 02:08:23,816 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-12 02:08:23,847 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-12 02:08:23,848 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-12 02:08:23,848 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-12 02:08:23,849 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-12 02:08:23,850 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-12 02:08:23,852 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-12 02:08:23,856 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-12 02:08:23,857 INFO L153 SettingsManager]: * Use SBE=true [2023-11-12 02:08:23,860 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-12 02:08:23,861 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2023-11-12 02:08:23,861 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-12 02:08:23,863 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-12 02:08:23,865 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-12 02:08:23,865 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-12 02:08:23,866 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2023-11-12 02:08:23,866 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-12 02:08:23,867 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2023-11-12 02:08:23,868 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-12 02:08:23,868 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2023-11-12 02:08:23,869 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-12 02:08:23,870 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-12 02:08:23,870 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-12 02:08:23,871 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-12 02:08:23,871 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:08:23,872 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-12 02:08:23,872 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-12 02:08:23,873 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2023-11-12 02:08:23,873 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-12 02:08:23,874 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-12 02:08:23,874 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-12 02:08:23,874 INFO L153 SettingsManager]: * Compute Hoare Annotation of negated interpolant automaton, abstraction and CFG=true [2023-11-12 02:08:23,875 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-12 02:08:23,875 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-12 02:08:23,875 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-12 02:08:23,876 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f2f6ef7968fa573a7da88ae0a516f1d800f437d82b0fa75227e8d7d318952eb1 [2023-11-12 02:08:24,221 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-12 02:08:24,257 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-12 02:08:24,260 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-12 02:08:24,261 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-12 02:08:24,262 INFO L274 PluginConnector]: CDTParser initialized [2023-11-12 02:08:24,264 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/../../sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2023-11-12 02:08:27,597 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-12 02:08:27,946 INFO L384 CDTParser]: Found 1 translation units. [2023-11-12 02:08:27,948 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i [2023-11-12 02:08:27,963 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/data/50664875b/f692c9010c794cdd9c36141880df8012/FLAG4db586a4a [2023-11-12 02:08:27,978 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/data/50664875b/f692c9010c794cdd9c36141880df8012 [2023-11-12 02:08:27,981 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-12 02:08:27,983 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-12 02:08:27,985 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-12 02:08:27,985 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-12 02:08:27,990 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-12 02:08:27,991 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:08:27" (1/1) ... [2023-11-12 02:08:27,993 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@502655a0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:08:27, skipping insertion in model container [2023-11-12 02:08:27,993 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 12.11 02:08:27" (1/1) ... [2023-11-12 02:08:28,052 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-12 02:08:28,406 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2023-11-12 02:08:28,412 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:08:28,425 INFO L202 MainTranslator]: Completed pre-run [2023-11-12 02:08:28,479 WARN L240 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/sv-benchmarks/c/list-simple/sll2c_prepend_unequal.i[24547,24560] [2023-11-12 02:08:28,480 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-12 02:08:28,519 INFO L206 MainTranslator]: Completed translation [2023-11-12 02:08:28,520 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:08:28 WrapperNode [2023-11-12 02:08:28,520 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-12 02:08:28,521 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-12 02:08:28,522 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-12 02:08:28,522 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-12 02:08:28,531 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:08:28" (1/1) ... [2023-11-12 02:08:28,555 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:08:28" (1/1) ... [2023-11-12 02:08:28,584 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 149 [2023-11-12 02:08:28,585 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-12 02:08:28,586 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-12 02:08:28,586 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-12 02:08:28,586 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-12 02:08:28,598 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:08:28" (1/1) ... [2023-11-12 02:08:28,598 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:08:28" (1/1) ... [2023-11-12 02:08:28,604 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:08:28" (1/1) ... [2023-11-12 02:08:28,604 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:08:28" (1/1) ... [2023-11-12 02:08:28,615 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:08:28" (1/1) ... [2023-11-12 02:08:28,620 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:08:28" (1/1) ... [2023-11-12 02:08:28,623 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:08:28" (1/1) ... [2023-11-12 02:08:28,625 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:08:28" (1/1) ... [2023-11-12 02:08:28,630 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-12 02:08:28,632 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-12 02:08:28,632 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-12 02:08:28,632 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-12 02:08:28,634 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:08:28" (1/1) ... [2023-11-12 02:08:28,649 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-12 02:08:28,667 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:08:28,681 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-12 02:08:28,688 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-12 02:08:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~int [2023-11-12 02:08:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~int [2023-11-12 02:08:28,723 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2023-11-12 02:08:28,724 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2023-11-12 02:08:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-12 02:08:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-12 02:08:28,724 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-12 02:08:28,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$ [2023-11-12 02:08:28,725 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$ [2023-11-12 02:08:28,725 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-12 02:08:28,725 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$ [2023-11-12 02:08:28,726 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int [2023-11-12 02:08:28,726 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-12 02:08:28,726 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-12 02:08:28,866 INFO L236 CfgBuilder]: Building ICFG [2023-11-12 02:08:28,869 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-12 02:08:29,208 INFO L277 CfgBuilder]: Performing block encoding [2023-11-12 02:08:29,224 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-12 02:08:29,225 INFO L302 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-12 02:08:29,227 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:08:29 BoogieIcfgContainer [2023-11-12 02:08:29,227 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-12 02:08:29,230 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-12 02:08:29,230 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-12 02:08:29,237 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-12 02:08:29,250 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 12.11 02:08:27" (1/3) ... [2023-11-12 02:08:29,251 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e9caaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:08:29, skipping insertion in model container [2023-11-12 02:08:29,251 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 12.11 02:08:28" (2/3) ... [2023-11-12 02:08:29,252 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@33e9caaa and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 12.11 02:08:29, skipping insertion in model container [2023-11-12 02:08:29,252 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 12.11 02:08:29" (3/3) ... [2023-11-12 02:08:29,253 INFO L112 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_unequal.i [2023-11-12 02:08:29,277 INFO L204 ceAbstractionStarter]: Automizer settings: Hoare:true NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-12 02:08:29,278 INFO L163 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2023-11-12 02:08:29,361 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-12 02:08:29,371 INFO L357 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mHoare=true, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@2fc88bed, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-12 02:08:29,373 INFO L358 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2023-11-12 02:08:29,380 INFO L276 IsEmpty]: Start isEmpty. Operand has 37 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 02:08:29,391 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-12 02:08:29,392 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:08:29,394 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:08:29,394 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:08:29,405 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:08:29,405 INFO L85 PathProgramCache]: Analyzing trace with hash -1454169709, now seen corresponding path program 1 times [2023-11-12 02:08:29,419 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:08:29,420 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1710176239] [2023-11-12 02:08:29,420 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:08:29,422 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:08:29,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:29,864 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:08:29,874 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:29,899 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:08:29,914 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:29,937 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 02:08:29,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:08:29,938 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1710176239] [2023-11-12 02:08:29,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1710176239] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:08:29,939 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:08:29,940 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-12 02:08:29,942 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [339918250] [2023-11-12 02:08:29,943 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:08:29,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-12 02:08:29,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:08:29,994 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-12 02:08:29,995 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:08:29,997 INFO L87 Difference]: Start difference. First operand has 37 states, 31 states have (on average 1.4838709677419355) internal successors, (46), 32 states have internal predecessors, (46), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 02:08:30,103 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:08:30,104 INFO L93 Difference]: Finished difference Result 67 states and 93 transitions. [2023-11-12 02:08:30,105 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-12 02:08:30,107 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-11-12 02:08:30,108 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:08:30,117 INFO L225 Difference]: With dead ends: 67 [2023-11-12 02:08:30,117 INFO L226 Difference]: Without dead ends: 29 [2023-11-12 02:08:30,121 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-12 02:08:30,126 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 0 mSDsluCounter, 21 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 67 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:08:30,128 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 67 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:08:30,151 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2023-11-12 02:08:30,179 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 29. [2023-11-12 02:08:30,182 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 29 states, 24 states have (on average 1.25) internal successors, (30), 24 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 02:08:30,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 29 states to 29 states and 36 transitions. [2023-11-12 02:08:30,187 INFO L78 Accepts]: Start accepts. Automaton has 29 states and 36 transitions. Word has length 23 [2023-11-12 02:08:30,189 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:08:30,190 INFO L495 AbstractCegarLoop]: Abstraction has 29 states and 36 transitions. [2023-11-12 02:08:30,191 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 2 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 02:08:30,191 INFO L276 IsEmpty]: Start isEmpty. Operand 29 states and 36 transitions. [2023-11-12 02:08:30,194 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-12 02:08:30,194 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:08:30,195 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:08:30,195 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-12 02:08:30,196 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:08:30,198 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:08:30,198 INFO L85 PathProgramCache]: Analyzing trace with hash 1579182041, now seen corresponding path program 1 times [2023-11-12 02:08:30,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:08:30,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1346836665] [2023-11-12 02:08:30,200 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:08:30,200 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:08:30,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:30,444 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:08:30,455 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:30,471 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 12 [2023-11-12 02:08:30,481 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:30,491 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2023-11-12 02:08:30,492 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:08:30,492 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1346836665] [2023-11-12 02:08:30,493 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1346836665] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-12 02:08:30,493 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-12 02:08:30,493 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-12 02:08:30,493 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [256951603] [2023-11-12 02:08:30,494 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-12 02:08:30,495 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-12 02:08:30,495 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:08:30,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-12 02:08:30,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:08:30,497 INFO L87 Difference]: Start difference. First operand 29 states and 36 transitions. Second operand has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 02:08:30,583 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:08:30,583 INFO L93 Difference]: Finished difference Result 54 states and 67 transitions. [2023-11-12 02:08:30,584 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-12 02:08:30,584 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 23 [2023-11-12 02:08:30,585 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:08:30,586 INFO L225 Difference]: With dead ends: 54 [2023-11-12 02:08:30,586 INFO L226 Difference]: Without dead ends: 32 [2023-11-12 02:08:30,587 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 5 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-12 02:08:30,589 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 1 mSDsluCounter, 42 mSDsCounter, 0 mSdLazyCounter, 27 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 30 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 27 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-12 02:08:30,590 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 30 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 27 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-12 02:08:30,591 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-12 02:08:30,597 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-11-12 02:08:30,598 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.24) internal successors, (31), 25 states have internal predecessors, (31), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 02:08:30,599 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 37 transitions. [2023-11-12 02:08:30,599 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 37 transitions. Word has length 23 [2023-11-12 02:08:30,600 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:08:30,600 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 37 transitions. [2023-11-12 02:08:30,600 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 3.75) internal successors, (15), 3 states have internal predecessors, (15), 2 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2023-11-12 02:08:30,601 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 37 transitions. [2023-11-12 02:08:30,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-12 02:08:30,602 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:08:30,602 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:08:30,603 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-12 02:08:30,603 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:08:30,604 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:08:30,604 INFO L85 PathProgramCache]: Analyzing trace with hash -1665445247, now seen corresponding path program 1 times [2023-11-12 02:08:30,604 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:08:30,604 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [94272200] [2023-11-12 02:08:30,605 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:08:30,605 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:08:30,673 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:31,260 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:08:31,268 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:31,281 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:08:31,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:31,405 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-12 02:08:31,416 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:31,593 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 9 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 02:08:31,593 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:08:31,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [94272200] [2023-11-12 02:08:31,595 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [94272200] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:08:31,600 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1351631263] [2023-11-12 02:08:31,601 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:08:31,602 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:08:31,603 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:08:31,607 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:08:31,635 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-12 02:08:31,849 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:31,854 INFO L262 TraceCheckSpWp]: Trace formula consists of 313 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-12 02:08:31,866 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:08:32,319 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 4 [2023-11-12 02:08:32,451 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:08:32,459 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 12 [2023-11-12 02:08:32,526 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2023-11-12 02:08:32,557 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:08:32,557 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:08:32,761 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1351631263] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:08:32,761 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 02:08:32,761 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 14] total 23 [2023-11-12 02:08:32,761 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [196078854] [2023-11-12 02:08:32,762 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 02:08:32,762 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-12 02:08:32,762 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:08:32,764 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-12 02:08:32,765 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=521, Unknown=4, NotChecked=0, Total=600 [2023-11-12 02:08:32,765 INFO L87 Difference]: Start difference. First operand 30 states and 37 transitions. Second operand has 23 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 17 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 02:08:33,463 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:08:33,463 INFO L93 Difference]: Finished difference Result 41 states and 51 transitions. [2023-11-12 02:08:33,464 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-12 02:08:33,465 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 17 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 31 [2023-11-12 02:08:33,465 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:08:33,466 INFO L225 Difference]: With dead ends: 41 [2023-11-12 02:08:33,466 INFO L226 Difference]: Without dead ends: 32 [2023-11-12 02:08:33,467 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 177 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=141, Invalid=847, Unknown=4, NotChecked=0, Total=992 [2023-11-12 02:08:33,469 INFO L413 NwaCegarLoop]: 21 mSDtfsCounter, 68 mSDsluCounter, 201 mSDsCounter, 0 mSdLazyCounter, 278 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 283 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 278 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-12 02:08:33,469 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 222 Invalid, 283 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 278 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-12 02:08:33,470 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 32 states. [2023-11-12 02:08:33,485 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 32 to 30. [2023-11-12 02:08:33,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 25 states have (on average 1.2) internal successors, (30), 25 states have internal predecessors, (30), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 02:08:33,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 36 transitions. [2023-11-12 02:08:33,489 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 36 transitions. Word has length 31 [2023-11-12 02:08:33,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:08:33,489 INFO L495 AbstractCegarLoop]: Abstraction has 30 states and 36 transitions. [2023-11-12 02:08:33,490 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 21 states have (on average 1.8571428571428572) internal successors, (39), 17 states have internal predecessors, (39), 4 states have call successors, (6), 3 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2023-11-12 02:08:33,490 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 36 transitions. [2023-11-12 02:08:33,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-12 02:08:33,492 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:08:33,493 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:08:33,510 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-12 02:08:33,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:08:33,701 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:08:33,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:08:33,702 INFO L85 PathProgramCache]: Analyzing trace with hash 1631242898, now seen corresponding path program 1 times [2023-11-12 02:08:33,702 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:08:33,702 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1106399971] [2023-11-12 02:08:33,702 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:08:33,702 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:08:33,764 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:35,152 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:08:35,159 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:35,223 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:08:35,230 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:35,378 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-12 02:08:35,387 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:35,717 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 4 proven. 9 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 02:08:35,718 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:08:35,718 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1106399971] [2023-11-12 02:08:35,720 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1106399971] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:08:35,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1923085086] [2023-11-12 02:08:35,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:08:35,721 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:08:35,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:08:35,724 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:08:35,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-12 02:08:35,963 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:35,968 INFO L262 TraceCheckSpWp]: Trace formula consists of 336 conjuncts, 85 conjunts are in the unsatisfiable core [2023-11-12 02:08:35,977 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:08:36,036 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 02:08:36,407 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-12 02:08:36,407 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-12 02:08:36,514 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 02:08:36,664 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-12 02:08:36,664 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2023-11-12 02:08:36,860 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 02:08:36,860 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 39 treesize of output 22 [2023-11-12 02:08:36,871 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 02:08:36,879 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 02:08:37,061 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:08:37,073 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-12 02:08:37,075 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 38 [2023-11-12 02:08:37,103 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-12 02:08:37,104 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 28 treesize of output 30 [2023-11-12 02:08:37,121 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:08:37,123 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 02:08:37,267 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 02:08:37,363 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 02:08:37,364 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 18 [2023-11-12 02:08:37,404 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-12 02:08:37,404 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:08:37,635 WARN L854 $PredicateComparison]: unable to prove that (forall ((|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_14| Int) (v_ArrVal_485 (Array Int Int)) (v_ArrVal_484 (Array Int Int))) (or (not (let ((.cse1 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_14| v_ArrVal_484))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (= .cse0 (select (select .cse1 .cse0) (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_14| v_ArrVal_485) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))))) (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_14| 1)) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_14|) 0)))) is different from false [2023-11-12 02:08:37,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1923085086] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:08:37,638 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 02:08:37,638 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 21] total 36 [2023-11-12 02:08:37,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [790828446] [2023-11-12 02:08:37,639 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 02:08:37,640 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-12 02:08:37,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:08:37,641 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-12 02:08:37,643 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=125, Invalid=1284, Unknown=1, NotChecked=72, Total=1482 [2023-11-12 02:08:37,643 INFO L87 Difference]: Start difference. First operand 30 states and 36 transitions. Second operand has 36 states, 32 states have (on average 1.46875) internal successors, (47), 27 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 02:08:39,691 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:08:39,691 INFO L93 Difference]: Finished difference Result 57 states and 72 transitions. [2023-11-12 02:08:39,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-12 02:08:39,692 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 32 states have (on average 1.46875) internal successors, (47), 27 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 34 [2023-11-12 02:08:39,692 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:08:39,693 INFO L225 Difference]: With dead ends: 57 [2023-11-12 02:08:39,693 INFO L226 Difference]: Without dead ends: 47 [2023-11-12 02:08:39,695 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 53 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 634 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=314, Invalid=2551, Unknown=1, NotChecked=104, Total=2970 [2023-11-12 02:08:39,696 INFO L413 NwaCegarLoop]: 20 mSDtfsCounter, 104 mSDsluCounter, 302 mSDsCounter, 0 mSdLazyCounter, 492 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 104 SdHoareTripleChecker+Valid, 322 SdHoareTripleChecker+Invalid, 509 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 492 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-12 02:08:39,697 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [104 Valid, 322 Invalid, 509 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 492 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-12 02:08:39,698 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 47 states. [2023-11-12 02:08:39,715 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 47 to 32. [2023-11-12 02:08:39,716 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 27 states have (on average 1.1851851851851851) internal successors, (32), 27 states have internal predecessors, (32), 3 states have call successors, (3), 1 states have call predecessors, (3), 1 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2023-11-12 02:08:39,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 38 transitions. [2023-11-12 02:08:39,717 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 38 transitions. Word has length 34 [2023-11-12 02:08:39,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:08:39,718 INFO L495 AbstractCegarLoop]: Abstraction has 32 states and 38 transitions. [2023-11-12 02:08:39,719 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 32 states have (on average 1.46875) internal successors, (47), 27 states have internal predecessors, (47), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 02:08:39,719 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 38 transitions. [2023-11-12 02:08:39,720 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2023-11-12 02:08:39,721 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:08:39,721 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:08:39,728 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2023-11-12 02:08:39,928 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable3 [2023-11-12 02:08:39,928 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:08:39,929 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:08:39,934 INFO L85 PathProgramCache]: Analyzing trace with hash 1471122359, now seen corresponding path program 1 times [2023-11-12 02:08:39,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:08:39,935 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1538871000] [2023-11-12 02:08:39,935 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:08:39,935 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:08:40,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:42,175 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:08:42,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:42,286 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:08:42,292 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:42,455 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-12 02:08:42,463 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:42,935 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 02:08:42,935 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:08:42,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1538871000] [2023-11-12 02:08:42,936 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1538871000] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:08:42,936 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1877446353] [2023-11-12 02:08:42,936 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:08:42,936 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:08:42,937 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:08:42,938 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:08:42,968 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-12 02:08:43,186 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:43,193 INFO L262 TraceCheckSpWp]: Trace formula consists of 349 conjuncts, 111 conjunts are in the unsatisfiable core [2023-11-12 02:08:43,204 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:08:43,217 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 02:08:43,286 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 02:08:43,438 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2023-11-12 02:08:43,441 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2023-11-12 02:08:43,477 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2023-11-12 02:08:43,480 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2023-11-12 02:08:43,541 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))) is different from false [2023-11-12 02:08:43,544 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))) is different from true [2023-11-12 02:08:43,579 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2023-11-12 02:08:43,582 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2023-11-12 02:08:43,644 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))) is different from false [2023-11-12 02:08:43,647 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|))))) is different from true [2023-11-12 02:08:43,765 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) is different from false [2023-11-12 02:08:43,770 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) is different from true [2023-11-12 02:08:43,813 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 02:08:43,860 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2023-11-12 02:08:43,865 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2023-11-12 02:08:43,992 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-12 02:08:43,992 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 35 treesize of output 34 [2023-11-12 02:08:44,038 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1)))) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2023-11-12 02:08:44,041 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1)))) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2023-11-12 02:08:44,144 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| .cse0 1)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2023-11-12 02:08:44,150 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (+ |c_#StackHeapBarrier| 1))) (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| .cse0) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse0) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| .cse0 1)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| .cse2) 0) (= (select |v_#valid_BEFORE_CALL_8| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse3 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2023-11-12 02:08:44,229 INFO L322 Elim1Store]: treesize reduction 15, result has 6.3 percent of original size [2023-11-12 02:08:44,229 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 19 [2023-11-12 02:08:44,282 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2023-11-12 02:08:44,287 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2023-11-12 02:08:44,382 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2023-11-12 02:08:44,387 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2023-11-12 02:08:44,495 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-12 02:08:44,549 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2023-11-12 02:08:44,554 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_node_create_#in~data#1| (select (select |c_#memory_int| |c_node_create_#res#1.base|) (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2023-11-12 02:08:44,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:08:44,750 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-12 02:08:44,750 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 64 treesize of output 55 [2023-11-12 02:08:44,764 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:08:44,765 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 36 [2023-11-12 02:08:44,874 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1))))))) is different from false [2023-11-12 02:08:44,884 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2))) (and (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1))))))) is different from true [2023-11-12 02:08:45,073 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse2 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2023-11-12 02:08:45,077 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse2 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2023-11-12 02:08:45,293 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse2 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)))) is different from false [2023-11-12 02:08:45,299 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse2 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)))) is different from true [2023-11-12 02:08:45,599 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse2 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2023-11-12 02:08:45,604 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| .cse2) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse4) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse2 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse4) 1))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2023-11-12 02:08:45,954 INFO L322 Elim1Store]: treesize reduction 124, result has 0.8 percent of original size [2023-11-12 02:08:45,955 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 6 new quantified variables, introduced 5 case distinctions, treesize of input 440 treesize of output 315 [2023-11-12 02:08:45,991 INFO L322 Elim1Store]: treesize reduction 62, result has 1.6 percent of original size [2023-11-12 02:08:45,992 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 275 treesize of output 234 [2023-11-12 02:08:46,033 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-12 02:08:46,040 WARN L207 Elim1Store]: Array PQE input equivalent to false [2023-11-12 02:08:46,066 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:08:46,075 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:08:46,092 INFO L322 Elim1Store]: treesize reduction 130, result has 0.8 percent of original size [2023-11-12 02:08:46,092 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 219 treesize of output 151 [2023-11-12 02:08:46,122 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:08:46,130 INFO L322 Elim1Store]: treesize reduction 46, result has 2.1 percent of original size [2023-11-12 02:08:46,130 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 107 treesize of output 109 [2023-11-12 02:08:46,175 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 163 treesize of output 43 [2023-11-12 02:08:46,196 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:08:46,207 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:08:46,323 INFO L322 Elim1Store]: treesize reduction 112, result has 14.5 percent of original size [2023-11-12 02:08:46,323 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 225 treesize of output 175 [2023-11-12 02:08:46,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:08:46,367 INFO L322 Elim1Store]: treesize reduction 53, result has 15.9 percent of original size [2023-11-12 02:08:46,367 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 4 case distinctions, treesize of input 165 treesize of output 181 [2023-11-12 02:08:46,381 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 175 treesize of output 143 [2023-11-12 02:08:46,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:08:46,399 INFO L322 Elim1Store]: treesize reduction 44, result has 2.2 percent of original size [2023-11-12 02:08:46,399 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 160 treesize of output 118 [2023-11-12 02:08:46,410 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 84 treesize of output 60 [2023-11-12 02:08:46,424 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 57 [2023-11-12 02:08:46,437 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:08:46,438 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 21 [2023-11-12 02:08:46,625 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse3 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_41 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_41) v_arrayElimCell_44))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_41 1) .cse3) 0) (= 0 (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_41))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| .cse3) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 4)))))) is different from false [2023-11-12 02:08:46,631 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse0 (+ .cse3 2))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_41 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_41) v_arrayElimCell_44))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse1) 0) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse2 (select |v_#valid_BEFORE_CALL_13| .cse2))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse1) 1) (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_41 1) .cse3) 0) (= 0 (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_41))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse4 (select |v_#valid_BEFORE_CALL_7| .cse4)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse5 (select |v_#valid_BEFORE_CALL_8| .cse5))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| .cse3) (+ (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0) 4)))))) is different from true [2023-11-12 02:08:46,712 INFO L322 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2023-11-12 02:08:46,713 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 60 [2023-11-12 02:08:46,735 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2023-11-12 02:08:46,754 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 18 not checked. [2023-11-12 02:08:46,754 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:08:46,830 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_667) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_675) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_674) (select (select (store (let ((.cse0 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_671))) (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_668) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_667 (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_667 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2023-11-12 02:08:46,890 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_667) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_675) .cse0 v_ArrVal_674) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_671))) (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse0 v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_668) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) (not (= v_ArrVal_667 (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_667 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2023-11-12 02:08:46,963 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse2))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_667) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_675) .cse0 v_ArrVal_674) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_671))) (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse0 v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_668) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) .cse0 v_ArrVal_669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (not (= v_ArrVal_667 (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select v_ArrVal_667 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) is different from false [2023-11-12 02:08:46,991 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_667 (Array Int Int)) (v_ArrVal_669 (Array Int Int)) (v_ArrVal_668 (Array Int Int)) (v_ArrVal_670 (Array Int Int)) (v_ArrVal_671 (Array Int Int)) (v_ArrVal_674 (Array Int Int)) (v_ArrVal_675 (Array Int Int))) (or (not (= v_ArrVal_667 (store (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_667 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (let ((.cse2 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse2))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_667) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_675) .cse0 v_ArrVal_674) (select (select (store (let ((.cse1 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_671))) (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) .cse0 v_ArrVal_670) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store (store (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_668) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse2)) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) .cse0 v_ArrVal_669) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) is different from false [2023-11-12 02:08:47,206 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-12 02:08:47,207 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1358 treesize of output 1362 [2023-11-12 02:08:47,265 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1306 treesize of output 1082 [2023-11-12 02:08:47,288 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1082 treesize of output 970 [2023-11-12 02:08:47,490 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 1321 treesize of output 1209 [2023-11-12 02:08:52,968 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1877446353] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:08:52,968 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 02:08:52,968 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 24] total 41 [2023-11-12 02:08:52,969 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1047205122] [2023-11-12 02:08:52,969 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 02:08:52,969 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2023-11-12 02:08:52,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:08:52,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2023-11-12 02:08:52,972 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=95, Invalid=601, Unknown=38, NotChecked=1428, Total=2162 [2023-11-12 02:08:52,973 INFO L87 Difference]: Start difference. First operand 32 states and 38 transitions. Second operand has 41 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 31 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 02:08:54,249 WARN L854 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from false [2023-11-12 02:08:54,252 WARN L876 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|)) is different from true [2023-11-12 02:08:54,257 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2023-11-12 02:08:54,260 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (exists ((|v_#valid_BEFORE_CALL_6| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |c_#valid|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_6| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0))) (<= (+ |c_#StackHeapBarrier| 1) |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2023-11-12 02:08:54,267 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_old(#length)| |c_#length|)) is different from false [2023-11-12 02:08:54,270 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_old(#length)| |c_#length|)) is different from true [2023-11-12 02:08:54,277 WARN L854 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from false [2023-11-12 02:08:54,280 WARN L876 $PredicateComparison]: unable to prove that (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse0 (select |v_#valid_BEFORE_CALL_7| .cse0)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|)) is different from true [2023-11-12 02:08:54,295 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse1 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse0 (select |c_#memory_$Pointer$.offset| .cse0))) (or .cse1 (= (select |c_old(#valid)| .cse2) 0)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 4) |c_node_create_#in~data#1|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (or (< .cse0 |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (or .cse1 (< .cse2 |c_#StackHeapBarrier|)))) is different from false [2023-11-12 02:08:54,301 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse1 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse2 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|))) (and (= |c_#valid| (store |c_old(#valid)| |c_node_create_#res#1.base| 1)) (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse0 (select |c_#memory_$Pointer$.offset| .cse0))) (or .cse1 (= (select |c_old(#valid)| .cse2) 0)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse2 (select |c_#memory_$Pointer$.base| .cse2))) (= (select (select |c_#memory_int| |c_node_create_#res#1.base|) 4) |c_node_create_#in~data#1|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= (+ |c_#StackHeapBarrier| 1) |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#valid| (let ((.cse4 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse4 (select |c_#valid| .cse4)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (or (< .cse0 |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (or .cse1 (< .cse2 |c_#StackHeapBarrier|)))) is different from true [2023-11-12 02:08:54,318 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) is different from false [2023-11-12 02:08:54,323 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1))) (and (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0) (= (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse0 (select |v_#valid_BEFORE_CALL_8| .cse0))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base| 1)))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) is different from true [2023-11-12 02:08:54,341 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from false [2023-11-12 02:08:54,345 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (.cse2 (+ |c_#StackHeapBarrier| 1))) (and (not (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| .cse0) 1) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| 1)) (= (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse1 (select |v_#valid_BEFORE_CALL_8| .cse1))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| .cse0) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse2 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse3 (select |v_#valid_BEFORE_CALL_7| .cse3)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (<= .cse2 |c_ULTIMATE.start_main_~#s~0#1.base|))) is different from true [2023-11-12 02:08:54,361 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from false [2023-11-12 02:08:54,367 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_#StackHeapBarrier| 1)) (.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (and (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base| 1)) (= (select |v_#valid_BEFORE_CALL_9| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_8| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_8| .cse0) 1))) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (not (= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|)))) is different from true [2023-11-12 02:08:54,393 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse8) (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse6 (+ |c_#StackHeapBarrier| 1))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (select .cse5 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) (select .cse4 0)))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse1) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| .cse1 1)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| .cse8) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from false [2023-11-12 02:08:54,398 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse5 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse8 (select .cse5 |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse4 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse8) (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.offset|))) (.cse6 (+ |c_#StackHeapBarrier| 1))) (and (= (select |c_#valid| .cse0) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (not (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int))) (let ((.cse1 (select .cse5 0))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| .cse1) (select .cse4 0)))) (and (= (select |v_#valid_BEFORE_CALL_8| .cse1) 0) (= |c_#valid| (store |v_#valid_BEFORE_CALL_8| .cse1 1)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_9| .cse3) 0) (= (select |v_#valid_BEFORE_CALL_8| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_9| |c_ULTIMATE.start_main_~#s~0#1.base|) 1))))) (= |c_ULTIMATE.start_main_~uneq~0#1| |c_ULTIMATE.start_sll_circular_prepend_~data#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse6 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse7 (select |v_#valid_BEFORE_CALL_7| .cse7)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| .cse8) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (<= .cse6 |c_ULTIMATE.start_main_~#s~0#1.base|))))) is different from true [2023-11-12 02:08:54,416 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_old(#length)| |c_#length|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2023-11-12 02:08:54,421 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_#valid| |c_old(#valid)|) (= |c_old(#memory_int)| |c_#memory_int|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_old(#length)| |c_#length|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2023-11-12 02:08:54,433 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2023-11-12 02:08:54,439 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_#StackHeapBarrier| 1))) (and (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|) (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse1 (select |v_#valid_BEFORE_CALL_7| .cse1)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (<= (+ |c_node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse2 (select |v_#valid_BEFORE_CALL_8| .cse2))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2023-11-12 02:08:54,543 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_#res#1.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse2 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse3 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse4 (+ |c_#StackHeapBarrier| 1))) (and (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select .cse0 (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (or .cse2 (= (select |c_old(#valid)| .cse3) 0)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse3 (select |c_#memory_$Pointer$.base| .cse3))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (= (select .cse0 4) |c_node_create_#in~data#1|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#valid| (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (or (< .cse1 |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (or .cse2 (< .cse3 |c_#StackHeapBarrier|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse4 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2023-11-12 02:08:54,551 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_node_create_#res#1.base|)) (.cse1 (@diff |c_old(#memory_$Pointer$.offset)| |c_#memory_$Pointer$.offset|)) (.cse2 (= |c_#memory_$Pointer$.base| |c_old(#memory_$Pointer$.base)|)) (.cse3 (@diff |c_old(#memory_$Pointer$.base)| |c_#memory_$Pointer$.base|)) (.cse4 (+ |c_#StackHeapBarrier| 1))) (and (= |c_node_create_#res#1.offset| 0) (= |c_node_create_#in~data#1| (select .cse0 (+ |c_node_create_#res#1.offset| 4))) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| .cse1 (select |c_#memory_$Pointer$.offset| .cse1))) (or .cse2 (= (select |c_old(#valid)| .cse3) 0)) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| .cse3 (select |c_#memory_$Pointer$.base| .cse3))) (= |c_#memory_$Pointer$.base| (store |c_old(#memory_$Pointer$.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.base| |c_node_create_#res#1.base|))) (= (select .cse0 4) |c_node_create_#in~data#1|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse4 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_#valid| (let ((.cse6 (@diff |c_old(#valid)| |c_#valid|))) (store |c_old(#valid)| .cse6 (select |c_#valid| .cse6)))) (<= (+ |c_node_create_#res#1.base| 1) |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| (store |c_old(#memory_$Pointer$.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$.offset| |c_node_create_#res#1.base|))) (or (< .cse1 |c_#StackHeapBarrier|) (= |c_#memory_$Pointer$.offset| |c_old(#memory_$Pointer$.offset)|)) (or .cse2 (< .cse3 |c_#StackHeapBarrier|)) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse4 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2023-11-12 02:08:54,614 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2)) (.cse4 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (= (select .cse0 4) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse1 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (not (= .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse5 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse7) 1))))))) is different from false [2023-11-12 02:08:54,619 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) (.cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| 2)) (.cse4 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (= (select .cse0 4) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (<= .cse1 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_main_~uneq~0#1| (select .cse0 (+ |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 4))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (<= .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (<= .cse1 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse3 (select |v_#valid_BEFORE_CALL_8| .cse3))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0))) (not (= .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (not (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse4)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse7 (select (select |c_#memory_$Pointer$.base| .cse5) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse5) 0) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse6 (select |v_#valid_BEFORE_CALL_13| .cse6))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse7) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select (store |v_#valid_BEFORE_CALL_13| .cse5 1) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_13| .cse7) 1))))))) is different from true [2023-11-12 02:08:54,688 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1))))) (not (= .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (not (= .cse6 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)))) is different from false [2023-11-12 02:08:54,693 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse6 (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1))))) (not (= .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (not (= .cse6 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)))) is different from true [2023-11-12 02:08:54,753 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse6) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse4 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1))))) (not (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)))) is different from false [2023-11-12 02:08:54,759 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (not (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse4 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse6 (select (select |c_#memory_$Pointer$.base| .cse4) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse4) 0) (= (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse5 (select |v_#valid_BEFORE_CALL_13| .cse5))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse6) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse4 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse6) 1))))) (not (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse7 (select |v_#valid_BEFORE_CALL_8| .cse7))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)))) is different from true [2023-11-12 02:08:54,837 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1))))) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from false [2023-11-12 02:08:54,843 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (.cse0 (+ 2 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse2 (select |v_#valid_BEFORE_CALL_7| .cse2)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select (select |c_#memory_$Pointer$.base| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0)) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) 0))) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (not (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (exists ((|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int))) (let ((.cse3 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|) 0))) (let ((.cse5 (select (select |c_#memory_$Pointer$.base| .cse3) (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) 0)))) (and (= (select |v_#valid_BEFORE_CALL_13| .cse3) 0) (= (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse4 (select |v_#valid_BEFORE_CALL_13| .cse4))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| .cse5) 0) (= (select (store |v_#valid_BEFORE_CALL_13| .cse3 1) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse5) 1))))) (not (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| 0) (= (select .cse1 (+ |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 4)) |c_ULTIMATE.start_main_~uneq~0#1|) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))))) is different from true [2023-11-12 02:08:54,931 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse7 0))) (let ((.cse0 (+ .cse4 2)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_41 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_41) v_arrayElimCell_44))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_41 1) .cse4) 0) (= 0 (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_41))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= (select (select |c_#memory_int| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| .cse4) (+ (select .cse1 0) 4))))))) is different from false [2023-11-12 02:08:54,937 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse7 (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_main_~#s~0#1.base|))) (let ((.cse4 (select .cse7 0))) (let ((.cse0 (+ .cse4 2)) (.cse1 (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_main_~#s~0#1.base|))) (and (<= .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) (= (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.offset|) 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (exists ((v_arrayElimCell_41 Int) (|v_#valid_BEFORE_CALL_12| (Array Int Int)) (|v_#valid_BEFORE_CALL_13| (Array Int Int)) (v_arrayElimCell_44 Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$.base| v_arrayElimCell_41) v_arrayElimCell_44))) (and (= (select |v_#valid_BEFORE_CALL_12| .cse2) 0) (= (let ((.cse3 (@diff |v_#valid_BEFORE_CALL_12| |v_#valid_BEFORE_CALL_13|))) (store |v_#valid_BEFORE_CALL_12| .cse3 (select |v_#valid_BEFORE_CALL_13| .cse3))) |v_#valid_BEFORE_CALL_13|) (= (select |v_#valid_BEFORE_CALL_12| |c_ULTIMATE.start_main_~#s~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_13| .cse2) 1) (= (select (store |v_#valid_BEFORE_CALL_13| v_arrayElimCell_41 1) .cse4) 0) (= 0 (select |v_#valid_BEFORE_CALL_13| v_arrayElimCell_41))))) (exists ((|v_#valid_BEFORE_CALL_7| (Array Int Int)) (|v_#valid_BEFORE_CALL_6| (Array Int Int)) (|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2| Int)) (and (<= .cse0 |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|) (= (select |v_#valid_BEFORE_CALL_7| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 1) (= (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_sll_circular_create_~last~0#1.base_BEFORE_CALL_2|) 0) (= |v_#valid_BEFORE_CALL_7| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_6| |v_#valid_BEFORE_CALL_7|))) (store |v_#valid_BEFORE_CALL_6| .cse5 (select |v_#valid_BEFORE_CALL_7| .cse5)))) (= 1 (select |v_#valid_BEFORE_CALL_6| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_6|)))) (exists ((|v_#valid_BEFORE_CALL_9| (Array Int Int)) (|v_#valid_BEFORE_CALL_8| (Array Int Int)) (v_arrayElimCell_24 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3| Int) (v_arrayElimCell_23 Int)) (and (= (select |v_#valid_BEFORE_CALL_9| v_arrayElimCell_23) 0) (= 1 (select |v_#valid_BEFORE_CALL_9| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|)) (= (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_9| |v_#valid_BEFORE_CALL_8|))) (store |v_#valid_BEFORE_CALL_9| .cse6 (select |v_#valid_BEFORE_CALL_8| .cse6))) |v_#valid_BEFORE_CALL_8|) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_23) 1) (= (select |v_#valid_BEFORE_CALL_8| v_arrayElimCell_24) 0) (<= .cse0 |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_3|))) (= (select (select |c_#memory_int| (select .cse7 |c_ULTIMATE.start_main_~#s~0#1.offset|)) 4) |c_ULTIMATE.start_main_~uneq~0#1|) (= |c_ULTIMATE.start_main_~uneq~0#1| (select (select |c_#memory_int| .cse4) (+ (select .cse1 0) 4))))))) is different from true [2023-11-12 02:08:55,366 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:08:55,366 INFO L93 Difference]: Finished difference Result 59 states and 67 transitions. [2023-11-12 02:08:55,367 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-12 02:08:55,367 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 31 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 36 [2023-11-12 02:08:55,368 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:08:55,369 INFO L225 Difference]: With dead ends: 59 [2023-11-12 02:08:55,369 INFO L226 Difference]: Without dead ends: 57 [2023-11-12 02:08:55,372 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 89 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 38 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 7.9s TimeCoverageRelationStatistics Valid=141, Invalid=695, Unknown=72, NotChecked=3382, Total=4290 [2023-11-12 02:08:55,373 INFO L413 NwaCegarLoop]: 27 mSDtfsCounter, 4 mSDsluCounter, 363 mSDsCounter, 0 mSdLazyCounter, 365 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 390 SdHoareTripleChecker+Invalid, 2015 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 365 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1647 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-12 02:08:55,377 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 390 Invalid, 2015 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 365 Invalid, 0 Unknown, 1647 Unchecked, 0.6s Time] [2023-11-12 02:08:55,378 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 57 states. [2023-11-12 02:08:55,395 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 57 to 57. [2023-11-12 02:08:55,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.1458333333333333) internal successors, (55), 48 states have internal predecessors, (55), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-12 02:08:55,402 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 65 transitions. [2023-11-12 02:08:55,403 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 65 transitions. Word has length 36 [2023-11-12 02:08:55,405 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:08:55,406 INFO L495 AbstractCegarLoop]: Abstraction has 57 states and 65 transitions. [2023-11-12 02:08:55,406 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 37 states have (on average 1.4594594594594594) internal successors, (54), 31 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 02:08:55,406 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 65 transitions. [2023-11-12 02:08:55,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-12 02:08:55,411 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:08:55,412 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:08:55,420 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-12 02:08:55,618 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:08:55,619 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:08:55,619 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:08:55,619 INFO L85 PathProgramCache]: Analyzing trace with hash 704367666, now seen corresponding path program 1 times [2023-11-12 02:08:55,619 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:08:55,619 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127635388] [2023-11-12 02:08:55,620 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:08:55,620 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:08:55,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:59,067 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:08:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:59,252 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:08:59,258 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:08:59,493 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-12 02:08:59,499 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:00,044 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 0 proven. 15 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 02:09:00,044 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:00,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127635388] [2023-11-12 02:09:00,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127635388] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:00,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [867269171] [2023-11-12 02:09:00,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:00,045 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:00,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:00,047 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:09:00,072 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-12 02:09:00,279 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:00,285 INFO L262 TraceCheckSpWp]: Trace formula consists of 359 conjuncts, 129 conjunts are in the unsatisfiable core [2023-11-12 02:09:00,298 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:09:00,307 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 02:09:00,395 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-12 02:09:00,636 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-12 02:09:00,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2023-11-12 02:09:00,900 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 02:09:01,016 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 02:09:01,169 INFO L322 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2023-11-12 02:09:01,170 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2023-11-12 02:09:01,389 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-12 02:09:01,415 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 02:09:01,623 INFO L322 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-12 02:09:01,624 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 51 [2023-11-12 02:09:01,636 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-12 02:09:01,986 INFO L322 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-12 02:09:01,987 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 33 [2023-11-12 02:09:01,996 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 10 [2023-11-12 02:09:02,004 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 02:09:02,010 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-12 02:09:02,426 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:09:02,427 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2023-11-12 02:09:02,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:09:02,448 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2023-11-12 02:09:02,456 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:09:02,470 INFO L322 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2023-11-12 02:09:02,471 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 70 treesize of output 53 [2023-11-12 02:09:02,493 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:09:02,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:09:02,517 INFO L322 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2023-11-12 02:09:02,517 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 4 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 33 treesize of output 33 [2023-11-12 02:09:03,510 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:09:03,513 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 56 treesize of output 42 [2023-11-12 02:09:03,523 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:09:03,554 INFO L322 Elim1Store]: treesize reduction 59, result has 10.6 percent of original size [2023-11-12 02:09:03,555 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 182 treesize of output 86 [2023-11-12 02:09:03,608 INFO L322 Elim1Store]: treesize reduction 78, result has 17.0 percent of original size [2023-11-12 02:09:03,608 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 278 treesize of output 153 [2023-11-12 02:09:03,622 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:09:03,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:09:03,625 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 6 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 78 treesize of output 23 [2023-11-12 02:09:03,634 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:09:03,660 INFO L322 Elim1Store]: treesize reduction 72, result has 17.2 percent of original size [2023-11-12 02:09:03,661 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 171 treesize of output 163 [2023-11-12 02:09:04,135 INFO L322 Elim1Store]: treesize reduction 37, result has 9.8 percent of original size [2023-11-12 02:09:04,135 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 155 treesize of output 53 [2023-11-12 02:09:04,148 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-12 02:09:04,150 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-12 02:09:04,365 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 6 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-12 02:09:04,365 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-12 02:09:04,708 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_875 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_871 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse3 (store (let ((.cse5 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_870)) (.cse0 (store (let ((.cse4 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse4 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_871))) (let ((.cse1 (select (select .cse0 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select .cse3 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_868) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_875) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_869) (select (select .cse0 .cse1) .cse2)) (+ (select (select .cse3 .cse1) .cse2) 4)))))) is different from false [2023-11-12 02:09:04,773 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_875 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_871 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse0 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (let ((.cse4 (store (let ((.cse6 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse6 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse0 v_ArrVal_870)) (.cse1 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse0 v_ArrVal_871))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_868) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_875) .cse0 v_ArrVal_869) (select (select .cse1 .cse2) .cse3)) (+ 4 (select (select .cse4 .cse2) .cse3)))))))) is different from false [2023-11-12 02:09:04,848 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_875 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_871 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse8))) (let ((.cse4 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse8)))) (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse0 v_ArrVal_870)) (.cse1 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse6)))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|))) .cse0 v_ArrVal_871))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_868) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_875) .cse0 v_ArrVal_869) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))))) is different from false [2023-11-12 02:09:04,875 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_875 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_870 (Array Int Int)) (v_ArrVal_871 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse6 (select (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (select (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$.base| .cse6) .cse8))) (let ((.cse4 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse8)))) (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse0 v_ArrVal_870)) (.cse1 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse6)))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|))) .cse0 v_ArrVal_871))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_868) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_875) .cse0 v_ArrVal_869) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))))) is different from false [2023-11-12 02:09:05,045 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_875 (Array Int Int)) (v_ArrVal_869 (Array Int Int)) (v_ArrVal_868 (Array Int Int)) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int) (v_ArrVal_870 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| Int) (v_ArrVal_871 (Array Int Int)) (v_ArrVal_885 (Array Int Int)) (v_ArrVal_884 (Array Int Int))) (or (< |c_#StackHeapBarrier| (+ |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| 1)) (= |c_ULTIMATE.start_main_~data~0#1| (let ((.cse9 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_884))) (let ((.cse6 (select (select .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse8 (select (select (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_885) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse0 (select (select .cse9 .cse6) .cse8))) (let ((.cse4 (store (let ((.cse7 (store |c_#memory_$Pointer$.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| (store v_ArrVal_885 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse8)))) (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))) .cse0 v_ArrVal_870)) (.cse1 (store (let ((.cse5 (store |c_#memory_$Pointer$.base| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| (store v_ArrVal_884 |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse6)))) (store .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select .cse5 |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|))) .cse0 v_ArrVal_871))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (select (select (store (store (store |c_#memory_int| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22| v_ArrVal_868) |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| v_ArrVal_875) .cse0 v_ArrVal_869) (select (select .cse1 .cse2) .cse3)) (+ (select (select .cse4 .cse2) .cse3) 4)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base_22|) 0)))) is different from false [2023-11-12 02:09:05,050 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [867269171] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:05,050 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-12 02:09:05,051 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 25] total 49 [2023-11-12 02:09:05,051 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2038892521] [2023-11-12 02:09:05,051 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-12 02:09:05,052 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2023-11-12 02:09:05,052 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-12 02:09:05,053 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2023-11-12 02:09:05,056 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=2528, Unknown=5, NotChecked=520, Total=3192 [2023-11-12 02:09:05,057 INFO L87 Difference]: Start difference. First operand 57 states and 65 transitions. Second operand has 49 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 40 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 02:09:09,741 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-12 02:09:09,741 INFO L93 Difference]: Finished difference Result 73 states and 84 transitions. [2023-11-12 02:09:09,742 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-12 02:09:09,742 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 40 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2023-11-12 02:09:09,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-12 02:09:09,743 INFO L225 Difference]: With dead ends: 73 [2023-11-12 02:09:09,743 INFO L226 Difference]: Without dead ends: 71 [2023-11-12 02:09:09,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 71 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 533 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=279, Invalid=4292, Unknown=5, NotChecked=680, Total=5256 [2023-11-12 02:09:09,746 INFO L413 NwaCegarLoop]: 18 mSDtfsCounter, 100 mSDsluCounter, 438 mSDsCounter, 0 mSdLazyCounter, 1134 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 456 SdHoareTripleChecker+Invalid, 1156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1134 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.8s IncrementalHoareTripleChecker+Time [2023-11-12 02:09:09,747 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 456 Invalid, 1156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1134 Invalid, 0 Unknown, 0 Unchecked, 1.8s Time] [2023-11-12 02:09:09,748 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 71 states. [2023-11-12 02:09:09,763 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 71 to 59. [2023-11-12 02:09:09,763 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.14) internal successors, (57), 50 states have internal predecessors, (57), 5 states have call successors, (5), 3 states have call predecessors, (5), 3 states have return successors, (5), 5 states have call predecessors, (5), 5 states have call successors, (5) [2023-11-12 02:09:09,764 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 67 transitions. [2023-11-12 02:09:09,764 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 67 transitions. Word has length 38 [2023-11-12 02:09:09,764 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-12 02:09:09,765 INFO L495 AbstractCegarLoop]: Abstraction has 59 states and 67 transitions. [2023-11-12 02:09:09,765 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 45 states have (on average 1.3777777777777778) internal successors, (62), 40 states have internal predecessors, (62), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2023-11-12 02:09:09,765 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 67 transitions. [2023-11-12 02:09:09,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-12 02:09:09,766 INFO L187 NwaCegarLoop]: Found error trace [2023-11-12 02:09:09,766 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-12 02:09:09,778 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-12 02:09:09,973 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:09,973 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2023-11-12 02:09:09,973 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-12 02:09:09,973 INFO L85 PathProgramCache]: Analyzing trace with hash -2080860260, now seen corresponding path program 2 times [2023-11-12 02:09:09,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-12 02:09:09,974 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2093454083] [2023-11-12 02:09:09,974 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-12 02:09:09,974 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-12 02:09:10,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:11,109 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 2 [2023-11-12 02:09:11,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:11,166 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 10 [2023-11-12 02:09:11,171 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:11,279 INFO L376 atingTraceCheckCraig]: Compute interpolants for subsequence at non-pending call position 20 [2023-11-12 02:09:11,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-12 02:09:11,530 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 8 proven. 11 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-12 02:09:11,530 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-12 02:09:11,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2093454083] [2023-11-12 02:09:11,530 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2093454083] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-12 02:09:11,530 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1554255919] [2023-11-12 02:09:11,530 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-12 02:09:11,530 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-12 02:09:11,531 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 [2023-11-12 02:09:11,533 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-12 02:09:11,552 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_84bb73e7-36f1-48d9-97e6-80c37cecc6a6/bin/uautomizer-verify-uTZkv6EMXl/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-12 02:09:11,807 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-12 02:09:11,807 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-12 02:09:11,812 INFO L262 TraceCheckSpWp]: Trace formula consists of 362 conjuncts, 123 conjunts are in the unsatisfiable core [2023-11-12 02:09:11,817 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-12 02:09:11,861 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-12 02:09:12,245 INFO L322 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-12 02:09:12,245 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21