./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version e2fb8bed Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --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 f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 --- Real Ultimate output --- This is Ultimate 0.3.0-?-e2fb8be-m [2025-03-08 04:34:35,652 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-08 04:34:35,700 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2025-03-08 04:34:35,708 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-08 04:34:35,708 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-08 04:34:35,728 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-08 04:34:35,728 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-08 04:34:35,728 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-08 04:34:35,729 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-08 04:34:35,729 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-08 04:34:35,729 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-08 04:34:35,729 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-08 04:34:35,729 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-08 04:34:35,729 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-08 04:34:35,729 INFO L153 SettingsManager]: * Use SBE=true [2025-03-08 04:34:35,729 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-08 04:34:35,729 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2025-03-08 04:34:35,730 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-08 04:34:35,730 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-08 04:34:35,730 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-08 04:34:35,730 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-08 04:34:35,730 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2025-03-08 04:34:35,730 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-08 04:34:35,730 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2025-03-08 04:34:35,730 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-08 04:34:35,730 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2025-03-08 04:34:35,730 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-08 04:34:35,730 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-08 04:34:35,731 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-08 04:34:35,731 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-08 04:34:35,731 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-08 04:34:35,731 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-08 04:34:35,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:34:35,731 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-08 04:34:35,731 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-08 04:34:35,731 INFO L153 SettingsManager]: * Compute procedure contracts=false [2025-03-08 04:34:35,731 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2025-03-08 04:34:35,731 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-08 04:34:35,731 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-08 04:34:35,731 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-08 04:34:35,732 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-08 04:34:35,732 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-08 04:34:35,732 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-08 04:34:35,732 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC 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 -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux 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 -> f682d6a9f9df80cf11b356f08ea6be5ab5adaf1b414fc8a476877af8610cc552 [2025-03-08 04:34:35,936 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-08 04:34:35,943 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-08 04:34:35,946 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-08 04:34:35,947 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-08 04:34:35,947 INFO L274 PluginConnector]: CDTParser initialized [2025-03-08 04:34:35,948 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2025-03-08 04:34:37,050 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3808d93d/2c2ae5d4db324d9c9373d4f5352d62ad/FLAGd76b6efa8 [2025-03-08 04:34:37,306 INFO L384 CDTParser]: Found 1 translation units. [2025-03-08 04:34:37,307 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i [2025-03-08 04:34:37,314 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3808d93d/2c2ae5d4db324d9c9373d4f5352d62ad/FLAGd76b6efa8 [2025-03-08 04:34:37,619 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/e3808d93d/2c2ae5d4db324d9c9373d4f5352d62ad [2025-03-08 04:34:37,621 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-08 04:34:37,622 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-08 04:34:37,623 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-08 04:34:37,623 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-08 04:34:37,626 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-08 04:34:37,627 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:34:37" (1/1) ... [2025-03-08 04:34:37,628 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@213527d0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:37, skipping insertion in model container [2025-03-08 04:34:37,628 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.03 04:34:37" (1/1) ... [2025-03-08 04:34:37,646 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-08 04:34:37,884 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2025-03-08 04:34:37,887 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:34:37,896 INFO L200 MainTranslator]: Completed pre-run [2025-03-08 04:34:37,943 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-simple/sll2c_prepend_equal.i[24458,24471] [2025-03-08 04:34:37,944 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-08 04:34:37,962 INFO L204 MainTranslator]: Completed translation [2025-03-08 04:34:37,963 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:37 WrapperNode [2025-03-08 04:34:37,963 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-08 04:34:37,964 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-08 04:34:37,964 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-08 04:34:37,964 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-08 04:34:37,968 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:37" (1/1) ... [2025-03-08 04:34:37,976 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:37" (1/1) ... [2025-03-08 04:34:37,993 INFO L138 Inliner]: procedures = 127, calls = 43, calls flagged for inlining = 6, calls inlined = 6, statements flattened = 132 [2025-03-08 04:34:37,993 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-08 04:34:37,994 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-08 04:34:37,994 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-08 04:34:37,994 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-08 04:34:38,000 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:37" (1/1) ... [2025-03-08 04:34:38,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:37" (1/1) ... [2025-03-08 04:34:38,004 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:37" (1/1) ... [2025-03-08 04:34:38,025 INFO L175 MemorySlicer]: Split 25 memory accesses to 3 slices as follows [2, 10, 13]. 52 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 1, 0]. The 9 writes are split as follows [0, 2, 7]. [2025-03-08 04:34:38,026 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:37" (1/1) ... [2025-03-08 04:34:38,026 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:37" (1/1) ... [2025-03-08 04:34:38,035 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:37" (1/1) ... [2025-03-08 04:34:38,036 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:37" (1/1) ... [2025-03-08 04:34:38,042 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:37" (1/1) ... [2025-03-08 04:34:38,043 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:37" (1/1) ... [2025-03-08 04:34:38,045 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-08 04:34:38,045 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-08 04:34:38,045 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-08 04:34:38,046 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-08 04:34:38,046 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:37" (1/1) ... [2025-03-08 04:34:38,051 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-08 04:34:38,065 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:34:38,078 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-08 04:34:38,084 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-08 04:34:38,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-08 04:34:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-08 04:34:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-03-08 04:34:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-08 04:34:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-08 04:34:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-03-08 04:34:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-03-08 04:34:38,107 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-03-08 04:34:38,107 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-08 04:34:38,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-08 04:34:38,108 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-03-08 04:34:38,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-08 04:34:38,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-08 04:34:38,108 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-03-08 04:34:38,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-08 04:34:38,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-08 04:34:38,108 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-03-08 04:34:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-08 04:34:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-03-08 04:34:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-03-08 04:34:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-03-08 04:34:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-08 04:34:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-08 04:34:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-03-08 04:34:38,109 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-08 04:34:38,110 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-08 04:34:38,229 INFO L256 CfgBuilder]: Building ICFG [2025-03-08 04:34:38,231 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-08 04:34:38,358 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint L624: call ULTIMATE.dealloc(main_~#s~0#1.base, main_~#s~0#1.offset);havoc main_~#s~0#1.base, main_~#s~0#1.offset; [2025-03-08 04:34:38,384 INFO L1307 $ProcedureCfgBuilder]: dead code at ProgramPoint myexit_returnLabel#1: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-03-08 04:34:38,399 INFO L? ?]: Removed 45 outVars from TransFormulas that were not future-live. [2025-03-08 04:34:38,399 INFO L307 CfgBuilder]: Performing block encoding [2025-03-08 04:34:38,407 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-08 04:34:38,409 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-08 04:34:38,410 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:34:38 BoogieIcfgContainer [2025-03-08 04:34:38,410 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-08 04:34:38,412 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-08 04:34:38,413 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-08 04:34:38,416 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-08 04:34:38,416 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.03 04:34:37" (1/3) ... [2025-03-08 04:34:38,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530e663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:34:38, skipping insertion in model container [2025-03-08 04:34:38,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.03 04:34:37" (2/3) ... [2025-03-08 04:34:38,417 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@530e663 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.03 04:34:38, skipping insertion in model container [2025-03-08 04:34:38,417 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.03 04:34:38" (3/3) ... [2025-03-08 04:34:38,418 INFO L128 eAbstractionObserver]: Analyzing ICFG sll2c_prepend_equal.i [2025-03-08 04:34:38,430 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-08 04:34:38,431 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG sll2c_prepend_equal.i that has 2 procedures, 33 locations, 1 initial locations, 4 loop locations, and 1 error locations. [2025-03-08 04:34:38,468 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-08 04:34:38,478 INFO L333 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, 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;@5b923442, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-08 04:34:38,478 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2025-03-08 04:34:38,481 INFO L276 IsEmpty]: Start isEmpty. Operand has 33 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 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) [2025-03-08 04:34:38,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2025-03-08 04:34:38,486 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:34:38,487 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:34:38,487 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:34:38,492 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:34:38,492 INFO L85 PathProgramCache]: Analyzing trace with hash 433364782, now seen corresponding path program 1 times [2025-03-08 04:34:38,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:34:38,499 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1369345995] [2025-03-08 04:34:38,500 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:38,500 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:34:38,582 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 23 statements into 1 equivalence classes. [2025-03-08 04:34:38,609 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 23 of 23 statements. [2025-03-08 04:34:38,611 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:38,611 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:38,831 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-03-08 04:34:38,832 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:34:38,833 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1369345995] [2025-03-08 04:34:38,833 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1369345995] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-08 04:34:38,834 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-08 04:34:38,834 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-08 04:34:38,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1793491904] [2025-03-08 04:34:38,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-08 04:34:38,838 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-08 04:34:38,838 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:34:38,850 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-08 04:34:38,850 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:34:38,851 INFO L87 Difference]: Start difference. First operand has 33 states, 27 states have (on average 1.4444444444444444) internal successors, (39), 28 states have internal predecessors, (39), 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), 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) [2025-03-08 04:34:38,874 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:34:38,875 INFO L93 Difference]: Finished difference Result 62 states and 85 transitions. [2025-03-08 04:34:38,877 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-08 04:34:38,878 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) 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 [2025-03-08 04:34:38,879 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:34:38,883 INFO L225 Difference]: With dead ends: 62 [2025-03-08 04:34:38,883 INFO L226 Difference]: Without dead ends: 29 [2025-03-08 04:34:38,885 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-08 04:34:38,888 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 1 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:34:38,890 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 75 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-08 04:34:38,899 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 29 states. [2025-03-08 04:34:38,907 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 29 to 27. [2025-03-08 04:34:38,908 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 27 states, 22 states have (on average 1.2272727272727273) internal successors, (27), 22 states have internal predecessors, (27), 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) [2025-03-08 04:34:38,911 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 27 states to 27 states and 33 transitions. [2025-03-08 04:34:38,912 INFO L78 Accepts]: Start accepts. Automaton has 27 states and 33 transitions. Word has length 23 [2025-03-08 04:34:38,912 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:34:38,912 INFO L471 AbstractCegarLoop]: Abstraction has 27 states and 33 transitions. [2025-03-08 04:34:38,912 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) 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) [2025-03-08 04:34:38,912 INFO L276 IsEmpty]: Start isEmpty. Operand 27 states and 33 transitions. [2025-03-08 04:34:38,913 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-03-08 04:34:38,913 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:34:38,913 INFO L218 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] [2025-03-08 04:34:38,913 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-08 04:34:38,913 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:34:38,914 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:34:38,914 INFO L85 PathProgramCache]: Analyzing trace with hash -1612058384, now seen corresponding path program 1 times [2025-03-08 04:34:38,914 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:34:38,914 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1497734950] [2025-03-08 04:34:38,914 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:38,914 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:34:38,939 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 04:34:38,960 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 04:34:38,961 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:38,961 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:39,262 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:34:39,263 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:34:39,263 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1497734950] [2025-03-08 04:34:39,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1497734950] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:34:39,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [157841632] [2025-03-08 04:34:39,264 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:34:39,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:34:39,265 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:34:39,268 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:34:39,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-08 04:34:39,361 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-03-08 04:34:39,418 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-03-08 04:34:39,419 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:34:39,419 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:34:39,422 INFO L256 TraceCheckSpWp]: Trace formula consists of 315 conjuncts, 23 conjuncts are in the unsatisfiable core [2025-03-08 04:34:39,427 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:34:39,537 INFO L378 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 [2025-03-08 04:34:39,552 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 11 proven. 4 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:34:39,553 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:34:39,615 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 5 proven. 4 refuted. 0 times theorem prover too weak. 7 trivial. 0 not checked. [2025-03-08 04:34:39,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [157841632] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-08 04:34:39,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-08 04:34:39,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10, 9] total 12 [2025-03-08 04:34:39,616 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [759359973] [2025-03-08 04:34:39,616 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-08 04:34:39,617 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2025-03-08 04:34:39,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:34:39,617 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2025-03-08 04:34:39,617 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2025-03-08 04:34:39,618 INFO L87 Difference]: Start difference. First operand 27 states and 33 transitions. Second operand has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 04:34:43,640 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 04:34:47,666 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 04:34:51,681 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 04:34:55,780 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 04:34:59,816 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2025-03-08 04:34:59,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:34:59,818 INFO L93 Difference]: Finished difference Result 41 states and 48 transitions. [2025-03-08 04:34:59,819 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2025-03-08 04:34:59,819 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) Word has length 31 [2025-03-08 04:34:59,819 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:34:59,821 INFO L225 Difference]: With dead ends: 41 [2025-03-08 04:34:59,821 INFO L226 Difference]: Without dead ends: 34 [2025-03-08 04:34:59,821 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 73 GetRequests, 58 SyntacticMatches, 1 SemanticMatches, 14 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=196, Unknown=0, NotChecked=0, Total=240 [2025-03-08 04:34:59,822 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 16 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 114 mSolverCounterSat, 0 mSolverCounterUnsat, 5 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 20.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 119 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 114 IncrementalHoareTripleChecker+Invalid, 5 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 20.1s IncrementalHoareTripleChecker+Time [2025-03-08 04:34:59,822 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 213 Invalid, 119 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 114 Invalid, 5 Unknown, 0 Unchecked, 20.1s Time] [2025-03-08 04:34:59,822 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2025-03-08 04:34:59,825 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 32. [2025-03-08 04:34:59,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 32 states, 26 states have (on average 1.1538461538461537) internal successors, (30), 26 states have internal predecessors, (30), 3 states have call successors, (3), 2 states have call predecessors, (3), 2 states have return successors, (3), 3 states have call predecessors, (3), 3 states have call successors, (3) [2025-03-08 04:34:59,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 32 states to 32 states and 36 transitions. [2025-03-08 04:34:59,827 INFO L78 Accepts]: Start accepts. Automaton has 32 states and 36 transitions. Word has length 31 [2025-03-08 04:34:59,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:34:59,827 INFO L471 AbstractCegarLoop]: Abstraction has 32 states and 36 transitions. [2025-03-08 04:34:59,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.3333333333333335) internal successors, (28), 11 states have internal predecessors, (28), 3 states have call successors, (5), 2 states have call predecessors, (5), 3 states have return successors, (5), 4 states have call predecessors, (5), 3 states have call successors, (5) [2025-03-08 04:34:59,827 INFO L276 IsEmpty]: Start isEmpty. Operand 32 states and 36 transitions. [2025-03-08 04:34:59,827 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2025-03-08 04:34:59,827 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:34:59,827 INFO L218 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] [2025-03-08 04:34:59,834 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-08 04:35:00,028 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:00,028 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:35:00,029 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:35:00,029 INFO L85 PathProgramCache]: Analyzing trace with hash 380675137, now seen corresponding path program 1 times [2025-03-08 04:35:00,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:35:00,029 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1752763752] [2025-03-08 04:35:00,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:00,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:35:00,043 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 04:35:00,057 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 04:35:00,057 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:00,057 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:01,003 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:35:01,004 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:35:01,004 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1752763752] [2025-03-08 04:35:01,004 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1752763752] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:35:01,005 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1615382533] [2025-03-08 04:35:01,005 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:01,005 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:01,005 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:35:01,007 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:35:01,009 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-08 04:35:01,084 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 34 statements into 1 equivalence classes. [2025-03-08 04:35:01,125 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 34 of 34 statements. [2025-03-08 04:35:01,125 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:01,125 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:01,128 INFO L256 TraceCheckSpWp]: Trace formula consists of 338 conjuncts, 116 conjuncts are in the unsatisfiable core [2025-03-08 04:35:01,136 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:35:01,164 INFO L378 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 [2025-03-08 04:35:01,293 INFO L378 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 [2025-03-08 04:35:01,364 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:35:01,364 INFO L378 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 [2025-03-08 04:35:01,427 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2025-03-08 04:35:01,438 INFO L378 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 [2025-03-08 04:35:01,507 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 04:35:01,507 INFO L378 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 50 treesize of output 45 [2025-03-08 04:35:01,515 INFO L378 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 24 treesize of output 11 [2025-03-08 04:35:01,642 INFO L378 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 30 treesize of output 14 [2025-03-08 04:35:01,650 INFO L378 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 15 treesize of output 7 [2025-03-08 04:35:01,655 INFO L378 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 11 treesize of output 3 [2025-03-08 04:35:01,844 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 04:35:01,845 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-03-08 04:35:01,857 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:35:01,858 INFO L378 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 38 treesize of output 27 [2025-03-08 04:35:01,877 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 04:35:01,877 INFO L378 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 [2025-03-08 04:35:02,159 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:35:02,161 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:35:02,162 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 16 [2025-03-08 04:35:02,242 INFO L134 CoverageAnalysis]: Checked inductivity of 16 backedges. 7 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:35:02,242 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:35:02,337 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_320 Int) (v_ArrVal_322 (Array Int Int)) (v_ArrVal_321 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_321) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_322) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |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_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| v_ArrVal_320)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2025-03-08 04:35:06,705 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1615382533] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:35:06,706 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:35:06,706 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 21] total 35 [2025-03-08 04:35:06,706 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [972068556] [2025-03-08 04:35:06,706 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:35:06,706 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2025-03-08 04:35:06,706 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:35:06,707 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2025-03-08 04:35:06,707 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=140, Invalid=1667, Unknown=3, NotChecked=82, Total=1892 [2025-03-08 04:35:06,707 INFO L87 Difference]: Start difference. First operand 32 states and 36 transitions. Second operand has 35 states, 32 states have (on average 1.4375) internal successors, (46), 27 states have internal predecessors, (46), 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) [2025-03-08 04:35:07,469 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:35:07,469 INFO L93 Difference]: Finished difference Result 59 states and 69 transitions. [2025-03-08 04:35:07,469 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2025-03-08 04:35:07,470 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 32 states have (on average 1.4375) internal successors, (46), 27 states have internal predecessors, (46), 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 [2025-03-08 04:35:07,470 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:35:07,471 INFO L225 Difference]: With dead ends: 59 [2025-03-08 04:35:07,471 INFO L226 Difference]: Without dead ends: 51 [2025-03-08 04:35:07,472 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 22 SyntacticMatches, 0 SemanticMatches, 54 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 639 ImplicationChecksByTransitivity, 5.6s TimeCoverageRelationStatistics Valid=244, Invalid=2727, Unknown=3, NotChecked=106, Total=3080 [2025-03-08 04:35:07,472 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 33 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 489 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 34 SdHoareTripleChecker+Valid, 263 SdHoareTripleChecker+Invalid, 508 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 489 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-03-08 04:35:07,472 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [34 Valid, 263 Invalid, 508 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 489 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-03-08 04:35:07,473 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 51 states. [2025-03-08 04:35:07,481 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 51 to 46. [2025-03-08 04:35:07,481 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 46 states, 37 states have (on average 1.135135135135135) internal successors, (42), 37 states have internal predecessors, (42), 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) [2025-03-08 04:35:07,481 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 46 states to 46 states and 52 transitions. [2025-03-08 04:35:07,482 INFO L78 Accepts]: Start accepts. Automaton has 46 states and 52 transitions. Word has length 34 [2025-03-08 04:35:07,483 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:35:07,483 INFO L471 AbstractCegarLoop]: Abstraction has 46 states and 52 transitions. [2025-03-08 04:35:07,483 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 32 states have (on average 1.4375) internal successors, (46), 27 states have internal predecessors, (46), 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) [2025-03-08 04:35:07,484 INFO L276 IsEmpty]: Start isEmpty. Operand 46 states and 52 transitions. [2025-03-08 04:35:07,485 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 37 [2025-03-08 04:35:07,485 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:35:07,485 INFO L218 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] [2025-03-08 04:35:07,492 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-03-08 04:35:07,686 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable2 [2025-03-08 04:35:07,686 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:35:07,686 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:35:07,686 INFO L85 PathProgramCache]: Analyzing trace with hash -1506011678, now seen corresponding path program 1 times [2025-03-08 04:35:07,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:35:07,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [151075365] [2025-03-08 04:35:07,687 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:07,687 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:35:07,701 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 04:35:07,725 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 04:35:07,725 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:07,725 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:09,174 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 7 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:35:09,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:35:09,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [151075365] [2025-03-08 04:35:09,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [151075365] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:35:09,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1973942358] [2025-03-08 04:35:09,175 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:09,175 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:09,175 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:35:09,178 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:35:09,179 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-08 04:35:09,255 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 36 statements into 1 equivalence classes. [2025-03-08 04:35:09,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 36 of 36 statements. [2025-03-08 04:35:09,293 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:09,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:09,296 INFO L256 TraceCheckSpWp]: Trace formula consists of 351 conjuncts, 137 conjuncts are in the unsatisfiable core [2025-03-08 04:35:09,301 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:35:09,326 INFO L378 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 [2025-03-08 04:35:09,516 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:35:09,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2025-03-08 04:35:09,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2025-03-08 04:35:09,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2025-03-08 04:35:09,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-08 04:35:09,773 INFO L378 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 15 treesize of output 7 [2025-03-08 04:35:09,891 INFO L378 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 18 treesize of output 7 [2025-03-08 04:35:09,895 INFO L378 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 [2025-03-08 04:35:09,989 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 04:35:09,989 INFO L378 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 1 case distinctions, treesize of input 20 treesize of output 23 [2025-03-08 04:35:10,027 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-08 04:35:10,027 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-03-08 04:35:10,364 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:35:10,364 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:35:10,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2025-03-08 04:35:10,496 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:35:10,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 1 case distinctions, treesize of input 15 treesize of output 15 [2025-03-08 04:35:10,704 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2025-03-08 04:35:10,707 INFO L378 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 [2025-03-08 04:35:10,734 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-03-08 04:35:10,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 44 treesize of output 44 [2025-03-08 04:35:10,747 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-08 04:35:10,747 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 21 [2025-03-08 04:35:10,815 INFO L378 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 19 treesize of output 11 [2025-03-08 04:35:10,887 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:35:10,887 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:35:12,760 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_478 Int) (v_ArrVal_476 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| v_ArrVal_478)) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_476) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |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_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#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_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4)))) is different from false [2025-03-08 04:35:13,331 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:35:13,332 INFO L378 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 53 [2025-03-08 04:35:13,344 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:35:13,345 INFO L378 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 94 treesize of output 95 [2025-03-08 04:35:13,351 INFO L378 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 35 treesize of output 19 [2025-03-08 04:35:13,366 INFO L378 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 438 treesize of output 400 [2025-03-08 04:35:13,631 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1973942358] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:35:13,632 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:35:13,632 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 26] total 46 [2025-03-08 04:35:13,632 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194700376] [2025-03-08 04:35:13,632 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:35:13,632 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2025-03-08 04:35:13,633 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:35:13,633 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2025-03-08 04:35:13,634 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=178, Invalid=2685, Unknown=3, NotChecked=104, Total=2970 [2025-03-08 04:35:13,635 INFO L87 Difference]: Start difference. First operand 46 states and 52 transitions. Second operand has 46 states, 43 states have (on average 1.255813953488372) internal successors, (54), 37 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) [2025-03-08 04:35:15,124 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:35:15,124 INFO L93 Difference]: Finished difference Result 65 states and 73 transitions. [2025-03-08 04:35:15,124 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-03-08 04:35:15,125 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 43 states have (on average 1.255813953488372) internal successors, (54), 37 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 [2025-03-08 04:35:15,125 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:35:15,125 INFO L225 Difference]: With dead ends: 65 [2025-03-08 04:35:15,125 INFO L226 Difference]: Without dead ends: 63 [2025-03-08 04:35:15,126 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 954 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=353, Invalid=4340, Unknown=3, NotChecked=134, Total=4830 [2025-03-08 04:35:15,127 INFO L435 NwaCegarLoop]: 14 mSDtfsCounter, 52 mSDsluCounter, 301 mSDsCounter, 0 mSdLazyCounter, 898 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 904 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 898 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-03-08 04:35:15,128 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 315 Invalid, 904 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 898 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-03-08 04:35:15,128 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 63 states. [2025-03-08 04:35:15,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 63 to 54. [2025-03-08 04:35:15,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 54 states, 45 states have (on average 1.1555555555555554) internal successors, (52), 45 states have internal predecessors, (52), 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) [2025-03-08 04:35:15,134 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 54 states to 54 states and 62 transitions. [2025-03-08 04:35:15,134 INFO L78 Accepts]: Start accepts. Automaton has 54 states and 62 transitions. Word has length 36 [2025-03-08 04:35:15,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:35:15,135 INFO L471 AbstractCegarLoop]: Abstraction has 54 states and 62 transitions. [2025-03-08 04:35:15,135 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 43 states have (on average 1.255813953488372) internal successors, (54), 37 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) [2025-03-08 04:35:15,135 INFO L276 IsEmpty]: Start isEmpty. Operand 54 states and 62 transitions. [2025-03-08 04:35:15,135 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 04:35:15,135 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:35:15,135 INFO L218 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] [2025-03-08 04:35:15,142 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-08 04:35:15,336 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:15,336 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:35:15,336 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:35:15,336 INFO L85 PathProgramCache]: Analyzing trace with hash 126828676, now seen corresponding path program 1 times [2025-03-08 04:35:15,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:35:15,336 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [464354737] [2025-03-08 04:35:15,336 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:15,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:35:15,349 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 04:35:15,357 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 04:35:15,358 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:15,358 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:16,137 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-08 04:35:16,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:35:16,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [464354737] [2025-03-08 04:35:16,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [464354737] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:35:16,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59173697] [2025-03-08 04:35:16,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:16,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:16,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:35:16,141 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:35:16,142 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-08 04:35:16,216 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 38 statements into 1 equivalence classes. [2025-03-08 04:35:16,253 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 04:35:16,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:16,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:16,256 INFO L256 TraceCheckSpWp]: Trace formula consists of 367 conjuncts, 121 conjuncts are in the unsatisfiable core [2025-03-08 04:35:16,262 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:35:16,268 INFO L378 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 [2025-03-08 04:35:16,394 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:35:16,395 INFO L378 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 [2025-03-08 04:35:16,456 INFO L378 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 [2025-03-08 04:35:16,499 INFO L378 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 [2025-03-08 04:35:16,595 INFO L378 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 11 treesize of output 3 [2025-03-08 04:35:16,599 INFO L378 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 15 treesize of output 7 [2025-03-08 04:35:16,679 INFO L378 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 18 treesize of output 7 [2025-03-08 04:35:16,761 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 04:35:16,762 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-03-08 04:35:16,783 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-08 04:35:16,784 INFO L378 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 20 treesize of output 22 [2025-03-08 04:35:17,012 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:35:17,013 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:35:17,013 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 7 [2025-03-08 04:35:17,221 INFO L349 Elim1Store]: treesize reduction 33, result has 31.3 percent of original size [2025-03-08 04:35:17,221 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 30 treesize of output 22 [2025-03-08 04:35:17,241 INFO L349 Elim1Store]: treesize reduction 72, result has 32.7 percent of original size [2025-03-08 04:35:17,241 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 55 treesize of output 72 [2025-03-08 04:35:17,248 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 58 treesize of output 45 [2025-03-08 04:35:17,251 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 33 [2025-03-08 04:35:17,257 INFO L378 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 34 treesize of output 28 [2025-03-08 04:35:17,298 INFO L378 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 63 treesize of output 47 [2025-03-08 04:35:17,350 INFO L378 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 62 treesize of output 38 [2025-03-08 04:35:17,354 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:35:17,354 INFO L378 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 35 treesize of output 27 [2025-03-08 04:35:17,382 INFO L134 CoverageAnalysis]: Checked inductivity of 18 backedges. 8 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:35:17,382 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:35:17,590 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_634 (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_21| Int) (|ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| Int)) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (or (not (= .cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_21|) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)))) (not (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (= (select (select (store (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse0)) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.base_21| v_ArrVal_634) .cse1) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.offset| |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_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) .cse1))))))) is different from false [2025-03-08 04:35:17,861 INFO L349 Elim1Store]: treesize reduction 267, result has 29.4 percent of original size [2025-03-08 04:35:17,862 INFO L378 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 4 case distinctions, treesize of input 261 treesize of output 334 [2025-03-08 04:35:17,943 INFO L349 Elim1Store]: treesize reduction 26, result has 89.6 percent of original size [2025-03-08 04:35:17,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 9 case distinctions, treesize of input 219 treesize of output 383 [2025-03-08 04:35:17,957 INFO L378 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 80 treesize of output 66 [2025-03-08 04:35:18,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59173697] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:35:18,790 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:35:18,790 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 25] total 40 [2025-03-08 04:35:18,790 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1486835436] [2025-03-08 04:35:18,790 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:35:18,790 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2025-03-08 04:35:18,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:35:18,791 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2025-03-08 04:35:18,791 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=129, Invalid=1938, Unknown=7, NotChecked=88, Total=2162 [2025-03-08 04:35:18,792 INFO L87 Difference]: Start difference. First operand 54 states and 62 transitions. Second operand has 40 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 33 states have internal predecessors, (56), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 04:35:20,161 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:35:20,161 INFO L93 Difference]: Finished difference Result 70 states and 80 transitions. [2025-03-08 04:35:20,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 31 states. [2025-03-08 04:35:20,163 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 33 states have internal predecessors, (56), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 38 [2025-03-08 04:35:20,163 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:35:20,163 INFO L225 Difference]: With dead ends: 70 [2025-03-08 04:35:20,163 INFO L226 Difference]: Without dead ends: 67 [2025-03-08 04:35:20,164 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 740 ImplicationChecksByTransitivity, 2.1s TimeCoverageRelationStatistics Valid=333, Invalid=3954, Unknown=7, NotChecked=128, Total=4422 [2025-03-08 04:35:20,165 INFO L435 NwaCegarLoop]: 17 mSDtfsCounter, 46 mSDsluCounter, 357 mSDsCounter, 0 mSdLazyCounter, 849 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 374 SdHoareTripleChecker+Invalid, 853 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 849 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-03-08 04:35:20,165 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 374 Invalid, 853 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 849 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2025-03-08 04:35:20,165 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-08 04:35:20,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 57. [2025-03-08 04:35:20,176 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 57 states, 48 states have (on average 1.1666666666666667) internal successors, (56), 48 states have internal predecessors, (56), 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) [2025-03-08 04:35:20,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 57 states to 57 states and 66 transitions. [2025-03-08 04:35:20,177 INFO L78 Accepts]: Start accepts. Automaton has 57 states and 66 transitions. Word has length 38 [2025-03-08 04:35:20,180 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:35:20,180 INFO L471 AbstractCegarLoop]: Abstraction has 57 states and 66 transitions. [2025-03-08 04:35:20,180 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 38 states have (on average 1.4736842105263157) internal successors, (56), 33 states have internal predecessors, (56), 4 states have call successors, (5), 3 states have call predecessors, (5), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-03-08 04:35:20,180 INFO L276 IsEmpty]: Start isEmpty. Operand 57 states and 66 transitions. [2025-03-08 04:35:20,181 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2025-03-08 04:35:20,181 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:35:20,181 INFO L218 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] [2025-03-08 04:35:20,189 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-03-08 04:35:20,381 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:20,381 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:35:20,382 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:35:20,382 INFO L85 PathProgramCache]: Analyzing trace with hash -2135841981, now seen corresponding path program 2 times [2025-03-08 04:35:20,382 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:35:20,382 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1841046143] [2025-03-08 04:35:20,382 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:35:20,382 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:35:20,395 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-08 04:35:20,411 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 04:35:20,411 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:35:20,411 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:21,403 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:35:21,404 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:35:21,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1841046143] [2025-03-08 04:35:21,404 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1841046143] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:35:21,404 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [31443778] [2025-03-08 04:35:21,404 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-03-08 04:35:21,404 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:21,404 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:35:21,406 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:35:21,408 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-08 04:35:21,481 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 38 statements into 2 equivalence classes. [2025-03-08 04:35:21,519 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 38 of 38 statements. [2025-03-08 04:35:21,519 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-03-08 04:35:21,519 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:21,521 INFO L256 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 147 conjuncts are in the unsatisfiable core [2025-03-08 04:35:21,526 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:35:21,553 INFO L378 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 [2025-03-08 04:35:21,650 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2025-03-08 04:35:21,652 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2025-03-08 04:35:21,666 INFO L378 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 [2025-03-08 04:35:21,671 INFO L378 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 [2025-03-08 04:35:21,675 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) is different from false [2025-03-08 04:35:21,677 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))))) is different from true [2025-03-08 04:35:21,693 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-08 04:35:21,693 INFO L378 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 45 treesize of output 31 [2025-03-08 04:35:21,706 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2025-03-08 04:35:21,706 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 19 [2025-03-08 04:35:21,719 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))))) is different from false [2025-03-08 04:35:21,721 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0) 0)) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 1) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |c_#valid| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0))))) is different from true [2025-03-08 04:35:21,765 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~data#1| 1) (= |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|) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= .cse0 .cse1)) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2025-03-08 04:35:21,767 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= |c_ULTIMATE.start_sll_circular_prepend_~data#1| 1) (= |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|) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |c_#valid| .cse2)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= .cse0 .cse1)) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2025-03-08 04:35:21,781 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-03-08 04:35:21,781 INFO L378 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 60 treesize of output 35 [2025-03-08 04:35:21,787 INFO L378 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 19 treesize of output 11 [2025-03-08 04:35:21,803 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-03-08 04:35:21,805 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-03-08 04:35:21,828 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-03-08 04:35:21,830 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-03-08 04:35:21,873 INFO L378 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 [2025-03-08 04:35:21,881 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 4) |c_node_create_#in~data#1|)) is different from false [2025-03-08 04:35:21,882 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#res#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 4) |c_node_create_#in~data#1|)) is different from true [2025-03-08 04:35:21,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:35:21,930 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-03-08 04:35:21,930 INFO L378 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 68 treesize of output 57 [2025-03-08 04:35:21,945 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 04:35:21,945 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 39 [2025-03-08 04:35:21,994 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= .cse0 .cse1)) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2025-03-08 04:35:21,996 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) 0) 0) (= .cse0 .cse1)) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2025-03-08 04:35:22,047 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse1 .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2025-03-08 04:35:22,049 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse1 .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2025-03-08 04:35:22,105 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse1 .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2025-03-08 04:35:22,108 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse1 .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2025-03-08 04:35:22,196 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:35:22,196 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:35:22,197 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 50 treesize of output 30 [2025-03-08 04:35:22,222 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$#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_~last~1#1.base|) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse1 .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2025-03-08 04:35:22,224 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$#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_~last~1#1.base|) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse1 .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2025-03-08 04:35:22,334 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (let ((.cse3 (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_22| Int)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select .cse4 |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_22|))))) (or (and .cse3 (= .cse1 .cse0)) (and .cse3 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select .cse4 0))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2025-03-08 04:35:22,337 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (let ((.cse4 (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (let ((.cse3 (exists ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_22| Int)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select .cse4 |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_22|))))) (or (and .cse3 (= .cse1 .cse0)) (and .cse3 (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| (select .cse4 0))))) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2025-03-08 04:35:22,368 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:35:22,369 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-08 04:35:22,410 INFO L349 Elim1Store]: treesize reduction 149, result has 21.2 percent of original size [2025-03-08 04:35:22,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 7 select indices, 7 select index equivalence classes, 0 disjoint index pairs (out of 21 index pairs), introduced 8 new quantified variables, introduced 20 case distinctions, treesize of input 122 treesize of output 87 [2025-03-08 04:35:22,470 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0))) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (= (select (select |c_#memory_$Pointer$#1.base| |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~mem13#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from false [2025-03-08 04:35:22,473 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0))) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (= (select (select |c_#memory_$Pointer$#1.base| |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~mem13#1.base|) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from true [2025-03-08 04:35:22,521 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0))) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from false [2025-03-08 04:35:22,523 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse1 (select |v_old(#valid)_AFTER_CALL_15| .cse1))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0))) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |v_#valid_BEFORE_CALL_15| .cse2))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse3) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from true [2025-03-08 04:35:22,552 INFO L349 Elim1Store]: treesize reduction 47, result has 2.1 percent of original size [2025-03-08 04:35:22,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 79 treesize of output 36 [2025-03-08 04:35:22,567 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-08 04:35:22,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 21 [2025-03-08 04:35:22,579 INFO L378 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 67 treesize of output 26 [2025-03-08 04:35:22,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 26 treesize of output 15 [2025-03-08 04:35:22,634 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-03-08 04:35:22,635 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 64 treesize of output 56 [2025-03-08 04:35:22,654 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-08 04:35:22,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 21 [2025-03-08 04:35:25,583 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (let ((.cse4 (exists ((v_arrayElimIndex_6 Int) (v_arrayElimCell_92 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_92) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse11 (select |v_old(#valid)_AFTER_CALL_15| .cse11))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| v_arrayElimCell_92) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 0))))) (or (exists ((v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 0))))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))))))) (and .cse4 (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1))))) (exists ((v_arrayElimIndex_6 Int) (v_arrayElimCell_93 Int) (v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_93) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse8 (select |v_old(#valid)_AFTER_CALL_15| .cse8))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimCell_93) 1) (= (select |v_old(#valid)_AFTER_CALL_15| v_arrayElimCell_93) 1) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_93) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 0))) (and .cse4 (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse9 (select |v_#valid_BEFORE_CALL_15| .cse9))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse10) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|)) (= (select |v_#valid_BEFORE_CALL_15| .cse10) 1))))))) (= (select (select |c_#memory_int#2| .cse3) 4) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from false [2025-03-08 04:35:25,587 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (let ((.cse4 (exists ((v_arrayElimIndex_6 Int) (v_arrayElimCell_92 Int) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_92) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (let ((.cse11 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse11 (select |v_old(#valid)_AFTER_CALL_15| .cse11))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| v_arrayElimCell_92) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 0))))) (or (exists ((v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (exists ((|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (exists ((|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (exists ((v_arrayElimIndex_6 Int) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 0))))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))))))) (and .cse4 (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (not (= |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| |c_ULTIMATE.start_main_~#s~0#1.base|)) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1))))) (exists ((v_arrayElimIndex_6 Int) (v_arrayElimCell_93 Int) (v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_93) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse7 (select |v_#valid_BEFORE_CALL_15| .cse7))) |v_#valid_BEFORE_CALL_15|) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse8 (select |v_old(#valid)_AFTER_CALL_15| .cse8))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimCell_93) 1) (= (select |v_old(#valid)_AFTER_CALL_15| v_arrayElimCell_93) 1) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_93) 0) (= (select |v_old(#valid)_AFTER_CALL_15| .cse3) 0))) (and .cse4 (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse9 (select |v_#valid_BEFORE_CALL_15| .cse9))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse10) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (not (= |c_ULTIMATE.start_main_~#s~0#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|)) (= (select |v_#valid_BEFORE_CALL_15| .cse10) 1))))))) (= (select (select |c_#memory_int#2| .cse3) 4) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0))) is different from true [2025-03-08 04:35:25,743 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:35:25,743 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 337 treesize of output 353 [2025-03-08 04:35:25,831 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:35:25,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 278 treesize of output 334 [2025-03-08 04:35:31,322 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse4 (exists ((v_arrayElimCell_92 Int) (v_prenex_101 (Array Int Int)) (v_prenex_98 Int) (v_prenex_102 (Array Int Int))) (and (= (select v_prenex_102 v_prenex_98) 1) (= (select v_prenex_101 v_arrayElimCell_92) 1) (= (select v_prenex_102 v_arrayElimCell_92) 0) (= (select v_prenex_101 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse7 (@diff v_prenex_102 v_prenex_101))) (store v_prenex_102 .cse7 (select v_prenex_101 .cse7))) v_prenex_101))))) (or (exists ((v_prenex_106 Int) (v_prenex_109 (Array Int Int)) (v_prenex_104 Int) (v_prenex_110 (Array Int Int))) (and (= (select v_prenex_109 v_prenex_106) 1) (= (select v_prenex_110 v_prenex_104) 1) (= v_prenex_109 (let ((.cse0 (@diff v_prenex_110 v_prenex_109))) (store v_prenex_110 .cse0 (select v_prenex_109 .cse0)))) (= (select v_prenex_109 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_110 v_prenex_106) 0))) (exists ((v_arrayElimIndex_6 Int) (v_arrayElimCell_93 Int) (v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_93) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimCell_93) 1) (= (select |v_old(#valid)_AFTER_CALL_15| v_arrayElimCell_93) 1) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_93) 0))) (and (exists ((v_prenex_99 Int) (v_prenex_100 (Array Int Int)) (v_prenex_103 (Array Int Int))) (and (= (select v_prenex_100 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse3 (@diff v_prenex_100 v_prenex_103))) (store v_prenex_100 .cse3 (select v_prenex_103 .cse3))) v_prenex_103) (= (select v_prenex_103 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_100 v_prenex_99) 1))) .cse4) .cse4 (exists ((v_arrayElimCell_96 Int)) (and (exists ((v_prenex_119 (Array Int Int)) (v_prenex_114 Int) (v_prenex_116 (Array Int Int))) (and (= v_prenex_119 (let ((.cse5 (@diff v_prenex_116 v_prenex_119))) (store v_prenex_116 .cse5 (select v_prenex_119 .cse5)))) (= (select v_prenex_119 v_arrayElimCell_96) 1) (= (select v_prenex_116 v_arrayElimCell_96) 0) (= (select v_prenex_116 v_prenex_114) 1))) (exists ((v_prenex_118 (Array Int Int)) (v_prenex_113 Int) (v_prenex_117 (Array Int Int))) (and (= (select v_prenex_118 v_arrayElimCell_96) 0) (= (select v_prenex_117 v_arrayElimCell_96) 1) (= (select v_prenex_117 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_118 v_prenex_113) 1) (= (let ((.cse6 (@diff v_prenex_118 v_prenex_117))) (store v_prenex_118 .cse6 (select v_prenex_117 .cse6))) v_prenex_117))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from false [2025-03-08 04:35:31,350 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse4 (exists ((v_arrayElimCell_92 Int) (v_prenex_101 (Array Int Int)) (v_prenex_98 Int) (v_prenex_102 (Array Int Int))) (and (= (select v_prenex_102 v_prenex_98) 1) (= (select v_prenex_101 v_arrayElimCell_92) 1) (= (select v_prenex_102 v_arrayElimCell_92) 0) (= (select v_prenex_101 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse7 (@diff v_prenex_102 v_prenex_101))) (store v_prenex_102 .cse7 (select v_prenex_101 .cse7))) v_prenex_101))))) (or (exists ((v_prenex_106 Int) (v_prenex_109 (Array Int Int)) (v_prenex_104 Int) (v_prenex_110 (Array Int Int))) (and (= (select v_prenex_109 v_prenex_106) 1) (= (select v_prenex_110 v_prenex_104) 1) (= v_prenex_109 (let ((.cse0 (@diff v_prenex_110 v_prenex_109))) (store v_prenex_110 .cse0 (select v_prenex_109 .cse0)))) (= (select v_prenex_109 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_110 v_prenex_106) 0))) (exists ((v_arrayElimIndex_6 Int) (v_arrayElimCell_93 Int) (v_arrayElimIndex_3 Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimCell_93) 0) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimIndex_6) 1) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| v_arrayElimCell_93) 1) (= (select |v_old(#valid)_AFTER_CALL_15| v_arrayElimCell_93) 1) (= (select |v_old(#valid)_AFTER_CALL_16| v_arrayElimCell_93) 0))) (and (exists ((v_prenex_99 Int) (v_prenex_100 (Array Int Int)) (v_prenex_103 (Array Int Int))) (and (= (select v_prenex_100 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (let ((.cse3 (@diff v_prenex_100 v_prenex_103))) (store v_prenex_100 .cse3 (select v_prenex_103 .cse3))) v_prenex_103) (= (select v_prenex_103 |c_ULTIMATE.start_main_~ptr~0#1.base|) 1) (= (select v_prenex_100 v_prenex_99) 1))) .cse4) .cse4 (exists ((v_arrayElimCell_96 Int)) (and (exists ((v_prenex_119 (Array Int Int)) (v_prenex_114 Int) (v_prenex_116 (Array Int Int))) (and (= v_prenex_119 (let ((.cse5 (@diff v_prenex_116 v_prenex_119))) (store v_prenex_116 .cse5 (select v_prenex_119 .cse5)))) (= (select v_prenex_119 v_arrayElimCell_96) 1) (= (select v_prenex_116 v_arrayElimCell_96) 0) (= (select v_prenex_116 v_prenex_114) 1))) (exists ((v_prenex_118 (Array Int Int)) (v_prenex_113 Int) (v_prenex_117 (Array Int Int))) (and (= (select v_prenex_118 v_arrayElimCell_96) 0) (= (select v_prenex_117 v_arrayElimCell_96) 1) (= (select v_prenex_117 |c_ULTIMATE.start_main_~ptr~0#1.base|) 0) (= (select v_prenex_118 v_prenex_113) 1) (= (let ((.cse6 (@diff v_prenex_118 v_prenex_117))) (store v_prenex_118 .cse6 (select v_prenex_117 .cse6))) v_prenex_117))))))) (= |c_ULTIMATE.start_main_~ptr~0#1.offset| 0) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_main_~ptr~0#1.base|) 4) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1)) is different from true [2025-03-08 04:35:35,382 INFO L378 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 [2025-03-08 04:35:35,404 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 16 not checked. [2025-03-08 04:35:35,404 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:35:35,469 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_789 (Array Int Int)) (v_ArrVal_793 (Array Int Int))) (or (not (= v_ArrVal_789 (store (select |c_#memory_int#2| |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_789 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_789) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_793) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#1.base| |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_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#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_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) is different from false [2025-03-08 04:35:35,531 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (or (forall ((|ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| Int)) (not (= (select .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)))) (forall ((v_ArrVal_789 (Array Int Int)) (v_ArrVal_793 (Array Int Int))) (or (not (= v_ArrVal_789 (store (select |c_#memory_int#2| |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_789 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_789) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_793) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse0 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#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_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))))) is different from false [2025-03-08 04:35:35,541 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (or (forall ((v_ArrVal_789 (Array Int Int)) (v_ArrVal_793 (Array Int Int))) (or (not (= v_ArrVal_789 (store (select |c_#memory_int#2| |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_789 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_789) .cse0 v_ArrVal_793) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#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_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_24| Int)) (not (= (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) (select (select |c_#memory_$Pointer$#2.base| .cse0) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_24|)))))) is different from false [2025-03-08 04:35:35,562 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)))) (or (forall ((v_ArrVal_789 (Array Int Int)) (v_ArrVal_793 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_789) .cse0 v_ArrVal_793) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store (select |c_#memory_$Pointer$#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_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_789 (store (select |c_#memory_int#2| |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_789 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_24| Int)) (not (= (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) (select (select |c_#memory_$Pointer$#2.base| .cse0) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_24|)))))) is different from false [2025-03-08 04:35:35,582 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse3 (select .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse0 (let ((.cse4 (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| .cse3) .cse4)) (select (select |c_#memory_$Pointer$#2.offset| .cse3) .cse4))))) (or (forall ((v_ArrVal_789 (Array Int Int)) (v_ArrVal_793 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_789) .cse0 v_ArrVal_793) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse1 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (not (= v_ArrVal_789 (store (select |c_#memory_int#2| |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_789 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)))))) (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_24| Int)) (not (= .cse3 (select (select |c_#memory_$Pointer$#2.base| .cse0) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_24|)))))))) is different from false [2025-03-08 04:35:35,595 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse3 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse1 (let ((.cse4 (select .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse4)) (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse4))))) (or (forall ((|v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_24| Int)) (not (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) |v_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset_24|)))) (forall ((v_ArrVal_789 (Array Int Int)) (v_ArrVal_793 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_789) .cse1 v_ArrVal_793) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse2 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse3 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)))) (not (= v_ArrVal_789 (store (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| (select v_ArrVal_789 |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)))))))))) is different from false [2025-03-08 04:35:35,656 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:35:35,657 INFO L378 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 654 treesize of output 644 [2025-03-08 04:35:35,671 INFO L378 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 125 treesize of output 93 [2025-03-08 04:35:35,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:35:35,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 183 treesize of output 183 [2025-03-08 04:35:35,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [31443778] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:35:35,938 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:35:35,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 27] total 41 [2025-03-08 04:35:35,938 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [586803518] [2025-03-08 04:35:35,938 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:35:35,938 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-08 04:35:35,938 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:35:35,939 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-08 04:35:35,939 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=113, Invalid=805, Unknown=40, NotChecked=1694, Total=2652 [2025-03-08 04:35:35,939 INFO L87 Difference]: Start difference. First operand 57 states and 66 transitions. Second operand has 41 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 33 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 04:35:36,084 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from false [2025-03-08 04:35:36,085 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 1) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (not (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_#valid| (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |c_#valid| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.base|) 0))) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_#t~ret5#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.base| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)) is different from true [2025-03-08 04:35:36,089 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (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_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select .cse1 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |c_#valid| .cse2)))) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (= (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) is different from false [2025-03-08 04:35:36,091 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|)) (.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|))) (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_sll_circular_create_~last~0#1.offset| |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.base| (select .cse0 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| (select .cse1 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_~last~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 1) (= |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset| 0) (= (select .cse1 0) 0) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse2 (select |c_#valid| .cse2)))) (= 1 (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|)))) (= (select .cse0 |c_ULTIMATE.start_sll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_sll_circular_create_~last~0#1.base|))) is different from true [2025-03-08 04:35:36,093 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) (.cse0 (select .cse4 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse1 (select .cse4 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (select (select |c_#memory_$Pointer$#2.offset| .cse0) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse0) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (select .cse2 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse1) (= (select .cse2 0) 0)) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)))))) is different from false [2025-03-08 04:35:36,094 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_create_#res#1.base|))) (let ((.cse2 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_create_#res#1.base|)) (.cse0 (select .cse4 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (.cse1 (select .cse4 0))) (and (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (select (select |c_#memory_$Pointer$#2.offset| .cse0) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| 0) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse0) |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= |c_ULTIMATE.start_sll_circular_create_#res#1.offset| (select .cse2 |c_ULTIMATE.start_sll_circular_create_#res#1.offset|)) (or (= |c_ULTIMATE.start_sll_circular_create_#res#1.base| .cse1) (= (select .cse2 0) 0)) (= (select |c_#valid| .cse0) 1) (= (select |c_#valid| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 1) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 1) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |c_#valid| .cse3)))) (= (select |v_old(#valid)_AFTER_CALL_14| |c_ULTIMATE.start_sll_circular_create_#res#1.base|) 0)))))) is different from true [2025-03-08 04:35:36,097 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse5) .cse1)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~data#1| 1) (= |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|) (= .cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse5) 1) (= .cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse5) .cse1)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse2 .cse3)) (= (select |c_#valid| .cse2) 1) (= .cse1 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1) .cse6)))) is different from false [2025-03-08 04:35:36,098 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse5) .cse1)) (.cse6 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~data#1| 1) (= |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|) (= .cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (exists ((|v_old(#valid)_AFTER_CALL_14| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |c_#valid| .cse4)))) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_14| .cse3) 1))) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select |c_#valid| .cse5) 1) (= .cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse5) .cse1)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse2 .cse3)) (= (select |c_#valid| .cse2) 1) (= .cse1 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1) .cse6)))) is different from true [2025-03-08 04:35:36,102 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from false [2025-03-08 04:35:36,104 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_node_create_#in~data#1| |c_node_create_~data#1|) (= |c_node_create_~temp~0#1.offset| 0) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse0 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse0 (select |v_#valid_BEFORE_CALL_15| .cse0))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse1) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse1) 1)))) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|) (= (select |c_#valid| |c_node_create_~temp~0#1.base|) 1) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|)) is different from true [2025-03-08 04:35:36,107 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse3 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1)))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse3) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 4) |c_node_create_#in~data#1|))) is different from false [2025-03-08 04:35:36,109 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (@diff |c_old(#memory_$Pointer$#2.offset)| |c_#memory_$Pointer$#2.offset|)) (.cse3 (@diff |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|))) (and (= |c_node_create_#res#1.offset| 0) (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#2.offset| |c_old(#memory_$Pointer$#2.offset)|)) (= (select |c_old(#valid)| |c_node_create_#res#1.base|) 0) (= (store |c_old(#memory_$Pointer$#2.offset)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.offset| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.offset|) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (= (store |c_old(#memory_$Pointer$#2.offset)| .cse0 (select |c_#memory_$Pointer$#2.offset| .cse0)) |c_#memory_$Pointer$#2.offset|) (= (store |c_old(#memory_$Pointer$#2.base)| |c_node_create_#res#1.base| (select |c_#memory_$Pointer$#2.base| |c_node_create_#res#1.base|)) |c_#memory_$Pointer$#2.base|) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse2 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse1 (select |v_#valid_BEFORE_CALL_15| .cse1))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse2) 1)))) (or (= |c_old(#memory_$Pointer$#2.base)| |c_#memory_$Pointer$#2.base|) (= (select |c_old(#valid)| .cse3) 0)) (= (store |c_old(#memory_$Pointer$#2.base)| .cse3 (select |c_#memory_$Pointer$#2.base| .cse3)) |c_#memory_$Pointer$#2.base|) (= (select (select |c_#memory_int#2| |c_node_create_#res#1.base|) 4) |c_node_create_#in~data#1|))) is different from true [2025-03-08 04:35:36,118 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse7) .cse1)) (.cse6 (select (select |c_#memory_$Pointer$#1.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 (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse2 .cse3)) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1)))) (= .cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse7) .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse8 (select |v_old(#valid)_AFTER_CALL_15| .cse8))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0))) (= .cse1 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1) .cse6)))) is different from false [2025-03-08 04:35:36,120 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse7) .cse1)) (.cse6 (select (select |c_#memory_$Pointer$#1.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 (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) .cse2) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_main_~#s~0#1.offset|) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) (= .cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (or (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse2) (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse2 .cse3)) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1)))) (= .cse6 (select (select |c_#memory_$Pointer$#2.offset| .cse7) .cse1)) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) 0) (= (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse8 (select |v_old(#valid)_AFTER_CALL_15| .cse8))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0))) (= .cse1 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1) .cse6)))) is different from true [2025-03-08 04:35:36,127 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse8) .cse1)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) .cse2) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= .cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1)))) (= .cse7 (select (select |c_#memory_$Pointer$#2.offset| .cse8) .cse1)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse2 .cse3) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse2)) (= .cse1 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1) .cse7)))) is different from false [2025-03-08 04:35:36,130 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse2) 0)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse8) .cse1)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse1) .cse2) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse2) 1) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse4 (select |v_old(#valid)_AFTER_CALL_15| .cse4))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse2) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= .cse2 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse5 (select |v_#valid_BEFORE_CALL_15| .cse5))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse6) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse6) 1)))) (= .cse7 (select (select |c_#memory_$Pointer$#2.offset| .cse8) .cse1)) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse2) 0) 0) (= .cse2 .cse3) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse2)) (= .cse1 0) (= (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse1) .cse7)))) is different from true [2025-03-08 04:35:36,136 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= .cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1)))) (= .cse3 (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse7)) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse7) .cse1) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse1 .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= .cse7 0)))) is different from false [2025-03-08 04:35:36,138 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse6 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (.cse7 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= .cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse3) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1)))) (= .cse3 (select (select |c_#memory_$Pointer$#2.offset| .cse6) .cse7)) (= (select (select |c_#memory_$Pointer$#2.base| .cse6) .cse7) .cse1) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse1) 0) 0) (= .cse1 .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= .cse7 0)))) is different from true [2025-03-08 04:35:36,145 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse2)) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse5 (select |v_old(#valid)_AFTER_CALL_15| .cse5))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse4) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= .cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2) .cse4) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0) 0) (= .cse4 .cse3) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2025-03-08 04:35:36,148 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse2 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| .cse4) 0))) (and (= .cse0 (select (select |c_#memory_$Pointer$#2.offset| .cse1) .cse2)) (= (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse4) 1) (= (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse5 (select |v_old(#valid)_AFTER_CALL_15| .cse5))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse4) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= .cse4 (select (select |c_#memory_$Pointer$#2.base| .cse3) 0)) (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| .cse0) (= |c_ULTIMATE.start_main_~data~0#1| 1) (= (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse2) .cse4) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse7 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse6 (select |v_#valid_BEFORE_CALL_15| .cse6))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse7) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse7) 1)))) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (or (= (select (select |c_#memory_$Pointer$#2.offset| .cse4) 0) 0) (= .cse4 .cse3) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse4)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2025-03-08 04:35:36,155 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= .cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse3) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse0 .cse1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2025-03-08 04:35:36,157 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0))) (and (= (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|) .cse0) (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse0) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0)) (= .cse3 (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse4 (select |v_#valid_BEFORE_CALL_15| .cse4))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse5) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse5) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) .cse3) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse0 .cse1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse0)) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2025-03-08 04:35:36,170 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$#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_~last~1#1.base|) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse1 .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from false [2025-03-08 04:35:36,172 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) 0))) (and (exists ((|v_old(#valid)_AFTER_CALL_15| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_16| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_16| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_15| .cse1) 1) (= (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_16| |v_old(#valid)_AFTER_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_16| .cse2 (select |v_old(#valid)_AFTER_CALL_15| .cse2))) |v_old(#valid)_AFTER_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_15| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_16| .cse1) 0))) (= (select (select |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) 4) 1) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| 0) (= |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|) (= .cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) 0)) (= |c_ULTIMATE.start_main_~data~0#1| 1) (exists ((v_arrayElimIndex_3 Int) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6| Int) (|v_old(#valid)_AFTER_CALL_14| (Array Int Int)) (|v_#valid_BEFORE_CALL_15| (Array Int Int)) (|v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6| Int)) (let ((.cse4 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|))) (and (= (select (select |c_#memory_$Pointer$#1.offset| |v_ULTIMATE.start_sll_circular_prepend_~head#1.base_BEFORE_CALL_6|) |v_ULTIMATE.start_sll_circular_prepend_~head#1.offset_BEFORE_CALL_6|) 0) (= (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_14| |v_#valid_BEFORE_CALL_15|))) (store |v_old(#valid)_AFTER_CALL_14| .cse3 (select |v_#valid_BEFORE_CALL_15| .cse3))) |v_#valid_BEFORE_CALL_15|) (= (select |v_old(#valid)_AFTER_CALL_14| .cse4) 0) (= (select |v_old(#valid)_AFTER_CALL_14| v_arrayElimIndex_3) 1) (= (select |v_#valid_BEFORE_CALL_15| .cse4) 1)))) (= (select (select |c_#memory_$Pointer$#2.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (select (select |c_#memory_$Pointer$#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_~last~1#1.base|) (or (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset| 0) (= .cse1 .cse0) (= |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| .cse1)) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.offset|) (= |c_ULTIMATE.start_sll_circular_prepend_#t~mem12#1.base| |c_ULTIMATE.start_sll_circular_prepend_#t~mem13#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 0)))) is different from true [2025-03-08 04:35:36,252 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:35:36,252 INFO L93 Difference]: Finished difference Result 72 states and 85 transitions. [2025-03-08 04:35:36,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-08 04:35:36,252 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 33 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 38 [2025-03-08 04:35:36,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:35:36,253 INFO L225 Difference]: With dead ends: 72 [2025-03-08 04:35:36,253 INFO L226 Difference]: Without dead ends: 59 [2025-03-08 04:35:36,254 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 23 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 34 IntricatePredicates, 0 DeprecatedPredicates, 124 ImplicationChecksByTransitivity, 7.3s TimeCoverageRelationStatistics Valid=148, Invalid=916, Unknown=64, NotChecked=3162, Total=4290 [2025-03-08 04:35:36,254 INFO L435 NwaCegarLoop]: 26 mSDtfsCounter, 0 mSDsluCounter, 268 mSDsCounter, 0 mSdLazyCounter, 222 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 294 SdHoareTripleChecker+Invalid, 1387 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 222 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1151 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-08 04:35:36,254 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 294 Invalid, 1387 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 222 Invalid, 0 Unknown, 1151 Unchecked, 0.2s Time] [2025-03-08 04:35:36,254 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 59 states. [2025-03-08 04:35:36,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 59 to 59. [2025-03-08 04:35:36,260 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 59 states, 50 states have (on average 1.16) internal successors, (58), 50 states have internal predecessors, (58), 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) [2025-03-08 04:35:36,261 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 59 states to 59 states and 68 transitions. [2025-03-08 04:35:36,261 INFO L78 Accepts]: Start accepts. Automaton has 59 states and 68 transitions. Word has length 38 [2025-03-08 04:35:36,261 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:35:36,261 INFO L471 AbstractCegarLoop]: Abstraction has 59 states and 68 transitions. [2025-03-08 04:35:36,261 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 38 states have (on average 1.4210526315789473) internal successors, (54), 33 states have internal predecessors, (54), 6 states have call successors, (6), 4 states have call predecessors, (6), 4 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 04:35:36,261 INFO L276 IsEmpty]: Start isEmpty. Operand 59 states and 68 transitions. [2025-03-08 04:35:36,262 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-08 04:35:36,262 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:35:36,262 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:35:36,268 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-03-08 04:35:36,464 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5,6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:36,464 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:35:36,464 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:35:36,464 INFO L85 PathProgramCache]: Analyzing trace with hash -363298021, now seen corresponding path program 1 times [2025-03-08 04:35:36,464 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:35:36,464 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1351555400] [2025-03-08 04:35:36,464 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:36,464 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:35:36,476 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 04:35:36,496 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 04:35:36,496 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:36,497 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:37,891 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:35:37,892 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:35:37,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1351555400] [2025-03-08 04:35:37,892 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1351555400] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:35:37,892 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1197697363] [2025-03-08 04:35:37,892 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:37,892 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:37,892 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:35:37,894 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:35:37,894 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-08 04:35:37,973 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-08 04:35:38,003 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-08 04:35:38,003 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:38,003 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:38,006 INFO L256 TraceCheckSpWp]: Trace formula consists of 366 conjuncts, 136 conjuncts are in the unsatisfiable core [2025-03-08 04:35:38,009 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:35:38,045 INFO L378 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 [2025-03-08 04:35:38,183 INFO L378 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 [2025-03-08 04:35:38,237 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:35:38,237 INFO L378 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 [2025-03-08 04:35:38,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2025-03-08 04:35:38,280 INFO L378 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 [2025-03-08 04:35:38,329 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-08 04:35:38,329 INFO L378 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 50 treesize of output 45 [2025-03-08 04:35:38,332 INFO L378 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 24 treesize of output 11 [2025-03-08 04:35:38,443 INFO L378 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 30 treesize of output 14 [2025-03-08 04:35:38,447 INFO L378 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 15 treesize of output 7 [2025-03-08 04:35:38,450 INFO L378 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 11 treesize of output 3 [2025-03-08 04:35:38,631 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-03-08 04:35:38,632 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 20 treesize of output 23 [2025-03-08 04:35:38,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:35:38,647 INFO L378 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 38 treesize of output 27 [2025-03-08 04:35:38,661 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-03-08 04:35:38,662 INFO L378 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 [2025-03-08 04:35:39,190 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-08 04:35:39,191 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 21 [2025-03-08 04:35:39,196 INFO L378 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 192 treesize of output 129 [2025-03-08 04:35:39,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2025-03-08 04:35:39,203 INFO L378 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 37 treesize of output 11 [2025-03-08 04:35:39,207 INFO L378 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 69 treesize of output 47 [2025-03-08 04:35:39,220 INFO L349 Elim1Store]: treesize reduction 60, result has 20.0 percent of original size [2025-03-08 04:35:39,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 140 treesize of output 83 [2025-03-08 04:35:39,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 15 [2025-03-08 04:35:39,295 INFO L378 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 78 treesize of output 50 [2025-03-08 04:35:39,393 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 04:35:39,393 INFO L378 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 47 treesize of output 26 [2025-03-08 04:35:39,398 INFO L378 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 [2025-03-08 04:35:39,492 INFO L134 CoverageAnalysis]: Checked inductivity of 20 backedges. 7 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:35:39,493 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:35:39,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:35:39,627 INFO L378 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 101 treesize of output 102 [2025-03-08 04:35:39,635 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-08 04:35:39,635 INFO L378 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 204 treesize of output 207 [2025-03-08 04:35:39,639 INFO L378 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 88 treesize of output 74 [2025-03-08 04:35:39,758 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))))) (let ((.cse0 (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse10 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse11 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse9))) (and (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_arrayElimCell_137 Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse8 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_958) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_960) (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_954) .cse9) .cse10)))) (or (forall ((v_arrayElimCell_138 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 (+ v_arrayElimCell_138 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse8 (+ v_arrayElimCell_137 4)))))) (or (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_arrayElimCell_137 Int) (v_ArrVal_960 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_958) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_960) (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_954) .cse9) .cse10)) (+ v_arrayElimCell_137 4)))) .cse11) (or (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int)) (v_arrayElimCell_138 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_958) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_960) (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_954) .cse9) .cse10)) (+ v_arrayElimCell_138 4)))) (not .cse11)))))) (.cse5 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ (select .cse7 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4)) (.cse6 (= |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| .cse1))) (and (or .cse0 (= .cse1 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_958) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_960) (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_954) .cse1) .cse5)))) (or (forall ((v_arrayElimCell_138 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 (+ v_arrayElimCell_138 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 .cse3))))) (or .cse0 (= .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) (or (not .cse6) (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int)) (v_arrayElimCell_138 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_958) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_960) (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_954) .cse1) .cse5)) (+ v_arrayElimCell_138 4))))) (or (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_958) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_960) (select (select (store .cse4 |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base| v_ArrVal_954) .cse1) .cse5)) .cse3))) .cse6))))) is different from false [2025-03-08 04:35:39,991 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse13 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse4 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| (select .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)))) (.cse5 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~last~1#1.offset|))) (let ((.cse2 (= .cse5 .cse3)) (.cse1 (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse9 (= .cse3 .cse10)) (.cse11 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (not .cse9) (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int)) (v_arrayElimCell_138 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_958) .cse3 v_ArrVal_960) (select (select (store .cse4 .cse3 v_ArrVal_954) .cse10) .cse11)) (+ v_arrayElimCell_138 4))))) (or .cse9 (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_arrayElimCell_137 Int) (v_ArrVal_960 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_958) .cse3 v_ArrVal_960) (select (select (store .cse4 .cse3 v_ArrVal_954) .cse10) .cse11)) (+ v_arrayElimCell_137 4))))) (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_arrayElimCell_137 Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse12 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_958) .cse3 v_ArrVal_960) (select (select (store .cse4 .cse3 v_ArrVal_954) .cse10) .cse11)))) (or (forall ((v_arrayElimCell_138 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ v_arrayElimCell_138 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse12 (+ v_arrayElimCell_137 4)))))))))) (.cse6 (+ (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|) 4)) (.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (= .cse0 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|) .cse1) (or .cse2 (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_958) .cse3 v_ArrVal_960) (select (select (store .cse4 .cse3 v_ArrVal_954) .cse5) .cse0)) .cse6) |c_ULTIMATE.start_main_~data~0#1|))) (or (not .cse2) (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int)) (v_arrayElimCell_138 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_958) .cse3 v_ArrVal_960) (select (select (store .cse4 .cse3 v_ArrVal_954) .cse5) .cse0)) (+ v_arrayElimCell_138 4))))) (or (= .cse5 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse1) (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (let ((.cse7 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_958) .cse3 v_ArrVal_960) (select (select (store .cse4 .cse3 v_ArrVal_954) .cse5) .cse0)))) (or (forall ((v_arrayElimCell_138 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse7 (+ v_arrayElimCell_138 4)))) (= (select .cse7 .cse6) |c_ULTIMATE.start_main_~data~0#1|)))))))) is different from false [2025-03-08 04:35:40,128 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse8 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse13 (select .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse15 (select .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse2 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse15))) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse15) .cse13)) (.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse14 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse0 (= .cse1 .cse3)) (.cse6 (+ .cse13 4)) (.cse7 (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (= .cse1 .cse10))) (and (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_arrayElimCell_137 Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse9 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_958) .cse1 v_ArrVal_960) (select (select (store .cse2 .cse1 v_ArrVal_954) .cse10) .cse11)))) (or (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 (+ v_arrayElimCell_137 4))) (forall ((v_arrayElimCell_138 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse9 (+ v_arrayElimCell_138 4))))))) (or (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_arrayElimCell_137 Int) (v_ArrVal_960 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_958) .cse1 v_ArrVal_960) (select (select (store .cse2 .cse1 v_ArrVal_954) .cse10) .cse11)) (+ v_arrayElimCell_137 4)))) .cse12) (or (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int)) (v_arrayElimCell_138 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_958) .cse1 v_ArrVal_960) (select (select (store .cse2 .cse1 v_ArrVal_954) .cse10) .cse11)) (+ v_arrayElimCell_138 4)))) (not .cse12)))))) (.cse4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse8 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (and (or (not .cse0) (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int)) (v_arrayElimCell_138 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_958) .cse1 v_ArrVal_960) (select (select (store .cse2 .cse1 v_ArrVal_954) .cse3) .cse4)) (+ v_arrayElimCell_138 4))))) (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (let ((.cse5 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_958) .cse1 v_ArrVal_960) (select (select (store .cse2 .cse1 v_ArrVal_954) .cse3) .cse4)))) (or (= (select .cse5 .cse6) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_138 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse5 (+ v_arrayElimCell_138 4))))))) (or .cse0 (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| v_ArrVal_958) .cse1 v_ArrVal_960) (select (select (store .cse2 .cse1 v_ArrVal_954) .cse3) .cse4)) .cse6) |c_ULTIMATE.start_main_~data~0#1|))) (or (= .cse3 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) .cse7) (or .cse7 (= .cse4 |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|))))))) is different from false [2025-03-08 04:35:40,232 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse15 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse9 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse8 (select .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse14 (select .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse15 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse5 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base|) |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse14))) (.cse4 (select (select |c_#memory_$Pointer$#2.base| .cse14) .cse8))) (let ((.cse0 (let ((.cse10 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|))) (let ((.cse11 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse12 (= .cse4 .cse10))) (and (or (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_arrayElimCell_137 Int) (v_ArrVal_960 (Array Int Int))) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_958) .cse4 v_ArrVal_960) (select (select (store .cse5 .cse4 v_ArrVal_954) .cse10) .cse11)) (+ v_arrayElimCell_137 4)))) .cse12) (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_arrayElimCell_137 Int) (v_ArrVal_960 (Array Int Int))) (let ((.cse13 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_958) .cse4 v_ArrVal_960) (select (select (store .cse5 .cse4 v_ArrVal_954) .cse10) .cse11)))) (or (forall ((v_arrayElimCell_138 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ v_arrayElimCell_138 4)))) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse13 (+ v_arrayElimCell_137 4)))))) (or (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int)) (v_arrayElimCell_138 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_958) .cse4 v_ArrVal_960) (select (select (store .cse5 .cse4 v_ArrVal_954) .cse10) .cse11)) (+ v_arrayElimCell_138 4)))) (not .cse12)))))) (.cse7 (= .cse1 .cse4)) (.cse6 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse9 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse3 (+ .cse8 4))) (and (or .cse0 (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| .cse1)) (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (let ((.cse2 (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_958) .cse4 v_ArrVal_960) (select (select (store .cse5 .cse4 v_ArrVal_954) .cse1) .cse6)))) (or (= (select .cse2 .cse3) |c_ULTIMATE.start_main_~data~0#1|) (forall ((v_arrayElimCell_138 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select .cse2 (+ v_arrayElimCell_138 4))))))) (or (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int)) (v_arrayElimCell_138 Int)) (= |c_ULTIMATE.start_main_~data~0#1| (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_958) .cse4 v_ArrVal_960) (select (select (store .cse5 .cse4 v_ArrVal_954) .cse1) .cse6)) (+ v_arrayElimCell_138 4)))) (not .cse7)) (or .cse0 (= |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.offset| .cse6)) (or .cse7 (forall ((v_ArrVal_954 (Array Int Int)) (v_ArrVal_958 (Array Int Int)) (v_ArrVal_960 (Array Int Int))) (= (select (select (store (store |c_#memory_int#2| |c_ULTIMATE.start_sll_circular_prepend_#t~ret9#1.base| v_ArrVal_958) .cse4 v_ArrVal_960) (select (select (store .cse5 .cse4 v_ArrVal_954) .cse1) .cse6)) .cse3) |c_ULTIMATE.start_main_~data~0#1|)))))))) is different from false [2025-03-08 04:35:43,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1197697363] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:35:43,894 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-03-08 04:35:43,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 50 [2025-03-08 04:35:43,895 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [728568728] [2025-03-08 04:35:43,895 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-03-08 04:35:43,895 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 50 states [2025-03-08 04:35:43,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-08 04:35:43,895 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 50 interpolants. [2025-03-08 04:35:43,896 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=150, Invalid=2724, Unknown=4, NotChecked=428, Total=3306 [2025-03-08 04:35:43,896 INFO L87 Difference]: Start difference. First operand 59 states and 68 transitions. Second operand has 50 states, 46 states have (on average 1.391304347826087) internal successors, (64), 41 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 04:35:47,552 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-08 04:35:47,553 INFO L93 Difference]: Finished difference Result 88 states and 101 transitions. [2025-03-08 04:35:47,553 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-03-08 04:35:47,553 INFO L78 Accepts]: Start accepts. Automaton has has 50 states, 46 states have (on average 1.391304347826087) internal successors, (64), 41 states have internal predecessors, (64), 6 states have call successors, (6), 4 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 39 [2025-03-08 04:35:47,553 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-08 04:35:47,555 INFO L225 Difference]: With dead ends: 88 [2025-03-08 04:35:47,555 INFO L226 Difference]: Without dead ends: 86 [2025-03-08 04:35:47,557 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 24 SyntacticMatches, 0 SemanticMatches, 89 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1537 ImplicationChecksByTransitivity, 7.5s TimeCoverageRelationStatistics Valid=413, Invalid=7081, Unknown=4, NotChecked=692, Total=8190 [2025-03-08 04:35:47,557 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 79 mSDsluCounter, 303 mSDsCounter, 0 mSdLazyCounter, 1210 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 316 SdHoareTripleChecker+Invalid, 1231 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 1210 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-03-08 04:35:47,557 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 316 Invalid, 1231 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 1210 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2025-03-08 04:35:47,557 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 86 states. [2025-03-08 04:35:47,567 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 86 to 66. [2025-03-08 04:35:47,567 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 57 states have (on average 1.1403508771929824) internal successors, (65), 57 states have internal predecessors, (65), 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) [2025-03-08 04:35:47,572 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 75 transitions. [2025-03-08 04:35:47,572 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 75 transitions. Word has length 39 [2025-03-08 04:35:47,572 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-08 04:35:47,572 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 75 transitions. [2025-03-08 04:35:47,572 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 50 states, 46 states have (on average 1.391304347826087) internal successors, (64), 41 states have internal predecessors, (64), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-03-08 04:35:47,572 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 75 transitions. [2025-03-08 04:35:47,573 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-08 04:35:47,573 INFO L210 NwaCegarLoop]: Found error trace [2025-03-08 04:35:47,573 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-08 04:35:47,580 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2025-03-08 04:35:47,773 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:47,773 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2025-03-08 04:35:47,774 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-08 04:35:47,774 INFO L85 PathProgramCache]: Analyzing trace with hash -1236974723, now seen corresponding path program 1 times [2025-03-08 04:35:47,774 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-08 04:35:47,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1102753405] [2025-03-08 04:35:47,774 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:47,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-08 04:35:47,784 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 04:35:47,792 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 04:35:47,792 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:47,792 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:48,809 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 7 proven. 14 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:35:48,809 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-08 04:35:48,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1102753405] [2025-03-08 04:35:48,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1102753405] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-08 04:35:48,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [988955526] [2025-03-08 04:35:48,809 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-08 04:35:48,810 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-08 04:35:48,810 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-08 04:35:48,811 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-08 04:35:48,812 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-03-08 04:35:48,901 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-08 04:35:48,943 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-08 04:35:48,943 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-08 04:35:48,943 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-08 04:35:48,946 INFO L256 TraceCheckSpWp]: Trace formula consists of 382 conjuncts, 147 conjuncts are in the unsatisfiable core [2025-03-08 04:35:48,949 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-08 04:35:48,955 INFO L378 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 [2025-03-08 04:35:49,070 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-08 04:35:49,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 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 [2025-03-08 04:35:49,119 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 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 [2025-03-08 04:35:49,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2025-03-08 04:35:49,255 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-03-08 04:35:49,257 INFO L378 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 15 treesize of output 7 [2025-03-08 04:35:49,352 INFO L378 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 18 treesize of output 7 [2025-03-08 04:35:49,434 INFO L349 Elim1Store]: treesize reduction 8, result has 61.9 percent of original size [2025-03-08 04:35:49,434 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 20 treesize of output 22 [2025-03-08 04:35:49,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 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 [2025-03-08 04:35:50,084 INFO L349 Elim1Store]: treesize reduction 20, result has 58.3 percent of original size [2025-03-08 04:35:50,084 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 174 treesize of output 134 [2025-03-08 04:35:50,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2025-03-08 04:35:50,102 INFO L349 Elim1Store]: treesize reduction 36, result has 30.8 percent of original size [2025-03-08 04:35:50,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 3 case distinctions, treesize of input 79 treesize of output 63 [2025-03-08 04:35:50,119 INFO L349 Elim1Store]: treesize reduction 80, result has 15.8 percent of original size [2025-03-08 04:35:50,119 INFO L378 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 5 new quantified variables, introduced 5 case distinctions, treesize of input 199 treesize of output 110 [2025-03-08 04:35:50,122 INFO L378 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 13 treesize of output 11 [2025-03-08 04:35:50,138 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2025-03-08 04:35:50,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 26 treesize of output 21 [2025-03-08 04:35:50,156 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:35:50,157 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 4 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 59 treesize of output 33 [2025-03-08 04:35:50,294 INFO L378 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 [2025-03-08 04:35:50,302 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-08 04:35:50,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 27 treesize of output 7 [2025-03-08 04:35:50,405 INFO L378 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 79 treesize of output 51 [2025-03-08 04:35:50,410 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-08 04:35:50,410 INFO L378 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 48 treesize of output 23 [2025-03-08 04:35:50,412 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 8 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-08 04:35:50,412 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-08 04:35:51,327 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|)) (.cse13 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base|))) (let ((.cse0 (select .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|)) (.cse2 (select .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset|))) (let ((.cse3 (select (select |c_#memory_$Pointer$#2.offset| .cse0) .cse2)) (.cse1 (select (select |c_#memory_$Pointer$#2.base| .cse0) .cse2))) (or (and (= .cse0 .cse1) (= .cse2 .cse3)) (not (= .cse0 (select (select |c_#memory_$Pointer$#2.base| .cse1) .cse3))) (let ((.cse9 (store |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse2))) (.cse4 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse13 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse6 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~head#1.base| (store .cse12 |c_ULTIMATE.start_sll_circular_prepend_~head#1.offset| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset|)) |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse7 (store |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base| (store (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.base|) |c_ULTIMATE.start_sll_circular_prepend_~new_head~1#1.offset| .cse0)))) (and (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1118 (Array Int Int))) (let ((.cse8 (select (select (store .cse9 .cse1 v_ArrVal_1119) .cse4) .cse6))) (or (not (= .cse4 (select (let ((.cse5 (store .cse7 .cse1 v_ArrVal_1118))) (select .cse5 (select (select .cse5 .cse4) .cse6))) .cse8))) (= .cse6 .cse8)))) (forall ((v_ArrVal_1119 (Array Int Int)) (v_ArrVal_1118 (Array Int Int))) (let ((.cse11 (store .cse7 .cse1 v_ArrVal_1118))) (let ((.cse10 (select (select .cse11 .cse4) .cse6))) (or (= .cse4 .cse10) (not (= .cse4 (select (select .cse11 .cse10) (select (select (store .cse9 .cse1 v_ArrVal_1119) .cse4) .cse6)))))))))))))) is different from false [2025-03-08 04:35:52,098 INFO L349 Elim1Store]: treesize reduction 437, result has 48.6 percent of original size [2025-03-08 04:35:52,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 6389 treesize of output 5670 [2025-03-08 04:36:05,775 WARN L286 SmtUtils]: Spent 13.60s on a formula simplification. DAG size of input: 1021 DAG size of output: 619 (called from [L 346] de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.arrays.Elim1Store.elim1) [2025-03-08 04:36:05,777 INFO L349 Elim1Store]: treesize reduction 9042, result has 46.5 percent of original size [2025-03-08 04:36:05,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 24 select indices, 24 select index equivalence classes, 1 disjoint index pairs (out of 276 index pairs), introduced 28 new quantified variables, introduced 275 case distinctions, treesize of input 5440 treesize of output 11579 [2025-03-08 04:36:06,831 INFO L349 Elim1Store]: treesize reduction 139, result has 81.1 percent of original size [2025-03-08 04:36:06,832 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 5033 treesize of output 4910 [2025-03-08 04:36:07,648 INFO L349 Elim1Store]: treesize reduction 288, result has 71.5 percent of original size [2025-03-08 04:36:07,648 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 6 select indices, 6 select index equivalence classes, 0 disjoint index pairs (out of 15 index pairs), introduced 6 new quantified variables, introduced 15 case distinctions, treesize of input 4794 treesize of output 4603