./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-simple/dll2n_append_unequal.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 48c9605d Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-simple/dll2n_append_unequal.i -s /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 --- Real Ultimate output --- This is Ultimate 0.3.0-?-48c9605-m [2025-02-08 06:41:41,221 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-02-08 06:41:41,277 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-02-08 06:41:41,283 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-02-08 06:41:41,285 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-02-08 06:41:41,303 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-02-08 06:41:41,305 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-02-08 06:41:41,305 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-02-08 06:41:41,305 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-02-08 06:41:41,306 INFO L153 SettingsManager]: * Use memory slicer=true [2025-02-08 06:41:41,306 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-02-08 06:41:41,306 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-02-08 06:41:41,307 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-02-08 06:41:41,307 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-02-08 06:41:41,307 INFO L153 SettingsManager]: * Use SBE=true [2025-02-08 06:41:41,307 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-02-08 06:41:41,307 INFO L153 SettingsManager]: * sizeof long=4 [2025-02-08 06:41:41,307 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-02-08 06:41:41,308 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-02-08 06:41:41,308 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-02-08 06:41:41,308 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-02-08 06:41:41,308 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-02-08 06:41:41,308 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-02-08 06:41:41,308 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-02-08 06:41:41,308 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-02-08 06:41:41,308 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-02-08 06:41:41,308 INFO L153 SettingsManager]: * sizeof long double=12 [2025-02-08 06:41:41,308 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-02-08 06:41:41,308 INFO L153 SettingsManager]: * Use constant arrays=true [2025-02-08 06:41:41,309 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-02-08 06:41:41,309 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-02-08 06:41:41,309 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-02-08 06:41:41,309 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-02-08 06:41:41,309 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:41:41,309 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-02-08 06:41:41,310 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-02-08 06:41:41,310 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-02-08 06:41:41,310 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-02-08 06:41:41,310 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-02-08 06:41:41,310 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-02-08 06:41:41,310 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-02-08 06:41:41,310 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-02-08 06:41:41,310 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-jdk21/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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) 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 -> 8e4e2611155a39995b0fc64ec45d64e4c98f789d2737326ee819380629347be0 [2025-02-08 06:41:41,530 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-02-08 06:41:41,539 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-02-08 06:41:41,541 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-02-08 06:41:41,542 INFO L270 PluginConnector]: Initializing CDTParser... [2025-02-08 06:41:41,543 INFO L274 PluginConnector]: CDTParser initialized [2025-02-08 06:41:41,544 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2025-02-08 06:41:42,655 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f03069a92/0c641566f82b4b759326f20f01a28660/FLAGdb11b204c [2025-02-08 06:41:43,001 INFO L384 CDTParser]: Found 1 translation units. [2025-02-08 06:41:43,001 INFO L180 CDTParser]: Scanning /storage/repos/ultimate-jdk21/releaseScripts/default/sv-benchmarks/c/list-simple/dll2n_append_unequal.i [2025-02-08 06:41:43,014 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f03069a92/0c641566f82b4b759326f20f01a28660/FLAGdb11b204c [2025-02-08 06:41:43,236 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/data/f03069a92/0c641566f82b4b759326f20f01a28660 [2025-02-08 06:41:43,239 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-02-08 06:41:43,240 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-02-08 06:41:43,241 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-02-08 06:41:43,241 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-02-08 06:41:43,244 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-02-08 06:41:43,245 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:41:43" (1/1) ... [2025-02-08 06:41:43,245 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@1d1ca5cb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:41:43, skipping insertion in model container [2025-02-08 06:41:43,247 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 08.02 06:41:43" (1/1) ... [2025-02-08 06:41:43,269 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-02-08 06:41:43,438 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:41:43,447 INFO L200 MainTranslator]: Completed pre-run [2025-02-08 06:41:43,484 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-02-08 06:41:43,505 INFO L204 MainTranslator]: Completed translation [2025-02-08 06:41:43,506 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:41:43 WrapperNode [2025-02-08 06:41:43,506 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-02-08 06:41:43,507 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-02-08 06:41:43,507 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-02-08 06:41:43,507 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-02-08 06:41:43,511 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:41:43" (1/1) ... [2025-02-08 06:41:43,518 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:41:43" (1/1) ... [2025-02-08 06:41:43,533 INFO L138 Inliner]: procedures = 127, calls = 41, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 137 [2025-02-08 06:41:43,534 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-02-08 06:41:43,534 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-02-08 06:41:43,534 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-02-08 06:41:43,534 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-02-08 06:41:43,541 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:41:43" (1/1) ... [2025-02-08 06:41:43,542 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:41:43" (1/1) ... [2025-02-08 06:41:43,546 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:41:43" (1/1) ... [2025-02-08 06:41:43,559 INFO L175 MemorySlicer]: Split 24 memory accesses to 3 slices as follows [2, 16, 6]. 67 percent of accesses are in the largest equivalence class. The 3 initializations are split as follows [2, 0, 1]. The 9 writes are split as follows [0, 8, 1]. [2025-02-08 06:41:43,559 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:41:43" (1/1) ... [2025-02-08 06:41:43,559 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:41:43" (1/1) ... [2025-02-08 06:41:43,565 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:41:43" (1/1) ... [2025-02-08 06:41:43,566 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:41:43" (1/1) ... [2025-02-08 06:41:43,567 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:41:43" (1/1) ... [2025-02-08 06:41:43,568 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:41:43" (1/1) ... [2025-02-08 06:41:43,569 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-02-08 06:41:43,570 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-02-08 06:41:43,570 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-02-08 06:41:43,570 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-02-08 06:41:43,571 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:41:43" (1/1) ... [2025-02-08 06:41:43,575 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-02-08 06:41:43,584 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:43,599 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-02-08 06:41:43,602 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#2 [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#2 [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-02-08 06:41:43,619 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#2 [2025-02-08 06:41:43,619 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-02-08 06:41:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-02-08 06:41:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2025-02-08 06:41:43,620 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-02-08 06:41:43,620 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-02-08 06:41:43,736 INFO L257 CfgBuilder]: Building ICFG [2025-02-08 06:41:43,739 INFO L287 CfgBuilder]: Building CFG for each procedure with an implementation [2025-02-08 06:41:44,009 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L622: 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-02-08 06:41:44,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume false; [2025-02-08 06:41:44,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12: assume !false; [2025-02-08 06:41:44,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume false; [2025-02-08 06:41:44,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L12-1: assume !false; [2025-02-08 06:41:44,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L645: havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset;assume { :end_inline_reach_error } true;assume false;main_#res#1 := 1;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-02-08 06:41:44,010 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L645-1: assume { :begin_inline_reach_error } true;havoc reach_error_#t~nondet0#1.base, reach_error_#t~nondet0#1.offset; [2025-02-08 06:41:44,045 INFO L1324 $ProcedureCfgBuilder]: dead code at ProgramPoint L578: havoc myexit_~s#1;havoc myexit_#in~s#1;assume { :end_inline_myexit } true; [2025-02-08 06:41:44,062 INFO L? ?]: Removed 117 outVars from TransFormulas that were not future-live. [2025-02-08 06:41:44,062 INFO L308 CfgBuilder]: Performing block encoding [2025-02-08 06:41:44,070 INFO L332 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-02-08 06:41:44,070 INFO L337 CfgBuilder]: Removed 0 assume(true) statements. [2025-02-08 06:41:44,071 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:41:44 BoogieIcfgContainer [2025-02-08 06:41:44,071 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-02-08 06:41:44,072 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-02-08 06:41:44,073 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-02-08 06:41:44,076 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-02-08 06:41:44,077 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 08.02 06:41:43" (1/3) ... [2025-02-08 06:41:44,078 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f26bc97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:41:44, skipping insertion in model container [2025-02-08 06:41:44,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 08.02 06:41:43" (2/3) ... [2025-02-08 06:41:44,079 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7f26bc97 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 08.02 06:41:44, skipping insertion in model container [2025-02-08 06:41:44,079 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 08.02 06:41:44" (3/3) ... [2025-02-08 06:41:44,080 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.i [2025-02-08 06:41:44,092 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-02-08 06:41:44,093 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_append_unequal.i that has 2 procedures, 106 locations, 1 initial locations, 4 loop locations, and 47 error locations. [2025-02-08 06:41:44,124 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-02-08 06:41:44,131 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=None, 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;@1f65ed19, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-02-08 06:41:44,131 INFO L334 AbstractCegarLoop]: Starting to check reachability of 47 error locations. [2025-02-08 06:41:44,134 INFO L276 IsEmpty]: Start isEmpty. Operand has 106 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 102 states have internal predecessors, (113), 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-02-08 06:41:44,138 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:41:44,138 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:44,138 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:41:44,138 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:41:44,142 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:44,142 INFO L85 PathProgramCache]: Analyzing trace with hash -64844937, now seen corresponding path program 1 times [2025-02-08 06:41:44,147 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:44,147 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [511379837] [2025-02-08 06:41:44,147 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:44,148 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:44,206 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:41:44,220 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:41:44,221 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:44,221 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:44,325 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:44,327 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:44,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [511379837] [2025-02-08 06:41:44,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [511379837] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:44,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:44,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:41:44,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [194049755] [2025-02-08 06:41:44,331 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:44,334 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:41:44,334 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:44,351 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:41:44,352 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:41:44,353 INFO L87 Difference]: Start difference. First operand has 106 states, 54 states have (on average 2.0925925925925926) internal successors, (113), 102 states have internal predecessors, (113), 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) Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:41:44,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:44,448 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2025-02-08 06:41:44,449 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:41:44,451 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 06:41:44,451 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:44,477 INFO L225 Difference]: With dead ends: 103 [2025-02-08 06:41:44,477 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 06:41:44,479 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-08 06:41:44,481 INFO L435 NwaCegarLoop]: 103 mSDtfsCounter, 3 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 56 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 58 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 56 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:44,481 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 163 Invalid, 58 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 56 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:41:44,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 06:41:44,505 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-08 06:41:44,506 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 53 states have (on average 1.9245283018867925) internal successors, (102), 95 states have internal predecessors, (102), 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-02-08 06:41:44,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2025-02-08 06:41:44,509 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 6 [2025-02-08 06:41:44,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:44,510 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2025-02-08 06:41:44,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:41:44,510 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2025-02-08 06:41:44,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2025-02-08 06:41:44,510 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:44,510 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2025-02-08 06:41:44,510 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-02-08 06:41:44,511 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:41:44,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:44,511 INFO L85 PathProgramCache]: Analyzing trace with hash -64844936, now seen corresponding path program 1 times [2025-02-08 06:41:44,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:44,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [177905117] [2025-02-08 06:41:44,512 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:44,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:44,517 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 6 statements into 1 equivalence classes. [2025-02-08 06:41:44,524 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 6 of 6 statements. [2025-02-08 06:41:44,524 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:44,524 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:44,594 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:44,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:44,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [177905117] [2025-02-08 06:41:44,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [177905117] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:44,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:44,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-02-08 06:41:44,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387713874] [2025-02-08 06:41:44,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:44,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:41:44,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:44,596 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:41:44,596 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:41:44,596 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:41:44,657 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:44,657 INFO L93 Difference]: Finished difference Result 96 states and 103 transitions. [2025-02-08 06:41:44,658 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:41:44,658 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2025-02-08 06:41:44,659 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:44,659 INFO L225 Difference]: With dead ends: 96 [2025-02-08 06:41:44,659 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 06:41:44,659 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 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-02-08 06:41:44,660 INFO L435 NwaCegarLoop]: 98 mSDtfsCounter, 3 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 158 SdHoareTripleChecker+Invalid, 45 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 43 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:44,660 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 158 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:41:44,661 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 06:41:44,667 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-08 06:41:44,669 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 53 states have (on average 1.8679245283018868) internal successors, (99), 92 states have internal predecessors, (99), 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-02-08 06:41:44,670 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 103 transitions. [2025-02-08 06:41:44,671 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 103 transitions. Word has length 6 [2025-02-08 06:41:44,672 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:44,672 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 103 transitions. [2025-02-08 06:41:44,672 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.5) internal successors, (5), 3 states have internal predecessors, (5), 1 states have call successors, (1), 1 states have call predecessors, (1), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-02-08 06:41:44,672 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 103 transitions. [2025-02-08 06:41:44,672 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:41:44,675 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:44,675 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:44,676 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-02-08 06:41:44,676 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:41:44,676 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:44,676 INFO L85 PathProgramCache]: Analyzing trace with hash 38740738, now seen corresponding path program 1 times [2025-02-08 06:41:44,676 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:44,676 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2056729963] [2025-02-08 06:41:44,676 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:44,677 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:44,697 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:41:44,714 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:41:44,714 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:44,714 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:44,799 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:44,800 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:44,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2056729963] [2025-02-08 06:41:44,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2056729963] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:44,801 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:44,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:41:44,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [415846785] [2025-02-08 06:41:44,801 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:44,802 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:41:44,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:44,803 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:41:44,803 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:41:44,804 INFO L87 Difference]: Start difference. First operand 96 states and 103 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:41:44,973 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:44,973 INFO L93 Difference]: Finished difference Result 94 states and 101 transitions. [2025-02-08 06:41:44,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:41:44,973 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-02-08 06:41:44,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:44,974 INFO L225 Difference]: With dead ends: 94 [2025-02-08 06:41:44,974 INFO L226 Difference]: Without dead ends: 94 [2025-02-08 06:41:44,974 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:41:44,974 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 8 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 282 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:44,975 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 282 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:41:44,975 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2025-02-08 06:41:44,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2025-02-08 06:41:44,978 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 53 states have (on average 1.830188679245283) internal successors, (97), 90 states have internal predecessors, (97), 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-02-08 06:41:44,978 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2025-02-08 06:41:44,978 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 13 [2025-02-08 06:41:44,980 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:44,980 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2025-02-08 06:41:44,980 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:41:44,981 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2025-02-08 06:41:44,981 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:41:44,981 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:44,982 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:44,982 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-02-08 06:41:44,982 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr40REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:41:44,983 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:44,983 INFO L85 PathProgramCache]: Analyzing trace with hash 38740739, now seen corresponding path program 1 times [2025-02-08 06:41:44,983 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:44,983 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1449008600] [2025-02-08 06:41:44,983 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:44,984 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:44,994 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:41:45,006 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:41:45,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:45,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:45,227 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:45,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:45,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1449008600] [2025-02-08 06:41:45,227 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1449008600] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:45,227 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:45,227 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:41:45,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2111815880] [2025-02-08 06:41:45,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:45,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:41:45,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:45,229 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:41:45,229 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:41:45,230 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:41:45,349 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:45,349 INFO L93 Difference]: Finished difference Result 92 states and 99 transitions. [2025-02-08 06:41:45,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:41:45,350 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-02-08 06:41:45,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:45,350 INFO L225 Difference]: With dead ends: 92 [2025-02-08 06:41:45,350 INFO L226 Difference]: Without dead ends: 92 [2025-02-08 06:41:45,352 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:41:45,353 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 7 mSDsluCounter, 210 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 298 SdHoareTripleChecker+Invalid, 182 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:45,355 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 298 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:41:45,355 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2025-02-08 06:41:45,357 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2025-02-08 06:41:45,360 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 53 states have (on average 1.7924528301886793) internal successors, (95), 88 states have internal predecessors, (95), 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-02-08 06:41:45,361 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 99 transitions. [2025-02-08 06:41:45,361 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 99 transitions. Word has length 13 [2025-02-08 06:41:45,361 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:45,361 INFO L471 AbstractCegarLoop]: Abstraction has 92 states and 99 transitions. [2025-02-08 06:41:45,361 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:41:45,361 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 99 transitions. [2025-02-08 06:41:45,361 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2025-02-08 06:41:45,362 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:45,363 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:45,364 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-02-08 06:41:45,364 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:41:45,364 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:45,365 INFO L85 PathProgramCache]: Analyzing trace with hash 1696400269, now seen corresponding path program 1 times [2025-02-08 06:41:45,365 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:45,365 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1418325016] [2025-02-08 06:41:45,365 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:45,365 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:45,375 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 13 statements into 1 equivalence classes. [2025-02-08 06:41:45,379 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 13 of 13 statements. [2025-02-08 06:41:45,380 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:45,380 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:45,420 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:45,420 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:45,420 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1418325016] [2025-02-08 06:41:45,421 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1418325016] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:45,421 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:45,421 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:41:45,421 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [608974464] [2025-02-08 06:41:45,421 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:45,421 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:41:45,421 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:45,422 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:41:45,422 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:41:45,422 INFO L87 Difference]: Start difference. First operand 92 states and 99 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:41:45,428 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:45,430 INFO L93 Difference]: Finished difference Result 102 states and 111 transitions. [2025-02-08 06:41:45,430 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:41:45,431 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 13 [2025-02-08 06:41:45,431 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:45,431 INFO L225 Difference]: With dead ends: 102 [2025-02-08 06:41:45,431 INFO L226 Difference]: Without dead ends: 102 [2025-02-08 06:41:45,431 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-02-08 06:41:45,432 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 9 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 5 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 5 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 5 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:45,432 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 192 Invalid, 5 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 5 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:41:45,432 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2025-02-08 06:41:45,437 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 93. [2025-02-08 06:41:45,439 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 54 states have (on average 1.7777777777777777) internal successors, (96), 89 states have internal predecessors, (96), 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-02-08 06:41:45,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2025-02-08 06:41:45,441 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 13 [2025-02-08 06:41:45,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:45,441 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2025-02-08 06:41:45,441 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:41:45,441 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2025-02-08 06:41:45,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2025-02-08 06:41:45,441 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:45,442 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:45,442 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-02-08 06:41:45,444 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:41:45,444 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:45,445 INFO L85 PathProgramCache]: Analyzing trace with hash -1220803451, now seen corresponding path program 1 times [2025-02-08 06:41:45,445 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:45,445 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1331396831] [2025-02-08 06:41:45,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:45,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:45,457 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 16 statements into 1 equivalence classes. [2025-02-08 06:41:45,465 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 16 of 16 statements. [2025-02-08 06:41:45,466 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:45,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:45,501 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:45,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:45,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1331396831] [2025-02-08 06:41:45,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1331396831] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:45,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:45,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-02-08 06:41:45,501 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650708427] [2025-02-08 06:41:45,501 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:45,502 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-02-08 06:41:45,503 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:45,503 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-02-08 06:41:45,503 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-02-08 06:41:45,503 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:41:45,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:45,517 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2025-02-08 06:41:45,518 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-02-08 06:41:45,518 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) Word has length 16 [2025-02-08 06:41:45,518 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:45,518 INFO L225 Difference]: With dead ends: 98 [2025-02-08 06:41:45,518 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 06:41:45,518 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-02-08 06:41:45,519 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:45,519 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 187 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:41:45,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 06:41:45,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-08 06:41:45,526 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 58 states have (on average 1.7241379310344827) internal successors, (100), 93 states have internal predecessors, (100), 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-02-08 06:41:45,529 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2025-02-08 06:41:45,529 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 16 [2025-02-08 06:41:45,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:45,529 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2025-02-08 06:41:45,529 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.666666666666667) internal successors, (14), 3 states have internal predecessors, (14), 1 states have call successors, (1), 1 states have call predecessors, (1), 1 states have return successors, (1), 1 states have call predecessors, (1), 1 states have call successors, (1) [2025-02-08 06:41:45,529 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2025-02-08 06:41:45,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2025-02-08 06:41:45,530 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:45,530 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:45,530 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-02-08 06:41:45,530 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:41:45,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:45,530 INFO L85 PathProgramCache]: Analyzing trace with hash -206996321, now seen corresponding path program 1 times [2025-02-08 06:41:45,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:45,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2033075760] [2025-02-08 06:41:45,530 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:45,532 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:45,548 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:41:45,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:41:45,555 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:45,555 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:45,612 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:41:45,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:45,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2033075760] [2025-02-08 06:41:45,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2033075760] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:45,613 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791272633] [2025-02-08 06:41:45,613 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:45,613 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:45,613 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:45,615 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:45,617 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-02-08 06:41:45,691 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 28 statements into 1 equivalence classes. [2025-02-08 06:41:45,738 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 28 of 28 statements. [2025-02-08 06:41:45,738 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:45,738 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:45,740 INFO L256 TraceCheckSpWp]: Trace formula consists of 289 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-02-08 06:41:45,743 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:45,780 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:45,781 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:45,818 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-02-08 06:41:45,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791272633] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:41:45,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:41:45,819 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-02-08 06:41:45,819 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [901039333] [2025-02-08 06:41:45,819 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:45,819 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:41:45,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:45,820 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:41:45,820 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:41:45,820 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:41:45,834 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:45,834 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2025-02-08 06:41:45,835 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:41:45,835 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 28 [2025-02-08 06:41:45,835 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:45,835 INFO L225 Difference]: With dead ends: 100 [2025-02-08 06:41:45,836 INFO L226 Difference]: Without dead ends: 100 [2025-02-08 06:41:45,836 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 53 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:41:45,837 INFO L435 NwaCegarLoop]: 97 mSDtfsCounter, 9 mSDsluCounter, 274 mSDsCounter, 0 mSdLazyCounter, 12 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 371 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 12 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:45,837 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 371 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 12 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:41:45,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-02-08 06:41:45,843 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-02-08 06:41:45,843 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 60 states have (on average 1.7) internal successors, (102), 95 states have internal predecessors, (102), 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-02-08 06:41:45,845 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2025-02-08 06:41:45,845 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 28 [2025-02-08 06:41:45,845 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:45,845 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2025-02-08 06:41:45,845 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.2) internal successors, (31), 5 states have internal predecessors, (31), 3 states have call successors, (4), 2 states have call predecessors, (4), 2 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:41:45,845 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2025-02-08 06:41:45,846 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:41:45,846 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:45,846 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 06:41:45,853 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-02-08 06:41:46,046 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:46,047 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:41:46,047 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:46,047 INFO L85 PathProgramCache]: Analyzing trace with hash 1144592947, now seen corresponding path program 1 times [2025-02-08 06:41:46,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:46,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1296916425] [2025-02-08 06:41:46,047 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:46,047 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:46,063 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:41:46,080 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:41:46,081 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:46,081 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:46,331 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:46,331 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:46,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1296916425] [2025-02-08 06:41:46,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1296916425] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:46,331 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [40246005] [2025-02-08 06:41:46,331 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:46,332 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:46,332 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:46,334 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:46,335 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-02-08 06:41:46,403 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:41:46,433 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:41:46,433 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:46,433 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:46,438 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-02-08 06:41:46,441 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:46,509 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:41:46,510 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 06:41:46,554 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:46,555 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:46,794 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:46,794 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [40246005] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:41:46,795 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:41:46,795 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 18 [2025-02-08 06:41:46,795 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [510436671] [2025-02-08 06:41:46,795 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:46,795 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-02-08 06:41:46,795 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:46,795 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-02-08 06:41:46,796 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=60, Invalid=282, Unknown=0, NotChecked=0, Total=342 [2025-02-08 06:41:46,796 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 06:41:47,141 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:47,141 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2025-02-08 06:41:47,142 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:41:47,142 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) Word has length 31 [2025-02-08 06:41:47,142 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:47,143 INFO L225 Difference]: With dead ends: 99 [2025-02-08 06:41:47,143 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 06:41:47,143 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 54 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 53 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=84, Invalid=378, Unknown=0, NotChecked=0, Total=462 [2025-02-08 06:41:47,143 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 6 mSDsluCounter, 464 mSDsCounter, 0 mSdLazyCounter, 541 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 550 SdHoareTripleChecker+Invalid, 554 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 541 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:47,144 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 550 Invalid, 554 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 541 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:41:47,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 06:41:47,150 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-08 06:41:47,150 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 60 states have (on average 1.6833333333333333) internal successors, (101), 94 states have internal predecessors, (101), 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-02-08 06:41:47,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2025-02-08 06:41:47,150 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 31 [2025-02-08 06:41:47,151 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:47,151 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2025-02-08 06:41:47,151 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.888888888888889) internal successors, (52), 14 states have internal predecessors, (52), 2 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 5 states have call predecessors, (5), 2 states have call successors, (5) [2025-02-08 06:41:47,151 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2025-02-08 06:41:47,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2025-02-08 06:41:47,151 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:47,151 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1] [2025-02-08 06:41:47,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2025-02-08 06:41:47,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,3 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:47,352 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:41:47,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:47,352 INFO L85 PathProgramCache]: Analyzing trace with hash 1144592948, now seen corresponding path program 1 times [2025-02-08 06:41:47,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:47,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [623933519] [2025-02-08 06:41:47,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:47,352 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:47,366 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:41:47,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:41:47,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:47,376 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:47,755 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:47,755 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:47,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [623933519] [2025-02-08 06:41:47,756 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [623933519] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:47,756 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1989176715] [2025-02-08 06:41:47,756 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:47,756 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:47,757 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:47,759 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:47,760 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-02-08 06:41:47,825 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 31 statements into 1 equivalence classes. [2025-02-08 06:41:47,851 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 31 of 31 statements. [2025-02-08 06:41:47,852 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:47,852 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:47,854 INFO L256 TraceCheckSpWp]: Trace formula consists of 300 conjuncts, 33 conjuncts are in the unsatisfiable core [2025-02-08 06:41:47,856 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:47,860 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 8 treesize of output 1 [2025-02-08 06:41:48,043 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:41:48,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 06:41:48,055 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:41:48,056 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 11 treesize of output 11 [2025-02-08 06:41:48,105 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:48,105 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:48,229 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1989176715] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:48,229 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:41:48,229 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 20 [2025-02-08 06:41:48,229 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1365553759] [2025-02-08 06:41:48,229 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:48,230 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2025-02-08 06:41:48,230 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:48,230 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2025-02-08 06:41:48,230 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2025-02-08 06:41:48,231 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 21 states, 20 states have (on average 2.35) internal successors, (47), 17 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:41:48,594 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:48,594 INFO L93 Difference]: Finished difference Result 98 states and 106 transitions. [2025-02-08 06:41:48,594 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-02-08 06:41:48,595 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 17 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) Word has length 31 [2025-02-08 06:41:48,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:48,596 INFO L225 Difference]: With dead ends: 98 [2025-02-08 06:41:48,597 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 06:41:48,597 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 108 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=104, Invalid=652, Unknown=0, NotChecked=0, Total=756 [2025-02-08 06:41:48,597 INFO L435 NwaCegarLoop]: 86 mSDtfsCounter, 6 mSDsluCounter, 492 mSDsCounter, 0 mSdLazyCounter, 544 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 578 SdHoareTripleChecker+Invalid, 546 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 544 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:48,597 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 578 Invalid, 546 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 544 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2025-02-08 06:41:48,598 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 06:41:48,602 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-08 06:41:48,602 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.6666666666666667) internal successors, (100), 93 states have internal predecessors, (100), 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-02-08 06:41:48,603 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 106 transitions. [2025-02-08 06:41:48,603 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 106 transitions. Word has length 31 [2025-02-08 06:41:48,603 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:48,603 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 106 transitions. [2025-02-08 06:41:48,603 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.35) internal successors, (47), 17 states have internal predecessors, (47), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (4), 4 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:41:48,604 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 106 transitions. [2025-02-08 06:41:48,604 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-02-08 06:41:48,605 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:48,605 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:48,612 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-02-08 06:41:48,805 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:48,806 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:41:48,806 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:48,807 INFO L85 PathProgramCache]: Analyzing trace with hash -910328499, now seen corresponding path program 2 times [2025-02-08 06:41:48,807 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:48,807 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1086761990] [2025-02-08 06:41:48,807 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:41:48,807 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:48,822 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-02-08 06:41:48,830 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 06:41:48,830 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:41:48,830 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:48,900 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:41:48,900 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:48,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1086761990] [2025-02-08 06:41:48,900 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1086761990] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:48,900 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [90993351] [2025-02-08 06:41:48,901 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:41:48,901 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:48,901 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:48,902 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:48,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-02-08 06:41:48,978 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 43 statements into 2 equivalence classes. [2025-02-08 06:41:49,019 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 43 of 43 statements. [2025-02-08 06:41:49,019 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:41:49,019 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:49,021 INFO L256 TraceCheckSpWp]: Trace formula consists of 420 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-02-08 06:41:49,022 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:49,044 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:49,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:49,076 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-02-08 06:41:49,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [90993351] provided 0 perfect and 2 imperfect interpolant sequences [2025-02-08 06:41:49,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-02-08 06:41:49,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-02-08 06:41:49,077 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [598790993] [2025-02-08 06:41:49,077 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:49,077 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:41:49,077 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:49,078 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:41:49,078 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-02-08 06:41:49,078 INFO L87 Difference]: Start difference. First operand 98 states and 106 transitions. Second operand has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:41:49,128 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:49,128 INFO L93 Difference]: Finished difference Result 98 states and 105 transitions. [2025-02-08 06:41:49,129 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-02-08 06:41:49,129 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 43 [2025-02-08 06:41:49,129 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:49,129 INFO L225 Difference]: With dead ends: 98 [2025-02-08 06:41:49,129 INFO L226 Difference]: Without dead ends: 98 [2025-02-08 06:41:49,129 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 93 GetRequests, 86 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=19, Invalid=53, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:41:49,130 INFO L435 NwaCegarLoop]: 88 mSDtfsCounter, 3 mSDsluCounter, 429 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 517 SdHoareTripleChecker+Invalid, 76 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:49,130 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 517 Invalid, 76 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:41:49,130 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2025-02-08 06:41:49,132 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2025-02-08 06:41:49,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 60 states have (on average 1.65) internal successors, (99), 93 states have internal predecessors, (99), 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-02-08 06:41:49,133 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2025-02-08 06:41:49,133 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 43 [2025-02-08 06:41:49,133 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:49,133 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2025-02-08 06:41:49,133 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.285714285714286) internal successors, (37), 6 states have internal predecessors, (37), 3 states have call successors, (4), 2 states have call predecessors, (4), 3 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:41:49,133 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2025-02-08 06:41:49,134 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 06:41:49,134 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:49,134 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:49,141 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-02-08 06:41:49,334 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-02-08 06:41:49,335 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:41:49,335 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:49,335 INFO L85 PathProgramCache]: Analyzing trace with hash 1304715117, now seen corresponding path program 1 times [2025-02-08 06:41:49,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:49,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1988239616] [2025-02-08 06:41:49,335 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:49,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:49,351 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:41:49,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:41:49,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:49,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:49,681 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 21 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 06:41:49,681 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:49,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1988239616] [2025-02-08 06:41:49,681 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1988239616] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:49,681 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1791976913] [2025-02-08 06:41:49,681 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:49,682 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:49,682 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:49,683 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:49,685 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-02-08 06:41:49,763 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:41:49,800 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:41:49,800 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:49,800 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:49,806 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 29 conjuncts are in the unsatisfiable core [2025-02-08 06:41:49,808 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:49,811 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-02-08 06:41:49,841 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:41:49,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 06:41:49,881 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))) is different from true [2025-02-08 06:41:49,898 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:41:49,898 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-08 06:41:49,938 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-02-08 06:41:49,938 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-02-08 06:41:49,950 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 14 not checked. [2025-02-08 06:41:49,950 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:50,314 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 16 proven. 0 refuted. 0 times theorem prover too weak. 17 trivial. 0 not checked. [2025-02-08 06:41:50,314 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1791976913] provided 1 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:50,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:41:50,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [9, 8] total 18 [2025-02-08 06:41:50,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [388392785] [2025-02-08 06:41:50,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:50,315 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:41:50,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:50,316 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:41:50,316 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=275, Unknown=1, NotChecked=34, Total=380 [2025-02-08 06:41:50,316 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:41:50,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:50,488 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2025-02-08 06:41:50,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:41:50,488 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) Word has length 44 [2025-02-08 06:41:50,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:50,489 INFO L225 Difference]: With dead ends: 104 [2025-02-08 06:41:50,489 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 06:41:50,489 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 102 GetRequests, 74 SyntacticMatches, 9 SemanticMatches, 19 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=78, Invalid=305, Unknown=1, NotChecked=36, Total=420 [2025-02-08 06:41:50,489 INFO L435 NwaCegarLoop]: 49 mSDtfsCounter, 137 mSDsluCounter, 187 mSDsCounter, 0 mSdLazyCounter, 239 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 137 SdHoareTripleChecker+Valid, 236 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 239 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:50,490 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [137 Valid, 236 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 239 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2025-02-08 06:41:50,490 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 06:41:50,491 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 93. [2025-02-08 06:41:50,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 60 states have (on average 1.5666666666666667) internal successors, (94), 88 states have internal predecessors, (94), 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-02-08 06:41:50,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2025-02-08 06:41:50,492 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 44 [2025-02-08 06:41:50,492 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:50,492 INFO L471 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2025-02-08 06:41:50,492 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 3.5) internal successors, (28), 7 states have internal predecessors, (28), 2 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (3), 3 states have call predecessors, (3), 2 states have call successors, (3) [2025-02-08 06:41:50,492 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2025-02-08 06:41:50,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 45 [2025-02-08 06:41:50,493 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:50,493 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:50,502 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-02-08 06:41:50,693 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-02-08 06:41:50,693 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:41:50,694 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:50,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1304715118, now seen corresponding path program 1 times [2025-02-08 06:41:50,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:50,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [850485753] [2025-02-08 06:41:50,694 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:50,694 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:50,711 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:41:50,726 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:41:50,727 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:50,727 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:51,168 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:41:51,168 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:51,168 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [850485753] [2025-02-08 06:41:51,169 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [850485753] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:51,169 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1346240359] [2025-02-08 06:41:51,169 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:51,169 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:51,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:51,171 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:51,172 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-02-08 06:41:51,256 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 44 statements into 1 equivalence classes. [2025-02-08 06:41:51,293 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 44 of 44 statements. [2025-02-08 06:41:51,294 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:51,294 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:51,295 INFO L256 TraceCheckSpWp]: Trace formula consists of 433 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-02-08 06:41:51,298 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:51,303 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 8 treesize of output 1 [2025-02-08 06:41:51,336 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 5 treesize of output 3 [2025-02-08 06:41:51,342 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-02-08 06:41:51,383 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:51,384 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 14 treesize of output 9 [2025-02-08 06:41:51,418 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 5 treesize of output 3 [2025-02-08 06:41:51,461 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:51,462 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 14 treesize of output 9 [2025-02-08 06:41:51,514 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 5 treesize of output 3 [2025-02-08 06:41:51,554 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:51,555 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 14 treesize of output 9 [2025-02-08 06:41:51,578 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-08 06:41:51,578 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-02-08 06:41:51,578 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1346240359] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:51,579 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-02-08 06:41:51,580 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [13] total 17 [2025-02-08 06:41:51,580 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1230426818] [2025-02-08 06:41:51,580 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:51,580 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-02-08 06:41:51,580 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:51,580 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-02-08 06:41:51,580 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=56, Invalid=253, Unknown=1, NotChecked=32, Total=342 [2025-02-08 06:41:51,581 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 7 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-02-08 06:41:51,683 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:51,683 INFO L93 Difference]: Finished difference Result 90 states and 97 transitions. [2025-02-08 06:41:51,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-02-08 06:41:51,684 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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 44 [2025-02-08 06:41:51,684 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:51,684 INFO L225 Difference]: With dead ends: 90 [2025-02-08 06:41:51,684 INFO L226 Difference]: Without dead ends: 90 [2025-02-08 06:41:51,685 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 58 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 61 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=61, Invalid=284, Unknown=1, NotChecked=34, Total=380 [2025-02-08 06:41:51,685 INFO L435 NwaCegarLoop]: 76 mSDtfsCounter, 4 mSDsluCounter, 169 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 245 SdHoareTripleChecker+Invalid, 264 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:51,685 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 245 Invalid, 264 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 145 Invalid, 0 Unknown, 117 Unchecked, 0.1s Time] [2025-02-08 06:41:51,686 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 90 states. [2025-02-08 06:41:51,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 90 to 90. [2025-02-08 06:41:51,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 60 states have (on average 1.5166666666666666) internal successors, (91), 85 states have internal predecessors, (91), 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-02-08 06:41:51,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 97 transitions. [2025-02-08 06:41:51,687 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 97 transitions. Word has length 44 [2025-02-08 06:41:51,687 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:51,688 INFO L471 AbstractCegarLoop]: Abstraction has 90 states and 97 transitions. [2025-02-08 06:41:51,688 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 3.8) internal successors, (19), 5 states have internal predecessors, (19), 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-02-08 06:41:51,688 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 97 transitions. [2025-02-08 06:41:51,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 49 [2025-02-08 06:41:51,688 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:51,688 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:51,695 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-02-08 06:41:51,889 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable11 [2025-02-08 06:41:51,889 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:41:51,889 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:51,889 INFO L85 PathProgramCache]: Analyzing trace with hash 210677416, now seen corresponding path program 1 times [2025-02-08 06:41:51,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:51,890 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [52943902] [2025-02-08 06:41:51,890 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:51,890 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:51,904 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 06:41:51,912 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 06:41:51,912 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:51,912 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:52,090 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 06:41:52,090 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:52,090 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [52943902] [2025-02-08 06:41:52,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [52943902] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:52,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1945812933] [2025-02-08 06:41:52,091 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:52,091 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:52,091 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:52,093 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:52,094 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-02-08 06:41:52,200 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 48 statements into 1 equivalence classes. [2025-02-08 06:41:52,244 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 48 of 48 statements. [2025-02-08 06:41:52,244 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:52,244 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:52,250 INFO L256 TraceCheckSpWp]: Trace formula consists of 462 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-02-08 06:41:52,254 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:52,260 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 8 treesize of output 1 [2025-02-08 06:41:52,266 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-02-08 06:41:52,292 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 5 treesize of output 3 [2025-02-08 06:41:52,295 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 5 treesize of output 3 [2025-02-08 06:41:52,372 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:41:52,373 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 11 treesize of output 11 [2025-02-08 06:41:52,382 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 14 treesize of output 9 [2025-02-08 06:41:52,457 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 5 treesize of output 3 [2025-02-08 06:41:52,476 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|))) is different from true [2025-02-08 06:41:52,500 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:52,501 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 14 treesize of output 9 [2025-02-08 06:41:52,533 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 5 treesize of output 3 [2025-02-08 06:41:52,563 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:52,564 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 14 treesize of output 9 [2025-02-08 06:41:52,591 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 14 not checked. [2025-02-08 06:41:52,592 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:52,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1945812933] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:52,680 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:41:52,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 18 [2025-02-08 06:41:52,681 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361776152] [2025-02-08 06:41:52,681 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:52,681 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2025-02-08 06:41:52,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:52,681 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2025-02-08 06:41:52,681 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=294, Unknown=1, NotChecked=34, Total=380 [2025-02-08 06:41:52,682 INFO L87 Difference]: Start difference. First operand 90 states and 97 transitions. Second operand has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 14 states have internal predecessors, (66), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:41:53,150 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:53,150 INFO L93 Difference]: Finished difference Result 87 states and 93 transitions. [2025-02-08 06:41:53,151 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:41:53,151 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 14 states have internal predecessors, (66), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 48 [2025-02-08 06:41:53,151 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:53,152 INFO L225 Difference]: With dead ends: 87 [2025-02-08 06:41:53,152 INFO L226 Difference]: Without dead ends: 87 [2025-02-08 06:41:53,152 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 48 SyntacticMatches, 0 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 47 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=127, Invalid=688, Unknown=1, NotChecked=54, Total=870 [2025-02-08 06:41:53,153 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 56 mSDsluCounter, 437 mSDsCounter, 0 mSdLazyCounter, 702 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 477 SdHoareTripleChecker+Invalid, 793 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 702 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 84 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:53,153 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 477 Invalid, 793 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 702 Invalid, 0 Unknown, 84 Unchecked, 0.3s Time] [2025-02-08 06:41:53,153 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-08 06:41:53,154 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-08 06:41:53,154 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 59 states have (on average 1.4745762711864407) internal successors, (87), 82 states have internal predecessors, (87), 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-02-08 06:41:53,155 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 93 transitions. [2025-02-08 06:41:53,156 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 93 transitions. Word has length 48 [2025-02-08 06:41:53,156 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:53,156 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 93 transitions. [2025-02-08 06:41:53,156 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 3.6666666666666665) internal successors, (66), 14 states have internal predecessors, (66), 4 states have call successors, (5), 3 states have call predecessors, (5), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:41:53,156 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 93 transitions. [2025-02-08 06:41:53,157 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 06:41:53,157 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:53,158 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:53,164 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-02-08 06:41:53,362 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:53,363 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:41:53,363 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:53,363 INFO L85 PathProgramCache]: Analyzing trace with hash -2036985652, now seen corresponding path program 1 times [2025-02-08 06:41:53,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:53,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1190383570] [2025-02-08 06:41:53,363 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:53,364 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:53,378 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 06:41:53,387 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:41:53,387 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:53,387 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:53,673 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:41:53,673 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:53,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1190383570] [2025-02-08 06:41:53,673 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1190383570] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:53,673 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1715288284] [2025-02-08 06:41:53,673 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:53,673 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:53,674 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:53,675 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:53,677 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-02-08 06:41:53,776 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 06:41:54,165 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:41:54,165 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:54,165 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:54,168 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 35 conjuncts are in the unsatisfiable core [2025-02-08 06:41:54,171 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:54,190 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-02-08 06:41:54,272 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 9 treesize of output 3 [2025-02-08 06:41:54,276 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-02-08 06:41:54,310 INFO L349 Elim1Store]: treesize reduction 32, result has 36.0 percent of original size [2025-02-08 06:41:54,311 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 23 treesize of output 24 [2025-02-08 06:41:54,324 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 17 treesize of output 9 [2025-02-08 06:41:54,331 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 7 not checked. [2025-02-08 06:41:54,331 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:54,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1715288284] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:54,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:41:54,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12] total 19 [2025-02-08 06:41:54,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [165091930] [2025-02-08 06:41:54,376 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:54,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-02-08 06:41:54,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:54,377 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-02-08 06:41:54,377 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=330, Unknown=1, NotChecked=36, Total=420 [2025-02-08 06:41:54,377 INFO L87 Difference]: Start difference. First operand 87 states and 93 transitions. Second operand has 20 states, 19 states have (on average 3.526315789473684) internal successors, (67), 17 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:41:54,725 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:54,725 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2025-02-08 06:41:54,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-02-08 06:41:54,726 INFO L78 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 3.526315789473684) internal successors, (67), 17 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 49 [2025-02-08 06:41:54,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:54,726 INFO L225 Difference]: With dead ends: 87 [2025-02-08 06:41:54,726 INFO L226 Difference]: Without dead ends: 87 [2025-02-08 06:41:54,726 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 52 SyntacticMatches, 0 SemanticMatches, 26 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 87 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=91, Invalid=614, Unknown=1, NotChecked=50, Total=756 [2025-02-08 06:41:54,727 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 65 mSDsluCounter, 423 mSDsCounter, 0 mSdLazyCounter, 593 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 65 SdHoareTripleChecker+Valid, 481 SdHoareTripleChecker+Invalid, 686 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 593 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:54,727 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [65 Valid, 481 Invalid, 686 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 593 Invalid, 0 Unknown, 85 Unchecked, 0.3s Time] [2025-02-08 06:41:54,727 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-02-08 06:41:54,728 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-02-08 06:41:54,728 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 87 states, 61 states have (on average 1.4426229508196722) internal successors, (88), 82 states have internal predecessors, (88), 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-02-08 06:41:54,729 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2025-02-08 06:41:54,729 INFO L78 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 49 [2025-02-08 06:41:54,729 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:54,729 INFO L471 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2025-02-08 06:41:54,729 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 3.526315789473684) internal successors, (67), 17 states have internal predecessors, (67), 4 states have call successors, (4), 2 states have call predecessors, (4), 4 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:41:54,729 INFO L276 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2025-02-08 06:41:54,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 50 [2025-02-08 06:41:54,729 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:54,729 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:54,738 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-02-08 06:41:54,930 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,9 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:54,930 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:41:54,930 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:54,931 INFO L85 PathProgramCache]: Analyzing trace with hash -2036985651, now seen corresponding path program 1 times [2025-02-08 06:41:54,931 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:54,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365659174] [2025-02-08 06:41:54,931 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:54,931 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:54,943 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 06:41:54,951 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:41:54,951 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:54,951 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:55,287 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:41:55,288 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:55,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365659174] [2025-02-08 06:41:55,288 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365659174] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:55,288 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1209707985] [2025-02-08 06:41:55,288 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:55,288 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:55,288 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:55,290 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:55,292 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-02-08 06:41:55,398 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 49 statements into 1 equivalence classes. [2025-02-08 06:41:55,437 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 49 of 49 statements. [2025-02-08 06:41:55,437 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:55,437 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:55,439 INFO L256 TraceCheckSpWp]: Trace formula consists of 455 conjuncts, 59 conjuncts are in the unsatisfiable core [2025-02-08 06:41:55,442 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:55,464 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 8 treesize of output 1 [2025-02-08 06:41:55,468 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-02-08 06:41:55,642 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 9 treesize of output 3 [2025-02-08 06:41:55,644 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 9 treesize of output 3 [2025-02-08 06:41:55,671 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2025-02-08 06:41:55,707 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:55,708 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 18 treesize of output 13 [2025-02-08 06:41:55,715 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 06:41:55,715 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 15 treesize of output 15 [2025-02-08 06:41:55,777 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 17 treesize of output 9 [2025-02-08 06:41:55,821 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 7 not checked. [2025-02-08 06:41:55,821 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:55,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1209707985] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:55,972 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:41:55,972 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 13] total 24 [2025-02-08 06:41:55,972 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [789211180] [2025-02-08 06:41:55,972 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:55,973 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2025-02-08 06:41:55,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:55,973 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2025-02-08 06:41:55,973 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=73, Invalid=686, Unknown=1, NotChecked=52, Total=812 [2025-02-08 06:41:55,973 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 25 states, 23 states have (on average 3.347826086956522) internal successors, (77), 21 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:41:56,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:56,561 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2025-02-08 06:41:56,561 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2025-02-08 06:41:56,561 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 23 states have (on average 3.347826086956522) internal successors, (77), 21 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) Word has length 49 [2025-02-08 06:41:56,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:56,562 INFO L225 Difference]: With dead ends: 101 [2025-02-08 06:41:56,562 INFO L226 Difference]: Without dead ends: 101 [2025-02-08 06:41:56,562 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 84 GetRequests, 44 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 168 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=153, Invalid=1490, Unknown=1, NotChecked=78, Total=1722 [2025-02-08 06:41:56,563 INFO L435 NwaCegarLoop]: 62 mSDtfsCounter, 77 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 806 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 77 SdHoareTripleChecker+Valid, 619 SdHoareTripleChecker+Invalid, 910 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 806 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:56,563 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [77 Valid, 619 Invalid, 910 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 806 Invalid, 0 Unknown, 98 Unchecked, 0.3s Time] [2025-02-08 06:41:56,563 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-02-08 06:41:56,564 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2025-02-08 06:41:56,564 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 71 states have (on average 1.380281690140845) internal successors, (98), 92 states have internal predecessors, (98), 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-02-08 06:41:56,565 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2025-02-08 06:41:56,565 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 49 [2025-02-08 06:41:56,566 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:56,566 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2025-02-08 06:41:56,566 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 23 states have (on average 3.347826086956522) internal successors, (77), 21 states have internal predecessors, (77), 4 states have call successors, (4), 3 states have call predecessors, (4), 5 states have return successors, (6), 6 states have call predecessors, (6), 4 states have call successors, (6) [2025-02-08 06:41:56,566 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2025-02-08 06:41:56,566 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 06:41:56,566 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:56,566 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:56,575 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-02-08 06:41:56,767 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,10 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:56,767 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:41:56,767 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:56,767 INFO L85 PathProgramCache]: Analyzing trace with hash -246583164, now seen corresponding path program 1 times [2025-02-08 06:41:56,767 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:56,767 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [453980717] [2025-02-08 06:41:56,767 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:56,767 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:56,782 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 06:41:56,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:41:56,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:56,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:56,853 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-02-08 06:41:56,853 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:56,854 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [453980717] [2025-02-08 06:41:56,854 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [453980717] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:56,854 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:56,854 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:41:56,854 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1475860970] [2025-02-08 06:41:56,854 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:56,854 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:41:56,854 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:56,855 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:41:56,855 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:41:56,855 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:56,932 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:56,932 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2025-02-08 06:41:56,932 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:41:56,933 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2025-02-08 06:41:56,933 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:56,933 INFO L225 Difference]: With dead ends: 97 [2025-02-08 06:41:56,933 INFO L226 Difference]: Without dead ends: 97 [2025-02-08 06:41:56,933 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:41:56,934 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 8 mSDsluCounter, 158 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 161 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:56,935 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 226 Invalid, 161 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:41:56,935 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-02-08 06:41:56,937 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-02-08 06:41:56,937 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 71 states have (on average 1.3661971830985915) internal successors, (97), 91 states have internal predecessors, (97), 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-02-08 06:41:56,937 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2025-02-08 06:41:56,938 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 52 [2025-02-08 06:41:56,938 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:56,938 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2025-02-08 06:41:56,938 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.4) internal successors, (32), 5 states have internal predecessors, (32), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:56,938 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2025-02-08 06:41:56,939 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 53 [2025-02-08 06:41:56,939 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:56,939 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:56,939 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-02-08 06:41:56,939 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:41:56,939 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:56,940 INFO L85 PathProgramCache]: Analyzing trace with hash -246583163, now seen corresponding path program 1 times [2025-02-08 06:41:56,940 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:56,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1443082305] [2025-02-08 06:41:56,940 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:56,940 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:56,955 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 52 statements into 1 equivalence classes. [2025-02-08 06:41:56,963 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 52 of 52 statements. [2025-02-08 06:41:56,963 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:56,963 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:57,098 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-02-08 06:41:57,098 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:57,098 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1443082305] [2025-02-08 06:41:57,098 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1443082305] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:41:57,098 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:41:57,098 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:41:57,099 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [459397419] [2025-02-08 06:41:57,099 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:41:57,099 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-02-08 06:41:57,099 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:57,099 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-02-08 06:41:57,099 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:41:57,099 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:57,174 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:41:57,174 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2025-02-08 06:41:57,174 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-02-08 06:41:57,174 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) Word has length 52 [2025-02-08 06:41:57,174 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:41:57,175 INFO L225 Difference]: With dead ends: 96 [2025-02-08 06:41:57,175 INFO L226 Difference]: Without dead ends: 96 [2025-02-08 06:41:57,175 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:41:57,175 INFO L435 NwaCegarLoop]: 66 mSDtfsCounter, 7 mSDsluCounter, 168 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 234 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 147 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:41:57,175 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 234 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:41:57,176 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-02-08 06:41:57,177 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-02-08 06:41:57,177 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 71 states have (on average 1.352112676056338) internal successors, (96), 90 states have internal predecessors, (96), 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-02-08 06:41:57,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2025-02-08 06:41:57,177 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 52 [2025-02-08 06:41:57,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:41:57,177 INFO L471 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2025-02-08 06:41:57,177 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.8) internal successors, (34), 5 states have internal predecessors, (34), 1 states have call successors, (2), 1 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:41:57,177 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2025-02-08 06:41:57,179 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 06:41:57,179 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:41:57,179 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:41:57,179 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-02-08 06:41:57,179 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:41:57,180 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:41:57,180 INFO L85 PathProgramCache]: Analyzing trace with hash -744016158, now seen corresponding path program 1 times [2025-02-08 06:41:57,180 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:41:57,180 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [434409812] [2025-02-08 06:41:57,180 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:57,180 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:41:57,194 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 06:41:57,216 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 06:41:57,216 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:57,216 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:57,966 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:41:57,966 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:41:57,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [434409812] [2025-02-08 06:41:57,966 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [434409812] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:57,966 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [883297970] [2025-02-08 06:41:57,966 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:41:57,966 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:41:57,966 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:41:57,969 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:41:57,970 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-02-08 06:41:58,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 06:41:58,373 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 06:41:58,373 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:41:58,373 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:41:58,376 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 80 conjuncts are in the unsatisfiable core [2025-02-08 06:41:58,380 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:41:58,484 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:41:58,485 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 11 treesize of output 11 [2025-02-08 06:41:58,575 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-02-08 06:41:58,629 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-02-08 06:41:58,629 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 34 treesize of output 33 [2025-02-08 06:41:58,739 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-02-08 06:41:58,742 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-02-08 06:41:58,884 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_6|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|)))))) is different from true [2025-02-08 06:41:58,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:41:58,907 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-02-08 06:41:58,930 INFO L349 Elim1Store]: treesize reduction 76, result has 36.1 percent of original size [2025-02-08 06:41:58,931 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 36 treesize of output 52 [2025-02-08 06:41:58,987 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 46 treesize of output 26 [2025-02-08 06:41:59,063 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 25 treesize of output 13 [2025-02-08 06:41:59,137 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 26 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-02-08 06:41:59,137 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:41:59,294 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [883297970] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:41:59,294 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:41:59,294 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 22] total 41 [2025-02-08 06:41:59,297 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1373739332] [2025-02-08 06:41:59,297 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:41:59,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2025-02-08 06:41:59,298 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:41:59,298 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2025-02-08 06:41:59,299 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1835, Unknown=1, NotChecked=86, Total=2070 [2025-02-08 06:41:59,299 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 42 states, 40 states have (on average 2.175) internal successors, (87), 37 states have internal predecessors, (87), 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-02-08 06:42:00,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:00,609 INFO L93 Difference]: Finished difference Result 109 states and 120 transitions. [2025-02-08 06:42:00,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 27 states. [2025-02-08 06:42:00,609 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 40 states have (on average 2.175) internal successors, (87), 37 states have internal predecessors, (87), 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 54 [2025-02-08 06:42:00,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:00,610 INFO L225 Difference]: With dead ends: 109 [2025-02-08 06:42:00,610 INFO L226 Difference]: Without dead ends: 109 [2025-02-08 06:42:00,611 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 936 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=306, Invalid=3603, Unknown=1, NotChecked=122, Total=4032 [2025-02-08 06:42:00,611 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 82 mSDsluCounter, 1186 mSDsCounter, 0 mSdLazyCounter, 1832 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 1247 SdHoareTripleChecker+Invalid, 1963 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 1832 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 117 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:00,611 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 1247 Invalid, 1963 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 1832 Invalid, 0 Unknown, 117 Unchecked, 0.9s Time] [2025-02-08 06:42:00,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2025-02-08 06:42:00,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 99. [2025-02-08 06:42:00,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 74 states have (on average 1.3513513513513513) internal successors, (100), 93 states have internal predecessors, (100), 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-02-08 06:42:00,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2025-02-08 06:42:00,613 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 54 [2025-02-08 06:42:00,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:00,614 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2025-02-08 06:42:00,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 40 states have (on average 2.175) internal successors, (87), 37 states have internal predecessors, (87), 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-02-08 06:42:00,614 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2025-02-08 06:42:00,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-02-08 06:42:00,614 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:00,614 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:00,623 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2025-02-08 06:42:00,815 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-02-08 06:42:00,815 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:42:00,815 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:00,816 INFO L85 PathProgramCache]: Analyzing trace with hash -744016157, now seen corresponding path program 1 times [2025-02-08 06:42:00,816 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:00,816 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961863829] [2025-02-08 06:42:00,816 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:00,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:00,829 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 06:42:00,846 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 06:42:00,846 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:00,846 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:02,209 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 15 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:02,209 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:02,209 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961863829] [2025-02-08 06:42:02,209 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961863829] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:02,210 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1303713539] [2025-02-08 06:42:02,210 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:02,210 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:02,210 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:02,212 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:42:02,213 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-02-08 06:42:02,357 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-02-08 06:42:02,553 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-02-08 06:42:02,553 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:02,553 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:02,556 INFO L256 TraceCheckSpWp]: Trace formula consists of 477 conjuncts, 108 conjuncts are in the unsatisfiable core [2025-02-08 06:42:02,560 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:02,583 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 8 treesize of output 1 [2025-02-08 06:42:02,587 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-02-08 06:42:02,834 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:02,834 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 11 treesize of output 11 [2025-02-08 06:42:02,838 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 14 treesize of output 9 [2025-02-08 06:42:02,943 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 13 treesize of output 9 [2025-02-08 06:42:02,947 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 13 treesize of output 9 [2025-02-08 06:42:02,998 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:42:02,998 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 73 treesize of output 66 [2025-02-08 06:42:03,002 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 30 treesize of output 13 [2025-02-08 06:42:03,138 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 61 treesize of output 19 [2025-02-08 06:42:03,142 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 17 treesize of output 3 [2025-02-08 06:42:03,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2025-02-08 06:42:03,151 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-02-08 06:42:03,190 WARN L873 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (= (store |c_old(#length)| |node_create_~temp~0#1.base| (select |c_#length| |node_create_~temp~0#1.base|)) |c_#length|) (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))))) is different from true [2025-02-08 06:42:03,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:03,210 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 69 treesize of output 52 [2025-02-08 06:42:03,216 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:03,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 28 treesize of output 23 [2025-02-08 06:42:03,232 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-02-08 06:42:03,232 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 34 treesize of output 36 [2025-02-08 06:42:03,239 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 26 treesize of output 21 [2025-02-08 06:42:03,299 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 66 treesize of output 46 [2025-02-08 06:42:03,302 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 50 treesize of output 34 [2025-02-08 06:42:03,391 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 31 treesize of output 13 [2025-02-08 06:42:03,394 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 9 treesize of output 3 [2025-02-08 06:42:03,452 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 10 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-08 06:42:03,453 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:03,781 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1303713539] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:03,781 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:42:03,781 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [27, 26] total 48 [2025-02-08 06:42:03,781 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2099405557] [2025-02-08 06:42:03,781 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:03,781 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 49 states [2025-02-08 06:42:03,781 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:03,782 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 49 interpolants. [2025-02-08 06:42:03,782 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=158, Invalid=2707, Unknown=1, NotChecked=104, Total=2970 [2025-02-08 06:42:03,783 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 49 states, 46 states have (on average 2.0) internal successors, (92), 43 states have internal predecessors, (92), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:42:05,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:05,246 INFO L93 Difference]: Finished difference Result 104 states and 112 transitions. [2025-02-08 06:42:05,247 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-02-08 06:42:05,247 INFO L78 Accepts]: Start accepts. Automaton has has 49 states, 46 states have (on average 2.0) internal successors, (92), 43 states have internal predecessors, (92), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 54 [2025-02-08 06:42:05,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:05,248 INFO L225 Difference]: With dead ends: 104 [2025-02-08 06:42:05,248 INFO L226 Difference]: Without dead ends: 104 [2025-02-08 06:42:05,249 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 46 SyntacticMatches, 1 SemanticMatches, 71 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1077 ImplicationChecksByTransitivity, 1.9s TimeCoverageRelationStatistics Valid=305, Invalid=4810, Unknown=1, NotChecked=140, Total=5256 [2025-02-08 06:42:05,250 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 81 mSDsluCounter, 1117 mSDsCounter, 0 mSdLazyCounter, 1914 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 2025 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1914 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:05,250 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 1176 Invalid, 2025 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1914 Invalid, 0 Unknown, 102 Unchecked, 0.8s Time] [2025-02-08 06:42:05,250 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2025-02-08 06:42:05,253 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2025-02-08 06:42:05,253 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 76 states have (on average 1.3421052631578947) internal successors, (102), 95 states have internal predecessors, (102), 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-02-08 06:42:05,254 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 108 transitions. [2025-02-08 06:42:05,254 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 108 transitions. Word has length 54 [2025-02-08 06:42:05,254 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:05,255 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 108 transitions. [2025-02-08 06:42:05,255 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 49 states, 46 states have (on average 2.0) internal successors, (92), 43 states have internal predecessors, (92), 6 states have call successors, (6), 3 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:42:05,255 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 108 transitions. [2025-02-08 06:42:05,255 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 06:42:05,255 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:05,255 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-02-08 06:42:05,264 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2025-02-08 06:42:05,456 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:05,456 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:42:05,456 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:05,456 INFO L85 PathProgramCache]: Analyzing trace with hash -653409443, now seen corresponding path program 1 times [2025-02-08 06:42:05,456 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:05,456 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [654092136] [2025-02-08 06:42:05,456 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:05,456 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:05,474 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 06:42:05,479 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 06:42:05,479 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:05,480 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:05,587 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-08 06:42:05,587 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:05,588 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [654092136] [2025-02-08 06:42:05,588 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [654092136] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:05,588 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:05,588 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-02-08 06:42:05,588 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1787760041] [2025-02-08 06:42:05,588 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:05,588 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-02-08 06:42:05,588 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:05,589 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-02-08 06:42:05,589 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-02-08 06:42:05,589 INFO L87 Difference]: Start difference. First operand 101 states and 108 transitions. Second operand has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 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-02-08 06:42:05,707 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:05,707 INFO L93 Difference]: Finished difference Result 115 states and 124 transitions. [2025-02-08 06:42:05,707 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-02-08 06:42:05,708 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 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 57 [2025-02-08 06:42:05,708 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:05,708 INFO L225 Difference]: With dead ends: 115 [2025-02-08 06:42:05,708 INFO L226 Difference]: Without dead ends: 115 [2025-02-08 06:42:05,708 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=25, Invalid=85, Unknown=0, NotChecked=0, Total=110 [2025-02-08 06:42:05,709 INFO L435 NwaCegarLoop]: 51 mSDtfsCounter, 64 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 213 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 213 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:05,709 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 284 Invalid, 218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 213 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-02-08 06:42:05,709 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2025-02-08 06:42:05,710 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 99. [2025-02-08 06:42:05,710 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 78 states have (on average 1.294871794871795) internal successors, (101), 93 states have internal predecessors, (101), 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-02-08 06:42:05,711 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2025-02-08 06:42:05,711 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 57 [2025-02-08 06:42:05,711 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:05,711 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2025-02-08 06:42:05,711 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.0) internal successors, (32), 9 states have internal predecessors, (32), 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-02-08 06:42:05,711 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2025-02-08 06:42:05,711 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 58 [2025-02-08 06:42:05,711 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:05,711 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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] [2025-02-08 06:42:05,711 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2025-02-08 06:42:05,711 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:42:05,712 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:05,712 INFO L85 PathProgramCache]: Analyzing trace with hash -653409442, now seen corresponding path program 1 times [2025-02-08 06:42:05,712 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:05,712 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [95690400] [2025-02-08 06:42:05,712 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:05,712 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:05,726 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 06:42:05,732 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 06:42:05,732 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:05,732 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:06,013 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-02-08 06:42:06,013 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:06,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [95690400] [2025-02-08 06:42:06,014 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [95690400] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:06,014 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1699745899] [2025-02-08 06:42:06,014 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:06,014 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:06,014 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:06,016 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:42:06,016 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-02-08 06:42:06,160 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 57 statements into 1 equivalence classes. [2025-02-08 06:42:06,195 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 57 of 57 statements. [2025-02-08 06:42:06,195 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:06,195 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:06,197 INFO L256 TraceCheckSpWp]: Trace formula consists of 515 conjuncts, 52 conjuncts are in the unsatisfiable core [2025-02-08 06:42:06,199 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:06,201 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 8 treesize of output 1 [2025-02-08 06:42:06,321 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 9 treesize of output 3 [2025-02-08 06:42:06,323 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 9 treesize of output 3 [2025-02-08 06:42:06,424 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 06:42:06,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 21 [2025-02-08 06:42:06,440 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-02-08 06:42:06,441 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 15 treesize of output 15 [2025-02-08 06:42:06,549 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 17 treesize of output 9 [2025-02-08 06:42:06,581 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:42:06,581 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:06,725 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1699745899] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:06,725 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:42:06,725 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 27 [2025-02-08 06:42:06,725 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [906759269] [2025-02-08 06:42:06,725 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:06,725 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-02-08 06:42:06,725 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:06,726 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-02-08 06:42:06,726 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=87, Invalid=905, Unknown=0, NotChecked=0, Total=992 [2025-02-08 06:42:06,726 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 28 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 24 states have internal predecessors, (79), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 06:42:07,295 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:07,296 INFO L93 Difference]: Finished difference Result 121 states and 129 transitions. [2025-02-08 06:42:07,296 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2025-02-08 06:42:07,296 INFO L78 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 24 states have internal predecessors, (79), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) Word has length 57 [2025-02-08 06:42:07,296 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:07,297 INFO L225 Difference]: With dead ends: 121 [2025-02-08 06:42:07,297 INFO L226 Difference]: Without dead ends: 121 [2025-02-08 06:42:07,297 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 366 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=180, Invalid=1800, Unknown=0, NotChecked=0, Total=1980 [2025-02-08 06:42:07,298 INFO L435 NwaCegarLoop]: 40 mSDtfsCounter, 124 mSDsluCounter, 684 mSDsCounter, 0 mSdLazyCounter, 1058 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 1065 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1058 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:07,298 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 724 Invalid, 1065 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1058 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2025-02-08 06:42:07,298 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2025-02-08 06:42:07,299 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 103. [2025-02-08 06:42:07,300 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 83 states have (on average 1.2650602409638554) internal successors, (105), 97 states have internal predecessors, (105), 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-02-08 06:42:07,300 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 111 transitions. [2025-02-08 06:42:07,300 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 111 transitions. Word has length 57 [2025-02-08 06:42:07,300 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:07,300 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 111 transitions. [2025-02-08 06:42:07,300 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.0384615384615383) internal successors, (79), 24 states have internal predecessors, (79), 3 states have call successors, (3), 2 states have call predecessors, (3), 4 states have return successors, (5), 5 states have call predecessors, (5), 3 states have call successors, (5) [2025-02-08 06:42:07,300 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 111 transitions. [2025-02-08 06:42:07,301 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 60 [2025-02-08 06:42:07,301 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:07,301 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:07,310 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-02-08 06:42:07,501 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,13 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:07,501 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:42:07,502 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:07,502 INFO L85 PathProgramCache]: Analyzing trace with hash 115895948, now seen corresponding path program 2 times [2025-02-08 06:42:07,502 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:07,502 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1879655285] [2025-02-08 06:42:07,502 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:42:07,502 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:07,529 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-02-08 06:42:07,556 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 06:42:07,556 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:42:07,556 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:09,026 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 15 proven. 26 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-02-08 06:42:09,026 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:09,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1879655285] [2025-02-08 06:42:09,026 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1879655285] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:09,026 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1374497313] [2025-02-08 06:42:09,026 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:42:09,026 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:09,027 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:09,028 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:42:09,029 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-02-08 06:42:09,161 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 59 statements into 2 equivalence classes. [2025-02-08 06:42:09,213 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 59 of 59 statements. [2025-02-08 06:42:09,213 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:42:09,213 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:09,218 INFO L256 TraceCheckSpWp]: Trace formula consists of 499 conjuncts, 141 conjuncts are in the unsatisfiable core [2025-02-08 06:42:09,222 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:09,285 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-02-08 06:42:09,387 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-02-08 06:42:09,390 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-02-08 06:42:09,625 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:42:09,626 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 16 treesize of output 15 [2025-02-08 06:42:09,639 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:42:09,640 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 16 treesize of output 15 [2025-02-08 06:42:09,658 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-02-08 06:42:09,658 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-02-08 06:42:09,761 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-02-08 06:42:09,766 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-02-08 06:42:09,780 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 19 treesize of output 18 [2025-02-08 06:42:09,785 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 19 treesize of output 18 [2025-02-08 06:42:09,856 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-02-08 06:42:09,856 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 1 case distinctions, treesize of input 94 treesize of output 63 [2025-02-08 06:42:09,859 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 46 treesize of output 25 [2025-02-08 06:42:10,030 INFO L349 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-02-08 06:42:10,031 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 27 [2025-02-08 06:42:10,035 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-02-08 06:42:10,037 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 0 case distinctions, treesize of input 19 treesize of output 7 [2025-02-08 06:42:10,189 WARN L873 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0)) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|)))))) is different from true [2025-02-08 06:42:10,214 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:10,219 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-02-08 06:42:10,219 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 51 [2025-02-08 06:42:10,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:10,223 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:10,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 33 [2025-02-08 06:42:10,232 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-02-08 06:42:10,232 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-02-08 06:42:10,315 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 65 treesize of output 41 [2025-02-08 06:42:10,595 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 16 proven. 20 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-02-08 06:42:10,596 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:10,919 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1374497313] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:10,919 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:42:10,919 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 29] total 55 [2025-02-08 06:42:10,920 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1356830308] [2025-02-08 06:42:10,920 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:10,920 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 55 states [2025-02-08 06:42:10,920 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:10,920 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 55 interpolants. [2025-02-08 06:42:10,921 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=211, Invalid=3332, Unknown=1, NotChecked=116, Total=3660 [2025-02-08 06:42:10,921 INFO L87 Difference]: Start difference. First operand 103 states and 111 transitions. Second operand has 55 states, 53 states have (on average 1.849056603773585) internal successors, (98), 48 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:42:11,829 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:11,829 INFO L93 Difference]: Finished difference Result 138 states and 150 transitions. [2025-02-08 06:42:11,829 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2025-02-08 06:42:11,830 INFO L78 Accepts]: Start accepts. Automaton has has 55 states, 53 states have (on average 1.849056603773585) internal successors, (98), 48 states have internal predecessors, (98), 6 states have call successors, (6), 3 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 59 [2025-02-08 06:42:11,830 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:11,831 INFO L225 Difference]: With dead ends: 138 [2025-02-08 06:42:11,833 INFO L226 Difference]: Without dead ends: 138 [2025-02-08 06:42:11,834 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 121 GetRequests, 55 SyntacticMatches, 1 SemanticMatches, 65 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1180 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=262, Invalid=4031, Unknown=1, NotChecked=128, Total=4422 [2025-02-08 06:42:11,835 INFO L435 NwaCegarLoop]: 59 mSDtfsCounter, 14 mSDsluCounter, 1230 mSDsCounter, 0 mSdLazyCounter, 1616 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 1289 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1616 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 120 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:11,835 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 1289 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1616 Invalid, 0 Unknown, 120 Unchecked, 0.7s Time] [2025-02-08 06:42:11,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 138 states. [2025-02-08 06:42:11,838 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 138 to 133. [2025-02-08 06:42:11,838 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 110 states have (on average 1.2181818181818183) internal successors, (134), 124 states have internal predecessors, (134), 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-02-08 06:42:11,839 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 144 transitions. [2025-02-08 06:42:11,839 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 144 transitions. Word has length 59 [2025-02-08 06:42:11,839 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:11,839 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 144 transitions. [2025-02-08 06:42:11,839 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 55 states, 53 states have (on average 1.849056603773585) internal successors, (98), 48 states have internal predecessors, (98), 6 states have call successors, (6), 3 states have call predecessors, (6), 5 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-02-08 06:42:11,839 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 144 transitions. [2025-02-08 06:42:11,840 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 64 [2025-02-08 06:42:11,840 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:11,840 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1] [2025-02-08 06:42:11,847 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2025-02-08 06:42:12,040 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,14 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:12,040 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:42:12,041 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:12,041 INFO L85 PathProgramCache]: Analyzing trace with hash -564126530, now seen corresponding path program 1 times [2025-02-08 06:42:12,041 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:12,041 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [356379112] [2025-02-08 06:42:12,041 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:12,041 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:12,057 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 63 statements into 1 equivalence classes. [2025-02-08 06:42:12,063 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 63 of 63 statements. [2025-02-08 06:42:12,063 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:12,064 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:12,120 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-02-08 06:42:12,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:12,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [356379112] [2025-02-08 06:42:12,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [356379112] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:12,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:12,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-02-08 06:42:12,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [42923062] [2025-02-08 06:42:12,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:12,121 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-02-08 06:42:12,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:12,121 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-02-08 06:42:12,121 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:42:12,121 INFO L87 Difference]: Start difference. First operand 133 states and 144 transitions. Second operand has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:42:12,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:12,133 INFO L93 Difference]: Finished difference Result 136 states and 146 transitions. [2025-02-08 06:42:12,133 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-02-08 06:42:12,133 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 63 [2025-02-08 06:42:12,133 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:12,134 INFO L225 Difference]: With dead ends: 136 [2025-02-08 06:42:12,134 INFO L226 Difference]: Without dead ends: 135 [2025-02-08 06:42:12,134 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-02-08 06:42:12,134 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 33 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 33 SdHoareTripleChecker+Valid, 163 SdHoareTripleChecker+Invalid, 10 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:12,136 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [33 Valid, 163 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:12,137 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2025-02-08 06:42:12,139 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 133. [2025-02-08 06:42:12,139 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 110 states have (on average 1.209090909090909) internal successors, (133), 124 states have internal predecessors, (133), 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-02-08 06:42:12,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 143 transitions. [2025-02-08 06:42:12,141 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 143 transitions. Word has length 63 [2025-02-08 06:42:12,142 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:12,142 INFO L471 AbstractCegarLoop]: Abstraction has 133 states and 143 transitions. [2025-02-08 06:42:12,142 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.5) internal successors, (38), 4 states have internal predecessors, (38), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:42:12,142 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 143 transitions. [2025-02-08 06:42:12,142 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 68 [2025-02-08 06:42:12,142 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:12,143 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:12,143 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-02-08 06:42:12,143 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:42:12,143 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:12,143 INFO L85 PathProgramCache]: Analyzing trace with hash 361158356, now seen corresponding path program 1 times [2025-02-08 06:42:12,143 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:12,143 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [88788425] [2025-02-08 06:42:12,143 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:12,143 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:12,159 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 06:42:12,171 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 06:42:12,172 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:12,172 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:12,858 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 6 proven. 27 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:42:12,858 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:12,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [88788425] [2025-02-08 06:42:12,858 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [88788425] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:12,858 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1711219165] [2025-02-08 06:42:12,858 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:12,858 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:12,858 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:12,861 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:42:12,862 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-02-08 06:42:13,018 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 67 statements into 1 equivalence classes. [2025-02-08 06:42:13,061 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 67 of 67 statements. [2025-02-08 06:42:13,062 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:13,062 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:13,064 INFO L256 TraceCheckSpWp]: Trace formula consists of 557 conjuncts, 76 conjuncts are in the unsatisfiable core [2025-02-08 06:42:13,067 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:13,069 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-02-08 06:42:13,194 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:13,194 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 11 treesize of output 11 [2025-02-08 06:42:13,251 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 13 treesize of output 9 [2025-02-08 06:42:13,288 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:42:13,288 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 42 treesize of output 41 [2025-02-08 06:42:13,395 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 42 treesize of output 14 [2025-02-08 06:42:13,398 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-02-08 06:42:13,516 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:13,517 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 50 treesize of output 39 [2025-02-08 06:42:13,536 INFO L349 Elim1Store]: treesize reduction 94, result has 36.9 percent of original size [2025-02-08 06:42:13,536 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 42 treesize of output 64 [2025-02-08 06:42:13,672 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2025-02-08 06:42:13,672 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 73 treesize of output 60 [2025-02-08 06:42:13,759 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-02-08 06:42:13,759 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 114 treesize of output 98 [2025-02-08 06:42:13,778 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 7 treesize of output 3 [2025-02-08 06:42:13,945 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 164 treesize of output 116 [2025-02-08 06:42:13,949 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 115 treesize of output 87 [2025-02-08 06:42:14,284 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 93 treesize of output 51 [2025-02-08 06:42:14,442 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 17 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:14,443 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:14,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1711219165] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:14,832 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:42:14,832 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [26, 28] total 51 [2025-02-08 06:42:14,832 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1774163101] [2025-02-08 06:42:14,832 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:14,832 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2025-02-08 06:42:14,832 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:14,833 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2025-02-08 06:42:14,833 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=184, Invalid=3354, Unknown=2, NotChecked=0, Total=3540 [2025-02-08 06:42:14,834 INFO L87 Difference]: Start difference. First operand 133 states and 143 transitions. Second operand has 51 states, 49 states have (on average 2.4285714285714284) internal successors, (119), 44 states have internal predecessors, (119), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:42:16,609 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:16,609 INFO L93 Difference]: Finished difference Result 136 states and 145 transitions. [2025-02-08 06:42:16,610 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2025-02-08 06:42:16,610 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 49 states have (on average 2.4285714285714284) internal successors, (119), 44 states have internal predecessors, (119), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 67 [2025-02-08 06:42:16,610 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:16,610 INFO L225 Difference]: With dead ends: 136 [2025-02-08 06:42:16,611 INFO L226 Difference]: Without dead ends: 136 [2025-02-08 06:42:16,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 144 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 81 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1306 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=425, Invalid=6379, Unknown=2, NotChecked=0, Total=6806 [2025-02-08 06:42:16,612 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 93 mSDsluCounter, 1014 mSDsCounter, 0 mSdLazyCounter, 1762 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 93 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 1779 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1762 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:16,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [93 Valid, 1055 Invalid, 1779 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1762 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-02-08 06:42:16,613 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-02-08 06:42:16,614 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-02-08 06:42:16,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 113 states have (on average 1.1946902654867257) internal successors, (135), 127 states have internal predecessors, (135), 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-02-08 06:42:16,615 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2025-02-08 06:42:16,615 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 67 [2025-02-08 06:42:16,615 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:16,615 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2025-02-08 06:42:16,615 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 49 states have (on average 2.4285714285714284) internal successors, (119), 44 states have internal predecessors, (119), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:42:16,615 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2025-02-08 06:42:16,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-02-08 06:42:16,615 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:16,615 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:16,623 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-02-08 06:42:16,816 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2025-02-08 06:42:16,816 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr16REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:42:16,816 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:16,816 INFO L85 PathProgramCache]: Analyzing trace with hash -1753291925, now seen corresponding path program 1 times [2025-02-08 06:42:16,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:16,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1555733875] [2025-02-08 06:42:16,817 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:16,817 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:16,830 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 06:42:16,842 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 06:42:16,842 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:16,842 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:18,579 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 6 proven. 32 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:18,579 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:18,579 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1555733875] [2025-02-08 06:42:18,580 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1555733875] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:18,580 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1621944145] [2025-02-08 06:42:18,580 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:18,580 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:18,580 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:18,582 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:42:18,583 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-02-08 06:42:18,748 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-02-08 06:42:18,818 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-02-08 06:42:18,818 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:18,818 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:18,822 INFO L256 TraceCheckSpWp]: Trace formula consists of 579 conjuncts, 123 conjuncts are in the unsatisfiable core [2025-02-08 06:42:18,826 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:18,832 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-02-08 06:42:18,835 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 8 treesize of output 1 [2025-02-08 06:42:19,116 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:42:19,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-02-08 06:42:19,124 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:19,124 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 11 treesize of output 11 [2025-02-08 06:42:19,240 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 13 treesize of output 9 [2025-02-08 06:42:19,243 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 13 treesize of output 9 [2025-02-08 06:42:19,306 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-02-08 06:42:19,306 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 73 treesize of output 66 [2025-02-08 06:42:19,312 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 30 treesize of output 13 [2025-02-08 06:42:19,471 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 61 treesize of output 19 [2025-02-08 06:42:19,474 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 17 treesize of output 3 [2025-02-08 06:42:19,476 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-02-08 06:42:19,479 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 5 treesize of output 3 [2025-02-08 06:42:19,691 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-02-08 06:42:19,691 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 26 treesize of output 29 [2025-02-08 06:42:19,695 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 11 treesize of output 3 [2025-02-08 06:42:19,700 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:19,700 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 69 treesize of output 52 [2025-02-08 06:42:19,712 INFO L349 Elim1Store]: treesize reduction 41, result has 47.4 percent of original size [2025-02-08 06:42:19,712 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 1 case distinctions, treesize of input 28 treesize of output 41 [2025-02-08 06:42:19,736 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-02-08 06:42:19,737 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 34 treesize of output 36 [2025-02-08 06:42:20,167 INFO L349 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2025-02-08 06:42:20,167 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 73 treesize of output 60 [2025-02-08 06:42:20,179 INFO L349 Elim1Store]: treesize reduction 71, result has 19.3 percent of original size [2025-02-08 06:42:20,179 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 2 case distinctions, treesize of input 40 treesize of output 33 [2025-02-08 06:42:20,324 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-02-08 06:42:20,324 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 123 treesize of output 107 [2025-02-08 06:42:20,337 INFO L349 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-02-08 06:42:20,338 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 138 treesize of output 140 [2025-02-08 06:42:20,376 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 7 treesize of output 3 [2025-02-08 06:42:20,443 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 7 treesize of output 3 [2025-02-08 06:42:20,882 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 354 treesize of output 266 [2025-02-08 06:42:20,889 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 270 treesize of output 214 [2025-02-08 06:42:21,509 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:21,509 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 211 treesize of output 145 [2025-02-08 06:42:21,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:21,531 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 115 treesize of output 115 [2025-02-08 06:42:21,994 INFO L134 CoverageAnalysis]: Checked inductivity of 38 backedges. 14 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-02-08 06:42:21,994 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:22,312 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|)) (.cse1 (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~#s~0#1.base|) |c_ULTIMATE.start_main_~#s~0#1.offset|) 4))) (and (forall ((v_ArrVal_3325 (Array Int Int))) (<= 0 (+ 4 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3325) .cse0) .cse1)))) (forall ((v_ArrVal_3325 (Array Int Int)) (v_ArrVal_3326 (Array Int Int))) (<= (+ 8 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3325) .cse0) .cse1)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~new_last~0#1.base| v_ArrVal_3326) .cse0) .cse1)))))) is different from false [2025-02-08 06:42:23,432 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1621944145] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:23,432 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:42:23,432 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [34, 30] total 61 [2025-02-08 06:42:23,432 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [360344102] [2025-02-08 06:42:23,432 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:23,432 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2025-02-08 06:42:23,433 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:23,433 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2025-02-08 06:42:23,434 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=223, Invalid=4865, Unknown=28, NotChecked=140, Total=5256 [2025-02-08 06:42:23,434 INFO L87 Difference]: Start difference. First operand 136 states and 145 transitions. Second operand has 62 states, 59 states have (on average 2.1864406779661016) internal successors, (129), 54 states have internal predecessors, (129), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:42:27,379 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:27,379 INFO L93 Difference]: Finished difference Result 179 states and 191 transitions. [2025-02-08 06:42:27,379 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 40 states. [2025-02-08 06:42:27,379 INFO L78 Accepts]: Start accepts. Automaton has has 62 states, 59 states have (on average 2.1864406779661016) internal successors, (129), 54 states have internal predecessors, (129), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) Word has length 72 [2025-02-08 06:42:27,380 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:27,380 INFO L225 Difference]: With dead ends: 179 [2025-02-08 06:42:27,380 INFO L226 Difference]: Without dead ends: 179 [2025-02-08 06:42:27,382 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 174 GetRequests, 69 SyntacticMatches, 0 SemanticMatches, 105 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1544 ImplicationChecksByTransitivity, 6.0s TimeCoverageRelationStatistics Valid=562, Invalid=10542, Unknown=30, NotChecked=208, Total=11342 [2025-02-08 06:42:27,382 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 163 mSDsluCounter, 1446 mSDsCounter, 0 mSdLazyCounter, 3205 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 163 SdHoareTripleChecker+Valid, 1487 SdHoareTripleChecker+Invalid, 3218 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 3205 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.5s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:27,382 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [163 Valid, 1487 Invalid, 3218 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 3205 Invalid, 0 Unknown, 0 Unchecked, 1.5s Time] [2025-02-08 06:42:27,383 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 179 states. [2025-02-08 06:42:27,385 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 179 to 140. [2025-02-08 06:42:27,385 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 117 states have (on average 1.188034188034188) internal successors, (139), 131 states have internal predecessors, (139), 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-02-08 06:42:27,385 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 149 transitions. [2025-02-08 06:42:27,385 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 149 transitions. Word has length 72 [2025-02-08 06:42:27,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:27,386 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 149 transitions. [2025-02-08 06:42:27,386 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 62 states, 59 states have (on average 2.1864406779661016) internal successors, (129), 54 states have internal predecessors, (129), 5 states have call successors, (5), 3 states have call predecessors, (5), 6 states have return successors, (6), 6 states have call predecessors, (6), 5 states have call successors, (6) [2025-02-08 06:42:27,386 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 149 transitions. [2025-02-08 06:42:27,386 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 74 [2025-02-08 06:42:27,386 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:27,386 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:27,394 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2025-02-08 06:42:27,587 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2025-02-08 06:42:27,587 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:42:27,587 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:27,587 INFO L85 PathProgramCache]: Analyzing trace with hash -1650707540, now seen corresponding path program 1 times [2025-02-08 06:42:27,587 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:27,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522006004] [2025-02-08 06:42:27,587 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:27,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:27,600 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 73 statements into 1 equivalence classes. [2025-02-08 06:42:27,605 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 73 of 73 statements. [2025-02-08 06:42:27,605 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:27,605 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:27,655 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 36 trivial. 0 not checked. [2025-02-08 06:42:27,655 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:27,655 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522006004] [2025-02-08 06:42:27,655 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522006004] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:27,655 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:27,655 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:42:27,655 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [220025691] [2025-02-08 06:42:27,655 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:27,655 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:42:27,655 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:27,655 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:42:27,655 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:42:27,656 INFO L87 Difference]: Start difference. First operand 140 states and 149 transitions. Second operand has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:42:27,694 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:27,694 INFO L93 Difference]: Finished difference Result 140 states and 148 transitions. [2025-02-08 06:42:27,694 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:42:27,695 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) Word has length 73 [2025-02-08 06:42:27,695 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:27,695 INFO L225 Difference]: With dead ends: 140 [2025-02-08 06:42:27,695 INFO L226 Difference]: Without dead ends: 140 [2025-02-08 06:42:27,695 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-02-08 06:42:27,695 INFO L435 NwaCegarLoop]: 70 mSDtfsCounter, 4 mSDsluCounter, 167 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 237 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:27,696 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 237 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:27,696 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2025-02-08 06:42:27,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 140. [2025-02-08 06:42:27,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 140 states, 117 states have (on average 1.1794871794871795) internal successors, (138), 131 states have internal predecessors, (138), 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-02-08 06:42:27,698 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 140 states to 140 states and 148 transitions. [2025-02-08 06:42:27,698 INFO L78 Accepts]: Start accepts. Automaton has 140 states and 148 transitions. Word has length 73 [2025-02-08 06:42:27,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:27,698 INFO L471 AbstractCegarLoop]: Abstraction has 140 states and 148 transitions. [2025-02-08 06:42:27,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 9.2) internal successors, (46), 5 states have internal predecessors, (46), 1 states have call successors, (2), 1 states have call predecessors, (2), 1 states have return successors, (2), 1 states have call predecessors, (2), 1 states have call successors, (2) [2025-02-08 06:42:27,698 INFO L276 IsEmpty]: Start isEmpty. Operand 140 states and 148 transitions. [2025-02-08 06:42:27,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-08 06:42:27,698 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:27,698 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:27,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-02-08 06:42:27,699 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr29REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:42:27,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:27,699 INFO L85 PathProgramCache]: Analyzing trace with hash 415543806, now seen corresponding path program 3 times [2025-02-08 06:42:27,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:27,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [181109321] [2025-02-08 06:42:27,699 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:42:27,699 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:27,715 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 4 equivalence classes. [2025-02-08 06:42:27,733 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 60 of 75 statements. [2025-02-08 06:42:27,734 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:42:27,734 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:29,304 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 66 proven. 13 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-02-08 06:42:29,305 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [181109321] [2025-02-08 06:42:29,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [181109321] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:29,305 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2024308057] [2025-02-08 06:42:29,305 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-02-08 06:42:29,305 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:29,305 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:29,321 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:42:29,322 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-02-08 06:42:29,494 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 75 statements into 4 equivalence classes. [2025-02-08 06:42:29,722 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 60 of 75 statements. [2025-02-08 06:42:29,722 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-02-08 06:42:29,722 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:29,725 INFO L256 TraceCheckSpWp]: Trace formula consists of 512 conjuncts, 139 conjuncts are in the unsatisfiable core [2025-02-08 06:42:29,730 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:29,868 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-02-08 06:42:29,915 INFO L349 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-02-08 06:42:29,915 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 31 treesize of output 25 [2025-02-08 06:42:30,125 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_#memory_$Pointer$#1.base|)) (.cse1 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= .cse0 |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_45| .cse1) 1) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse2 (select |c_#valid| .cse2)))))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |c_#valid| .cse4))))))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0)) is different from false [2025-02-08 06:42:30,127 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_#memory_$Pointer$#1.base|)) (.cse1 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= .cse0 |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_45| .cse1) 1) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse2 (select |c_#valid| .cse2)))))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |c_#valid| .cse4))))))))) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0)) is different from true [2025-02-08 06:42:30,177 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse1 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_45| .cse1) 1) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse2 (select |c_#valid| .cse2)))))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |c_#valid| .cse4)))))))))) is different from false [2025-02-08 06:42:30,179 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse1 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse0 (select |c_#memory_$Pointer$#1.base| .cse0))) (= (select |v_old(#valid)_AFTER_CALL_45| .cse1) 1) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse0 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse2 (select |c_#valid| .cse2)))))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |c_#valid| .cse4)))))))))) is different from true [2025-02-08 06:42:30,195 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:30,204 INFO L349 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-02-08 06:42:30,204 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 31 treesize of output 30 [2025-02-08 06:42:30,234 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#1.base_233| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_#memory_$Pointer$#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse1 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse0 (select |v_#memory_$Pointer$#1.base_233| .cse0)) |v_#memory_$Pointer$#1.base_233|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse1) 1) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse2 (select |c_#valid| .cse2)))))))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |c_#valid| .cse4)))))))))) is different from false [2025-02-08 06:42:30,236 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (or (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#1.base_233| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_#memory_$Pointer$#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse0 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse1 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse0 (select |v_#memory_$Pointer$#1.base_233| .cse0)) |v_#memory_$Pointer$#1.base_233|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse1) 1) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse2 (select |c_#valid| .cse2)))))))) (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |c_#valid| .cse4)))))))))) is different from true [2025-02-08 06:42:30,253 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-02-08 06:42:30,266 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 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 12 [2025-02-08 06:42:30,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:30,299 INFO L349 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2025-02-08 06:42:30,299 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 34 treesize of output 35 [2025-02-08 06:42:30,316 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse2 (= (select .cse3 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse1 (select |c_#valid| .cse1)))))) .cse2)) (and (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse5 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (store |v_#memory_$Pointer$#1.base_233| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) |c_#memory_$Pointer$#1.base|) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse4 (select |v_#memory_$Pointer$#1.base_233| .cse4)) |v_#memory_$Pointer$#1.base_233|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse5) 1) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |c_#valid| .cse6))))))) .cse2)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) is different from false [2025-02-08 06:42:30,318 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse2 (= (select .cse3 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse1 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse1 (select |c_#valid| .cse1)))))) .cse2)) (and (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse5 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (store |v_#memory_$Pointer$#1.base_233| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) |c_#memory_$Pointer$#1.base|) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse4 (select |v_#memory_$Pointer$#1.base_233| .cse4)) |v_#memory_$Pointer$#1.base_233|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse5) 1) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |c_#valid| .cse6))))))) .cse2)))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) is different from true [2025-02-08 06:42:30,403 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:42:30,403 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 16 treesize of output 15 [2025-02-08 06:42:30,434 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:30,446 INFO L349 Elim1Store]: treesize reduction 47, result has 26.6 percent of original size [2025-02-08 06:42:30,446 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 4 new quantified variables, introduced 3 case distinctions, treesize of input 41 treesize of output 53 [2025-02-08 06:42:30,466 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 6 treesize of output 4 [2025-02-08 06:42:30,505 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 63 treesize of output 47 [2025-02-08 06:42:30,594 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse3 (select .cse5 4))) (let ((.cse0 (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) (.cse1 (= (select |c_#valid| .cse3) 1))) (or (and .cse0 .cse1 (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) .cse3) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse4 (select |v_#memory_$Pointer$#1.base_233| .cse4)) |v_#memory_$Pointer$#1.base_233|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_233| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) .cse3 (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |c_#valid| .cse6)))))))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse7 (select .cse9 4))) (and .cse0 .cse1 (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse8 (select |c_#valid| .cse8)))))) (= (select .cse9 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (or (= .cse7 .cse3) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) .cse3))))))))))) is different from false [2025-02-08 06:42:30,596 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse3 (select .cse5 4))) (let ((.cse0 (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) (.cse1 (= (select |c_#valid| .cse3) 1))) (or (and .cse0 .cse1 (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse4 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) .cse3) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse4 (select |v_#memory_$Pointer$#1.base_233| .cse4)) |v_#memory_$Pointer$#1.base_233|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_233| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) .cse3 (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |c_#valid| .cse6)))))))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse7 (select .cse9 4))) (and .cse0 .cse1 (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| .cse7) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse8 (select |c_#valid| .cse8)))))) (= (select .cse9 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (or (= .cse7 .cse3) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) .cse3))))))))))) is different from true [2025-02-08 06:42:30,655 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (select .cse5 4))) (let ((.cse0 (= (select |c_#valid| .cse2) 1)) (.cse1 (or (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)))) (or (and .cse0 .cse1 (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) 4)) (.cse4 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|))) (and (= .cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse4 (select |v_#memory_$Pointer$#1.base_233| .cse4)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1) (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_233| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse5) .cse2 (store (select |v_#memory_$Pointer$#1.base_233| .cse2) 8 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |c_#valid| .cse6)))))))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse8 (select .cse7 4))) (and .cse0 (= (select .cse7 8) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse8) 1) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse9 (select |c_#valid| .cse9)))))) (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)))) (= .cse2 .cse8))))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2025-02-08 06:42:30,657 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (select .cse5 4))) (let ((.cse0 (= (select |c_#valid| .cse2) 1)) (.cse1 (or (= .cse2 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)))) (or (and .cse0 .cse1 (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) 4)) (.cse4 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|))) (and (= .cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse4 (select |v_#memory_$Pointer$#1.base_233| .cse4)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1) (= .cse4 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_233| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse5) .cse2 (store (select |v_#memory_$Pointer$#1.base_233| .cse2) 8 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |c_#valid| .cse6)))))))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse8 (select .cse7 4))) (and .cse0 (= (select .cse7 8) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse1 (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse8) 1) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse9 (select |c_#valid| .cse9)))))) (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)))) (= .cse2 .cse8))))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from true [2025-02-08 06:42:30,731 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse6 (select .cse9 4))) (let ((.cse2 (= (select |c_#valid| .cse6) 1)) (.cse3 (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 .cse6)))) (or (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse4 (select .cse1 4))) (and (= (select .cse1 8) .cse0) .cse2 .cse3 (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse4) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |c_#valid| .cse5)))))) (or (= .cse6 .cse4) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= .cse6 (select (select |c_#memory_$Pointer$#1.base| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)))))))) (and .cse2 (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse7 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse6) 4)) (.cse8 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|))) (and (= (select |v_old(#valid)_AFTER_CALL_45| .cse7) 1) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse8 (select |v_#memory_$Pointer$#1.base_233| .cse8)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_233| .cse0 .cse9) .cse6 (store (select |v_#memory_$Pointer$#1.base_233| .cse6) 8 .cse0))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) .cse6) (= .cse0 .cse8) (= |c_#valid| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse10 (select |c_#valid| .cse10))))))) .cse3))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))) is different from false [2025-02-08 06:42:30,734 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) 0) 0) (= (select |c_#valid| .cse0) 1) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse6 (select .cse9 4))) (let ((.cse2 (= (select |c_#valid| .cse6) 1)) (.cse3 (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= .cse0 .cse6)))) (or (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse6))) (let ((.cse4 (select .cse1 4))) (and (= (select .cse1 8) .cse0) .cse2 .cse3 (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse4) 1) (= |c_#valid| (let ((.cse5 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse5 (select |c_#valid| .cse5)))))) (or (= .cse6 .cse4) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= .cse6 (select (select |c_#memory_$Pointer$#1.base| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)))))))) (and .cse2 (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse7 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse6) 4)) (.cse8 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|))) (and (= (select |v_old(#valid)_AFTER_CALL_45| .cse7) 1) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse8 (select |v_#memory_$Pointer$#1.base_233| .cse8)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse6) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_233| .cse0 .cse9) .cse6 (store (select |v_#memory_$Pointer$#1.base_233| .cse6) 8 .cse0))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) .cse6) (= .cse0 .cse8) (= |c_#valid| (let ((.cse10 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse10 (select |c_#valid| .cse10))))))) .cse3))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))) is different from true [2025-02-08 06:42:30,758 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 338 treesize of output 322 [2025-02-08 06:42:30,787 INFO L349 Elim1Store]: treesize reduction 22, result has 61.4 percent of original size [2025-02-08 06:42:30,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 6 new quantified variables, introduced 6 case distinctions, treesize of input 122 treesize of output 76 [2025-02-08 06:42:30,930 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse0 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse0) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= v_DerPreprocessor_25 .cse3) (= .cse0 .cse1) (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 .cse0) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse5) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse5 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (select v_prenex_43 .cse5) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-02-08 06:42:30,933 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse0 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse0) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= v_DerPreprocessor_25 .cse3) (= .cse0 .cse1) (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 .cse0) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse5) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse5 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (select v_prenex_43 .cse5) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (= |c_#valid| |c_old(#valid)|) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-02-08 06:42:31,016 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse0 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse0) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= v_DerPreprocessor_25 .cse3) (= .cse0 .cse1) (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 .cse0) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse5) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse5 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (select v_prenex_43 .cse5) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-02-08 06:42:31,019 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse0 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse0) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= v_DerPreprocessor_25 .cse3) (= .cse0 .cse1) (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 .cse0) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse5) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse5 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (select v_prenex_43 .cse5) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-02-08 06:42:31,208 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse0 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse0) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= v_DerPreprocessor_25 .cse3) (= .cse0 .cse1) (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 .cse0) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse5) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse5 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (select v_prenex_43 .cse5) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#1.offset|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2025-02-08 06:42:31,211 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse0 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse0) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= v_DerPreprocessor_25 .cse3) (= .cse0 .cse1) (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 .cse0) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse5) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse5 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (select v_prenex_43 .cse5) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#1.offset|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2025-02-08 06:42:31,353 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse0 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse0) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= v_DerPreprocessor_25 .cse3) (= .cse0 .cse1) (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 .cse0) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse5) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse5 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (select v_prenex_43 .cse5) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))))) is different from false [2025-02-08 06:42:31,356 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse0 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse0) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= v_DerPreprocessor_25 .cse3) (= .cse0 .cse1) (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 .cse0) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse5) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse5 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (select v_prenex_43 .cse5) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))))) is different from true [2025-02-08 06:42:31,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:31,567 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 347 treesize of output 336 [2025-02-08 06:42:31,828 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:31,844 INFO L349 Elim1Store]: treesize reduction 64, result has 14.7 percent of original size [2025-02-08 06:42:31,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 5 new quantified variables, introduced 5 case distinctions, treesize of input 138 treesize of output 91 [2025-02-08 06:42:32,305 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse0 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse0) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= v_DerPreprocessor_25 .cse3) (= .cse0 .cse1) (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 .cse0) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse5) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse5 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (select v_prenex_43 .cse5) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) 0))) (let ((.cse7 (= (select (select |c_#memory_$Pointer$#1.offset| .cse9) 4) 0)) (.cse15 (select |c_#memory_$Pointer$#1.base| .cse9))) (or (and .cse7 (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse11 (store (store |v_#memory_$Pointer$#1.base_233| .cse9 .cse15) v_DerPreprocessor_32 .cse10))) (let ((.cse8 (select (select .cse11 .cse9) 4))) (let ((.cse12 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse8) 4)) (.cse13 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|))) (and (= (store (select |v_#memory_$Pointer$#1.base_233| .cse8) 8 .cse9) .cse10) (= |c_#memory_$Pointer$#1.base| (store .cse11 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse12) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) .cse8) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse13 (select |v_#memory_$Pointer$#1.base_233| .cse13)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse12) 1) (= v_DerPreprocessor_32 .cse8) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse9) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_45| |v_old(#valid)_AFTER_CALL_46|))) (store |v_old(#valid)_AFTER_CALL_45| .cse14 (select |v_old(#valid)_AFTER_CALL_46| .cse14))) |v_old(#valid)_AFTER_CALL_46|) (= 1 (select |v_old(#valid)_AFTER_CALL_45| .cse8)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse9) 1) (= .cse9 .cse13)))))))) (let ((.cse18 (select .cse15 4))) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| .cse18))) (let ((.cse17 (select .cse16 4))) (and (= (select .cse16 8) .cse9) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 .cse17) 1) (= (select v_prenex_45 .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse18) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse19 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse19 (select |v_old(#valid)_AFTER_CALL_46| .cse19)))) (= (select |v_old(#valid)_AFTER_CALL_46| .cse9) 1))) (or .cse7 (= .cse9 .cse18)) (or (= .cse18 .cse17) (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse17) (+ v_prenex_46 8)) .cse18)))))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)) is different from false [2025-02-08 06:42:32,310 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse0 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse0) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= v_DerPreprocessor_25 .cse3) (= .cse0 .cse1) (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 .cse0) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse5) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse5 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (select v_prenex_43 .cse5) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (let ((.cse9 (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|) 0))) (let ((.cse7 (= (select (select |c_#memory_$Pointer$#1.offset| .cse9) 4) 0)) (.cse15 (select |c_#memory_$Pointer$#1.base| .cse9))) (or (and .cse7 (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse11 (store (store |v_#memory_$Pointer$#1.base_233| .cse9 .cse15) v_DerPreprocessor_32 .cse10))) (let ((.cse8 (select (select .cse11 .cse9) 4))) (let ((.cse12 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse8) 4)) (.cse13 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|))) (and (= (store (select |v_#memory_$Pointer$#1.base_233| .cse8) 8 .cse9) .cse10) (= |c_#memory_$Pointer$#1.base| (store .cse11 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse12) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) .cse8) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse13 (select |v_#memory_$Pointer$#1.base_233| .cse13)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse12) 1) (= v_DerPreprocessor_32 .cse8) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse9) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= (let ((.cse14 (@diff |v_old(#valid)_AFTER_CALL_45| |v_old(#valid)_AFTER_CALL_46|))) (store |v_old(#valid)_AFTER_CALL_45| .cse14 (select |v_old(#valid)_AFTER_CALL_46| .cse14))) |v_old(#valid)_AFTER_CALL_46|) (= 1 (select |v_old(#valid)_AFTER_CALL_45| .cse8)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse9) 1) (= .cse9 .cse13)))))))) (let ((.cse18 (select .cse15 4))) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| .cse18))) (let ((.cse17 (select .cse16 4))) (and (= (select .cse16 8) .cse9) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 .cse17) 1) (= (select v_prenex_45 .cse9) 0) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse18) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse19 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse19 (select |v_old(#valid)_AFTER_CALL_46| .cse19)))) (= (select |v_old(#valid)_AFTER_CALL_46| .cse9) 1))) (or .cse7 (= .cse9 .cse18)) (or (= .cse18 .cse17) (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse17) (+ v_prenex_46 8)) .cse18)))))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|) 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0)) is different from true [2025-02-08 06:42:32,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:32,904 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 746 treesize of output 538 [2025-02-08 06:42:32,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-02-08 06:42:32,983 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 198 treesize of output 210 [2025-02-08 06:42:33,729 WARN L851 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 0) (let ((.cse7 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4) 0)) (.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|))) (or (and (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse2 (store (store v_prenex_52 |c_ULTIMATE.start_dll_append_#t~mem9#1.base| .cse6) v_DerPreprocessor_32 .cse4))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4))) (let ((.cse3 (@diff v_prenex_54 v_prenex_52)) (.cse5 (select (select v_prenex_54 .cse0) 4))) (and (= v_DerPreprocessor_32 .cse0) (= v_prenex_51 (let ((.cse1 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse1 (select v_prenex_51 .cse1)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (store .cse2 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50)) |c_#memory_$Pointer$#1.base|) (= .cse3 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (= (select v_prenex_51 v_prenex_50) 0) (= (store (select v_prenex_52 .cse0) 8 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse4) (= (select v_prenex_53 .cse5) 1) (= (select v_prenex_53 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= (store v_prenex_54 .cse3 (select v_prenex_52 .cse3)) v_prenex_52) (= (select v_prenex_53 .cse0) 1) (= (select (select v_prenex_54 .cse5) (+ v_prenex_55 8)) .cse0) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1))))))) .cse7) (let ((.cse8 (select .cse6 4))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse10 (select .cse9 4))) (and (or .cse7 (= .cse8 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|)) (= (select .cse9 8) |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (or (exists ((v_prenex_46 Int)) (= .cse8 (select (select |c_#memory_$Pointer$#1.base| .cse10) (+ v_prenex_46 8)))) (= .cse8 .cse10)) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse8) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= (select v_prenex_45 .cse10) 1) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_46| .cse11))))))))))))) is different from false [2025-02-08 06:42:33,732 WARN L873 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 0) (let ((.cse7 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4) 0)) (.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|))) (or (and (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse2 (store (store v_prenex_52 |c_ULTIMATE.start_dll_append_#t~mem9#1.base| .cse6) v_DerPreprocessor_32 .cse4))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4))) (let ((.cse3 (@diff v_prenex_54 v_prenex_52)) (.cse5 (select (select v_prenex_54 .cse0) 4))) (and (= v_DerPreprocessor_32 .cse0) (= v_prenex_51 (let ((.cse1 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse1 (select v_prenex_51 .cse1)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (store .cse2 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50)) |c_#memory_$Pointer$#1.base|) (= .cse3 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (= (select v_prenex_51 v_prenex_50) 0) (= (store (select v_prenex_52 .cse0) 8 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse4) (= (select v_prenex_53 .cse5) 1) (= (select v_prenex_53 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= (store v_prenex_54 .cse3 (select v_prenex_52 .cse3)) v_prenex_52) (= (select v_prenex_53 .cse0) 1) (= (select (select v_prenex_54 .cse5) (+ v_prenex_55 8)) .cse0) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1))))))) .cse7) (let ((.cse8 (select .cse6 4))) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse10 (select .cse9 4))) (and (or .cse7 (= .cse8 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|)) (= (select .cse9 8) |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (or (exists ((v_prenex_46 Int)) (= .cse8 (select (select |c_#memory_$Pointer$#1.base| .cse10) (+ v_prenex_46 8)))) (= .cse8 .cse10)) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse8) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= (select v_prenex_45 .cse10) 1) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_46| .cse11))))))))))))) is different from true [2025-02-08 06:42:33,830 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse4 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (let ((.cse1 (select .cse5 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse3 4))) (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ v_prenex_46 8)) .cse1)) (= .cse0 .cse1)) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse2 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse2 (select |v_old(#valid)_AFTER_CALL_46| .cse2)))) (= (select v_prenex_45 .cse0) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse3 8)) (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) .cse4))))) (and .cse4 (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse11 (store (store v_prenex_52 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) v_DerPreprocessor_32 .cse10))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse6 (@diff v_prenex_54 v_prenex_52)) (.cse8 (select (select v_prenex_54 .cse9) 4))) (and (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) (= (select v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= v_prenex_51 (let ((.cse7 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse7 (select v_prenex_51 .cse7)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (select v_prenex_53 .cse8) 1) (= (select v_prenex_53 .cse9) 1) (= v_DerPreprocessor_32 .cse9) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store (select v_prenex_52 .cse9) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse10) (= |c_#memory_$Pointer$#1.base| (store .cse11 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50))) (= (store v_prenex_54 .cse6 (select v_prenex_52 .cse6)) v_prenex_52) (= (select (select v_prenex_54 .cse8) (+ v_prenex_55 8)) .cse9)))))))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0)) is different from false [2025-02-08 06:42:33,833 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse4 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (let ((.cse1 (select .cse5 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse3 4))) (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ v_prenex_46 8)) .cse1)) (= .cse0 .cse1)) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse2 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse2 (select |v_old(#valid)_AFTER_CALL_46| .cse2)))) (= (select v_prenex_45 .cse0) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse3 8)) (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) .cse4))))) (and .cse4 (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse11 (store (store v_prenex_52 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) v_DerPreprocessor_32 .cse10))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse6 (@diff v_prenex_54 v_prenex_52)) (.cse8 (select (select v_prenex_54 .cse9) 4))) (and (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) (= (select v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= v_prenex_51 (let ((.cse7 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse7 (select v_prenex_51 .cse7)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (select v_prenex_53 .cse8) 1) (= (select v_prenex_53 .cse9) 1) (= v_DerPreprocessor_32 .cse9) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store (select v_prenex_52 .cse9) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse10) (= |c_#memory_$Pointer$#1.base| (store .cse11 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50))) (= (store v_prenex_54 .cse6 (select v_prenex_52 .cse6)) v_prenex_52) (= (select (select v_prenex_54 .cse8) (+ v_prenex_55 8)) .cse9)))))))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0)) is different from true [2025-02-08 06:42:34,024 WARN L851 $PredicateComparison]: unable to prove that (and (let ((.cse4 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (let ((.cse1 (select .cse5 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse3 4))) (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ v_prenex_46 8)) .cse1)) (= .cse0 .cse1)) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse2 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse2 (select |v_old(#valid)_AFTER_CALL_46| .cse2)))) (= (select v_prenex_45 .cse0) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse3 8)) (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) .cse4))))) (and .cse4 (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse11 (store (store v_prenex_52 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) v_DerPreprocessor_32 .cse10))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse6 (@diff v_prenex_54 v_prenex_52)) (.cse8 (select (select v_prenex_54 .cse9) 4))) (and (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) (= (select v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= v_prenex_51 (let ((.cse7 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse7 (select v_prenex_51 .cse7)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (select v_prenex_53 .cse8) 1) (= (select v_prenex_53 .cse9) 1) (= v_DerPreprocessor_32 .cse9) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store (select v_prenex_52 .cse9) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse10) (= |c_#memory_$Pointer$#1.base| (store .cse11 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50))) (= (store v_prenex_54 .cse6 (select v_prenex_52 .cse6)) v_prenex_52) (= (select (select v_prenex_54 .cse8) (+ v_prenex_55 8)) .cse9)))))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0)) is different from false [2025-02-08 06:42:34,028 WARN L873 $PredicateComparison]: unable to prove that (and (let ((.cse4 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0)) (.cse5 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (let ((.cse1 (select .cse5 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse3 4))) (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ v_prenex_46 8)) .cse1)) (= .cse0 .cse1)) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse2 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse2 (select |v_old(#valid)_AFTER_CALL_46| .cse2)))) (= (select v_prenex_45 .cse0) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse3 8)) (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) .cse4))))) (and .cse4 (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse11 (store (store v_prenex_52 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse5) v_DerPreprocessor_32 .cse10))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse6 (@diff v_prenex_54 v_prenex_52)) (.cse8 (select (select v_prenex_54 .cse9) 4))) (and (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) (= (select v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= v_prenex_51 (let ((.cse7 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse7 (select v_prenex_51 .cse7)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (select v_prenex_53 .cse8) 1) (= (select v_prenex_53 .cse9) 1) (= v_DerPreprocessor_32 .cse9) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store (select v_prenex_52 .cse9) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse10) (= |c_#memory_$Pointer$#1.base| (store .cse11 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50))) (= (store v_prenex_54 .cse6 (select v_prenex_52 .cse6)) v_prenex_52) (= (select (select v_prenex_54 .cse8) (+ v_prenex_55 8)) .cse9)))))))))) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0)) is different from true [2025-02-08 06:42:34,201 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 328 treesize of output 316 [2025-02-08 06:42:34,437 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 0))) (or (and .cse0 (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse3 (@diff v_prenex_54 v_prenex_52))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse3)) (.cse7 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse1 (store (store v_prenex_52 .cse3 .cse6) v_DerPreprocessor_32 .cse7))) (let ((.cse2 (select (select .cse1 .cse3) 4))) (let ((.cse5 (select (select v_prenex_54 .cse2) 4))) (and (= (store .cse1 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50)) |c_#memory_$Pointer$#1.base|) (= v_DerPreprocessor_32 .cse2) (= (select v_prenex_51 .cse3) 1) (= v_prenex_51 (let ((.cse4 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse4 (select v_prenex_51 .cse4)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= .cse2 (select (select v_prenex_54 .cse5) (+ v_prenex_55 8))) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse3) 0) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select .cse6 4)) (= (select v_prenex_53 .cse5) 1) (= (select v_prenex_53 .cse2) 1) (= (store (select v_prenex_52 .cse2) 8 .cse3) .cse7) (= (store v_prenex_54 .cse3 (select v_prenex_52 .cse3)) v_prenex_52))))))))) (and .cse0 (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse9 (select .cse10 4))) (and (= .cse8 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= .cse8 .cse9) (= (select v_prenex_45 .cse9) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse10 8)) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_46| .cse11)))))) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (exists ((v_prenex_45 (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse12 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse12 (select |v_old(#valid)_AFTER_CALL_46| .cse12)))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| .cse13))) (let ((.cse14 (select .cse15 4))) (and (exists ((v_prenex_46 Int)) (= .cse13 (select (select |c_#memory_$Pointer$#1.base| .cse14) (+ v_prenex_46 8)))) (= .cse13 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (select v_prenex_45 .cse14) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse15 8)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse13) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))))))))))) is different from false [2025-02-08 06:42:34,441 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 0))) (or (and .cse0 (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse3 (@diff v_prenex_54 v_prenex_52))) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| .cse3)) (.cse7 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse1 (store (store v_prenex_52 .cse3 .cse6) v_DerPreprocessor_32 .cse7))) (let ((.cse2 (select (select .cse1 .cse3) 4))) (let ((.cse5 (select (select v_prenex_54 .cse2) 4))) (and (= (store .cse1 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50)) |c_#memory_$Pointer$#1.base|) (= v_DerPreprocessor_32 .cse2) (= (select v_prenex_51 .cse3) 1) (= v_prenex_51 (let ((.cse4 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse4 (select v_prenex_51 .cse4)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= .cse2 (select (select v_prenex_54 .cse5) (+ v_prenex_55 8))) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse3) 0) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select .cse6 4)) (= (select v_prenex_53 .cse5) 1) (= (select v_prenex_53 .cse2) 1) (= (store (select v_prenex_52 .cse2) 8 .cse3) .cse7) (= (store v_prenex_54 .cse3 (select v_prenex_52 .cse3)) v_prenex_52))))))))) (and .cse0 (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse9 (select .cse10 4))) (and (= .cse8 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= .cse8 .cse9) (= (select v_prenex_45 .cse9) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse10 8)) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_46| .cse11)))))) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (exists ((v_prenex_45 (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse12 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse12 (select |v_old(#valid)_AFTER_CALL_46| .cse12)))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse13 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| .cse13))) (let ((.cse14 (select .cse15 4))) (and (exists ((v_prenex_46 Int)) (= .cse13 (select (select |c_#memory_$Pointer$#1.base| .cse14) (+ v_prenex_46 8)))) (= .cse13 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (select v_prenex_45 .cse14) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse15 8)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse13) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))))))))))) is different from true [2025-02-08 06:42:34,577 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))) (or (and (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse2 (@diff v_prenex_54 v_prenex_52))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse6 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse0 (store (store v_prenex_52 .cse2 .cse4) v_DerPreprocessor_32 .cse6))) (let ((.cse1 (select (select .cse0 .cse2) 4))) (let ((.cse5 (select (select v_prenex_54 .cse1) 4))) (and (= (store .cse0 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50)) |c_#memory_$Pointer$#1.base|) (= v_DerPreprocessor_32 .cse1) (= (select v_prenex_51 .cse2) 1) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse3 (select v_prenex_51 .cse3)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse4 4)) (= .cse1 (select (select v_prenex_54 .cse5) (+ v_prenex_55 8))) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse2) 0) (= (select v_prenex_53 .cse5) 1) (= (select v_prenex_53 .cse1) 1) (= (store (select v_prenex_52 .cse1) 8 .cse2) .cse6) (= (store v_prenex_54 .cse2 (select v_prenex_52 .cse2)) v_prenex_52)))))))) .cse7) (and .cse7 (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse9 (select .cse10 4))) (and (= .cse8 .cse9) (= (select v_prenex_45 .cse9) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= .cse8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse10 8)) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_46| .cse11)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse12))) (let ((.cse13 (select .cse14 4))) (and (exists ((v_prenex_46 Int)) (= .cse12 (select (select |c_#memory_$Pointer$#1.base| .cse13) (+ v_prenex_46 8)))) (= (select v_prenex_45 .cse13) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= .cse12 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse14 8)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse12) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse15 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse15 (select |v_old(#valid)_AFTER_CALL_46| .cse15)))))))))))) is different from false [2025-02-08 06:42:34,581 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))) (or (and (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse2 (@diff v_prenex_54 v_prenex_52))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse6 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse0 (store (store v_prenex_52 .cse2 .cse4) v_DerPreprocessor_32 .cse6))) (let ((.cse1 (select (select .cse0 .cse2) 4))) (let ((.cse5 (select (select v_prenex_54 .cse1) 4))) (and (= (store .cse0 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50)) |c_#memory_$Pointer$#1.base|) (= v_DerPreprocessor_32 .cse1) (= (select v_prenex_51 .cse2) 1) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse3 (select v_prenex_51 .cse3)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse4 4)) (= .cse1 (select (select v_prenex_54 .cse5) (+ v_prenex_55 8))) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse2) 0) (= (select v_prenex_53 .cse5) 1) (= (select v_prenex_53 .cse1) 1) (= (store (select v_prenex_52 .cse1) 8 .cse2) .cse6) (= (store v_prenex_54 .cse2 (select v_prenex_52 .cse2)) v_prenex_52)))))))) .cse7) (and .cse7 (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse9 (select .cse10 4))) (and (= .cse8 .cse9) (= (select v_prenex_45 .cse9) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= .cse8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse10 8)) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_46| .cse11)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse12))) (let ((.cse13 (select .cse14 4))) (and (exists ((v_prenex_46 Int)) (= .cse12 (select (select |c_#memory_$Pointer$#1.base| .cse13) (+ v_prenex_46 8)))) (= (select v_prenex_45 .cse13) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= .cse12 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse14 8)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse12) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse15 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse15 (select |v_old(#valid)_AFTER_CALL_46| .cse15)))))))))))) is different from true [2025-02-08 06:42:34,865 WARN L851 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (let ((.cse7 (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))) (or (and (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse2 (@diff v_prenex_54 v_prenex_52))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse6 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse0 (store (store v_prenex_52 .cse2 .cse4) v_DerPreprocessor_32 .cse6))) (let ((.cse1 (select (select .cse0 .cse2) 4))) (let ((.cse5 (select (select v_prenex_54 .cse1) 4))) (and (= (store .cse0 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50)) |c_#memory_$Pointer$#1.base|) (= v_DerPreprocessor_32 .cse1) (= (select v_prenex_51 .cse2) 1) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse3 (select v_prenex_51 .cse3)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse4 4)) (= .cse1 (select (select v_prenex_54 .cse5) (+ v_prenex_55 8))) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse2) 0) (= (select v_prenex_53 .cse5) 1) (= (select v_prenex_53 .cse1) 1) (= (store (select v_prenex_52 .cse1) 8 .cse2) .cse6) (= (store v_prenex_54 .cse2 (select v_prenex_52 .cse2)) v_prenex_52)))))))) .cse7) (and .cse7 (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse9 (select .cse10 4))) (and (= .cse8 .cse9) (= (select v_prenex_45 .cse9) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= .cse8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse10 8)) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_46| .cse11)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse12))) (let ((.cse13 (select .cse14 4))) (and (exists ((v_prenex_46 Int)) (= .cse12 (select (select |c_#memory_$Pointer$#1.base| .cse13) (+ v_prenex_46 8)))) (= (select v_prenex_45 .cse13) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= .cse12 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse14 8)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse12) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse15 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse15 (select |v_old(#valid)_AFTER_CALL_46| .cse15))))))))))))) is different from false [2025-02-08 06:42:34,869 WARN L873 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (let ((.cse7 (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))) (or (and (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse2 (@diff v_prenex_54 v_prenex_52))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse6 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse0 (store (store v_prenex_52 .cse2 .cse4) v_DerPreprocessor_32 .cse6))) (let ((.cse1 (select (select .cse0 .cse2) 4))) (let ((.cse5 (select (select v_prenex_54 .cse1) 4))) (and (= (store .cse0 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50)) |c_#memory_$Pointer$#1.base|) (= v_DerPreprocessor_32 .cse1) (= (select v_prenex_51 .cse2) 1) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse3 (select v_prenex_51 .cse3)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse4 4)) (= .cse1 (select (select v_prenex_54 .cse5) (+ v_prenex_55 8))) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse2) 0) (= (select v_prenex_53 .cse5) 1) (= (select v_prenex_53 .cse1) 1) (= (store (select v_prenex_52 .cse1) 8 .cse2) .cse6) (= (store v_prenex_54 .cse2 (select v_prenex_52 .cse2)) v_prenex_52)))))))) .cse7) (and .cse7 (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse9 (select .cse10 4))) (and (= .cse8 .cse9) (= (select v_prenex_45 .cse9) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= .cse8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse10 8)) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_46| .cse11)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse12))) (let ((.cse13 (select .cse14 4))) (and (exists ((v_prenex_46 Int)) (= .cse12 (select (select |c_#memory_$Pointer$#1.base| .cse13) (+ v_prenex_46 8)))) (= (select v_prenex_45 .cse13) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= .cse12 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse14 8)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse12) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse15 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse15 (select |v_old(#valid)_AFTER_CALL_46| .cse15))))))))))))) is different from true [2025-02-08 06:42:35,122 INFO L349 Elim1Store]: treesize reduction 22, result has 12.0 percent of original size [2025-02-08 06:42:35,122 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 6 case distinctions, treesize of input 54 treesize of output 24 [2025-02-08 06:42:35,221 INFO L349 Elim1Store]: treesize reduction 62, result has 21.5 percent of original size [2025-02-08 06:42:35,221 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 7 new quantified variables, introduced 10 case distinctions, treesize of input 69 treesize of output 45 [2025-02-08 06:42:35,360 WARN L851 $PredicateComparison]: unable to prove that (or (and (exists ((|node_create_~temp~0#1.base| Int) (v_arrayElimCell_175 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= 0 (select v_prenex_45 v_arrayElimCell_175)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse0 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_175) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1)) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_43| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_dll_append_~last~0#1.base_43|) 1) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_arrayElimCell_180 Int)) (and (not (= |v_ULTIMATE.start_dll_append_~last~0#1.base_43| v_arrayElimCell_180)) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_43|) 1) (= (select v_prenex_45 v_arrayElimCell_180) 0) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_180) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse1 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse1 (select |v_old(#valid)_AFTER_CALL_46| .cse1)))))))) (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_DerPreprocessor_37 (Array Int Int)) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_35 (Array Int Int)) (v_prenex_50 Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse4 (@diff v_prenex_54 v_prenex_52))) (let ((.cse5 (store (store (store v_prenex_52 .cse4 v_DerPreprocessor_35) v_DerPreprocessor_32 v_DerPreprocessor_36) v_prenex_50 v_DerPreprocessor_37))) (let ((.cse6 (select .cse5 .cse4)) (.cse8 (select .cse5 v_DerPreprocessor_32))) (let ((.cse2 (select (select (store (store v_prenex_52 .cse4 .cse6) v_DerPreprocessor_32 .cse8) .cse4) 4))) (let ((.cse3 (select (select v_prenex_54 .cse2) 4))) (and (= (select v_prenex_53 .cse2) 1) (= .cse2 (select (select v_prenex_54 .cse3) (+ v_prenex_55 8))) (= (select v_prenex_51 .cse4) 1) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select (select .cse5 (select .cse6 4)) 4)) (= v_prenex_51 (let ((.cse7 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse7 (select v_prenex_51 .cse7)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (store (select v_prenex_52 .cse2) 8 .cse4) .cse8) (= (select v_prenex_53 .cse3) 1) (= v_DerPreprocessor_32 .cse2) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse4) 0) (= (store v_prenex_54 .cse4 (select v_prenex_52 .cse4)) v_prenex_52))))))))) is different from false [2025-02-08 06:42:35,364 WARN L873 $PredicateComparison]: unable to prove that (or (and (exists ((|node_create_~temp~0#1.base| Int) (v_arrayElimCell_175 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= 0 (select v_prenex_45 v_arrayElimCell_175)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse0 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_175) 1))) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1)) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_43| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_dll_append_~last~0#1.base_43|) 1) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_arrayElimCell_180 Int)) (and (not (= |v_ULTIMATE.start_dll_append_~last~0#1.base_43| v_arrayElimCell_180)) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_43|) 1) (= (select v_prenex_45 v_arrayElimCell_180) 0) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_180) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse1 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse1 (select |v_old(#valid)_AFTER_CALL_46| .cse1)))))))) (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_DerPreprocessor_37 (Array Int Int)) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_35 (Array Int Int)) (v_prenex_50 Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse4 (@diff v_prenex_54 v_prenex_52))) (let ((.cse5 (store (store (store v_prenex_52 .cse4 v_DerPreprocessor_35) v_DerPreprocessor_32 v_DerPreprocessor_36) v_prenex_50 v_DerPreprocessor_37))) (let ((.cse6 (select .cse5 .cse4)) (.cse8 (select .cse5 v_DerPreprocessor_32))) (let ((.cse2 (select (select (store (store v_prenex_52 .cse4 .cse6) v_DerPreprocessor_32 .cse8) .cse4) 4))) (let ((.cse3 (select (select v_prenex_54 .cse2) 4))) (and (= (select v_prenex_53 .cse2) 1) (= .cse2 (select (select v_prenex_54 .cse3) (+ v_prenex_55 8))) (= (select v_prenex_51 .cse4) 1) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select (select .cse5 (select .cse6 4)) 4)) (= v_prenex_51 (let ((.cse7 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse7 (select v_prenex_51 .cse7)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (store (select v_prenex_52 .cse2) 8 .cse4) .cse8) (= (select v_prenex_53 .cse3) 1) (= v_DerPreprocessor_32 .cse2) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse4) 0) (= (store v_prenex_54 .cse4 (select v_prenex_52 .cse4)) v_prenex_52))))))))) is different from true [2025-02-08 06:42:35,471 WARN L851 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (exists ((|node_create_~temp~0#1.base| Int) (v_arrayElimCell_175 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= 0 (select v_prenex_45 v_arrayElimCell_175)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse0 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_175) 1)))) (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_DerPreprocessor_37 (Array Int Int)) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_35 (Array Int Int)) (v_prenex_50 Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse3 (@diff v_prenex_54 v_prenex_52))) (let ((.cse6 (store (store (store v_prenex_52 .cse3 v_DerPreprocessor_35) v_DerPreprocessor_32 v_DerPreprocessor_36) v_prenex_50 v_DerPreprocessor_37))) (let ((.cse7 (select .cse6 .cse3)) (.cse5 (select .cse6 v_DerPreprocessor_32))) (let ((.cse1 (select (select (store (store v_prenex_52 .cse3 .cse7) v_DerPreprocessor_32 .cse5) .cse3) 4))) (let ((.cse2 (select (select v_prenex_54 .cse1) 4))) (and (= (select v_prenex_53 .cse1) 1) (= .cse1 (select (select v_prenex_54 .cse2) (+ v_prenex_55 8))) (= (select v_prenex_51 .cse3) 1) (= v_prenex_51 (let ((.cse4 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse4 (select v_prenex_51 .cse4)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (store (select v_prenex_52 .cse1) 8 .cse3) .cse5) (= (select v_prenex_53 .cse2) 1) (= v_DerPreprocessor_32 .cse1) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse3) 0) (= (store v_prenex_54 .cse3 (select v_prenex_52 .cse3)) v_prenex_52) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select .cse6 (select .cse7 4)) 4))))))))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_43| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_dll_append_~last~0#1.base_43|) 1) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_arrayElimCell_180 Int)) (and (not (= |v_ULTIMATE.start_dll_append_~last~0#1.base_43| v_arrayElimCell_180)) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_43|) 1) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select v_prenex_45 v_arrayElimCell_180) 0) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_180) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse8 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse8 (select |v_old(#valid)_AFTER_CALL_46| .cse8))))))))) is different from false [2025-02-08 06:42:35,475 WARN L873 $PredicateComparison]: unable to prove that (or (and (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (exists ((|node_create_~temp~0#1.base| Int) (v_arrayElimCell_175 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= 0 (select v_prenex_45 v_arrayElimCell_175)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse0 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_175) 1)))) (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_DerPreprocessor_37 (Array Int Int)) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_35 (Array Int Int)) (v_prenex_50 Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse3 (@diff v_prenex_54 v_prenex_52))) (let ((.cse6 (store (store (store v_prenex_52 .cse3 v_DerPreprocessor_35) v_DerPreprocessor_32 v_DerPreprocessor_36) v_prenex_50 v_DerPreprocessor_37))) (let ((.cse7 (select .cse6 .cse3)) (.cse5 (select .cse6 v_DerPreprocessor_32))) (let ((.cse1 (select (select (store (store v_prenex_52 .cse3 .cse7) v_DerPreprocessor_32 .cse5) .cse3) 4))) (let ((.cse2 (select (select v_prenex_54 .cse1) 4))) (and (= (select v_prenex_53 .cse1) 1) (= .cse1 (select (select v_prenex_54 .cse2) (+ v_prenex_55 8))) (= (select v_prenex_51 .cse3) 1) (= v_prenex_51 (let ((.cse4 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse4 (select v_prenex_51 .cse4)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (store (select v_prenex_52 .cse1) 8 .cse3) .cse5) (= (select v_prenex_53 .cse2) 1) (= v_DerPreprocessor_32 .cse1) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse3) 0) (= (store v_prenex_54 .cse3 (select v_prenex_52 .cse3)) v_prenex_52) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select .cse6 (select .cse7 4)) 4))))))))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_43| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_dll_append_~last~0#1.base_43|) 1) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_arrayElimCell_180 Int)) (and (not (= |v_ULTIMATE.start_dll_append_~last~0#1.base_43| v_arrayElimCell_180)) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_43|) 1) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select v_prenex_45 v_arrayElimCell_180) 0) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_180) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse8 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse8 (select |v_old(#valid)_AFTER_CALL_46| .cse8))))))))) is different from true [2025-02-08 06:42:35,547 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 41 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 38 not checked. [2025-02-08 06:42:35,547 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-02-08 06:42:35,961 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2024308057] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:35,961 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-02-08 06:42:35,961 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [33, 34] total 63 [2025-02-08 06:42:35,962 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1338205140] [2025-02-08 06:42:35,962 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-02-08 06:42:35,962 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2025-02-08 06:42:35,962 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:35,963 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2025-02-08 06:42:35,972 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=214, Invalid=2478, Unknown=40, NotChecked=2380, Total=5112 [2025-02-08 06:42:35,972 INFO L87 Difference]: Start difference. First operand 140 states and 148 transitions. Second operand has 64 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 57 states have internal predecessors, (121), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 06:42:36,769 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (.cse0 (= (select |c_#valid| .cse5) 1))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) .cse1 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_#memory_$Pointer$#1.base|)) (.cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= .cse2 |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |c_#valid| .cse4)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse5) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |c_#valid| .cse6)))))))) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (or .cse0 (= .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from false [2025-02-08 06:42:36,772 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse5 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (let ((.cse1 (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (.cse0 (= (select |c_#valid| .cse5) 1))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) .cse1 (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 1) (or (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse2 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_#memory_$Pointer$#1.base|)) (.cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= .cse2 |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2 (select |c_#memory_$Pointer$#1.base| .cse2))) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |c_#valid| .cse4)))))) (and .cse1 (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_#t~ret4#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse5) 1) (= |c_#valid| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |c_#valid| .cse6)))))))) (not (= |c_ULTIMATE.start_dll_create_#t~ret4#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (or .cse0 (= .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (<= |c_ULTIMATE.start_dll_create_#t~ret4#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)))) is different from true [2025-02-08 06:42:36,780 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (= (select |c_#valid| .cse0) 1) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse3 (select |c_#valid| .cse3)))))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |c_#valid| .cse4)))))))))) is different from false [2025-02-08 06:42:36,783 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (<= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (= (select |c_#valid| .cse0) 1) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |c_#memory_$Pointer$#1.base| .cse1))) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= .cse1 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse3 (select |c_#valid| .cse3)))))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |c_#valid| .cse4)))))))))) is different from true [2025-02-08 06:42:36,789 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (= (select |c_#valid| .cse0) 1) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#1.base_233| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_#memory_$Pointer$#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse3 (select |c_#valid| .cse3)))))))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |c_#valid| .cse4)))))))))) is different from false [2025-02-08 06:42:36,792 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (= (select |c_#valid| .cse0) 1) (= .cse0 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int)))) (and (= (store |v_#memory_$Pointer$#1.base_233| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) |c_#memory_$Pointer$#1.base|) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (exists ((|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse3 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse3 (select |c_#valid| .cse3)))))))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |c_#valid| .cse4)))))))))) is different from true [2025-02-08 06:42:36,799 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse1 (select .cse4 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse3 (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (or (= (select |c_#valid| .cse0) 1) (= .cse0 .cse1)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse2 (select |c_#valid| .cse2)))))) .cse3) (and (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse6 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (store |v_#memory_$Pointer$#1.base_233| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) |c_#memory_$Pointer$#1.base|) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse5 (select |v_#memory_$Pointer$#1.base_233| .cse5)) |v_#memory_$Pointer$#1.base_233|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse6) 1) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |c_#valid| .cse7))))))) .cse3)) .cse3 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))))) is different from false [2025-02-08 06:42:36,802 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse1 (select .cse4 4))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse3 (= .cse1 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (and (or (= (select |c_#valid| .cse0) 1) (= .cse0 .cse1)) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (not (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (or (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse2 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse2 (select |c_#valid| .cse2)))))) .cse3) (and (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse6 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (= (store |v_#memory_$Pointer$#1.base_233| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) |c_#memory_$Pointer$#1.base|) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse5 (select |v_#memory_$Pointer$#1.base_233| .cse5)) |v_#memory_$Pointer$#1.base_233|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse6) 1) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |c_#valid| .cse7))))))) .cse3)) .cse3 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))))) is different from true [2025-02-08 06:42:36,811 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse4 (select .cse6 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse1 (= (select |c_#valid| .cse4) 1)) (.cse8 (select .cse0 4)) (.cse10 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select .cse0 (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (let ((.cse2 (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) .cse10))) (or (and .cse2 .cse1 (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse4) 4))) (and (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) .cse4) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse5 (select |v_#memory_$Pointer$#1.base_233| .cse5)) |v_#memory_$Pointer$#1.base_233|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) (= (select |v_old(#valid)_AFTER_CALL_45| .cse4) 1) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_233| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse6) .cse4 (store (select |v_#memory_$Pointer$#1.base_233| .cse4) 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1) (= |c_#valid| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |c_#valid| .cse7)))))))) (and .cse2 .cse1 (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse9 (select |c_#valid| .cse9)))))) (= (select .cse0 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (or (= .cse8 .cse4) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) .cse4)))))) (= (select |c_#valid| .cse8) 1) .cse10))))) is different from false [2025-02-08 06:42:36,815 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse4 (select .cse6 4))) (let ((.cse0 (select |c_#memory_$Pointer$#1.base| .cse4))) (let ((.cse1 (= (select |c_#valid| .cse4) 1)) (.cse8 (select .cse0 4)) (.cse10 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0))) (and (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select .cse0 (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.offset| 0) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) .cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 1) (let ((.cse2 (or (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) .cse10))) (or (and .cse2 .cse1 (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse5 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse4) 4))) (and (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) .cse4) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse5 (select |v_#memory_$Pointer$#1.base_233| .cse5)) |v_#memory_$Pointer$#1.base_233|) (= |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse5) (= (select |v_old(#valid)_AFTER_CALL_45| .cse4) 1) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_233| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse6) .cse4 (store (select |v_#memory_$Pointer$#1.base_233| .cse4) 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1) (= |c_#valid| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |c_#valid| .cse7)))))))) (and .cse2 .cse1 (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| .cse8) 1) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse9 (select |c_#valid| .cse9)))))) (= (select .cse0 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (or (= .cse8 .cse4) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) .cse4)))))) (= (select |c_#valid| .cse8) 1) .cse10))))) is different from true [2025-02-08 06:42:36,822 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse3 (select .cse6 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse0 (= (select |c_#valid| .cse3) 1)) (.cse10 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (.cse8 (select .cse1 4))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select .cse1 (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse2 (or (= .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse10))) (or (and .cse0 .cse2 (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse4 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4)) (.cse5 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|))) (and (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse5 (select |v_#memory_$Pointer$#1.base_233| .cse5)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse4) 1) (= .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_233| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse6) .cse3 (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1) (= |c_#valid| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |c_#valid| .cse7)))))))) (and .cse0 (= (select .cse1 8) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse8) 1) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse9 (select |c_#valid| .cse9)))))) (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)))) (= .cse3 .cse8))))) .cse10 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse8) 1)))))) is different from false [2025-02-08 06:42:36,825 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse3 (select .cse6 4))) (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse0 (= (select |c_#valid| .cse3) 1)) (.cse10 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0)) (.cse8 (select .cse1 4))) (and .cse0 (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= (select .cse1 (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (let ((.cse2 (or (= .cse3 |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse10))) (or (and .cse0 .cse2 (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse4 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4)) (.cse5 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|))) (and (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse5 (select |v_#memory_$Pointer$#1.base_233| .cse5)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse4) 1) (= .cse5 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_233| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse6) .cse3 (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1) (= |c_#valid| (let ((.cse7 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse7 (select |c_#valid| .cse7)))))))) (and .cse0 (= (select .cse1 8) |c_ULTIMATE.start_dll_create_~head~0#1.base|) .cse2 (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse8) 1) (= |c_#valid| (let ((.cse9 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse9 (select |c_#valid| .cse9)))))) (or (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)))) (= .cse3 .cse8))))) .cse10 (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |c_#valid| .cse8) 1)))))) is different from true [2025-02-08 06:42:36,834 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse0 (select .cse14 |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) (.cse3 (select .cse14 0))) (and (= (select |c_#valid| .cse0) 1) (= (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select .cse1 0) 0) (= (select |c_#valid| .cse3) 1) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) 1) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse9 (select .cse12 4))) (let ((.cse5 (= (select |c_#valid| .cse9) 1)) (.cse6 (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= .cse3 .cse9)))) (or (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse9))) (let ((.cse7 (select .cse4 4))) (and (= (select .cse4 8) .cse3) .cse5 .cse6 (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse7) 1) (= |c_#valid| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse8 (select |c_#valid| .cse8)))))) (or (= .cse9 .cse7) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= .cse9 (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)))))))) (and .cse5 (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse9) 4)) (.cse11 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|))) (and (= (select |v_old(#valid)_AFTER_CALL_45| .cse10) 1) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse11 (select |v_#memory_$Pointer$#1.base_233| .cse11)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 0) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_233| .cse3 .cse12) .cse9 (store (select |v_#memory_$Pointer$#1.base_233| .cse9) 8 .cse3))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) .cse9) (= .cse3 .cse11) (= |c_#valid| (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse13 (select |c_#valid| .cse13))))))) .cse6))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from false [2025-02-08 06:42:36,838 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse14 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse0 (select .cse14 |c_ULTIMATE.start_dll_append_~head#1.offset|))) (let ((.cse1 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| .cse0) 4)) (.cse3 (select .cse14 0))) (and (= (select |c_#valid| .cse0) 1) (= (select .cse1 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (= (select |c_#valid| .cse2) 1) (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (= (select .cse1 0) 0) (= (select |c_#valid| .cse3) 1) (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| .cse2) 4)) 1) (let ((.cse12 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse9 (select .cse12 4))) (let ((.cse5 (= (select |c_#valid| .cse9) 1)) (.cse6 (or (= (select (select |c_#memory_$Pointer$#1.offset| .cse3) 4) 0) (= .cse3 .cse9)))) (or (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse9))) (let ((.cse7 (select .cse4 4))) (and (= (select .cse4 8) .cse3) .cse5 .cse6 (exists ((|v_old(#valid)_AFTER_CALL_45| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse7) 1) (= |c_#valid| (let ((.cse8 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse8 (select |c_#valid| .cse8)))))) (or (= .cse9 .cse7) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (= .cse9 (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)))))))) (and .cse5 (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse10 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse9) 4)) (.cse11 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|))) (and (= (select |v_old(#valid)_AFTER_CALL_45| .cse10) 1) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse11 (select |v_#memory_$Pointer$#1.base_233| .cse11)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse9) 1) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 0) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_233| .cse3 .cse12) .cse9 (store (select |v_#memory_$Pointer$#1.base_233| .cse9) 8 .cse3))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse10) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) .cse9) (= .cse3 .cse11) (= |c_#valid| (let ((.cse13 (@diff |v_old(#valid)_AFTER_CALL_45| |c_#valid|))) (store |v_old(#valid)_AFTER_CALL_45| .cse13 (select |c_#valid| .cse13))))))) .cse6))))) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0))))) is different from true [2025-02-08 06:42:36,852 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse0 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse0) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= v_DerPreprocessor_25 .cse3) (= .cse0 .cse1) (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 .cse0) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse5) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse5 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (select v_prenex_43 .cse5) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from false [2025-02-08 06:42:36,856 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse0 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse0) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= v_DerPreprocessor_25 .cse3) (= .cse0 .cse1) (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 .cse0) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse5) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse5 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (select v_prenex_43 .cse5) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| (select |c_#valid| |c_node_create_~temp~0#1.base|))) (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) is different from true [2025-02-08 06:42:36,870 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse0 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse0) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= v_DerPreprocessor_25 .cse3) (= .cse0 .cse1) (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 .cse0) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse5) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse5 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (select v_prenex_43 .cse5) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#1.offset|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from false [2025-02-08 06:42:36,874 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse0 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse0) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= v_DerPreprocessor_25 .cse3) (= .cse0 .cse1) (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 .cse0) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse5) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse5 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (select v_prenex_43 .cse5) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#1.offset|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0)) is different from true [2025-02-08 06:42:36,886 WARN L851 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse0 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse0) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= v_DerPreprocessor_25 .cse3) (= .cse0 .cse1) (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 .cse0) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse5) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse5 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (select v_prenex_43 .cse5) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#1.offset|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))))) is different from false [2025-02-08 06:42:36,891 WARN L873 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse0 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse0) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= v_DerPreprocessor_25 .cse3) (= .cse0 .cse1) (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 .cse0) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse5) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse5 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (select v_prenex_43 .cse5) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (= |c_#valid| (store |c_old(#valid)| |c_node_create_~temp~0#1.base| 1)) (= |c_node_create_~temp~0#1.offset| 0) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |c_node_create_~temp~0#1.base|))) (= (store |c_old(#memory_$Pointer$#1.offset)| |c_node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |c_node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#1.offset|) (= (select |c_old(#valid)| |c_node_create_~temp~0#1.base|) 0) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1))))) is different from true [2025-02-08 06:42:37,009 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse18 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (let ((.cse15 (store |c_old(#memory_$Pointer$#1.base)| .cse18 (select |c_#memory_$Pointer$#1.base| .cse18))) (.cse13 (store |c_old(#memory_$Pointer$#1.offset)| .cse17 (select |c_#memory_$Pointer$#1.offset| .cse17)))) (let ((.cse12 (@diff .cse13 |c_#memory_$Pointer$#1.offset|)) (.cse14 (@diff .cse15 |c_#memory_$Pointer$#1.base|))) (let ((.cse10 (store .cse15 .cse14 (select |c_#memory_$Pointer$#1.base| .cse14))) (.cse16 (@diff |c_old(#valid)| |c_#valid|)) (.cse1 (store .cse13 .cse12 (select |c_#memory_$Pointer$#1.offset| .cse12)))) (let ((.cse0 (@diff .cse1 |c_#memory_$Pointer$#1.offset|)) (.cse11 (select |c_#valid| .cse16)) (.cse9 (@diff .cse10 |c_#memory_$Pointer$#1.base|))) (and (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.offset| .cse1)) (= |c_node_create_#res#1.offset| 0) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse2) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse5 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse2 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse2) 4))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse4 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse5) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3 (select |v_#memory_$Pointer$#1.base_233| .cse3)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse4) 1) (= v_DerPreprocessor_25 .cse5) (= .cse2 .cse3) (= .cse5 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse5) 8 .cse2) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse5) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse7) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse7 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse8 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8)))) (= (select v_prenex_43 .cse7) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (or (= (select |c_old(#valid)| .cse9) 0) (= |c_#memory_$Pointer$#1.base| .cse10)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (or (= |c_#valid| |c_old(#valid)|) (= .cse11 1)) (= |c_#memory_$Pointer$#1.offset| (store .cse1 .cse0 (select |c_#memory_$Pointer$#1.offset| .cse0))) (or (= (select |c_old(#valid)| .cse12) 0) (= |c_#memory_$Pointer$#1.offset| .cse13)) (or (= (select |c_old(#valid)| .cse14) 0) (= |c_#memory_$Pointer$#1.base| .cse15)) (= |c_#valid| (store |c_old(#valid)| .cse16 .cse11)) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse17) 0)) (or (= (select |c_old(#valid)| .cse18) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (= (store .cse10 .cse9 (select |c_#memory_$Pointer$#1.base| .cse9)) |c_#memory_$Pointer$#1.base|) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))))))))) is different from false [2025-02-08 06:42:38,318 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse17 (@diff |c_old(#memory_$Pointer$#1.offset)| |c_#memory_$Pointer$#1.offset|)) (.cse18 (@diff |c_old(#memory_$Pointer$#1.base)| |c_#memory_$Pointer$#1.base|))) (let ((.cse15 (store |c_old(#memory_$Pointer$#1.base)| .cse18 (select |c_#memory_$Pointer$#1.base| .cse18))) (.cse13 (store |c_old(#memory_$Pointer$#1.offset)| .cse17 (select |c_#memory_$Pointer$#1.offset| .cse17)))) (let ((.cse12 (@diff .cse13 |c_#memory_$Pointer$#1.offset|)) (.cse14 (@diff .cse15 |c_#memory_$Pointer$#1.base|))) (let ((.cse10 (store .cse15 .cse14 (select |c_#memory_$Pointer$#1.base| .cse14))) (.cse16 (@diff |c_old(#valid)| |c_#valid|)) (.cse1 (store .cse13 .cse12 (select |c_#memory_$Pointer$#1.offset| .cse12)))) (let ((.cse0 (@diff .cse1 |c_#memory_$Pointer$#1.offset|)) (.cse11 (select |c_#valid| .cse16)) (.cse9 (@diff .cse10 |c_#memory_$Pointer$#1.base|))) (and (or (= (select |c_old(#valid)| .cse0) 0) (= |c_#memory_$Pointer$#1.offset| .cse1)) (= |c_node_create_#res#1.offset| 0) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse2) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse5 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse2 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse2) 4))) (let ((.cse3 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse4 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse5) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3 (select |v_#memory_$Pointer$#1.base_233| .cse3)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse4) 1) (= v_DerPreprocessor_25 .cse5) (= .cse2 .cse3) (= .cse5 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse5) 8 .cse2) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse5) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse7 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse7) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse7 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse8 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse8 (select |v_#valid_BEFORE_CALL_45| .cse8)))) (= (select v_prenex_43 .cse7) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (or (= (select |c_old(#valid)| .cse9) 0) (= |c_#memory_$Pointer$#1.base| .cse10)) (= (select |c_#valid| |c_node_create_#res#1.base|) 1) (or (= |c_#valid| |c_old(#valid)|) (= .cse11 1)) (= |c_#memory_$Pointer$#1.offset| (store .cse1 .cse0 (select |c_#memory_$Pointer$#1.offset| .cse0))) (or (= (select |c_old(#valid)| .cse12) 0) (= |c_#memory_$Pointer$#1.offset| .cse13)) (or (= (select |c_old(#valid)| .cse14) 0) (= |c_#memory_$Pointer$#1.base| .cse15)) (= |c_#valid| (store |c_old(#valid)| .cse16 .cse11)) (or (= |c_#memory_$Pointer$#1.offset| |c_old(#memory_$Pointer$#1.offset)|) (= (select |c_old(#valid)| .cse17) 0)) (or (= (select |c_old(#valid)| .cse18) 0) (= |c_#memory_$Pointer$#1.base| |c_old(#memory_$Pointer$#1.base)|)) (= (store .cse10 .cse9 (select |c_#memory_$Pointer$#1.base| .cse9)) |c_#memory_$Pointer$#1.base|) (exists ((|node_create_~temp~0#1.base| Int)) (and (= |c_#memory_$Pointer$#1.offset| (store |c_old(#memory_$Pointer$#1.offset)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.offset| |node_create_~temp~0#1.base|))) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)) (= |c_#memory_$Pointer$#1.base| (store |c_old(#memory_$Pointer$#1.base)| |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| 1)))))))))) is different from true [2025-02-08 06:42:38,603 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse22 (select .cse21 |c_ULTIMATE.start_dll_append_~head#1.offset|))) (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse0 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse0) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= v_DerPreprocessor_25 .cse3) (= .cse0 .cse1) (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 .cse0) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse5) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse5 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (select v_prenex_43 .cse5) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (= (select .cse7 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (let ((.cse10 (select .cse21 0))) (let ((.cse8 (= (select (select |c_#memory_$Pointer$#1.offset| .cse10) 4) 0)) (.cse16 (select |c_#memory_$Pointer$#1.base| .cse10))) (or (and .cse8 (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse12 (store (store |v_#memory_$Pointer$#1.base_233| .cse10 .cse16) v_DerPreprocessor_32 .cse11))) (let ((.cse9 (select (select .cse12 .cse10) 4))) (let ((.cse13 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse9) 4)) (.cse14 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|))) (and (= (store (select |v_#memory_$Pointer$#1.base_233| .cse9) 8 .cse10) .cse11) (= |c_#memory_$Pointer$#1.base| (store .cse12 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse13) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) .cse9) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse14 (select |v_#memory_$Pointer$#1.base_233| .cse14)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse13) 1) (= v_DerPreprocessor_32 .cse9) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse10) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_45| |v_old(#valid)_AFTER_CALL_46|))) (store |v_old(#valid)_AFTER_CALL_45| .cse15 (select |v_old(#valid)_AFTER_CALL_46| .cse15))) |v_old(#valid)_AFTER_CALL_46|) (= 1 (select |v_old(#valid)_AFTER_CALL_45| .cse9)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse10) 1) (= .cse10 .cse14)))))))) (let ((.cse19 (select .cse16 4))) (let ((.cse17 (select |c_#memory_$Pointer$#1.base| .cse19))) (let ((.cse18 (select .cse17 4))) (and (= (select .cse17 8) .cse10) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 .cse18) 1) (= (select v_prenex_45 .cse10) 0) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse19) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse20 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse20 (select |v_old(#valid)_AFTER_CALL_46| .cse20)))) (= (select |v_old(#valid)_AFTER_CALL_46| .cse10) 1))) (or .cse8 (= .cse10 .cse19)) (or (= .cse19 .cse18) (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse18) (+ v_prenex_46 8)) .cse19)))))))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse22) 4) 0) (= (select .cse7 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (let ((.cse24 (select (select |c_#memory_$Pointer$#1.base| .cse22) 4))) (let ((.cse23 (select (select |c_#memory_$Pointer$#1.base| .cse24) 4))) (or (= .cse23 .cse22) (= .cse23 .cse24) (= (select |c_#valid| .cse23) 1))))))) is different from false [2025-02-08 06:42:38,609 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse21 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_dll_append_~head#1.base|))) (let ((.cse7 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_dll_append_~head#1.base|)) (.cse22 (select .cse21 |c_ULTIMATE.start_dll_append_~head#1.offset|))) (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse0 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse0) 1) (exists ((v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse3 (select (select (store (store |v_#memory_$Pointer$#1.base_233| .cse0 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse0) 4))) (let ((.cse1 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|)) (.cse2 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse3) 4))) (and (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse1 (select |v_#memory_$Pointer$#1.base_233| .cse1)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse0) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse2) 1) (= v_DerPreprocessor_25 .cse3) (= .cse0 .cse1) (= .cse3 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8))) (= |v_#valid_BEFORE_CALL_45| (let ((.cse4 (@diff |v_old(#valid)_AFTER_CALL_45| |v_#valid_BEFORE_CALL_45|))) (store |v_old(#valid)_AFTER_CALL_45| .cse4 (select |v_#valid_BEFORE_CALL_45| .cse4)))) (= (store (select |v_#memory_$Pointer$#1.base_233| .cse3) 8 .cse0) v_DerPreprocessor_27) (= (select |v_old(#valid)_AFTER_CALL_45| .cse3) 1)))))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9| Int)) (and (exists ((|v_#valid_BEFORE_CALL_45| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#2.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0))) (and (= (select |v_#valid_BEFORE_CALL_45| .cse5) 1) (exists ((v_arrayElimCell_159 Int)) (and (= (select |v_#valid_BEFORE_CALL_45| v_arrayElimCell_159) 1) (not (= .cse5 v_arrayElimCell_159)))) (exists ((v_arrayElimCell_160 Int) (v_prenex_43 (Array Int Int))) (and (= (select v_prenex_43 v_arrayElimCell_160) 1) (= |v_#valid_BEFORE_CALL_45| (let ((.cse6 (@diff v_prenex_43 |v_#valid_BEFORE_CALL_45|))) (store v_prenex_43 .cse6 (select |v_#valid_BEFORE_CALL_45| .cse6)))) (= (select v_prenex_43 .cse5) 0)))))) (= (select (select |c_#memory_$Pointer$#2.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_9|) 0) 0)))) (= (select .cse7 |c_ULTIMATE.start_dll_append_~head#1.offset|) 0) (let ((.cse10 (select .cse21 0))) (let ((.cse8 (= (select (select |c_#memory_$Pointer$#1.offset| .cse10) 4) 0)) (.cse16 (select |c_#memory_$Pointer$#1.base| .cse10))) (or (and .cse8 (exists ((|v_#memory_$Pointer$#1.base_233| (Array Int (Array Int Int))) (|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_45| (Array Int Int)) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_25| Int)) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse12 (store (store |v_#memory_$Pointer$#1.base_233| .cse10 .cse16) v_DerPreprocessor_32 .cse11))) (let ((.cse9 (select (select .cse12 .cse10) 4))) (let ((.cse13 (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse9) 4)) (.cse14 (@diff |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| |v_#memory_$Pointer$#1.base_233|))) (and (= (store (select |v_#memory_$Pointer$#1.base_233| .cse9) 8 .cse10) .cse11) (= |c_#memory_$Pointer$#1.base| (store .cse12 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|))) (= (select (select |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse13) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_25| 8)) .cse9) (= (store |v_old(#memory_$Pointer$#1.base)_AFTER_CALL_45| .cse14 (select |v_#memory_$Pointer$#1.base_233| .cse14)) |v_#memory_$Pointer$#1.base_233|) (= (select |v_old(#valid)_AFTER_CALL_45| .cse13) 1) (= v_DerPreprocessor_32 .cse9) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_45| .cse10) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= (let ((.cse15 (@diff |v_old(#valid)_AFTER_CALL_45| |v_old(#valid)_AFTER_CALL_46|))) (store |v_old(#valid)_AFTER_CALL_45| .cse15 (select |v_old(#valid)_AFTER_CALL_46| .cse15))) |v_old(#valid)_AFTER_CALL_46|) (= 1 (select |v_old(#valid)_AFTER_CALL_45| .cse9)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse10) 1) (= .cse10 .cse14)))))))) (let ((.cse19 (select .cse16 4))) (let ((.cse17 (select |c_#memory_$Pointer$#1.base| .cse19))) (let ((.cse18 (select .cse17 4))) (and (= (select .cse17 8) .cse10) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 .cse18) 1) (= (select v_prenex_45 .cse10) 0) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse19) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse20 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse20 (select |v_old(#valid)_AFTER_CALL_46| .cse20)))) (= (select |v_old(#valid)_AFTER_CALL_46| .cse10) 1))) (or .cse8 (= .cse10 .cse19)) (or (= .cse19 .cse18) (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse18) (+ v_prenex_46 8)) .cse19)))))))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse22) 4) 0) (= (select .cse7 0) 0) (= |c_ULTIMATE.start_dll_append_~head#1.offset| 0) (let ((.cse24 (select (select |c_#memory_$Pointer$#1.base| .cse22) 4))) (let ((.cse23 (select (select |c_#memory_$Pointer$#1.base| .cse24) 4))) (or (= .cse23 .cse22) (= .cse23 .cse24) (= (select |c_#valid| .cse23) 1))))))) is different from true [2025-02-08 06:42:38,623 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|))) (let ((.cse10 (select .cse8 4))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse10))) (let ((.cse0 (select .cse11 4))) (let ((.cse1 (= .cse10 .cse0)) (.cse9 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4) 0))) (and (or (= (select |c_#valid| .cse0) 1) (= .cse0 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse1) (= |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 0) (or (and (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse4 (store (store v_prenex_52 |c_ULTIMATE.start_dll_append_#t~mem9#1.base| .cse8) v_DerPreprocessor_32 .cse6))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4))) (let ((.cse5 (@diff v_prenex_54 v_prenex_52)) (.cse7 (select (select v_prenex_54 .cse2) 4))) (and (= v_DerPreprocessor_32 .cse2) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse3 (select v_prenex_51 .cse3)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (store .cse4 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50)) |c_#memory_$Pointer$#1.base|) (= .cse5 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (= (select v_prenex_51 v_prenex_50) 0) (= (store (select v_prenex_52 .cse2) 8 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse6) (= (select v_prenex_53 .cse7) 1) (= (select v_prenex_53 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= (store v_prenex_54 .cse5 (select v_prenex_52 .cse5)) v_prenex_52) (= (select v_prenex_53 .cse2) 1) (= (select (select v_prenex_54 .cse7) (+ v_prenex_55 8)) .cse2) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1))))))) .cse9) (and (or .cse9 (= .cse10 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|)) (= (select .cse11 8) |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (or (exists ((v_prenex_46 Int)) (= .cse10 (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ v_prenex_46 8)))) .cse1) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse10) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= (select v_prenex_45 .cse0) 1) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse12 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse12 (select |v_old(#valid)_AFTER_CALL_46| .cse12)))))))) .cse9)))))) is different from false [2025-02-08 06:42:38,627 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|))) (let ((.cse10 (select .cse8 4))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse10))) (let ((.cse0 (select .cse11 4))) (let ((.cse1 (= .cse10 .cse0)) (.cse9 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4) 0))) (and (or (= (select |c_#valid| .cse0) 1) (= .cse0 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse1) (= |c_ULTIMATE.start_dll_append_#t~mem9#1.offset| 0) (or (and (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse6 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse4 (store (store v_prenex_52 |c_ULTIMATE.start_dll_append_#t~mem9#1.base| .cse8) v_DerPreprocessor_32 .cse6))) (let ((.cse2 (select (select .cse4 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 4))) (let ((.cse5 (@diff v_prenex_54 v_prenex_52)) (.cse7 (select (select v_prenex_54 .cse2) 4))) (and (= v_DerPreprocessor_32 .cse2) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse3 (select v_prenex_51 .cse3)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (store .cse4 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50)) |c_#memory_$Pointer$#1.base|) (= .cse5 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (= (select v_prenex_51 v_prenex_50) 0) (= (store (select v_prenex_52 .cse2) 8 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) .cse6) (= (select v_prenex_53 .cse7) 1) (= (select v_prenex_53 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= (store v_prenex_54 .cse5 (select v_prenex_52 .cse5)) v_prenex_52) (= (select v_prenex_53 .cse2) 1) (= (select (select v_prenex_54 .cse7) (+ v_prenex_55 8)) .cse2) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1))))))) .cse9) (and (or .cse9 (= .cse10 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|)) (= (select .cse11 8) |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) (or (exists ((v_prenex_46 Int)) (= .cse10 (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ v_prenex_46 8)))) .cse1) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_#t~mem9#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse10) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= (select v_prenex_45 .cse0) 1) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse12 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse12 (select |v_old(#valid)_AFTER_CALL_46| .cse12)))))))) .cse9)))))) is different from true [2025-02-08 06:42:38,640 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse1 (select .cse12 4))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse4 4))) (let ((.cse5 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0)) (.cse2 (= .cse0 .cse1))) (and (or (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ v_prenex_46 8)) .cse1)) .cse2) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse3 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse3 (select |v_old(#valid)_AFTER_CALL_46| .cse3)))) (= (select v_prenex_45 .cse0) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse4 8)) (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) .cse5)) (and .cse5 (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse11 (store (store v_prenex_52 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse12) v_DerPreprocessor_32 .cse10))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse6 (@diff v_prenex_54 v_prenex_52)) (.cse8 (select (select v_prenex_54 .cse9) 4))) (and (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) (= (select v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= v_prenex_51 (let ((.cse7 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse7 (select v_prenex_51 .cse7)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (select v_prenex_53 .cse8) 1) (= (select v_prenex_53 .cse9) 1) (= v_DerPreprocessor_32 .cse9) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store (select v_prenex_52 .cse9) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse10) (= |c_#memory_$Pointer$#1.base| (store .cse11 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50))) (= (store v_prenex_54 .cse6 (select v_prenex_52 .cse6)) v_prenex_52) (= (select (select v_prenex_54 .cse8) (+ v_prenex_55 8)) .cse9))))))))) .cse5 (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= (select |c_#valid| .cse0) 1) .cse2))))))) is different from false [2025-02-08 06:42:38,644 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse1 (select .cse12 4))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse4 4))) (let ((.cse5 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0)) (.cse2 (= .cse0 .cse1))) (and (or (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ v_prenex_46 8)) .cse1)) .cse2) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse3 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse3 (select |v_old(#valid)_AFTER_CALL_46| .cse3)))) (= (select v_prenex_45 .cse0) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse4 8)) (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) .cse5)) (and .cse5 (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse11 (store (store v_prenex_52 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse12) v_DerPreprocessor_32 .cse10))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse6 (@diff v_prenex_54 v_prenex_52)) (.cse8 (select (select v_prenex_54 .cse9) 4))) (and (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) (= (select v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= v_prenex_51 (let ((.cse7 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse7 (select v_prenex_51 .cse7)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (select v_prenex_53 .cse8) 1) (= (select v_prenex_53 .cse9) 1) (= v_DerPreprocessor_32 .cse9) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store (select v_prenex_52 .cse9) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse10) (= |c_#memory_$Pointer$#1.base| (store .cse11 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50))) (= (store v_prenex_54 .cse6 (select v_prenex_52 .cse6)) v_prenex_52) (= (select (select v_prenex_54 .cse8) (+ v_prenex_55 8)) .cse9))))))))) .cse5 (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= (select |c_#valid| .cse0) 1) .cse2))))))) is different from true [2025-02-08 06:42:38,660 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse1 (select .cse12 4))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse4 4))) (let ((.cse5 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0)) (.cse2 (= .cse0 .cse1))) (and (or (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ v_prenex_46 8)) .cse1)) .cse2) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse3 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse3 (select |v_old(#valid)_AFTER_CALL_46| .cse3)))) (= (select v_prenex_45 .cse0) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse4 8)) (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) .cse5)) (and .cse5 (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse11 (store (store v_prenex_52 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse12) v_DerPreprocessor_32 .cse10))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse6 (@diff v_prenex_54 v_prenex_52)) (.cse8 (select (select v_prenex_54 .cse9) 4))) (and (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) (= (select v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= v_prenex_51 (let ((.cse7 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse7 (select v_prenex_51 .cse7)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (select v_prenex_53 .cse8) 1) (= (select v_prenex_53 .cse9) 1) (= v_DerPreprocessor_32 .cse9) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store (select v_prenex_52 .cse9) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse10) (= |c_#memory_$Pointer$#1.base| (store .cse11 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50))) (= (store v_prenex_54 .cse6 (select v_prenex_52 .cse6)) v_prenex_52) (= (select (select v_prenex_54 .cse8) (+ v_prenex_55 8)) .cse9))))))))) .cse5 (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0) (or (= (select |c_#valid| .cse0) 1) .cse2))))))) is different from false [2025-02-08 06:42:38,665 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse1 (select .cse12 4))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse4 4))) (let ((.cse5 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0)) (.cse2 (= .cse0 .cse1))) (and (or (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ v_prenex_46 8)) .cse1)) .cse2) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse3 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse3 (select |v_old(#valid)_AFTER_CALL_46| .cse3)))) (= (select v_prenex_45 .cse0) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse4 8)) (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) .cse5)) (and .cse5 (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse11 (store (store v_prenex_52 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse12) v_DerPreprocessor_32 .cse10))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse6 (@diff v_prenex_54 v_prenex_52)) (.cse8 (select (select v_prenex_54 .cse9) 4))) (and (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) (= (select v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= v_prenex_51 (let ((.cse7 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse7 (select v_prenex_51 .cse7)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (select v_prenex_53 .cse8) 1) (= (select v_prenex_53 .cse9) 1) (= v_DerPreprocessor_32 .cse9) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store (select v_prenex_52 .cse9) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse10) (= |c_#memory_$Pointer$#1.base| (store .cse11 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50))) (= (store v_prenex_54 .cse6 (select v_prenex_52 .cse6)) v_prenex_52) (= (select (select v_prenex_54 .cse8) (+ v_prenex_55 8)) .cse9))))))))) .cse5 (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (= |c_ULTIMATE.start_dll_append_#t~mem10#1.offset| 0) (or (= (select |c_#valid| .cse0) 1) .cse2))))))) is different from true [2025-02-08 06:42:38,678 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse1 (select .cse12 4))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse4 4))) (let ((.cse5 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0)) (.cse2 (= .cse0 .cse1))) (and (or (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ v_prenex_46 8)) .cse1)) .cse2) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse3 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse3 (select |v_old(#valid)_AFTER_CALL_46| .cse3)))) (= (select v_prenex_45 .cse0) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse4 8)) (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) .cse5)) (and .cse5 (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse11 (store (store v_prenex_52 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse12) v_DerPreprocessor_32 .cse10))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse6 (@diff v_prenex_54 v_prenex_52)) (.cse8 (select (select v_prenex_54 .cse9) 4))) (and (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) (= (select v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= v_prenex_51 (let ((.cse7 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse7 (select v_prenex_51 .cse7)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (select v_prenex_53 .cse8) 1) (= (select v_prenex_53 .cse9) 1) (= v_DerPreprocessor_32 .cse9) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store (select v_prenex_52 .cse9) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse10) (= |c_#memory_$Pointer$#1.base| (store .cse11 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50))) (= (store v_prenex_54 .cse6 (select v_prenex_52 .cse6)) v_prenex_52) (= (select (select v_prenex_54 .cse8) (+ v_prenex_55 8)) .cse9))))))))) .cse5 (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select |c_#valid| .cse0) 1) .cse2))))))) is different from false [2025-02-08 06:42:38,683 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse12 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (let ((.cse1 (select .cse12 4))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse0 (select .cse4 4))) (let ((.cse5 (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0)) (.cse2 (= .cse0 .cse1))) (and (or (and (or (exists ((v_prenex_46 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse0) (+ v_prenex_46 8)) .cse1)) .cse2) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| .cse1) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse3 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse3 (select |v_old(#valid)_AFTER_CALL_46| .cse3)))) (= (select v_prenex_45 .cse0) 1))) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse4 8)) (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse1) .cse5)) (and .cse5 (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse11 (store (store v_prenex_52 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse12) v_DerPreprocessor_32 .cse10))) (let ((.cse9 (select (select .cse11 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse6 (@diff v_prenex_54 v_prenex_52)) (.cse8 (select (select v_prenex_54 .cse9) 4))) (and (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse6) (= (select v_prenex_53 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (= v_prenex_51 (let ((.cse7 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse7 (select v_prenex_51 .cse7)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (select v_prenex_53 .cse8) 1) (= (select v_prenex_53 .cse9) 1) (= v_DerPreprocessor_32 .cse9) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_51 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (store (select v_prenex_52 .cse9) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse10) (= |c_#memory_$Pointer$#1.base| (store .cse11 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50))) (= (store v_prenex_54 .cse6 (select v_prenex_52 .cse6)) v_prenex_52) (= (select (select v_prenex_54 .cse8) (+ v_prenex_55 8)) .cse9))))))))) .cse5 (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0) (or (= (select |c_#valid| .cse0) 1) .cse2))))))) is different from true [2025-02-08 06:42:38,734 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 0))) (and (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 4))) (or (= .cse0 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (select |c_#valid| .cse0) 1))) (or (and .cse1 (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse4 (@diff v_prenex_54 v_prenex_52))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse4)) (.cse8 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse2 (store (store v_prenex_52 .cse4 .cse7) v_DerPreprocessor_32 .cse8))) (let ((.cse3 (select (select .cse2 .cse4) 4))) (let ((.cse6 (select (select v_prenex_54 .cse3) 4))) (and (= (store .cse2 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50)) |c_#memory_$Pointer$#1.base|) (= v_DerPreprocessor_32 .cse3) (= (select v_prenex_51 .cse4) 1) (= v_prenex_51 (let ((.cse5 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse5 (select v_prenex_51 .cse5)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= .cse3 (select (select v_prenex_54 .cse6) (+ v_prenex_55 8))) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse4) 0) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select .cse7 4)) (= (select v_prenex_53 .cse6) 1) (= (select v_prenex_53 .cse3) 1) (= (store (select v_prenex_52 .cse3) 8 .cse4) .cse8) (= (store v_prenex_54 .cse4 (select v_prenex_52 .cse4)) v_prenex_52))))))))) (and .cse1 (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse9))) (let ((.cse10 (select .cse11 4))) (and (= .cse9 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= .cse9 .cse10) (= (select v_prenex_45 .cse10) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse11 8)) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse12 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse12 (select |v_old(#valid)_AFTER_CALL_46| .cse12)))))) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (exists ((v_prenex_45 (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse13 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse13 (select |v_old(#valid)_AFTER_CALL_46| .cse13)))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| .cse14))) (let ((.cse15 (select .cse16 4))) (and (exists ((v_prenex_46 Int)) (= .cse14 (select (select |c_#memory_$Pointer$#1.base| .cse15) (+ v_prenex_46 8)))) (= .cse14 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (select v_prenex_45 .cse15) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse16 8)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse14) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1))))))))))))) .cse1)) is different from false [2025-02-08 06:42:38,767 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_append_#t~mem11#1.offset| 0))) (and (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 4))) (or (= .cse0 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (select |c_#valid| .cse0) 1))) (or (and .cse1 (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse4 (@diff v_prenex_54 v_prenex_52))) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse4)) (.cse8 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse2 (store (store v_prenex_52 .cse4 .cse7) v_DerPreprocessor_32 .cse8))) (let ((.cse3 (select (select .cse2 .cse4) 4))) (let ((.cse6 (select (select v_prenex_54 .cse3) 4))) (and (= (store .cse2 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50)) |c_#memory_$Pointer$#1.base|) (= v_DerPreprocessor_32 .cse3) (= (select v_prenex_51 .cse4) 1) (= v_prenex_51 (let ((.cse5 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse5 (select v_prenex_51 .cse5)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= .cse3 (select (select v_prenex_54 .cse6) (+ v_prenex_55 8))) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse4) 0) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select .cse7 4)) (= (select v_prenex_53 .cse6) 1) (= (select v_prenex_53 .cse3) 1) (= (store (select v_prenex_52 .cse3) 8 .cse4) .cse8) (= (store v_prenex_54 .cse4 (select v_prenex_52 .cse4)) v_prenex_52))))))))) (and .cse1 (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse9 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| .cse9))) (let ((.cse10 (select .cse11 4))) (and (= .cse9 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= .cse9 .cse10) (= (select v_prenex_45 .cse10) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse11 8)) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse12 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse12 (select |v_old(#valid)_AFTER_CALL_46| .cse12)))))) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (exists ((v_prenex_45 (Array Int Int))) (and (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse13 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse13 (select |v_old(#valid)_AFTER_CALL_46| .cse13)))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse14 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse16 (select |c_#memory_$Pointer$#1.base| .cse14))) (let ((.cse15 (select .cse16 4))) (and (exists ((v_prenex_46 Int)) (= .cse14 (select (select |c_#memory_$Pointer$#1.base| .cse15) (+ v_prenex_46 8)))) (= .cse14 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) (= (select v_prenex_45 .cse15) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse16 8)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse14) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1))))))))))))) .cse1)) is different from true [2025-02-08 06:42:38,803 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))) (and (or (and (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse2 (@diff v_prenex_54 v_prenex_52))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse6 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse0 (store (store v_prenex_52 .cse2 .cse4) v_DerPreprocessor_32 .cse6))) (let ((.cse1 (select (select .cse0 .cse2) 4))) (let ((.cse5 (select (select v_prenex_54 .cse1) 4))) (and (= (store .cse0 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50)) |c_#memory_$Pointer$#1.base|) (= v_DerPreprocessor_32 .cse1) (= (select v_prenex_51 .cse2) 1) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse3 (select v_prenex_51 .cse3)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse4 4)) (= .cse1 (select (select v_prenex_54 .cse5) (+ v_prenex_55 8))) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse2) 0) (= (select v_prenex_53 .cse5) 1) (= (select v_prenex_53 .cse1) 1) (= (store (select v_prenex_52 .cse1) 8 .cse2) .cse6) (= (store v_prenex_54 .cse2 (select v_prenex_52 .cse2)) v_prenex_52)))))))) .cse7) (and .cse7 (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse9 (select .cse10 4))) (and (= .cse8 .cse9) (= (select v_prenex_45 .cse9) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= .cse8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse10 8)) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_46| .cse11)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse12))) (let ((.cse13 (select .cse14 4))) (and (exists ((v_prenex_46 Int)) (= .cse12 (select (select |c_#memory_$Pointer$#1.base| .cse13) (+ v_prenex_46 8)))) (= (select v_prenex_45 .cse13) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= .cse12 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse14 8)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse12) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse15 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse15 (select |v_old(#valid)_AFTER_CALL_46| .cse15))))))))))) (let ((.cse16 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse16) (= (select |c_#valid| .cse16) 1))) .cse7)) is different from false [2025-02-08 06:42:38,808 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))) (and (or (and (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse2 (@diff v_prenex_54 v_prenex_52))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse6 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse0 (store (store v_prenex_52 .cse2 .cse4) v_DerPreprocessor_32 .cse6))) (let ((.cse1 (select (select .cse0 .cse2) 4))) (let ((.cse5 (select (select v_prenex_54 .cse1) 4))) (and (= (store .cse0 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50)) |c_#memory_$Pointer$#1.base|) (= v_DerPreprocessor_32 .cse1) (= (select v_prenex_51 .cse2) 1) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse3 (select v_prenex_51 .cse3)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse4 4)) (= .cse1 (select (select v_prenex_54 .cse5) (+ v_prenex_55 8))) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse2) 0) (= (select v_prenex_53 .cse5) 1) (= (select v_prenex_53 .cse1) 1) (= (store (select v_prenex_52 .cse1) 8 .cse2) .cse6) (= (store v_prenex_54 .cse2 (select v_prenex_52 .cse2)) v_prenex_52)))))))) .cse7) (and .cse7 (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse9 (select .cse10 4))) (and (= .cse8 .cse9) (= (select v_prenex_45 .cse9) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= .cse8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse10 8)) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_46| .cse11)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse12))) (let ((.cse13 (select .cse14 4))) (and (exists ((v_prenex_46 Int)) (= .cse12 (select (select |c_#memory_$Pointer$#1.base| .cse13) (+ v_prenex_46 8)))) (= (select v_prenex_45 .cse13) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= .cse12 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse14 8)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse12) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse15 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse15 (select |v_old(#valid)_AFTER_CALL_46| .cse15))))))))))) (let ((.cse16 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (or (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse16) (= (select |c_#valid| .cse16) 1))) .cse7)) is different from true [2025-02-08 06:42:38,865 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (or (and (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse2 (@diff v_prenex_54 v_prenex_52))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse6 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse0 (store (store v_prenex_52 .cse2 .cse4) v_DerPreprocessor_32 .cse6))) (let ((.cse1 (select (select .cse0 .cse2) 4))) (let ((.cse5 (select (select v_prenex_54 .cse1) 4))) (and (= (store .cse0 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50)) |c_#memory_$Pointer$#1.base|) (= v_DerPreprocessor_32 .cse1) (= (select v_prenex_51 .cse2) 1) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse3 (select v_prenex_51 .cse3)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse4 4)) (= .cse1 (select (select v_prenex_54 .cse5) (+ v_prenex_55 8))) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse2) 0) (= (select v_prenex_53 .cse5) 1) (= (select v_prenex_53 .cse1) 1) (= (store (select v_prenex_52 .cse1) 8 .cse2) .cse6) (= (store v_prenex_54 .cse2 (select v_prenex_52 .cse2)) v_prenex_52)))))))) .cse7) (and .cse7 (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse9 (select .cse10 4))) (and (= .cse8 .cse9) (= (select v_prenex_45 .cse9) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= .cse8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse10 8)) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_46| .cse11)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse12))) (let ((.cse13 (select .cse14 4))) (and (exists ((v_prenex_46 Int)) (= .cse12 (select (select |c_#memory_$Pointer$#1.base| .cse13) (+ v_prenex_46 8)))) (= (select v_prenex_45 .cse13) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= .cse12 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse14 8)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse12) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse15 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse15 (select |v_old(#valid)_AFTER_CALL_46| .cse15))))))))))) .cse7 (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) 1))) is different from false [2025-02-08 06:42:38,870 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse7 (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0))) (and (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (or (and (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_prenex_50 Int)) (let ((.cse2 (@diff v_prenex_54 v_prenex_52))) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| .cse2)) (.cse6 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse0 (store (store v_prenex_52 .cse2 .cse4) v_DerPreprocessor_32 .cse6))) (let ((.cse1 (select (select .cse0 .cse2) 4))) (let ((.cse5 (select (select v_prenex_54 .cse1) 4))) (and (= (store .cse0 v_prenex_50 (select |c_#memory_$Pointer$#1.base| v_prenex_50)) |c_#memory_$Pointer$#1.base|) (= v_DerPreprocessor_32 .cse1) (= (select v_prenex_51 .cse2) 1) (= v_prenex_51 (let ((.cse3 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse3 (select v_prenex_51 .cse3)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse4 4)) (= .cse1 (select (select v_prenex_54 .cse5) (+ v_prenex_55 8))) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse2) 0) (= (select v_prenex_53 .cse5) 1) (= (select v_prenex_53 .cse1) 1) (= (store (select v_prenex_52 .cse1) 8 .cse2) .cse6) (= (store v_prenex_54 .cse2 (select v_prenex_52 .cse2)) v_prenex_52)))))))) .cse7) (and .cse7 (or (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse9 (select .cse10 4))) (and (= .cse8 .cse9) (= (select v_prenex_45 .cse9) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= .cse8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse10 8)) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse11 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse11 (select |v_old(#valid)_AFTER_CALL_46| .cse11)))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (exists ((v_prenex_45 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_42| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 4))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse12))) (let ((.cse13 (select .cse14 4))) (and (exists ((v_prenex_46 Int)) (= .cse12 (select (select |c_#memory_$Pointer$#1.base| .cse13) (+ v_prenex_46 8)))) (= (select v_prenex_45 .cse13) 1) (= (select v_prenex_45 |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 0) (= .cse12 |c_ULTIMATE.start_dll_append_~last~0#1.base|) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_42| (select .cse14 8)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse12) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_42|) 1)))))) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse15 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse15 (select |v_old(#valid)_AFTER_CALL_46| .cse15))))))))))) .cse7 (= (select |c_#valid| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4)) 1))) is different from true [2025-02-08 06:42:38,909 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1))) (and (or (and (exists ((|node_create_~temp~0#1.base| Int) (v_arrayElimCell_175 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= 0 (select v_prenex_45 v_arrayElimCell_175)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse0 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_175) 1))) .cse1) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_43| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_dll_append_~last~0#1.base_43|) 1) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_arrayElimCell_180 Int)) (and (not (= |v_ULTIMATE.start_dll_append_~last~0#1.base_43| v_arrayElimCell_180)) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_43|) 1) (= (select v_prenex_45 v_arrayElimCell_180) 0) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_180) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse2 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse2 (select |v_old(#valid)_AFTER_CALL_46| .cse2)))))))) (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_DerPreprocessor_37 (Array Int Int)) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_35 (Array Int Int)) (v_prenex_50 Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse5 (@diff v_prenex_54 v_prenex_52))) (let ((.cse6 (store (store (store v_prenex_52 .cse5 v_DerPreprocessor_35) v_DerPreprocessor_32 v_DerPreprocessor_36) v_prenex_50 v_DerPreprocessor_37))) (let ((.cse7 (select .cse6 .cse5)) (.cse9 (select .cse6 v_DerPreprocessor_32))) (let ((.cse3 (select (select (store (store v_prenex_52 .cse5 .cse7) v_DerPreprocessor_32 .cse9) .cse5) 4))) (let ((.cse4 (select (select v_prenex_54 .cse3) 4))) (and (= (select v_prenex_53 .cse3) 1) (= .cse3 (select (select v_prenex_54 .cse4) (+ v_prenex_55 8))) (= (select v_prenex_51 .cse5) 1) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select (select .cse6 (select .cse7 4)) 4)) (= v_prenex_51 (let ((.cse8 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse8 (select v_prenex_51 .cse8)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (store (select v_prenex_52 .cse3) 8 .cse5) .cse9) (= (select v_prenex_53 .cse4) 1) (= v_DerPreprocessor_32 .cse3) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse5) 0) (= (store v_prenex_54 .cse5 (select v_prenex_52 .cse5)) v_prenex_52))))))))) .cse1)) is different from false [2025-02-08 06:42:38,914 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= (select |c_#valid| |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1))) (and (or (and (exists ((|node_create_~temp~0#1.base| Int) (v_arrayElimCell_175 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= 0 (select v_prenex_45 v_arrayElimCell_175)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse0 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0)))) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_175) 1))) .cse1) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_43| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_dll_append_~last~0#1.base_43|) 1) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_arrayElimCell_180 Int)) (and (not (= |v_ULTIMATE.start_dll_append_~last~0#1.base_43| v_arrayElimCell_180)) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_#t~mem11#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_43|) 1) (= (select v_prenex_45 v_arrayElimCell_180) 0) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_180) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse2 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse2 (select |v_old(#valid)_AFTER_CALL_46| .cse2)))))))) (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_DerPreprocessor_37 (Array Int Int)) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_35 (Array Int Int)) (v_prenex_50 Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse5 (@diff v_prenex_54 v_prenex_52))) (let ((.cse6 (store (store (store v_prenex_52 .cse5 v_DerPreprocessor_35) v_DerPreprocessor_32 v_DerPreprocessor_36) v_prenex_50 v_DerPreprocessor_37))) (let ((.cse7 (select .cse6 .cse5)) (.cse9 (select .cse6 v_DerPreprocessor_32))) (let ((.cse3 (select (select (store (store v_prenex_52 .cse5 .cse7) v_DerPreprocessor_32 .cse9) .cse5) 4))) (let ((.cse4 (select (select v_prenex_54 .cse3) 4))) (and (= (select v_prenex_53 .cse3) 1) (= .cse3 (select (select v_prenex_54 .cse4) (+ v_prenex_55 8))) (= (select v_prenex_51 .cse5) 1) (= |c_ULTIMATE.start_dll_append_#t~mem11#1.base| (select (select .cse6 (select .cse7 4)) 4)) (= v_prenex_51 (let ((.cse8 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse8 (select v_prenex_51 .cse8)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (store (select v_prenex_52 .cse3) 8 .cse5) .cse9) (= (select v_prenex_53 .cse4) 1) (= v_DerPreprocessor_32 .cse3) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse5) 0) (= (store v_prenex_54 .cse5 (select v_prenex_52 .cse5)) v_prenex_52))))))))) .cse1)) is different from true [2025-02-08 06:42:38,975 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1))) (and (or (and .cse0 (exists ((|node_create_~temp~0#1.base| Int) (v_arrayElimCell_175 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= 0 (select v_prenex_45 v_arrayElimCell_175)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse1 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse1 (select |v_old(#valid)_AFTER_CALL_46| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_175) 1)))) (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_DerPreprocessor_37 (Array Int Int)) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_35 (Array Int Int)) (v_prenex_50 Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse4 (@diff v_prenex_54 v_prenex_52))) (let ((.cse7 (store (store (store v_prenex_52 .cse4 v_DerPreprocessor_35) v_DerPreprocessor_32 v_DerPreprocessor_36) v_prenex_50 v_DerPreprocessor_37))) (let ((.cse8 (select .cse7 .cse4)) (.cse6 (select .cse7 v_DerPreprocessor_32))) (let ((.cse2 (select (select (store (store v_prenex_52 .cse4 .cse8) v_DerPreprocessor_32 .cse6) .cse4) 4))) (let ((.cse3 (select (select v_prenex_54 .cse2) 4))) (and (= (select v_prenex_53 .cse2) 1) (= .cse2 (select (select v_prenex_54 .cse3) (+ v_prenex_55 8))) (= (select v_prenex_51 .cse4) 1) (= v_prenex_51 (let ((.cse5 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse5 (select v_prenex_51 .cse5)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (store (select v_prenex_52 .cse2) 8 .cse4) .cse6) (= (select v_prenex_53 .cse3) 1) (= v_DerPreprocessor_32 .cse2) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse4) 0) (= (store v_prenex_54 .cse4 (select v_prenex_52 .cse4)) v_prenex_52) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select .cse7 (select .cse8 4)) 4))))))))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_43| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_dll_append_~last~0#1.base_43|) 1) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_arrayElimCell_180 Int)) (and (not (= |v_ULTIMATE.start_dll_append_~last~0#1.base_43| v_arrayElimCell_180)) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_43|) 1) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select v_prenex_45 v_arrayElimCell_180) 0) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_180) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse9 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse9 (select |v_old(#valid)_AFTER_CALL_46| .cse9))))))))) .cse0)) is different from false [2025-02-08 06:42:38,980 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse0 (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1))) (and (or (and .cse0 (exists ((|node_create_~temp~0#1.base| Int) (v_arrayElimCell_175 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int))) (and (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= 0 (select v_prenex_45 v_arrayElimCell_175)) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse1 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse1 (select |v_old(#valid)_AFTER_CALL_46| .cse1)))) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_175) 1)))) (exists ((v_prenex_53 (Array Int Int)) (v_prenex_55 Int) (v_prenex_51 (Array Int Int)) (v_prenex_54 (Array Int (Array Int Int))) (v_DerPreprocessor_37 (Array Int Int)) (v_prenex_52 (Array Int (Array Int Int))) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_35 (Array Int Int)) (v_prenex_50 Int) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse4 (@diff v_prenex_54 v_prenex_52))) (let ((.cse7 (store (store (store v_prenex_52 .cse4 v_DerPreprocessor_35) v_DerPreprocessor_32 v_DerPreprocessor_36) v_prenex_50 v_DerPreprocessor_37))) (let ((.cse8 (select .cse7 .cse4)) (.cse6 (select .cse7 v_DerPreprocessor_32))) (let ((.cse2 (select (select (store (store v_prenex_52 .cse4 .cse8) v_DerPreprocessor_32 .cse6) .cse4) 4))) (let ((.cse3 (select (select v_prenex_54 .cse2) 4))) (and (= (select v_prenex_53 .cse2) 1) (= .cse2 (select (select v_prenex_54 .cse3) (+ v_prenex_55 8))) (= (select v_prenex_51 .cse4) 1) (= v_prenex_51 (let ((.cse5 (@diff v_prenex_53 v_prenex_51))) (store v_prenex_53 .cse5 (select v_prenex_51 .cse5)))) (= |c_#valid| (store v_prenex_51 v_prenex_50 1)) (= (store (select v_prenex_52 .cse2) 8 .cse4) .cse6) (= (select v_prenex_53 .cse3) 1) (= v_DerPreprocessor_32 .cse2) (= (select v_prenex_51 v_prenex_50) 0) (= (select v_prenex_53 .cse4) 0) (= (store v_prenex_54 .cse4 (select v_prenex_52 .cse4)) v_prenex_52) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select .cse7 (select .cse8 4)) 4))))))))) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_43| Int)) (and (= (select |c_#valid| |v_ULTIMATE.start_dll_append_~last~0#1.base_43|) 1) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_prenex_45 (Array Int Int)) (v_arrayElimCell_180 Int)) (and (not (= |v_ULTIMATE.start_dll_append_~last~0#1.base_43| v_arrayElimCell_180)) (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_43|) 1) (= (select v_prenex_45 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= (select v_prenex_45 v_arrayElimCell_180) 0) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_180) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= |v_old(#valid)_AFTER_CALL_46| (let ((.cse9 (@diff v_prenex_45 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_45 .cse9 (select |v_old(#valid)_AFTER_CALL_46| .cse9))))))))) .cse0)) is different from true [2025-02-08 06:42:39,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:39,031 INFO L93 Difference]: Finished difference Result 184 states and 198 transitions. [2025-02-08 06:42:39,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2025-02-08 06:42:39,032 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 57 states have internal predecessors, (121), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) Word has length 75 [2025-02-08 06:42:39,032 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:39,033 INFO L225 Difference]: With dead ends: 184 [2025-02-08 06:42:39,033 INFO L226 Difference]: Without dead ends: 184 [2025-02-08 06:42:39,035 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 157 GetRequests, 61 SyntacticMatches, 1 SemanticMatches, 95 ConstructedPredicates, 41 IntricatePredicates, 0 DeprecatedPredicates, 868 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=282, Invalid=2880, Unknown=82, NotChecked=6068, Total=9312 [2025-02-08 06:42:39,040 INFO L435 NwaCegarLoop]: 58 mSDtfsCounter, 46 mSDsluCounter, 899 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 14 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 957 SdHoareTripleChecker+Invalid, 5384 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 14 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 4492 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:39,044 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 957 Invalid, 5384 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [14 Valid, 878 Invalid, 0 Unknown, 4492 Unchecked, 0.6s Time] [2025-02-08 06:42:39,044 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-02-08 06:42:39,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 143. [2025-02-08 06:42:39,051 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 120 states have (on average 1.1833333333333333) internal successors, (142), 134 states have internal predecessors, (142), 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-02-08 06:42:39,051 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 152 transitions. [2025-02-08 06:42:39,052 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 152 transitions. Word has length 75 [2025-02-08 06:42:39,052 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:39,052 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 152 transitions. [2025-02-08 06:42:39,052 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 61 states have (on average 1.9836065573770492) internal successors, (121), 57 states have internal predecessors, (121), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (8), 8 states have call predecessors, (8), 6 states have call successors, (8) [2025-02-08 06:42:39,052 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 152 transitions. [2025-02-08 06:42:39,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 76 [2025-02-08 06:42:39,057 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:39,057 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-02-08 06:42:39,069 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2025-02-08 06:42:39,258 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,17 /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:39,258 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:42:39,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:39,259 INFO L85 PathProgramCache]: Analyzing trace with hash 415543807, now seen corresponding path program 2 times [2025-02-08 06:42:39,259 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:39,259 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1018705776] [2025-02-08 06:42:39,259 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-02-08 06:42:39,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:39,314 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 75 statements into 2 equivalence classes. [2025-02-08 06:42:39,440 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 75 of 75 statements. [2025-02-08 06:42:39,442 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-02-08 06:42:39,443 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:39,731 INFO L134 CoverageAnalysis]: Checked inductivity of 82 backedges. 25 proven. 0 refuted. 0 times theorem prover too weak. 57 trivial. 0 not checked. [2025-02-08 06:42:39,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:39,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1018705776] [2025-02-08 06:42:39,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1018705776] provided 1 perfect and 0 imperfect interpolant sequences [2025-02-08 06:42:39,732 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-02-08 06:42:39,732 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-02-08 06:42:39,732 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [821828494] [2025-02-08 06:42:39,732 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-02-08 06:42:39,732 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-02-08 06:42:39,732 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-02-08 06:42:39,733 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-02-08 06:42:39,733 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:42:39,733 INFO L87 Difference]: Start difference. First operand 143 states and 152 transitions. Second operand has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:42:39,748 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-02-08 06:42:39,748 INFO L93 Difference]: Finished difference Result 99 states and 102 transitions. [2025-02-08 06:42:39,749 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-02-08 06:42:39,749 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) Word has length 75 [2025-02-08 06:42:39,750 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-02-08 06:42:39,750 INFO L225 Difference]: With dead ends: 99 [2025-02-08 06:42:39,750 INFO L226 Difference]: Without dead ends: 99 [2025-02-08 06:42:39,750 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-02-08 06:42:39,751 INFO L435 NwaCegarLoop]: 73 mSDtfsCounter, 0 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 204 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-02-08 06:42:39,751 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 204 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-02-08 06:42:39,751 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-02-08 06:42:39,759 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-02-08 06:42:39,759 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 83 states have (on average 1.1566265060240963) internal successors, (96), 93 states have internal predecessors, (96), 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-02-08 06:42:39,759 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 102 transitions. [2025-02-08 06:42:39,759 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 102 transitions. Word has length 75 [2025-02-08 06:42:39,760 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-02-08 06:42:39,760 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 102 transitions. [2025-02-08 06:42:39,760 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 8.0) internal successors, (40), 5 states have internal predecessors, (40), 3 states have call successors, (4), 1 states have call predecessors, (4), 1 states have return successors, (4), 3 states have call predecessors, (4), 3 states have call successors, (4) [2025-02-08 06:42:39,760 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 102 transitions. [2025-02-08 06:42:39,761 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 80 [2025-02-08 06:42:39,761 INFO L210 NwaCegarLoop]: Found error trace [2025-02-08 06:42:39,761 INFO L218 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 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, 1, 1] [2025-02-08 06:42:39,761 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2025-02-08 06:42:39,761 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr15REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 44 more)] === [2025-02-08 06:42:39,765 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-02-08 06:42:39,765 INFO L85 PathProgramCache]: Analyzing trace with hash 526036611, now seen corresponding path program 1 times [2025-02-08 06:42:39,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-02-08 06:42:39,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [459055324] [2025-02-08 06:42:39,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:39,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-02-08 06:42:39,799 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 06:42:39,926 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 06:42:39,926 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:39,926 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:43,201 INFO L134 CoverageAnalysis]: Checked inductivity of 47 backedges. 26 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-02-08 06:42:43,201 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-02-08 06:42:43,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [459055324] [2025-02-08 06:42:43,202 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [459055324] provided 0 perfect and 1 imperfect interpolant sequences [2025-02-08 06:42:43,202 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [749507202] [2025-02-08 06:42:43,202 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-02-08 06:42:43,202 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-02-08 06:42:43,202 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 [2025-02-08 06:42:43,205 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-02-08 06:42:43,207 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-jdk21/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2025-02-08 06:42:43,419 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 79 statements into 1 equivalence classes. [2025-02-08 06:42:43,487 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 79 of 79 statements. [2025-02-08 06:42:43,487 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-02-08 06:42:43,487 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-02-08 06:42:43,494 INFO L256 TraceCheckSpWp]: Trace formula consists of 611 conjuncts, 164 conjuncts are in the unsatisfiable core [2025-02-08 06:42:43,506 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-02-08 06:42:43,552 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-02-08 06:42:43,733 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-02-08 06:42:43,736 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-02-08 06:42:44,060 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:42:44,060 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 16 treesize of output 15 [2025-02-08 06:42:44,075 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:42:44,075 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 16 treesize of output 15 [2025-02-08 06:42:44,085 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-02-08 06:42:44,085 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 11 treesize of output 11 [2025-02-08 06:42:44,192 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-02-08 06:42:44,196 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-02-08 06:42:44,254 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 21 treesize of output 20 [2025-02-08 06:42:44,266 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 27 treesize of output 11 [2025-02-08 06:42:44,361 INFO L349 Elim1Store]: treesize reduction 43, result has 17.3 percent of original size [2025-02-08 06:42:44,361 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 114 treesize of output 65 [2025-02-08 06:42:44,366 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 56 treesize of output 29 [2025-02-08 06:42:44,593 INFO L349 Elim1Store]: treesize reduction 19, result has 5.0 percent of original size [2025-02-08 06:42:44,594 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 84 treesize of output 27 [2025-02-08 06:42:44,597 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 0 case distinctions, treesize of input 25 treesize of output 7 [2025-02-08 06:42:44,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-02-08 06:42:44,757 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 15 treesize of output 1 [2025-02-08 06:42:44,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-02-08 06:42:44,918 INFO L349 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-02-08 06:42:44,918 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 92 treesize of output 75 [2025-02-08 06:42:44,934 INFO L349 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-02-08 06:42:44,934 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 34 treesize of output 36 [2025-02-08 06:42:44,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2025-02-08 06:42:45,371 INFO L349 Elim1Store]: treesize reduction 70, result has 41.2 percent of original size [2025-02-08 06:42:45,372 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 3 case distinctions, treesize of input 96 treesize of output 83 [2025-02-08 06:42:45,386 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-02-08 06:42:45,387 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 1 case distinctions, treesize of input 16 treesize of output 15 [2025-02-08 06:42:45,421 INFO L349 Elim1Store]: treesize reduction 62, result has 44.1 percent of original size [2025-02-08 06:42:45,421 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 44 treesize of output 55 [2025-02-08 06:42:45,830 INFO L349 Elim1Store]: treesize reduction 96, result has 35.1 percent of original size [2025-02-08 06:42:45,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 12 case distinctions, treesize of input 293 treesize of output 288 [2025-02-08 06:42:45,886 INFO L349 Elim1Store]: treesize reduction 166, result has 36.2 percent of original size [2025-02-08 06:42:45,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 5 select indices, 5 select index equivalence classes, 1 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 12 case distinctions, treesize of input 255 treesize of output 293 [2025-02-08 06:42:45,893 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 224 treesize of output 204 [2025-02-08 06:42:48,433 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 7 treesize of output 3 [2025-02-08 06:42:48,464 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 7 treesize of output 3 [2025-02-08 06:42:48,478 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 7 treesize of output 3 [2025-02-08 06:42:48,483 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 7 treesize of output 3 [2025-02-08 06:42:48,552 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 7 treesize of output 3 [2025-02-08 06:42:48,584 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 7 treesize of output 3 [2025-02-08 06:42:48,598 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 7 treesize of output 3 [2025-02-08 06:42:48,669 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 7 treesize of output 3 [2025-02-08 06:42:48,696 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 7 treesize of output 3 [2025-02-08 06:42:48,704 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 7 treesize of output 3 [2025-02-08 06:42:48,864 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 7 treesize of output 3 [2025-02-08 06:42:48,870 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 7 treesize of output 3 [2025-02-08 06:42:53,482 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-08 06:42:53,486 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-08 06:42:53,526 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-08 06:42:53,606 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-08 06:42:53,618 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-08 06:42:53,620 WARN L214 Elim1Store]: Array PQE input equivalent to false [2025-02-08 06:42:56,562 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 2748 treesize of output 2164 [2025-02-08 06:42:56,579 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 2168 treesize of output 1712