./Ultimate.py --spec ../../../trunk/examples/svcomp/properties/valid-memsafety.prp --file ../../../trunk/examples/svcomp/list-simple/dll2n_append_unequal.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version da043454 Calling Ultimate with: /root/.sdkman/candidates/java/21.0.5-tem/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.6.800.v20240513-1750.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../../../trunk/examples/svcomp/list-simple/dll2n_append_unequal.c -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G 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 2084efc1795c4fba8a475cf32ecbe164fdc55ee773237012cda7650451559375 --- Real Ultimate output --- This is Ultimate 0.3.0-wip.fs.system-includes-da04345-m [2025-04-29 11:19:32,696 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-04-29 11:19:32,748 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-04-29 11:19:32,752 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-04-29 11:19:32,752 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-04-29 11:19:32,769 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-04-29 11:19:32,770 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-04-29 11:19:32,770 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-04-29 11:19:32,770 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-04-29 11:19:32,770 INFO L153 SettingsManager]: * Use memory slicer=true [2025-04-29 11:19:32,770 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-04-29 11:19:32,770 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-04-29 11:19:32,771 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-04-29 11:19:32,771 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-04-29 11:19:32,771 INFO L153 SettingsManager]: * Use SBE=true [2025-04-29 11:19:32,771 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-04-29 11:19:32,771 INFO L153 SettingsManager]: * sizeof long=4 [2025-04-29 11:19:32,771 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-04-29 11:19:32,772 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-04-29 11:19:32,772 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-04-29 11:19:32,772 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-04-29 11:19:32,772 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-04-29 11:19:32,772 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-04-29 11:19:32,772 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-04-29 11:19:32,773 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-04-29 11:19:32,773 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-04-29 11:19:32,773 INFO L153 SettingsManager]: * sizeof long double=12 [2025-04-29 11:19:32,773 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-04-29 11:19:32,773 INFO L153 SettingsManager]: * Use constant arrays=true [2025-04-29 11:19:32,773 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-04-29 11:19:32,773 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:19:32,773 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:19:32,773 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:19:32,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:19:32,774 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2025-04-29 11:19:32,774 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-04-29 11:19:32,774 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-04-29 11:19:32,774 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-04-29 11:19:32,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:19:32,774 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-04-29 11:19:32,774 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-04-29 11:19:32,774 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-04-29 11:19:32,774 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-04-29 11:19:32,774 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-04-29 11:19:32,775 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-04-29 11:19:32,775 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-04-29 11:19:32,775 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G 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 -> 2084efc1795c4fba8a475cf32ecbe164fdc55ee773237012cda7650451559375 [2025-04-29 11:19:33,009 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-04-29 11:19:33,017 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-04-29 11:19:33,019 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-04-29 11:19:33,020 INFO L270 PluginConnector]: Initializing CDTParser... [2025-04-29 11:19:33,020 INFO L274 PluginConnector]: CDTParser initialized [2025-04-29 11:19:33,021 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../../../trunk/examples/svcomp/list-simple/dll2n_append_unequal.c [2025-04-29 11:19:34,315 INFO L538 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7957399f9/53f9a876021f480999e90e72c95f95e2/FLAG3ef939347 [2025-04-29 11:19:34,525 INFO L389 CDTParser]: Found 1 translation units. [2025-04-29 11:19:34,526 INFO L178 CDTParser]: Scanning /storage/repos/ultimate/trunk/examples/svcomp/list-simple/dll2n_append_unequal.c [2025-04-29 11:19:34,527 WARN L117 ultiparseSymbolTable]: System include assert.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:19:34,528 WARN L117 ultiparseSymbolTable]: System include stdlib.h could not be resolved by CDT -- only built-in system includes are available. [2025-04-29 11:19:34,533 INFO L432 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7957399f9/53f9a876021f480999e90e72c95f95e2/FLAG3ef939347 [2025-04-29 11:19:35,366 INFO L440 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/7957399f9/53f9a876021f480999e90e72c95f95e2 [2025-04-29 11:19:35,368 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-04-29 11:19:35,369 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-04-29 11:19:35,370 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-04-29 11:19:35,370 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-04-29 11:19:35,373 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-04-29 11:19:35,373 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:19:35" (1/1) ... [2025-04-29 11:19:35,379 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@2c992d6b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:35, skipping insertion in model container [2025-04-29 11:19:35,379 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.04 11:19:35" (1/1) ... [2025-04-29 11:19:35,390 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-04-29 11:19:35,564 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:19:35,580 INFO L200 MainTranslator]: Completed pre-run [2025-04-29 11:19:35,612 INFO L211 PostProcessor]: Analyzing one entry point: main [2025-04-29 11:19:35,626 INFO L204 MainTranslator]: Completed translation [2025-04-29 11:19:35,627 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:35 WrapperNode [2025-04-29 11:19:35,627 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-04-29 11:19:35,628 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-04-29 11:19:35,628 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-04-29 11:19:35,628 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-04-29 11:19:35,632 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:35" (1/1) ... [2025-04-29 11:19:35,638 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:35" (1/1) ... [2025-04-29 11:19:35,659 INFO L138 Inliner]: procedures = 18, calls = 37, calls flagged for inlining = 7, calls inlined = 7, statements flattened = 132 [2025-04-29 11:19:35,659 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-04-29 11:19:35,659 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-04-29 11:19:35,659 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-04-29 11:19:35,659 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-04-29 11:19:35,664 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:35" (1/1) ... [2025-04-29 11:19:35,664 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:35" (1/1) ... [2025-04-29 11:19:35,667 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:35" (1/1) ... [2025-04-29 11:19:35,685 INFO L175 MemorySlicer]: Split 22 memory accesses to 2 slices as follows [6, 16]. 73 percent of accesses are in the largest equivalence class. The 1 initializations are split as follows [1, 0]. The 9 writes are split as follows [1, 8]. [2025-04-29 11:19:35,688 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:35" (1/1) ... [2025-04-29 11:19:35,689 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:35" (1/1) ... [2025-04-29 11:19:35,697 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:35" (1/1) ... [2025-04-29 11:19:35,698 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:35" (1/1) ... [2025-04-29 11:19:35,701 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:35" (1/1) ... [2025-04-29 11:19:35,701 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:35" (1/1) ... [2025-04-29 11:19:35,702 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:35" (1/1) ... [2025-04-29 11:19:35,705 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-04-29 11:19:35,706 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2025-04-29 11:19:35,706 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2025-04-29 11:19:35,706 INFO L274 PluginConnector]: RCFGBuilder initialized [2025-04-29 11:19:35,707 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:35" (1/1) ... [2025-04-29 11:19:35,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-04-29 11:19:35,719 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:35,731 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-04-29 11:19:35,733 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-04-29 11:19:35,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-04-29 11:19:35,749 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-04-29 11:19:35,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#0 [2025-04-29 11:19:35,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~$Pointer$#1 [2025-04-29 11:19:35,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2025-04-29 11:19:35,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-04-29 11:19:35,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-04-29 11:19:35,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-04-29 11:19:35,750 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-04-29 11:19:35,750 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-04-29 11:19:35,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-04-29 11:19:35,750 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-04-29 11:19:35,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-04-29 11:19:35,750 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-04-29 11:19:35,750 INFO L130 BoogieDeclarations]: Found specification of procedure node_create [2025-04-29 11:19:35,750 INFO L138 BoogieDeclarations]: Found implementation of procedure node_create [2025-04-29 11:19:35,750 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-04-29 11:19:35,814 INFO L234 CfgBuilder]: Building ICFG [2025-04-29 11:19:35,815 INFO L260 CfgBuilder]: Building CFG for each procedure with an implementation [2025-04-29 11:19:36,098 INFO L? ?]: Removed 122 outVars from TransFormulas that were not future-live. [2025-04-29 11:19:36,099 INFO L283 CfgBuilder]: Performing block encoding [2025-04-29 11:19:36,111 INFO L307 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-04-29 11:19:36,111 INFO L312 CfgBuilder]: Removed 2 assume(true) statements. [2025-04-29 11:19:36,112 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:19:36 BoogieIcfgContainer [2025-04-29 11:19:36,112 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2025-04-29 11:19:36,113 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-04-29 11:19:36,113 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-04-29 11:19:36,116 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-04-29 11:19:36,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.04 11:19:35" (1/3) ... [2025-04-29 11:19:36,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672aaa0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:19:36, skipping insertion in model container [2025-04-29 11:19:36,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.04 11:19:35" (2/3) ... [2025-04-29 11:19:36,117 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@672aaa0f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.04 11:19:36, skipping insertion in model container [2025-04-29 11:19:36,117 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.04 11:19:36" (3/3) ... [2025-04-29 11:19:36,118 INFO L128 eAbstractionObserver]: Analyzing ICFG dll2n_append_unequal.c [2025-04-29 11:19:36,128 INFO L217 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-04-29 11:19:36,129 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll2n_append_unequal.c that has 2 procedures, 108 locations, 123 edges, 1 initial locations, 4 loop locations, and 46 error locations. [2025-04-29 11:19:36,161 INFO L339 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-04-29 11:19:36,170 INFO L340 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;@73372135, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-04-29 11:19:36,171 INFO L341 AbstractCegarLoop]: Starting to check reachability of 46 error locations. [2025-04-29 11:19:36,173 INFO L278 IsEmpty]: Start isEmpty. Operand has 108 states, 58 states have (on average 2.0172413793103448) internal successors, (117), 104 states have internal predecessors, (117), 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-04-29 11:19:36,177 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:19:36,177 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:36,178 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:36,178 INFO L403 AbstractCegarLoop]: === Iteration 1 === Targeting node_createErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:36,181 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:36,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1811038866, now seen corresponding path program 1 times [2025-04-29 11:19:36,187 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:36,187 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1436428233] [2025-04-29 11:19:36,187 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:36,188 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:36,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:19:36,254 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:19:36,254 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:36,254 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:36,341 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:36,341 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:36,341 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1436428233] [2025-04-29 11:19:36,341 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1436428233] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:36,342 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:36,342 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:19:36,343 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [15250997] [2025-04-29 11:19:36,343 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:36,345 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:36,345 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:36,359 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:36,359 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:36,361 INFO L87 Difference]: Start difference. First operand has 108 states, 58 states have (on average 2.0172413793103448) internal successors, (117), 104 states have internal predecessors, (117), 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 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-04-29 11:19:36,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:36,454 INFO L93 Difference]: Finished difference Result 104 states and 114 transitions. [2025-04-29 11:19:36,455 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:36,456 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-04-29 11:19:36,456 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:36,460 INFO L225 Difference]: With dead ends: 104 [2025-04-29 11:19:36,460 INFO L226 Difference]: Without dead ends: 100 [2025-04-29 11:19:36,461 INFO L436 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-04-29 11:19:36,464 INFO L437 NwaCegarLoop]: 105 mSDtfsCounter, 3 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 57 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 166 SdHoareTripleChecker+Invalid, 59 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 57 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:36,464 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 166 Invalid, 59 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 57 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:36,474 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-29 11:19:36,487 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-04-29 11:19:36,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 54 states have (on average 1.9074074074074074) internal successors, (103), 96 states have internal predecessors, (103), 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-04-29 11:19:36,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2025-04-29 11:19:36,492 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 7 [2025-04-29 11:19:36,492 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:36,492 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2025-04-29 11:19:36,492 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-04-29 11:19:36,492 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2025-04-29 11:19:36,493 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2025-04-29 11:19:36,493 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:36,493 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:36,493 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-04-29 11:19:36,493 INFO L403 AbstractCegarLoop]: === Iteration 2 === Targeting node_createErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:36,494 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:36,494 INFO L85 PathProgramCache]: Analyzing trace with hash 1811038867, now seen corresponding path program 1 times [2025-04-29 11:19:36,494 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:36,494 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1996275951] [2025-04-29 11:19:36,494 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:36,494 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:36,503 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 7 statements into 1 equivalence classes. [2025-04-29 11:19:36,512 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 7 of 7 statements. [2025-04-29 11:19:36,512 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:36,512 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:36,605 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:36,605 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:36,605 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1996275951] [2025-04-29 11:19:36,605 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1996275951] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:36,605 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:36,605 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-04-29 11:19:36,605 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1538751915] [2025-04-29 11:19:36,605 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:36,606 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:36,606 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:36,606 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:36,606 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:36,606 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-04-29 11:19:36,680 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:36,680 INFO L93 Difference]: Finished difference Result 97 states and 104 transitions. [2025-04-29 11:19:36,681 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:36,681 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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 7 [2025-04-29 11:19:36,681 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:36,682 INFO L225 Difference]: With dead ends: 97 [2025-04-29 11:19:36,682 INFO L226 Difference]: Without dead ends: 97 [2025-04-29 11:19:36,682 INFO L436 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-04-29 11:19:36,682 INFO L437 NwaCegarLoop]: 99 mSDtfsCounter, 3 mSDsluCounter, 61 mSDsCounter, 0 mSdLazyCounter, 43 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 160 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-04-29 11:19:36,683 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 160 Invalid, 45 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 43 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:36,684 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-04-29 11:19:36,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-04-29 11:19:36,689 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 54 states have (on average 1.8518518518518519) internal successors, (100), 93 states have internal predecessors, (100), 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-04-29 11:19:36,690 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 104 transitions. [2025-04-29 11:19:36,690 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 104 transitions. Word has length 7 [2025-04-29 11:19:36,690 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:36,690 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 104 transitions. [2025-04-29 11:19:36,690 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.0) internal successors, (6), 3 states have internal predecessors, (6), 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-04-29 11:19:36,691 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 104 transitions. [2025-04-29 11:19:36,691 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:19:36,691 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:36,691 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:36,691 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-04-29 11:19:36,691 INFO L403 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:36,691 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:36,692 INFO L85 PathProgramCache]: Analyzing trace with hash 1756602623, now seen corresponding path program 1 times [2025-04-29 11:19:36,692 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:36,692 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061015817] [2025-04-29 11:19:36,692 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:36,692 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:36,704 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:19:36,719 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:19:36,722 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:36,723 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:36,812 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:36,812 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:36,812 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061015817] [2025-04-29 11:19:36,812 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061015817] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:36,813 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:36,813 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:19:36,813 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022294828] [2025-04-29 11:19:36,813 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:36,813 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:19:36,813 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:36,814 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:19:36,814 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:36,814 INFO L87 Difference]: Start difference. First operand 97 states and 104 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-04-29 11:19:36,949 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:36,949 INFO L93 Difference]: Finished difference Result 95 states and 102 transitions. [2025-04-29 11:19:36,949 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:36,949 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 14 [2025-04-29 11:19:36,950 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:36,950 INFO L225 Difference]: With dead ends: 95 [2025-04-29 11:19:36,952 INFO L226 Difference]: Without dead ends: 95 [2025-04-29 11:19:36,952 INFO L436 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-04-29 11:19:36,953 INFO L437 NwaCegarLoop]: 89 mSDtfsCounter, 8 mSDsluCounter, 194 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 283 SdHoareTripleChecker+Invalid, 213 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:36,953 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 283 Invalid, 213 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 211 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:36,953 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2025-04-29 11:19:36,956 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2025-04-29 11:19:36,956 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 54 states have (on average 1.8148148148148149) internal successors, (98), 91 states have internal predecessors, (98), 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-04-29 11:19:36,957 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 102 transitions. [2025-04-29 11:19:36,957 INFO L79 Accepts]: Start accepts. Automaton has 95 states and 102 transitions. Word has length 14 [2025-04-29 11:19:36,958 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:36,958 INFO L485 AbstractCegarLoop]: Abstraction has 95 states and 102 transitions. [2025-04-29 11:19:36,958 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-04-29 11:19:36,958 INFO L278 IsEmpty]: Start isEmpty. Operand 95 states and 102 transitions. [2025-04-29 11:19:36,958 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2025-04-29 11:19:36,958 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:36,959 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:36,959 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-04-29 11:19:36,959 INFO L403 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:36,959 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:36,959 INFO L85 PathProgramCache]: Analyzing trace with hash 1756602624, now seen corresponding path program 1 times [2025-04-29 11:19:36,959 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:36,959 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [643923134] [2025-04-29 11:19:36,960 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:36,960 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:36,969 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 14 statements into 1 equivalence classes. [2025-04-29 11:19:36,981 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 14 of 14 statements. [2025-04-29 11:19:36,981 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:36,981 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:37,149 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:37,149 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:37,149 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [643923134] [2025-04-29 11:19:37,149 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [643923134] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:37,149 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:37,150 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:19:37,150 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1731515034] [2025-04-29 11:19:37,150 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:37,150 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:19:37,150 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:37,150 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:19:37,150 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:37,150 INFO L87 Difference]: Start difference. First operand 95 states and 102 transitions. Second operand has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-04-29 11:19:37,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:37,291 INFO L93 Difference]: Finished difference Result 93 states and 100 transitions. [2025-04-29 11:19:37,291 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:37,292 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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 14 [2025-04-29 11:19:37,292 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:37,292 INFO L225 Difference]: With dead ends: 93 [2025-04-29 11:19:37,292 INFO L226 Difference]: Without dead ends: 93 [2025-04-29 11:19:37,292 INFO L436 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-04-29 11:19:37,293 INFO L437 NwaCegarLoop]: 89 mSDtfsCounter, 7 mSDsluCounter, 214 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 303 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-04-29 11:19:37,293 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 303 Invalid, 182 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:37,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2025-04-29 11:19:37,298 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2025-04-29 11:19:37,299 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-04-29 11:19:37,299 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 100 transitions. [2025-04-29 11:19:37,299 INFO L79 Accepts]: Start accepts. Automaton has 93 states and 100 transitions. Word has length 14 [2025-04-29 11:19:37,299 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:37,300 INFO L485 AbstractCegarLoop]: Abstraction has 93 states and 100 transitions. [2025-04-29 11:19:37,300 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 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-04-29 11:19:37,300 INFO L278 IsEmpty]: Start isEmpty. Operand 93 states and 100 transitions. [2025-04-29 11:19:37,302 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-04-29 11:19:37,302 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:37,302 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:37,302 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-04-29 11:19:37,302 INFO L403 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:37,302 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:37,302 INFO L85 PathProgramCache]: Analyzing trace with hash -478418463, now seen corresponding path program 1 times [2025-04-29 11:19:37,302 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:37,302 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1769226915] [2025-04-29 11:19:37,302 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:37,302 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:37,312 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-04-29 11:19:37,315 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-04-29 11:19:37,315 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:37,316 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:37,352 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:37,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:37,352 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1769226915] [2025-04-29 11:19:37,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1769226915] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:37,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:37,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:19:37,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499923678] [2025-04-29 11:19:37,352 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:37,353 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:37,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:37,353 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:37,353 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:37,353 INFO L87 Difference]: Start difference. First operand 93 states and 100 transitions. Second operand has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-04-29 11:19:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:37,359 INFO L93 Difference]: Finished difference Result 103 states and 112 transitions. [2025-04-29 11:19:37,359 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:37,359 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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 15 [2025-04-29 11:19:37,360 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:37,360 INFO L225 Difference]: With dead ends: 103 [2025-04-29 11:19:37,360 INFO L226 Difference]: Without dead ends: 103 [2025-04-29 11:19:37,360 INFO L436 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-04-29 11:19:37,361 INFO L437 NwaCegarLoop]: 98 mSDtfsCounter, 9 mSDsluCounter, 95 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 193 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:37,361 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 193 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:37,361 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2025-04-29 11:19:37,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 94. [2025-04-29 11:19:37,367 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 55 states have (on average 1.7636363636363637) 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-04-29 11:19:37,367 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2025-04-29 11:19:37,367 INFO L79 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 15 [2025-04-29 11:19:37,367 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:37,367 INFO L485 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2025-04-29 11:19:37,367 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.333333333333333) internal successors, (13), 3 states have internal predecessors, (13), 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-04-29 11:19:37,368 INFO L278 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2025-04-29 11:19:37,368 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-04-29 11:19:37,368 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:37,368 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:37,368 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-04-29 11:19:37,368 INFO L403 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:37,368 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:37,368 INFO L85 PathProgramCache]: Analyzing trace with hash 1067189616, now seen corresponding path program 1 times [2025-04-29 11:19:37,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:37,368 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948691450] [2025-04-29 11:19:37,369 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:37,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:37,380 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-04-29 11:19:37,389 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-04-29 11:19:37,390 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:37,390 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:37,429 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:37,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:37,429 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948691450] [2025-04-29 11:19:37,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948691450] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:37,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:37,430 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-04-29 11:19:37,430 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1133424508] [2025-04-29 11:19:37,430 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:37,430 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-04-29 11:19:37,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:37,430 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-04-29 11:19:37,430 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-04-29 11:19:37,430 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-04-29 11:19:37,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:37,445 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2025-04-29 11:19:37,446 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-04-29 11:19:37,446 INFO L79 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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 17 [2025-04-29 11:19:37,446 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:37,446 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:19:37,446 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 11:19:37,447 INFO L436 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-04-29 11:19:37,447 INFO L437 NwaCegarLoop]: 98 mSDtfsCounter, 0 mSDsluCounter, 90 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 188 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:37,447 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 188 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:37,448 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 11:19:37,452 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-04-29 11:19:37,452 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 59 states have (on average 1.7118644067796611) 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-04-29 11:19:37,452 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2025-04-29 11:19:37,453 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 17 [2025-04-29 11:19:37,453 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:37,453 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2025-04-29 11:19:37,453 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 5.0) internal successors, (15), 3 states have internal predecessors, (15), 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-04-29 11:19:37,453 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2025-04-29 11:19:37,453 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2025-04-29 11:19:37,453 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:37,453 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, 1, 1] [2025-04-29 11:19:37,453 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-04-29 11:19:37,453 INFO L403 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:37,454 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:37,454 INFO L85 PathProgramCache]: Analyzing trace with hash -1935094604, now seen corresponding path program 1 times [2025-04-29 11:19:37,454 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:37,454 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [596237841] [2025-04-29 11:19:37,454 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:37,454 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:37,466 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:19:37,476 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:19:37,477 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:37,477 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:37,540 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:19:37,540 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:37,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [596237841] [2025-04-29 11:19:37,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [596237841] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:37,540 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1465376591] [2025-04-29 11:19:37,540 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:37,540 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:37,540 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:37,542 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:37,544 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-04-29 11:19:37,598 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 30 statements into 1 equivalence classes. [2025-04-29 11:19:37,626 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 30 of 30 statements. [2025-04-29 11:19:37,626 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:37,626 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:37,628 INFO L256 TraceCheckSpWp]: Trace formula consists of 277 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-04-29 11:19:37,631 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:37,662 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 8 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:37,662 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-04-29 11:19:37,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1465376591] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:37,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:37,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2025-04-29 11:19:37,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [490145072] [2025-04-29 11:19:37,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:37,694 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:19:37,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:37,694 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:19:37,694 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:19:37,695 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-04-29 11:19:37,706 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:37,707 INFO L93 Difference]: Finished difference Result 101 states and 109 transitions. [2025-04-29 11:19:37,707 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:19:37,711 INFO L79 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 30 [2025-04-29 11:19:37,711 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:37,711 INFO L225 Difference]: With dead ends: 101 [2025-04-29 11:19:37,711 INFO L226 Difference]: Without dead ends: 101 [2025-04-29 11:19:37,712 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 57 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-04-29 11:19:37,712 INFO L437 NwaCegarLoop]: 98 mSDtfsCounter, 9 mSDsluCounter, 180 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 278 SdHoareTripleChecker+Invalid, 11 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 10 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:37,712 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 278 Invalid, 11 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:37,713 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-04-29 11:19:37,718 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 101. [2025-04-29 11:19:37,718 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 61 states have (on average 1.6885245901639345) internal successors, (103), 96 states have internal predecessors, (103), 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-04-29 11:19:37,719 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 109 transitions. [2025-04-29 11:19:37,720 INFO L79 Accepts]: Start accepts. Automaton has 101 states and 109 transitions. Word has length 30 [2025-04-29 11:19:37,720 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:37,720 INFO L485 AbstractCegarLoop]: Abstraction has 101 states and 109 transitions. [2025-04-29 11:19:37,720 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-04-29 11:19:37,721 INFO L278 IsEmpty]: Start isEmpty. Operand 101 states and 109 transitions. [2025-04-29 11:19:37,721 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-29 11:19:37,721 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:37,721 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:37,728 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:37,922 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:37,922 INFO L403 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:37,922 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:37,922 INFO L85 PathProgramCache]: Analyzing trace with hash 1360756611, now seen corresponding path program 1 times [2025-04-29 11:19:37,923 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:37,923 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1253927299] [2025-04-29 11:19:37,923 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:37,923 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:37,949 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:19:37,959 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:19:37,959 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:37,959 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:38,186 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 6 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:38,186 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:38,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1253927299] [2025-04-29 11:19:38,186 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1253927299] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:38,186 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [476896951] [2025-04-29 11:19:38,186 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:38,186 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:38,186 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:38,191 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:38,193 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-04-29 11:19:38,252 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:19:38,280 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:19:38,280 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:38,280 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:38,282 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 16 conjuncts are in the unsatisfiable core [2025-04-29 11:19:38,283 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:38,312 WARN L871 $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-04-29 11:19:38,350 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:19:38,350 INFO L354 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-04-29 11:19:38,365 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:38,365 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:38,492 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 12 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:38,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [476896951] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:38,492 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:38,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 5, 4] total 12 [2025-04-29 11:19:38,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [289322547] [2025-04-29 11:19:38,492 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:38,493 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2025-04-29 11:19:38,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:38,493 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2025-04-29 11:19:38,493 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=31, Invalid=104, Unknown=1, NotChecked=20, Total=156 [2025-04-29 11:19:38,493 INFO L87 Difference]: Start difference. First operand 101 states and 109 transitions. Second operand has 13 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-29 11:19:38,768 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:38,768 INFO L93 Difference]: Finished difference Result 100 states and 108 transitions. [2025-04-29 11:19:38,769 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:19:38,769 INFO L79 Accepts]: Start accepts. Automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) Word has length 32 [2025-04-29 11:19:38,769 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:38,769 INFO L225 Difference]: With dead ends: 100 [2025-04-29 11:19:38,769 INFO L226 Difference]: Without dead ends: 100 [2025-04-29 11:19:38,770 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 60 SyntacticMatches, 4 SemanticMatches, 14 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 12 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=169, Unknown=1, NotChecked=26, Total=240 [2025-04-29 11:19:38,770 INFO L437 NwaCegarLoop]: 87 mSDtfsCounter, 4 mSDsluCounter, 370 mSDsCounter, 0 mSdLazyCounter, 449 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 457 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 449 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 99 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:38,770 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 457 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 449 Invalid, 0 Unknown, 99 Unchecked, 0.2s Time] [2025-04-29 11:19:38,771 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2025-04-29 11:19:38,773 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2025-04-29 11:19:38,773 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 61 states have (on average 1.6721311475409837) 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-04-29 11:19:38,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 108 transitions. [2025-04-29 11:19:38,773 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 108 transitions. Word has length 32 [2025-04-29 11:19:38,773 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:38,773 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 108 transitions. [2025-04-29 11:19:38,773 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 12 states have (on average 4.25) internal successors, (51), 11 states have internal predecessors, (51), 2 states have call successors, (3), 3 states have call predecessors, (3), 5 states have return successors, (5), 3 states have call predecessors, (5), 2 states have call successors, (5) [2025-04-29 11:19:38,773 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 108 transitions. [2025-04-29 11:19:38,774 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2025-04-29 11:19:38,774 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:38,774 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1] [2025-04-29 11:19:38,780 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-04-29 11:19:38,974 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable7 [2025-04-29 11:19:38,975 INFO L403 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:38,975 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:38,975 INFO L85 PathProgramCache]: Analyzing trace with hash 1360756612, now seen corresponding path program 1 times [2025-04-29 11:19:38,975 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:38,975 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [247387916] [2025-04-29 11:19:38,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:38,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:38,986 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:19:38,997 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:19:38,998 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:38,998 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:39,358 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:39,358 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:39,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [247387916] [2025-04-29 11:19:39,358 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [247387916] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:39,358 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [110386381] [2025-04-29 11:19:39,359 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:39,359 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:39,359 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:39,360 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:39,362 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-04-29 11:19:39,415 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 32 statements into 1 equivalence classes. [2025-04-29 11:19:39,457 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 32 of 32 statements. [2025-04-29 11:19:39,457 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:39,457 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:39,463 INFO L256 TraceCheckSpWp]: Trace formula consists of 288 conjuncts, 27 conjuncts are in the unsatisfiable core [2025-04-29 11:19:39,464 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:39,471 INFO L354 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-04-29 11:19:39,618 WARN L871 $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|) (= 0 (select |c_old(#valid)| |node_create_~temp~0#1.base|)))) is different from true [2025-04-29 11:19:39,667 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:39,668 INFO L354 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-04-29 11:19:39,673 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:39,673 INFO L354 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-04-29 11:19:39,700 INFO L134 CoverageAnalysis]: Checked inductivity of 14 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 7 not checked. [2025-04-29 11:19:39,700 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:39,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [110386381] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:39,805 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:39,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2025-04-29 11:19:39,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1942819255] [2025-04-29 11:19:39,806 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:39,806 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 20 states [2025-04-29 11:19:39,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:39,806 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 20 interpolants. [2025-04-29 11:19:39,806 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=361, Unknown=1, NotChecked=38, Total=462 [2025-04-29 11:19:39,807 INFO L87 Difference]: Start difference. First operand 100 states and 108 transitions. Second operand has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 17 states have internal predecessors, (53), 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-04-29 11:19:40,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:40,228 INFO L93 Difference]: Finished difference Result 99 states and 107 transitions. [2025-04-29 11:19:40,229 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:19:40,229 INFO L79 Accepts]: Start accepts. Automaton has has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 17 states have internal predecessors, (53), 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 32 [2025-04-29 11:19:40,229 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:40,230 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:19:40,230 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 11:19:40,230 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 53 GetRequests, 28 SyntacticMatches, 0 SemanticMatches, 25 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=556, Unknown=1, NotChecked=48, Total=702 [2025-04-29 11:19:40,230 INFO L437 NwaCegarLoop]: 87 mSDtfsCounter, 4 mSDsluCounter, 527 mSDsCounter, 0 mSdLazyCounter, 595 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 595 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:40,231 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 614 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 595 Invalid, 0 Unknown, 98 Unchecked, 0.3s Time] [2025-04-29 11:19:40,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 11:19:40,233 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-04-29 11:19:40,234 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 61 states have (on average 1.6557377049180328) 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-04-29 11:19:40,234 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 107 transitions. [2025-04-29 11:19:40,234 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 107 transitions. Word has length 32 [2025-04-29 11:19:40,234 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:40,235 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 107 transitions. [2025-04-29 11:19:40,235 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 20 states, 19 states have (on average 2.789473684210526) internal successors, (53), 17 states have internal predecessors, (53), 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-04-29 11:19:40,235 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 107 transitions. [2025-04-29 11:19:40,236 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-04-29 11:19:40,236 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:40,236 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] [2025-04-29 11:19:40,243 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:40,440 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:40,440 INFO L403 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:40,441 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:40,441 INFO L85 PathProgramCache]: Analyzing trace with hash -1760196223, now seen corresponding path program 2 times [2025-04-29 11:19:40,441 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:40,441 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1687422525] [2025-04-29 11:19:40,441 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:19:40,441 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:40,458 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-29 11:19:40,469 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:19:40,469 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:19:40,469 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:40,565 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:19:40,565 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:40,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1687422525] [2025-04-29 11:19:40,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1687422525] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:40,565 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [155657728] [2025-04-29 11:19:40,565 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:19:40,565 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:40,565 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:40,567 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:40,569 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-04-29 11:19:40,643 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 45 statements into 2 equivalence classes. [2025-04-29 11:19:40,688 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 45 of 45 statements. [2025-04-29 11:19:40,688 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:19:40,688 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:40,690 INFO L256 TraceCheckSpWp]: Trace formula consists of 408 conjuncts, 11 conjuncts are in the unsatisfiable core [2025-04-29 11:19:40,691 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:40,716 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 11 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:40,717 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:40,756 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 5 proven. 18 refuted. 0 times theorem prover too weak. 10 trivial. 0 not checked. [2025-04-29 11:19:40,757 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [155657728] provided 0 perfect and 2 imperfect interpolant sequences [2025-04-29 11:19:40,757 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-04-29 11:19:40,757 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 7 [2025-04-29 11:19:40,757 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344283188] [2025-04-29 11:19:40,757 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:40,757 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:19:40,757 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:40,758 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:19:40,758 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2025-04-29 11:19:40,758 INFO L87 Difference]: Start difference. First operand 99 states and 107 transitions. Second operand has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 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-04-29 11:19:40,818 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:40,819 INFO L93 Difference]: Finished difference Result 99 states and 106 transitions. [2025-04-29 11:19:40,819 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2025-04-29 11:19:40,819 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 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 45 [2025-04-29 11:19:40,819 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:40,820 INFO L225 Difference]: With dead ends: 99 [2025-04-29 11:19:40,820 INFO L226 Difference]: Without dead ends: 99 [2025-04-29 11:19:40,820 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 97 GetRequests, 90 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-04-29 11:19:40,820 INFO L437 NwaCegarLoop]: 89 mSDtfsCounter, 3 mSDsluCounter, 431 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 520 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:40,821 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 520 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:19:40,821 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2025-04-29 11:19:40,823 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2025-04-29 11:19:40,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 61 states have (on average 1.639344262295082) internal successors, (100), 94 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-04-29 11:19:40,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 106 transitions. [2025-04-29 11:19:40,824 INFO L79 Accepts]: Start accepts. Automaton has 99 states and 106 transitions. Word has length 45 [2025-04-29 11:19:40,824 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:40,824 INFO L485 AbstractCegarLoop]: Abstraction has 99 states and 106 transitions. [2025-04-29 11:19:40,824 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 5.571428571428571) internal successors, (39), 6 states have internal predecessors, (39), 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-04-29 11:19:40,824 INFO L278 IsEmpty]: Start isEmpty. Operand 99 states and 106 transitions. [2025-04-29 11:19:40,825 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:19:40,825 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:40,825 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] [2025-04-29 11:19:40,831 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2025-04-29 11:19:41,028 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:41,028 INFO L403 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:41,029 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:41,029 INFO L85 PathProgramCache]: Analyzing trace with hash -1409903698, now seen corresponding path program 1 times [2025-04-29 11:19:41,029 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:41,029 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [535458810] [2025-04-29 11:19:41,029 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:41,029 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:41,046 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:19:41,067 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:19:41,067 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:41,067 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:41,393 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 28 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2025-04-29 11:19:41,393 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:41,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [535458810] [2025-04-29 11:19:41,393 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [535458810] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:41,393 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1681363149] [2025-04-29 11:19:41,393 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:41,394 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:41,394 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:41,395 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:41,397 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-04-29 11:19:41,467 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:19:41,504 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:19:41,504 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:41,504 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:41,506 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 22 conjuncts are in the unsatisfiable core [2025-04-29 11:19:41,508 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:41,512 INFO L354 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-04-29 11:19:41,520 INFO L354 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-04-29 11:19:41,527 WARN L871 $PredicateComparison]: unable to prove that (exists ((|node_create_~temp~0#1.base| Int)) (and (<= (+ |node_create_~temp~0#1.base| 1) |c_#StackHeapBarrier|) (= |c_#valid| (store |c_old(#valid)| |node_create_~temp~0#1.base| (select |c_#valid| |node_create_~temp~0#1.base|))))) is different from true [2025-04-29 11:19:41,557 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:41,558 INFO L354 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-04-29 11:19:41,580 INFO L354 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-04-29 11:19:41,585 WARN L871 $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-04-29 11:19:41,604 INFO L325 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-04-29 11:19:41,604 INFO L354 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-04-29 11:19:41,657 INFO L354 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-04-29 11:19:41,694 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:41,695 INFO L354 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-04-29 11:19:41,699 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 14 not checked. [2025-04-29 11:19:41,699 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:41,746 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1681363149] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:41,746 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:41,746 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 7] total 15 [2025-04-29 11:19:41,748 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [363069363] [2025-04-29 11:19:41,748 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:41,748 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2025-04-29 11:19:41,748 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:41,748 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2025-04-29 11:19:41,749 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=45, Invalid=171, Unknown=2, NotChecked=54, Total=272 [2025-04-29 11:19:41,749 INFO L87 Difference]: Start difference. First operand 99 states and 106 transitions. Second operand has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-04-29 11:19:42,065 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:42,065 INFO L93 Difference]: Finished difference Result 106 states and 114 transitions. [2025-04-29 11:19:42,065 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:42,065 INFO L79 Accepts]: Start accepts. Automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) Word has length 46 [2025-04-29 11:19:42,066 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:42,066 INFO L225 Difference]: With dead ends: 106 [2025-04-29 11:19:42,066 INFO L226 Difference]: Without dead ends: 106 [2025-04-29 11:19:42,066 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 48 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=67, Invalid=245, Unknown=2, NotChecked=66, Total=380 [2025-04-29 11:19:42,067 INFO L437 NwaCegarLoop]: 46 mSDtfsCounter, 138 mSDsluCounter, 244 mSDsCounter, 0 mSdLazyCounter, 352 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 290 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 352 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 198 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:42,067 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 290 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 352 Invalid, 0 Unknown, 198 Unchecked, 0.3s Time] [2025-04-29 11:19:42,067 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 106 states. [2025-04-29 11:19:42,072 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 106 to 94. [2025-04-29 11:19:42,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 61 states have (on average 1.5573770491803278) internal successors, (95), 89 states have internal predecessors, (95), 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-04-29 11:19:42,074 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 101 transitions. [2025-04-29 11:19:42,074 INFO L79 Accepts]: Start accepts. Automaton has 94 states and 101 transitions. Word has length 46 [2025-04-29 11:19:42,074 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:42,075 INFO L485 AbstractCegarLoop]: Abstraction has 94 states and 101 transitions. [2025-04-29 11:19:42,075 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 14 states have (on average 4.071428571428571) internal successors, (57), 15 states have internal predecessors, (57), 3 states have call successors, (3), 1 states have call predecessors, (3), 5 states have return successors, (6), 3 states have call predecessors, (6), 3 states have call successors, (6) [2025-04-29 11:19:42,077 INFO L278 IsEmpty]: Start isEmpty. Operand 94 states and 101 transitions. [2025-04-29 11:19:42,077 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 47 [2025-04-29 11:19:42,078 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:42,078 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] [2025-04-29 11:19:42,084 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:42,278 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable10 [2025-04-29 11:19:42,278 INFO L403 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:42,279 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:42,279 INFO L85 PathProgramCache]: Analyzing trace with hash -1409903697, now seen corresponding path program 1 times [2025-04-29 11:19:42,279 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:42,279 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2049720991] [2025-04-29 11:19:42,279 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:42,279 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:42,292 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:19:42,303 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:19:42,303 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:42,303 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:42,710 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 32 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:19:42,710 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:42,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2049720991] [2025-04-29 11:19:42,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2049720991] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:42,710 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1635766965] [2025-04-29 11:19:42,710 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:42,710 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:42,710 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:42,712 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:42,713 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-04-29 11:19:42,790 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 46 statements into 1 equivalence classes. [2025-04-29 11:19:42,825 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 46 of 46 statements. [2025-04-29 11:19:42,826 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:42,826 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:42,827 INFO L256 TraceCheckSpWp]: Trace formula consists of 421 conjuncts, 26 conjuncts are in the unsatisfiable core [2025-04-29 11:19:42,829 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:42,837 INFO L354 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-04-29 11:19:42,850 INFO L354 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-04-29 11:19:42,855 WARN L871 $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-04-29 11:19:42,882 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:42,882 INFO L354 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-04-29 11:19:42,912 INFO L354 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-04-29 11:19:42,944 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:42,945 INFO L354 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-04-29 11:19:43,004 INFO L354 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-04-29 11:19:43,033 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:43,034 INFO L354 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-04-29 11:19:43,038 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-29 11:19:43,039 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:19:43,039 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1635766965] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:43,039 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:19:43,039 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [13] total 15 [2025-04-29 11:19:43,039 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1814107596] [2025-04-29 11:19:43,039 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:43,039 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2025-04-29 11:19:43,039 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:43,039 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2025-04-29 11:19:43,039 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=43, Invalid=170, Unknown=1, NotChecked=26, Total=240 [2025-04-29 11:19:43,040 INFO L87 Difference]: Start difference. First operand 94 states and 101 transitions. Second operand has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-04-29 11:19:43,119 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:43,120 INFO L93 Difference]: Finished difference Result 91 states and 98 transitions. [2025-04-29 11:19:43,120 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-04-29 11:19:43,120 INFO L79 Accepts]: Start accepts. Automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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 46 [2025-04-29 11:19:43,120 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:43,120 INFO L225 Difference]: With dead ends: 91 [2025-04-29 11:19:43,121 INFO L226 Difference]: Without dead ends: 91 [2025-04-29 11:19:43,121 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 46 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=49, Invalid=194, Unknown=1, NotChecked=28, Total=272 [2025-04-29 11:19:43,121 INFO L437 NwaCegarLoop]: 77 mSDtfsCounter, 4 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 110 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 230 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:43,121 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 207 Invalid, 230 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 110 Invalid, 0 Unknown, 118 Unchecked, 0.1s Time] [2025-04-29 11:19:43,121 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 91 states. [2025-04-29 11:19:43,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 91 to 91. [2025-04-29 11:19:43,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 91 states, 61 states have (on average 1.5081967213114753) internal successors, (92), 86 states have internal predecessors, (92), 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-04-29 11:19:43,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 91 states to 91 states and 98 transitions. [2025-04-29 11:19:43,123 INFO L79 Accepts]: Start accepts. Automaton has 91 states and 98 transitions. Word has length 46 [2025-04-29 11:19:43,123 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:43,125 INFO L485 AbstractCegarLoop]: Abstraction has 91 states and 98 transitions. [2025-04-29 11:19:43,126 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 5 states have (on average 4.2) internal successors, (21), 6 states have internal predecessors, (21), 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-04-29 11:19:43,126 INFO L278 IsEmpty]: Start isEmpty. Operand 91 states and 98 transitions. [2025-04-29 11:19:43,128 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-29 11:19:43,128 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:43,128 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] [2025-04-29 11:19:43,136 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:43,328 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:43,329 INFO L403 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:43,329 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:43,329 INFO L85 PathProgramCache]: Analyzing trace with hash -502536559, now seen corresponding path program 1 times [2025-04-29 11:19:43,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:43,329 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1965939089] [2025-04-29 11:19:43,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:43,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:43,343 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:19:43,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:19:43,349 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:43,349 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:43,537 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:19:43,537 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:43,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1965939089] [2025-04-29 11:19:43,537 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1965939089] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:43,537 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [240108348] [2025-04-29 11:19:43,537 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:43,537 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:43,537 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:43,539 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:43,541 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2025-04-29 11:19:43,630 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:19:43,674 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:19:43,674 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:43,674 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:43,676 INFO L256 TraceCheckSpWp]: Trace formula consists of 450 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-29 11:19:43,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:43,690 INFO L354 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-04-29 11:19:43,698 INFO L354 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-04-29 11:19:43,727 INFO L354 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-04-29 11:19:43,730 INFO L354 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-04-29 11:19:43,801 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:19:43,802 INFO L354 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-04-29 11:19:43,807 INFO L354 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-04-29 11:19:43,879 INFO L354 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-04-29 11:19:43,898 WARN L871 $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-04-29 11:19:43,937 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:43,938 INFO L354 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-04-29 11:19:43,982 INFO L354 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-04-29 11:19:44,015 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:44,016 INFO L354 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-04-29 11:19:44,043 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 13 trivial. 14 not checked. [2025-04-29 11:19:44,044 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:44,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [240108348] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:44,130 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:44,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10] total 19 [2025-04-29 11:19:44,130 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353965409] [2025-04-29 11:19:44,130 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:44,131 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2025-04-29 11:19:44,131 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:44,131 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2025-04-29 11:19:44,132 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=53, Invalid=330, Unknown=1, NotChecked=36, Total=420 [2025-04-29 11:19:44,132 INFO L87 Difference]: Start difference. First operand 91 states and 98 transitions. Second operand has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 15 states have internal predecessors, (69), 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-04-29 11:19:44,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:44,632 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2025-04-29 11:19:44,632 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-04-29 11:19:44,632 INFO L79 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 15 states have internal predecessors, (69), 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 50 [2025-04-29 11:19:44,632 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:44,633 INFO L225 Difference]: With dead ends: 88 [2025-04-29 11:19:44,633 INFO L226 Difference]: Without dead ends: 88 [2025-04-29 11:19:44,633 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 80 GetRequests, 50 SyntacticMatches, 0 SemanticMatches, 30 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 57 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=136, Invalid=797, Unknown=1, NotChecked=58, Total=992 [2025-04-29 11:19:44,634 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 54 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 770 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 516 SdHoareTripleChecker+Invalid, 862 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 770 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 85 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:44,634 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 516 Invalid, 862 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 770 Invalid, 0 Unknown, 85 Unchecked, 0.3s Time] [2025-04-29 11:19:44,634 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2025-04-29 11:19:44,635 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2025-04-29 11:19:44,635 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 60 states have (on average 1.4666666666666666) internal successors, (88), 83 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-04-29 11:19:44,636 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2025-04-29 11:19:44,636 INFO L79 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 50 [2025-04-29 11:19:44,636 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:44,636 INFO L485 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2025-04-29 11:19:44,636 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 3.6315789473684212) internal successors, (69), 15 states have internal predecessors, (69), 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-04-29 11:19:44,636 INFO L278 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2025-04-29 11:19:44,636 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-29 11:19:44,637 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:44,637 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] [2025-04-29 11:19:44,645 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:44,837 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:44,837 INFO L403 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:44,838 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:44,838 INFO L85 PathProgramCache]: Analyzing trace with hash -502383693, now seen corresponding path program 1 times [2025-04-29 11:19:44,838 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:44,838 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [648009249] [2025-04-29 11:19:44,838 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:44,838 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:44,851 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:19:44,861 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:19:44,861 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:44,861 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:45,138 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 26 proven. 4 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:19:45,139 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:45,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [648009249] [2025-04-29 11:19:45,139 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [648009249] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:45,139 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1594975380] [2025-04-29 11:19:45,139 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:45,139 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:45,139 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:45,141 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:45,143 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2025-04-29 11:19:45,234 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:19:45,489 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:19:45,489 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:45,489 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:45,491 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 30 conjuncts are in the unsatisfiable core [2025-04-29 11:19:45,494 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:45,587 INFO L354 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-04-29 11:19:45,591 WARN L871 $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-04-29 11:19:45,608 INFO L325 Elim1Store]: treesize reduction 27, result has 25.0 percent of original size [2025-04-29 11:19:45,609 INFO L354 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 16 treesize of output 18 [2025-04-29 11:19:45,636 INFO L354 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-04-29 11:19:45,639 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 21 proven. 0 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:19:45,639 INFO L308 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2025-04-29 11:19:45,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1594975380] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:45,639 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2025-04-29 11:19:45,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [14] total 20 [2025-04-29 11:19:45,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863022505] [2025-04-29 11:19:45,639 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:45,639 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2025-04-29 11:19:45,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:45,640 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2025-04-29 11:19:45,640 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=51, Invalid=332, Unknown=1, NotChecked=36, Total=420 [2025-04-29 11:19:45,640 INFO L87 Difference]: Start difference. First operand 88 states and 94 transitions. Second operand has 11 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:45,747 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:45,747 INFO L93 Difference]: Finished difference Result 87 states and 94 transitions. [2025-04-29 11:19:45,747 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2025-04-29 11:19:45,748 INFO L79 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) Word has length 50 [2025-04-29 11:19:45,748 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:45,748 INFO L225 Difference]: With dead ends: 87 [2025-04-29 11:19:45,748 INFO L226 Difference]: Without dead ends: 87 [2025-04-29 11:19:45,748 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 20 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 39 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=56, Invalid=367, Unknown=1, NotChecked=38, Total=462 [2025-04-29 11:19:45,749 INFO L437 NwaCegarLoop]: 65 mSDtfsCounter, 9 mSDsluCounter, 197 mSDsCounter, 0 mSdLazyCounter, 211 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 371 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 211 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 156 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:45,749 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 262 Invalid, 371 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 211 Invalid, 0 Unknown, 156 Unchecked, 0.1s Time] [2025-04-29 11:19:45,749 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-04-29 11:19:45,750 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 87. [2025-04-29 11:19:45,750 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-04-29 11:19:45,750 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 87 states to 87 states and 94 transitions. [2025-04-29 11:19:45,751 INFO L79 Accepts]: Start accepts. Automaton has 87 states and 94 transitions. Word has length 50 [2025-04-29 11:19:45,751 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:45,751 INFO L485 AbstractCegarLoop]: Abstraction has 87 states and 94 transitions. [2025-04-29 11:19:45,751 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.5) internal successors, (35), 10 states have internal predecessors, (35), 2 states have call successors, (2), 2 states have call predecessors, (2), 2 states have return successors, (2), 2 states have call predecessors, (2), 2 states have call successors, (2) [2025-04-29 11:19:45,751 INFO L278 IsEmpty]: Start isEmpty. Operand 87 states and 94 transitions. [2025-04-29 11:19:45,751 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 51 [2025-04-29 11:19:45,751 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:45,751 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] [2025-04-29 11:19:45,759 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2025-04-29 11:19:45,956 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable13 [2025-04-29 11:19:45,957 INFO L403 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:45,957 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:45,957 INFO L85 PathProgramCache]: Analyzing trace with hash -502383692, now seen corresponding path program 1 times [2025-04-29 11:19:45,957 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:45,957 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1518596577] [2025-04-29 11:19:45,957 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:45,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:45,970 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:19:45,978 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:19:45,979 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:45,979 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:46,387 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:19:46,387 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:46,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1518596577] [2025-04-29 11:19:46,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1518596577] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:46,387 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [390200846] [2025-04-29 11:19:46,387 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:46,387 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:46,387 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:46,390 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:46,391 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2025-04-29 11:19:46,487 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 50 statements into 1 equivalence classes. [2025-04-29 11:19:46,538 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 50 of 50 statements. [2025-04-29 11:19:46,539 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:46,539 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:46,541 INFO L256 TraceCheckSpWp]: Trace formula consists of 442 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-04-29 11:19:46,544 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:46,565 INFO L354 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-04-29 11:19:46,736 INFO L354 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-04-29 11:19:46,839 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 11:19:46,839 INFO L354 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-04-29 11:19:46,889 INFO L354 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-04-29 11:19:46,935 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 7 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:19:46,935 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:47,116 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [390200846] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:47,116 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:47,116 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13] total 27 [2025-04-29 11:19:47,116 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [702195044] [2025-04-29 11:19:47,116 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:47,117 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 28 states [2025-04-29 11:19:47,117 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:47,118 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 28 interpolants. [2025-04-29 11:19:47,118 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=906, Unknown=0, NotChecked=0, Total=992 [2025-04-29 11:19:47,118 INFO L87 Difference]: Start difference. First operand 87 states and 94 transitions. Second operand has 28 states, 26 states have (on average 3.0) internal successors, (78), 24 states have internal predecessors, (78), 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-04-29 11:19:47,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:47,990 INFO L93 Difference]: Finished difference Result 101 states and 107 transitions. [2025-04-29 11:19:47,990 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2025-04-29 11:19:47,990 INFO L79 Accepts]: Start accepts. Automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 24 states have internal predecessors, (78), 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 50 [2025-04-29 11:19:47,991 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:47,991 INFO L225 Difference]: With dead ends: 101 [2025-04-29 11:19:47,991 INFO L226 Difference]: Without dead ends: 101 [2025-04-29 11:19:47,992 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 42 SyntacticMatches, 1 SemanticMatches, 45 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 313 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=182, Invalid=1980, Unknown=0, NotChecked=0, Total=2162 [2025-04-29 11:19:47,992 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 69 mSDsluCounter, 809 mSDsCounter, 0 mSdLazyCounter, 1232 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 871 SdHoareTripleChecker+Invalid, 1239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 1232 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:47,993 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 871 Invalid, 1239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 1232 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2025-04-29 11:19:47,993 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2025-04-29 11:19:47,994 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2025-04-29 11:19:47,994 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-04-29 11:19:47,995 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2025-04-29 11:19:47,995 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 50 [2025-04-29 11:19:47,995 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:47,995 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2025-04-29 11:19:47,995 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 28 states, 26 states have (on average 3.0) internal successors, (78), 24 states have internal predecessors, (78), 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-04-29 11:19:47,995 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2025-04-29 11:19:47,996 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-29 11:19:47,996 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:47,996 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] [2025-04-29 11:19:48,004 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2025-04-29 11:19:48,196 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-04-29 11:19:48,197 INFO L403 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:48,197 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:48,197 INFO L85 PathProgramCache]: Analyzing trace with hash 1448454506, now seen corresponding path program 1 times [2025-04-29 11:19:48,197 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:48,197 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [985022149] [2025-04-29 11:19:48,197 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:48,197 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:48,212 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:19:48,218 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:19:48,219 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:48,219 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:48,270 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 10 proven. 0 refuted. 0 times theorem prover too weak. 23 trivial. 0 not checked. [2025-04-29 11:19:48,271 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:48,271 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [985022149] [2025-04-29 11:19:48,271 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [985022149] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:48,271 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:48,271 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:19:48,271 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1178873299] [2025-04-29 11:19:48,272 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:48,272 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:19:48,272 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:48,272 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:19:48,272 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:48,273 INFO L87 Difference]: Start difference. First operand 98 states and 104 transitions. Second operand has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-04-29 11:19:48,347 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:48,348 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2025-04-29 11:19:48,348 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:48,348 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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 53 [2025-04-29 11:19:48,348 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:48,348 INFO L225 Difference]: With dead ends: 97 [2025-04-29 11:19:48,349 INFO L226 Difference]: Without dead ends: 97 [2025-04-29 11:19:48,349 INFO L436 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-04-29 11:19:48,350 INFO L437 NwaCegarLoop]: 69 mSDtfsCounter, 8 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 164 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 228 SdHoareTripleChecker+Invalid, 165 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 164 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:48,350 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 228 Invalid, 165 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 164 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:48,350 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2025-04-29 11:19:48,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2025-04-29 11:19:48,351 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-04-29 11:19:48,352 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2025-04-29 11:19:48,352 INFO L79 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 53 [2025-04-29 11:19:48,352 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:48,352 INFO L485 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2025-04-29 11:19:48,352 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.6) internal successors, (33), 5 states have internal predecessors, (33), 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-04-29 11:19:48,352 INFO L278 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2025-04-29 11:19:48,352 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 54 [2025-04-29 11:19:48,352 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:48,352 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] [2025-04-29 11:19:48,354 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-04-29 11:19:48,355 INFO L403 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:48,355 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:48,356 INFO L85 PathProgramCache]: Analyzing trace with hash 1448454507, now seen corresponding path program 1 times [2025-04-29 11:19:48,356 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:48,356 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [849463474] [2025-04-29 11:19:48,356 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:48,356 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:48,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 53 statements into 1 equivalence classes. [2025-04-29 11:19:48,377 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 53 of 53 statements. [2025-04-29 11:19:48,377 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:48,377 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:48,499 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 0 refuted. 0 times theorem prover too weak. 19 trivial. 0 not checked. [2025-04-29 11:19:48,500 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:48,500 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [849463474] [2025-04-29 11:19:48,500 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [849463474] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:19:48,500 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:19:48,500 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:19:48,500 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [784617248] [2025-04-29 11:19:48,500 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:19:48,500 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-04-29 11:19:48,501 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:48,501 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-04-29 11:19:48,501 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2025-04-29 11:19:48,502 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-04-29 11:19:48,575 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:48,576 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2025-04-29 11:19:48,576 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-04-29 11:19:48,576 INFO L79 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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 53 [2025-04-29 11:19:48,576 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:48,577 INFO L225 Difference]: With dead ends: 96 [2025-04-29 11:19:48,577 INFO L226 Difference]: Without dead ends: 96 [2025-04-29 11:19:48,577 INFO L436 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-04-29 11:19:48,578 INFO L437 NwaCegarLoop]: 67 mSDtfsCounter, 7 mSDsluCounter, 173 mSDsCounter, 0 mSdLazyCounter, 147 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 240 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-04-29 11:19:48,578 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 240 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 147 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:19:48,578 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2025-04-29 11:19:48,579 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2025-04-29 11:19:48,580 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-04-29 11:19:48,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2025-04-29 11:19:48,580 INFO L79 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 53 [2025-04-29 11:19:48,580 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:48,580 INFO L485 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2025-04-29 11:19:48,580 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 7.0) internal successors, (35), 5 states have internal predecessors, (35), 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-04-29 11:19:48,580 INFO L278 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2025-04-29 11:19:48,581 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-29 11:19:48,581 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:48,581 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] [2025-04-29 11:19:48,582 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-04-29 11:19:48,582 INFO L403 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:48,582 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:48,582 INFO L85 PathProgramCache]: Analyzing trace with hash 1952350219, now seen corresponding path program 1 times [2025-04-29 11:19:48,582 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:48,582 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1545712573] [2025-04-29 11:19:48,582 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:48,582 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:48,596 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:19:48,612 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:19:48,613 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:48,613 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:49,445 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:49,445 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:49,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1545712573] [2025-04-29 11:19:49,445 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1545712573] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:49,445 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1406252331] [2025-04-29 11:19:49,445 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:49,446 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:49,446 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:49,447 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:49,448 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2025-04-29 11:19:49,549 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:19:49,760 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:19:49,760 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:49,760 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:49,763 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 91 conjuncts are in the unsatisfiable core [2025-04-29 11:19:49,766 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:49,924 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:19:49,924 INFO L354 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-04-29 11:19:50,012 INFO L354 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-04-29 11:19:50,066 INFO L325 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-04-29 11:19:50,066 INFO L354 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-04-29 11:19:50,225 INFO L354 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-04-29 11:19:50,227 INFO L354 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-04-29 11:19:50,357 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|node_create_~temp~0#1.base| Int)) (and (= 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)))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5| Int)) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_5|) 0) 0))) is different from true [2025-04-29 11:19:50,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:50,380 INFO L354 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-04-29 11:19:50,401 INFO L325 Elim1Store]: treesize reduction 72, result has 37.4 percent of original size [2025-04-29 11:19:50,401 INFO L354 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 34 treesize of output 57 [2025-04-29 11:19:50,513 INFO L354 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 38 [2025-04-29 11:19:50,652 INFO L354 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 33 treesize of output 17 [2025-04-29 11:19:50,751 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2025-04-29 11:19:50,751 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:50,915 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1406252331] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:50,915 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:50,915 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 23] total 44 [2025-04-29 11:19:50,915 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [636834103] [2025-04-29 11:19:50,915 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:50,915 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 45 states [2025-04-29 11:19:50,915 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:50,916 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 45 interpolants. [2025-04-29 11:19:50,917 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=2086, Unknown=1, NotChecked=92, Total=2352 [2025-04-29 11:19:50,917 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 45 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 40 states have internal predecessors, (88), 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-04-29 11:19:52,228 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:52,228 INFO L93 Difference]: Finished difference Result 108 states and 119 transitions. [2025-04-29 11:19:52,228 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 29 states. [2025-04-29 11:19:52,229 INFO L79 Accepts]: Start accepts. Automaton has has 45 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 40 states have internal predecessors, (88), 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-04-29 11:19:52,229 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:52,229 INFO L225 Difference]: With dead ends: 108 [2025-04-29 11:19:52,229 INFO L226 Difference]: Without dead ends: 108 [2025-04-29 11:19:52,230 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 108 GetRequests, 44 SyntacticMatches, 1 SemanticMatches, 63 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1030 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=307, Invalid=3728, Unknown=1, NotChecked=124, Total=4160 [2025-04-29 11:19:52,230 INFO L437 NwaCegarLoop]: 61 mSDtfsCounter, 73 mSDsluCounter, 897 mSDsCounter, 0 mSdLazyCounter, 1587 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 73 SdHoareTripleChecker+Valid, 958 SdHoareTripleChecker+Invalid, 1715 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 1587 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 116 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:52,231 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [73 Valid, 958 Invalid, 1715 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 1587 Invalid, 0 Unknown, 116 Unchecked, 0.8s Time] [2025-04-29 11:19:52,231 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-04-29 11:19:52,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 98. [2025-04-29 11:19:52,232 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 73 states have (on average 1.356164383561644) internal successors, (99), 92 states have internal predecessors, (99), 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-04-29 11:19:52,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 105 transitions. [2025-04-29 11:19:52,233 INFO L79 Accepts]: Start accepts. Automaton has 98 states and 105 transitions. Word has length 54 [2025-04-29 11:19:52,233 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:52,233 INFO L485 AbstractCegarLoop]: Abstraction has 98 states and 105 transitions. [2025-04-29 11:19:52,233 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 45 states, 42 states have (on average 2.0952380952380953) internal successors, (88), 40 states have internal predecessors, (88), 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-04-29 11:19:52,233 INFO L278 IsEmpty]: Start isEmpty. Operand 98 states and 105 transitions. [2025-04-29 11:19:52,234 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 55 [2025-04-29 11:19:52,234 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:52,234 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] [2025-04-29 11:19:52,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2025-04-29 11:19:52,438 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2025-04-29 11:19:52,438 INFO L403 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:52,438 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:52,438 INFO L85 PathProgramCache]: Analyzing trace with hash 1952350220, now seen corresponding path program 1 times [2025-04-29 11:19:52,438 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:52,438 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1626950602] [2025-04-29 11:19:52,438 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:52,438 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:52,453 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:19:52,478 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:19:52,478 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:52,478 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:53,887 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 15 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:19:53,887 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:53,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1626950602] [2025-04-29 11:19:53,887 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1626950602] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:53,887 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [630041626] [2025-04-29 11:19:53,888 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:19:53,888 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:53,888 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:53,889 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:53,890 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2025-04-29 11:19:54,006 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 54 statements into 1 equivalence classes. [2025-04-29 11:19:54,072 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 54 of 54 statements. [2025-04-29 11:19:54,072 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:19:54,072 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:54,074 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 111 conjuncts are in the unsatisfiable core [2025-04-29 11:19:54,078 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:54,101 INFO L354 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-04-29 11:19:54,104 INFO L354 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-04-29 11:19:54,414 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:19:54,414 INFO L354 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-04-29 11:19:54,421 INFO L354 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 12 treesize of output 14 [2025-04-29 11:19:54,531 INFO L354 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-04-29 11:19:54,535 INFO L354 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-04-29 11:19:54,607 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:19:54,607 INFO L354 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-04-29 11:19:54,613 INFO L354 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-04-29 11:19:54,833 INFO L354 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-04-29 11:19:54,837 INFO L354 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-04-29 11:19:54,840 INFO L354 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-04-29 11:19:54,843 INFO L354 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-04-29 11:19:54,949 WARN L871 $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-04-29 11:19:54,975 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:19:54,976 INFO L354 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-04-29 11:19:54,987 INFO L325 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-04-29 11:19:54,987 INFO L354 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-04-29 11:19:54,990 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 37 treesize of output 35 [2025-04-29 11:19:54,999 INFO L354 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-04-29 11:19:55,078 INFO L354 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 75 treesize of output 51 [2025-04-29 11:19:55,080 INFO L354 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-04-29 11:19:55,174 INFO L354 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-04-29 11:19:55,177 INFO L354 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-04-29 11:19:55,276 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 6 proven. 22 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-04-29 11:19:55,277 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:19:55,647 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [630041626] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:55,647 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:19:55,647 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [28, 27] total 52 [2025-04-29 11:19:55,647 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1645313983] [2025-04-29 11:19:55,647 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:19:55,647 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2025-04-29 11:19:55,647 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:19:55,648 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2025-04-29 11:19:55,648 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=173, Invalid=3136, Unknown=1, NotChecked=112, Total=3422 [2025-04-29 11:19:55,649 INFO L87 Difference]: Start difference. First operand 98 states and 105 transitions. Second operand has 53 states, 50 states have (on average 1.9) internal successors, (95), 47 states have internal predecessors, (95), 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-04-29 11:19:57,498 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:19:57,498 INFO L93 Difference]: Finished difference Result 108 states and 116 transitions. [2025-04-29 11:19:57,498 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2025-04-29 11:19:57,499 INFO L79 Accepts]: Start accepts. Automaton has has 53 states, 50 states have (on average 1.9) internal successors, (95), 47 states have internal predecessors, (95), 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-04-29 11:19:57,499 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:19:57,499 INFO L225 Difference]: With dead ends: 108 [2025-04-29 11:19:57,499 INFO L226 Difference]: Without dead ends: 108 [2025-04-29 11:19:57,501 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1203 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=367, Invalid=5488, Unknown=1, NotChecked=150, Total=6006 [2025-04-29 11:19:57,501 INFO L437 NwaCegarLoop]: 59 mSDtfsCounter, 85 mSDsluCounter, 1166 mSDsCounter, 0 mSdLazyCounter, 2307 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 1225 SdHoareTripleChecker+Invalid, 2430 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 2307 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 106 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:19:57,501 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 1225 Invalid, 2430 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 2307 Invalid, 0 Unknown, 106 Unchecked, 1.0s Time] [2025-04-29 11:19:57,501 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2025-04-29 11:19:57,503 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 100. [2025-04-29 11:19:57,503 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 75 states have (on average 1.3466666666666667) internal successors, (101), 94 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-04-29 11:19:57,504 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 107 transitions. [2025-04-29 11:19:57,504 INFO L79 Accepts]: Start accepts. Automaton has 100 states and 107 transitions. Word has length 54 [2025-04-29 11:19:57,504 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:19:57,504 INFO L485 AbstractCegarLoop]: Abstraction has 100 states and 107 transitions. [2025-04-29 11:19:57,504 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 50 states have (on average 1.9) internal successors, (95), 47 states have internal predecessors, (95), 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-04-29 11:19:57,504 INFO L278 IsEmpty]: Start isEmpty. Operand 100 states and 107 transitions. [2025-04-29 11:19:57,504 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-29 11:19:57,504 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:19:57,504 INFO L218 NwaCegarLoop]: trace histogram [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, 1, 1] [2025-04-29 11:19:57,512 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2025-04-29 11:19:57,705 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:57,705 INFO L403 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:19:57,705 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:19:57,705 INFO L85 PathProgramCache]: Analyzing trace with hash 566548579, now seen corresponding path program 2 times [2025-04-29 11:19:57,706 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:19:57,706 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1731367607] [2025-04-29 11:19:57,706 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:19:57,706 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:19:57,718 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-04-29 11:19:57,738 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:19:57,739 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:19:57,739 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:59,613 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 11 proven. 25 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:19:59,613 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:19:59,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1731367607] [2025-04-29 11:19:59,613 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1731367607] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:19:59,613 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1838982687] [2025-04-29 11:19:59,613 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2025-04-29 11:19:59,614 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:19:59,614 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:19:59,615 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:19:59,616 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2025-04-29 11:19:59,737 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 partitioned 58 statements into 2 equivalence classes. [2025-04-29 11:19:59,782 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:19:59,782 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2025-04-29 11:19:59,782 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:19:59,785 INFO L256 TraceCheckSpWp]: Trace formula consists of 484 conjuncts, 136 conjuncts are in the unsatisfiable core [2025-04-29 11:19:59,788 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:19:59,967 INFO L354 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-04-29 11:19:59,972 INFO L354 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-04-29 11:20:00,132 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:20:00,132 INFO L354 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-04-29 11:20:00,140 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:20:00,140 INFO L354 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-04-29 11:20:00,146 INFO L354 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-04-29 11:20:00,222 INFO L354 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-04-29 11:20:00,227 INFO L354 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-04-29 11:20:00,276 INFO L354 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-04-29 11:20:00,281 INFO L354 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-04-29 11:20:00,372 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-29 11:20:00,372 INFO L354 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 78 treesize of output 55 [2025-04-29 11:20:00,380 INFO L354 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 38 treesize of output 36 [2025-04-29 11:20:00,639 INFO L325 Elim1Store]: treesize reduction 11, result has 8.3 percent of original size [2025-04-29 11:20:00,639 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 94 treesize of output 41 [2025-04-29 11:20:00,643 INFO L354 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-04-29 11:20:00,646 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 10 [2025-04-29 11:20:00,812 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7| Int)) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_7|) 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-04-29 11:20:00,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:20:00,883 INFO L325 Elim1Store]: treesize reduction 29, result has 14.7 percent of original size [2025-04-29 11:20:00,883 INFO L354 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 102 treesize of output 69 [2025-04-29 11:20:00,888 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:20:00,891 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:20:00,891 INFO L354 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 50 treesize of output 38 [2025-04-29 11:20:00,913 INFO L325 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2025-04-29 11:20:00,914 INFO L354 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-04-29 11:20:01,047 INFO L354 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 99 treesize of output 63 [2025-04-29 11:20:01,344 INFO L134 CoverageAnalysis]: Checked inductivity of 39 backedges. 14 proven. 19 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2025-04-29 11:20:01,344 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:20:01,702 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1838982687] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:01,703 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:20:01,703 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [31, 32] total 58 [2025-04-29 11:20:01,703 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1281835553] [2025-04-29 11:20:01,703 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:20:01,703 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2025-04-29 11:20:01,703 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:01,704 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2025-04-29 11:20:01,704 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=198, Invalid=3711, Unknown=1, NotChecked=122, Total=4032 [2025-04-29 11:20:01,704 INFO L87 Difference]: Start difference. First operand 100 states and 107 transitions. Second operand has 58 states, 56 states have (on average 1.6607142857142858) internal successors, (93), 52 states have internal predecessors, (93), 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-04-29 11:20:03,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:03,224 INFO L93 Difference]: Finished difference Result 132 states and 143 transitions. [2025-04-29 11:20:03,224 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 32 states. [2025-04-29 11:20:03,224 INFO L79 Accepts]: Start accepts. Automaton has has 58 states, 56 states have (on average 1.6607142857142858) internal successors, (93), 52 states have internal predecessors, (93), 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 58 [2025-04-29 11:20:03,225 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:03,226 INFO L225 Difference]: With dead ends: 132 [2025-04-29 11:20:03,226 INFO L226 Difference]: Without dead ends: 132 [2025-04-29 11:20:03,227 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 131 GetRequests, 51 SyntacticMatches, 1 SemanticMatches, 79 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1565 ImplicationChecksByTransitivity, 2.4s TimeCoverageRelationStatistics Valid=327, Invalid=5996, Unknown=1, NotChecked=156, Total=6480 [2025-04-29 11:20:03,227 INFO L437 NwaCegarLoop]: 62 mSDtfsCounter, 9 mSDsluCounter, 1763 mSDsCounter, 0 mSdLazyCounter, 2248 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 1825 SdHoareTripleChecker+Invalid, 2380 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 2248 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 123 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:03,228 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 1825 Invalid, 2380 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 2248 Invalid, 0 Unknown, 123 Unchecked, 1.0s Time] [2025-04-29 11:20:03,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-04-29 11:20:03,231 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2025-04-29 11:20:03,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 101 states have (on average 1.2772277227722773) internal successors, (129), 120 states have internal predecessors, (129), 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-04-29 11:20:03,232 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 139 transitions. [2025-04-29 11:20:03,232 INFO L79 Accepts]: Start accepts. Automaton has 129 states and 139 transitions. Word has length 58 [2025-04-29 11:20:03,232 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:03,232 INFO L485 AbstractCegarLoop]: Abstraction has 129 states and 139 transitions. [2025-04-29 11:20:03,232 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 56 states have (on average 1.6607142857142858) internal successors, (93), 52 states have internal predecessors, (93), 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-04-29 11:20:03,232 INFO L278 IsEmpty]: Start isEmpty. Operand 129 states and 139 transitions. [2025-04-29 11:20:03,233 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-29 11:20:03,233 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:03,233 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] [2025-04-29 11:20:03,242 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2025-04-29 11:20:03,433 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:03,433 INFO L403 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:20:03,434 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:03,434 INFO L85 PathProgramCache]: Analyzing trace with hash 1896063874, now seen corresponding path program 1 times [2025-04-29 11:20:03,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:03,434 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1310287585] [2025-04-29 11:20:03,434 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:03,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:03,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:20:03,454 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:20:03,454 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:03,454 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:03,727 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 14 proven. 7 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-04-29 11:20:03,728 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:03,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1310287585] [2025-04-29 11:20:03,728 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1310287585] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:03,728 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1181893441] [2025-04-29 11:20:03,728 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:03,728 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:03,728 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:03,730 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:20:03,731 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2025-04-29 11:20:03,871 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:20:03,913 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:20:03,913 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:03,913 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:03,915 INFO L256 TraceCheckSpWp]: Trace formula consists of 502 conjuncts, 47 conjuncts are in the unsatisfiable core [2025-04-29 11:20:03,917 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:03,921 INFO L354 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-04-29 11:20:03,925 INFO L354 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-04-29 11:20:04,088 INFO L354 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-04-29 11:20:04,090 INFO L354 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-04-29 11:20:04,118 WARN L871 $PredicateComparison]: unable to prove that (and (exists ((|v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8| Int) (|v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_16| Int)) (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_main_~#s~0#1.base_BEFORE_CALL_8|) |v_ULTIMATE.start_main_~#s~0#1.offset_BEFORE_CALL_16|) 0)) (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|))))) is different from true [2025-04-29 11:20:04,154 INFO L325 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2025-04-29 11:20:04,154 INFO L354 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-04-29 11:20:04,157 INFO L354 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-04-29 11:20:04,229 INFO L354 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-04-29 11:20:04,258 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 23 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 7 not checked. [2025-04-29 11:20:04,259 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:20:04,394 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1181893441] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:04,394 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:20:04,394 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 13] total 26 [2025-04-29 11:20:04,394 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [785484335] [2025-04-29 11:20:04,394 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:20:04,394 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 27 states [2025-04-29 11:20:04,395 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:04,395 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 27 interpolants. [2025-04-29 11:20:04,395 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=81, Invalid=792, Unknown=1, NotChecked=56, Total=930 [2025-04-29 11:20:04,395 INFO L87 Difference]: Start difference. First operand 129 states and 139 transitions. Second operand has 27 states, 25 states have (on average 3.2) internal successors, (80), 24 states have internal predecessors, (80), 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-04-29 11:20:04,864 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:04,864 INFO L93 Difference]: Finished difference Result 153 states and 168 transitions. [2025-04-29 11:20:04,864 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2025-04-29 11:20:04,864 INFO L79 Accepts]: Start accepts. Automaton has has 27 states, 25 states have (on average 3.2) internal successors, (80), 24 states have internal predecessors, (80), 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 58 [2025-04-29 11:20:04,865 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:04,866 INFO L225 Difference]: With dead ends: 153 [2025-04-29 11:20:04,866 INFO L226 Difference]: Without dead ends: 153 [2025-04-29 11:20:04,867 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 98 GetRequests, 58 SyntacticMatches, 0 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 290 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=157, Invalid=1486, Unknown=1, NotChecked=78, Total=1722 [2025-04-29 11:20:04,867 INFO L437 NwaCegarLoop]: 40 mSDtfsCounter, 114 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 877 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 1003 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 877 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 118 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:04,867 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 553 Invalid, 1003 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 877 Invalid, 0 Unknown, 118 Unchecked, 0.3s Time] [2025-04-29 11:20:04,867 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 153 states. [2025-04-29 11:20:04,873 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 153 to 134. [2025-04-29 11:20:04,875 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 107 states have (on average 1.2990654205607477) internal successors, (139), 125 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-04-29 11:20:04,876 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 149 transitions. [2025-04-29 11:20:04,876 INFO L79 Accepts]: Start accepts. Automaton has 134 states and 149 transitions. Word has length 58 [2025-04-29 11:20:04,876 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:04,876 INFO L485 AbstractCegarLoop]: Abstraction has 134 states and 149 transitions. [2025-04-29 11:20:04,876 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 27 states, 25 states have (on average 3.2) internal successors, (80), 24 states have internal predecessors, (80), 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-04-29 11:20:04,877 INFO L278 IsEmpty]: Start isEmpty. Operand 134 states and 149 transitions. [2025-04-29 11:20:04,877 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 59 [2025-04-29 11:20:04,877 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:04,877 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] [2025-04-29 11:20:04,887 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2025-04-29 11:20:05,081 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2025-04-29 11:20:05,081 INFO L403 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:20:05,081 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:05,081 INFO L85 PathProgramCache]: Analyzing trace with hash 1896063873, now seen corresponding path program 1 times [2025-04-29 11:20:05,081 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:05,081 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [814186430] [2025-04-29 11:20:05,081 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:05,081 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:05,096 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 58 statements into 1 equivalence classes. [2025-04-29 11:20:05,101 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 58 of 58 statements. [2025-04-29 11:20:05,101 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:05,101 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:05,203 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-29 11:20:05,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:05,204 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [814186430] [2025-04-29 11:20:05,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [814186430] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:20:05,204 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:20:05,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [8] imperfect sequences [] total 8 [2025-04-29 11:20:05,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1559312481] [2025-04-29 11:20:05,204 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:20:05,204 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-04-29 11:20:05,204 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:05,205 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-04-29 11:20:05,205 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=55, Unknown=0, NotChecked=0, Total=72 [2025-04-29 11:20:05,205 INFO L87 Difference]: Start difference. First operand 134 states and 149 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 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-04-29 11:20:05,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:05,322 INFO L93 Difference]: Finished difference Result 147 states and 159 transitions. [2025-04-29 11:20:05,323 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2025-04-29 11:20:05,323 INFO L79 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 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 58 [2025-04-29 11:20:05,323 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:05,323 INFO L225 Difference]: With dead ends: 147 [2025-04-29 11:20:05,324 INFO L226 Difference]: Without dead ends: 147 [2025-04-29 11:20:05,324 INFO L436 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-04-29 11:20:05,325 INFO L437 NwaCegarLoop]: 52 mSDtfsCounter, 58 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 300 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:05,325 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 300 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-04-29 11:20:05,325 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2025-04-29 11:20:05,327 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 130. [2025-04-29 11:20:05,327 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.2242990654205608) internal successors, (131), 121 states have internal predecessors, (131), 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-04-29 11:20:05,327 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 141 transitions. [2025-04-29 11:20:05,328 INFO L79 Accepts]: Start accepts. Automaton has 130 states and 141 transitions. Word has length 58 [2025-04-29 11:20:05,328 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:05,328 INFO L485 AbstractCegarLoop]: Abstraction has 130 states and 141 transitions. [2025-04-29 11:20:05,328 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 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-04-29 11:20:05,328 INFO L278 IsEmpty]: Start isEmpty. Operand 130 states and 141 transitions. [2025-04-29 11:20:05,328 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 65 [2025-04-29 11:20:05,328 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:05,328 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, 1] [2025-04-29 11:20:05,329 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21 [2025-04-29 11:20:05,329 INFO L403 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:20:05,329 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:05,329 INFO L85 PathProgramCache]: Analyzing trace with hash 1099682667, now seen corresponding path program 1 times [2025-04-29 11:20:05,329 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:05,329 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1597595866] [2025-04-29 11:20:05,329 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:05,329 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:05,344 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 64 statements into 1 equivalence classes. [2025-04-29 11:20:05,349 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 64 of 64 statements. [2025-04-29 11:20:05,350 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:05,350 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:05,412 INFO L134 CoverageAnalysis]: Checked inductivity of 33 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 33 trivial. 0 not checked. [2025-04-29 11:20:05,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:05,412 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1597595866] [2025-04-29 11:20:05,412 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1597595866] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:20:05,412 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:20:05,412 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-04-29 11:20:05,412 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [626092393] [2025-04-29 11:20:05,412 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:20:05,413 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-04-29 11:20:05,413 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:05,413 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-04-29 11:20:05,413 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2025-04-29 11:20:05,413 INFO L87 Difference]: Start difference. First operand 130 states and 141 transitions. Second operand has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-04-29 11:20:05,424 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:05,424 INFO L93 Difference]: Finished difference Result 133 states and 143 transitions. [2025-04-29 11:20:05,424 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-04-29 11:20:05,425 INFO L79 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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 64 [2025-04-29 11:20:05,425 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:05,425 INFO L225 Difference]: With dead ends: 133 [2025-04-29 11:20:05,425 INFO L226 Difference]: Without dead ends: 132 [2025-04-29 11:20:05,425 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 3 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-04-29 11:20:05,426 INFO L437 NwaCegarLoop]: 74 mSDtfsCounter, 31 mSDsluCounter, 93 mSDsCounter, 0 mSdLazyCounter, 10 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 31 SdHoareTripleChecker+Valid, 167 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-04-29 11:20:05,426 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [31 Valid, 167 Invalid, 10 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 10 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:20:05,426 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-04-29 11:20:05,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 130. [2025-04-29 11:20:05,431 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 107 states have (on average 1.2149532710280373) internal successors, (130), 121 states have internal predecessors, (130), 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-04-29 11:20:05,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 140 transitions. [2025-04-29 11:20:05,431 INFO L79 Accepts]: Start accepts. Automaton has 130 states and 140 transitions. Word has length 64 [2025-04-29 11:20:05,431 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:05,431 INFO L485 AbstractCegarLoop]: Abstraction has 130 states and 140 transitions. [2025-04-29 11:20:05,431 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 9.75) internal successors, (39), 4 states have internal predecessors, (39), 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-04-29 11:20:05,432 INFO L278 IsEmpty]: Start isEmpty. Operand 130 states and 140 transitions. [2025-04-29 11:20:05,432 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 67 [2025-04-29 11:20:05,432 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:05,432 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, 1, 1, 1] [2025-04-29 11:20:05,432 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2025-04-29 11:20:05,432 INFO L403 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:20:05,432 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:05,433 INFO L85 PathProgramCache]: Analyzing trace with hash -1113660842, now seen corresponding path program 1 times [2025-04-29 11:20:05,433 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:05,433 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1440285770] [2025-04-29 11:20:05,433 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:05,433 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:05,448 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:20:05,459 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:20:05,459 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:05,459 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:06,229 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 17 proven. 16 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:20:06,229 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:06,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1440285770] [2025-04-29 11:20:06,230 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1440285770] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:06,230 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [530290409] [2025-04-29 11:20:06,230 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:06,230 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:06,230 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:06,232 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:20:06,234 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2025-04-29 11:20:06,369 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 66 statements into 1 equivalence classes. [2025-04-29 11:20:06,412 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 66 of 66 statements. [2025-04-29 11:20:06,412 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:06,413 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:06,415 INFO L256 TraceCheckSpWp]: Trace formula consists of 542 conjuncts, 81 conjuncts are in the unsatisfiable core [2025-04-29 11:20:06,417 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:06,419 INFO L354 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-04-29 11:20:06,551 INFO L325 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-04-29 11:20:06,551 INFO L354 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-04-29 11:20:06,611 INFO L354 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-04-29 11:20:06,645 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:20:06,645 INFO L354 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-04-29 11:20:06,753 INFO L354 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-04-29 11:20:06,755 INFO L354 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-04-29 11:20:06,855 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:20:06,856 INFO L354 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-04-29 11:20:06,873 INFO L325 Elim1Store]: treesize reduction 90, result has 37.9 percent of original size [2025-04-29 11:20:06,873 INFO L354 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 40 treesize of output 69 [2025-04-29 11:20:07,028 INFO L325 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2025-04-29 11:20:07,028 INFO L354 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-04-29 11:20:07,132 INFO L325 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-04-29 11:20:07,132 INFO L354 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-04-29 11:20:07,156 INFO L354 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-04-29 11:20:07,299 INFO L354 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-04-29 11:20:07,303 INFO L354 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-04-29 11:20:07,552 INFO L354 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-04-29 11:20:07,713 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 33 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:20:07,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:20:08,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [530290409] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:08,197 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:20:08,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [29, 28] total 54 [2025-04-29 11:20:08,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [863515033] [2025-04-29 11:20:08,197 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:20:08,197 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2025-04-29 11:20:08,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:08,198 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2025-04-29 11:20:08,198 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=3651, Unknown=54, NotChecked=0, Total=3906 [2025-04-29 11:20:08,199 INFO L87 Difference]: Start difference. First operand 130 states and 140 transitions. Second operand has 54 states, 52 states have (on average 2.25) internal successors, (117), 47 states have internal predecessors, (117), 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-04-29 11:20:09,855 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:09,855 INFO L93 Difference]: Finished difference Result 132 states and 141 transitions. [2025-04-29 11:20:09,855 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 33 states. [2025-04-29 11:20:09,856 INFO L79 Accepts]: Start accepts. Automaton has has 54 states, 52 states have (on average 2.25) internal successors, (117), 47 states have internal predecessors, (117), 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 66 [2025-04-29 11:20:09,856 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:09,856 INFO L225 Difference]: With dead ends: 132 [2025-04-29 11:20:09,856 INFO L226 Difference]: Without dead ends: 132 [2025-04-29 11:20:09,857 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 151 GetRequests, 63 SyntacticMatches, 0 SemanticMatches, 88 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2016 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=491, Invalid=7464, Unknown=55, NotChecked=0, Total=8010 [2025-04-29 11:20:09,858 INFO L437 NwaCegarLoop]: 41 mSDtfsCounter, 62 mSDsluCounter, 1135 mSDsCounter, 0 mSdLazyCounter, 2188 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 1176 SdHoareTripleChecker+Invalid, 2201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 2188 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:09,858 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 1176 Invalid, 2201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 2188 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2025-04-29 11:20:09,858 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2025-04-29 11:20:09,865 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 132. [2025-04-29 11:20:09,865 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 132 states, 109 states have (on average 1.201834862385321) internal successors, (131), 123 states have internal predecessors, (131), 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-04-29 11:20:09,865 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 132 states to 132 states and 141 transitions. [2025-04-29 11:20:09,866 INFO L79 Accepts]: Start accepts. Automaton has 132 states and 141 transitions. Word has length 66 [2025-04-29 11:20:09,866 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:09,866 INFO L485 AbstractCegarLoop]: Abstraction has 132 states and 141 transitions. [2025-04-29 11:20:09,866 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 52 states have (on average 2.25) internal successors, (117), 47 states have internal predecessors, (117), 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-04-29 11:20:09,866 INFO L278 IsEmpty]: Start isEmpty. Operand 132 states and 141 transitions. [2025-04-29 11:20:09,866 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 71 [2025-04-29 11:20:09,866 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:09,866 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, 1, 1, 1] [2025-04-29 11:20:09,875 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2025-04-29 11:20:10,069 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:10,069 INFO L403 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:20:10,069 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:10,069 INFO L85 PathProgramCache]: Analyzing trace with hash -1991543121, now seen corresponding path program 1 times [2025-04-29 11:20:10,070 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:10,070 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [820228506] [2025-04-29 11:20:10,070 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:10,070 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:10,082 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-29 11:20:10,102 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-29 11:20:10,103 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:10,103 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:12,475 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 5 proven. 31 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-04-29 11:20:12,475 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:12,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [820228506] [2025-04-29 11:20:12,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [820228506] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:12,475 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [130820221] [2025-04-29 11:20:12,475 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:12,475 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:12,475 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:12,477 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:20:12,478 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2025-04-29 11:20:12,622 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 70 statements into 1 equivalence classes. [2025-04-29 11:20:12,668 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 70 of 70 statements. [2025-04-29 11:20:12,668 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:12,668 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:12,671 INFO L256 TraceCheckSpWp]: Trace formula consists of 563 conjuncts, 125 conjuncts are in the unsatisfiable core [2025-04-29 11:20:12,678 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:12,683 INFO L354 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-04-29 11:20:12,686 INFO L354 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-04-29 11:20:13,060 INFO L325 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-04-29 11:20:13,061 INFO L354 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-04-29 11:20:13,063 INFO L354 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-04-29 11:20:13,213 INFO L354 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-04-29 11:20:13,220 INFO L354 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-04-29 11:20:13,308 INFO L325 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-04-29 11:20:13,308 INFO L354 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-04-29 11:20:13,317 INFO L354 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-04-29 11:20:13,546 INFO L354 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-04-29 11:20:13,550 INFO L354 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-04-29 11:20:13,552 INFO L354 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-04-29 11:20:13,554 INFO L354 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-04-29 11:20:13,800 INFO L325 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2025-04-29 11:20:13,800 INFO L354 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-04-29 11:20:13,802 INFO L354 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-04-29 11:20:13,810 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:20:13,810 INFO L354 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-04-29 11:20:13,826 INFO L325 Elim1Store]: treesize reduction 41, result has 47.4 percent of original size [2025-04-29 11:20:13,826 INFO L354 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-04-29 11:20:13,844 INFO L325 Elim1Store]: treesize reduction 8, result has 77.1 percent of original size [2025-04-29 11:20:13,845 INFO L354 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-04-29 11:20:14,219 INFO L325 Elim1Store]: treesize reduction 35, result has 48.5 percent of original size [2025-04-29 11:20:14,220 INFO L354 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-04-29 11:20:14,230 INFO L325 Elim1Store]: treesize reduction 71, result has 19.3 percent of original size [2025-04-29 11:20:14,230 INFO L354 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-04-29 11:20:14,375 INFO L325 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-04-29 11:20:14,375 INFO L354 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-04-29 11:20:14,391 INFO L325 Elim1Store]: treesize reduction 25, result has 26.5 percent of original size [2025-04-29 11:20:14,392 INFO L354 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-04-29 11:20:14,442 INFO L354 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-04-29 11:20:14,462 INFO L354 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-04-29 11:20:14,465 WARN L195 Elim1Store]: Array PQE input equivalent to false [2025-04-29 11:20:14,633 INFO L354 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 172 treesize of output 124 [2025-04-29 11:20:14,636 INFO L354 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 128 treesize of output 96 [2025-04-29 11:20:14,978 INFO L354 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-04-29 11:20:14,981 INFO L354 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 9 treesize of output 3 [2025-04-29 11:20:15,178 INFO L134 CoverageAnalysis]: Checked inductivity of 36 backedges. 14 proven. 21 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-04-29 11:20:15,178 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-04-29 11:20:16,668 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [130820221] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:16,668 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2025-04-29 11:20:16,668 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [38, 32] total 67 [2025-04-29 11:20:16,668 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [893532014] [2025-04-29 11:20:16,668 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2025-04-29 11:20:16,669 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 68 states [2025-04-29 11:20:16,669 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:16,669 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 68 interpolants. [2025-04-29 11:20:16,670 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=249, Invalid=5912, Unknown=1, NotChecked=0, Total=6162 [2025-04-29 11:20:16,670 INFO L87 Difference]: Start difference. First operand 132 states and 141 transitions. Second operand has 68 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 59 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:20:22,015 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:22,015 INFO L93 Difference]: Finished difference Result 184 states and 197 transitions. [2025-04-29 11:20:22,016 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 46 states. [2025-04-29 11:20:22,016 INFO L79 Accepts]: Start accepts. Automaton has has 68 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 59 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) Word has length 70 [2025-04-29 11:20:22,016 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:22,017 INFO L225 Difference]: With dead ends: 184 [2025-04-29 11:20:22,017 INFO L226 Difference]: Without dead ends: 184 [2025-04-29 11:20:22,019 INFO L436 NwaCegarLoop]: 0 DeclaredPredicates, 177 GetRequests, 60 SyntacticMatches, 0 SemanticMatches, 117 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2625 ImplicationChecksByTransitivity, 7.1s TimeCoverageRelationStatistics Valid=791, Invalid=13250, Unknown=1, NotChecked=0, Total=14042 [2025-04-29 11:20:22,019 INFO L437 NwaCegarLoop]: 30 mSDtfsCounter, 342 mSDsluCounter, 1212 mSDsCounter, 0 mSdLazyCounter, 4035 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 342 SdHoareTripleChecker+Valid, 1242 SdHoareTripleChecker+Invalid, 4064 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 4035 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.1s IncrementalHoareTripleChecker+Time [2025-04-29 11:20:22,019 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [342 Valid, 1242 Invalid, 4064 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 4035 Invalid, 0 Unknown, 0 Unchecked, 2.1s Time] [2025-04-29 11:20:22,020 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2025-04-29 11:20:22,022 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 136. [2025-04-29 11:20:22,022 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-04-29 11:20:22,022 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 145 transitions. [2025-04-29 11:20:22,022 INFO L79 Accepts]: Start accepts. Automaton has 136 states and 145 transitions. Word has length 70 [2025-04-29 11:20:22,022 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:22,022 INFO L485 AbstractCegarLoop]: Abstraction has 136 states and 145 transitions. [2025-04-29 11:20:22,023 INFO L486 AbstractCegarLoop]: INTERPOLANT automaton has has 68 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 59 states have internal predecessors, (127), 6 states have call successors, (6), 4 states have call predecessors, (6), 6 states have return successors, (6), 6 states have call predecessors, (6), 6 states have call successors, (6) [2025-04-29 11:20:22,023 INFO L278 IsEmpty]: Start isEmpty. Operand 136 states and 145 transitions. [2025-04-29 11:20:22,023 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 73 [2025-04-29 11:20:22,023 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:22,023 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, 1, 1, 1, 1, 1] [2025-04-29 11:20:22,030 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Ended with exit code 0 [2025-04-29 11:20:22,223 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24,16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:22,224 INFO L403 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:20:22,224 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:22,224 INFO L85 PathProgramCache]: Analyzing trace with hash 1751175674, now seen corresponding path program 1 times [2025-04-29 11:20:22,224 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:22,225 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [731939091] [2025-04-29 11:20:22,225 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-04-29 11:20:22,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:22,238 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 72 statements into 1 equivalence classes. [2025-04-29 11:20:22,243 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 72 of 72 statements. [2025-04-29 11:20:22,243 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-04-29 11:20:22,243 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:22,293 INFO L134 CoverageAnalysis]: Checked inductivity of 35 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 35 trivial. 0 not checked. [2025-04-29 11:20:22,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:22,293 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [731939091] [2025-04-29 11:20:22,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [731939091] provided 1 perfect and 0 imperfect interpolant sequences [2025-04-29 11:20:22,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-04-29 11:20:22,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-04-29 11:20:22,293 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1381136267] [2025-04-29 11:20:22,293 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-04-29 11:20:22,294 INFO L562 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-04-29 11:20:22,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-04-29 11:20:22,294 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-04-29 11:20:22,294 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-04-29 11:20:22,294 INFO L87 Difference]: Start difference. First operand 136 states and 145 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-04-29 11:20:22,331 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-04-29 11:20:22,331 INFO L93 Difference]: Finished difference Result 136 states and 144 transitions. [2025-04-29 11:20:22,331 INFO L140 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-04-29 11:20:22,331 INFO L79 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 72 [2025-04-29 11:20:22,332 INFO L85 Accepts]: Finished accepts. some prefix is accepted. [2025-04-29 11:20:22,332 INFO L225 Difference]: With dead ends: 136 [2025-04-29 11:20:22,332 INFO L226 Difference]: Without dead ends: 136 [2025-04-29 11:20:22,332 INFO L436 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-04-29 11:20:22,332 INFO L437 NwaCegarLoop]: 71 mSDtfsCounter, 4 mSDsluCounter, 170 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 241 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-04-29 11:20:22,332 INFO L438 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 241 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-04-29 11:20:22,333 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2025-04-29 11:20:22,334 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2025-04-29 11:20:22,334 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 113 states have (on average 1.1858407079646018) internal successors, (134), 127 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-04-29 11:20:22,335 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 144 transitions. [2025-04-29 11:20:22,335 INFO L79 Accepts]: Start accepts. Automaton has 136 states and 144 transitions. Word has length 72 [2025-04-29 11:20:22,335 INFO L85 Accepts]: Finished accepts. word is rejected. [2025-04-29 11:20:22,335 INFO L485 AbstractCegarLoop]: Abstraction has 136 states and 144 transitions. [2025-04-29 11:20:22,335 INFO L486 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-04-29 11:20:22,335 INFO L278 IsEmpty]: Start isEmpty. Operand 136 states and 144 transitions. [2025-04-29 11:20:22,335 INFO L284 IsEmpty]: Finished isEmpty. Found accepting run of length 75 [2025-04-29 11:20:22,336 INFO L210 NwaCegarLoop]: Found error trace [2025-04-29 11:20:22,336 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 4, 3, 3, 3, 3, 3, 3, 3, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-04-29 11:20:22,336 WARN L466 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2025-04-29 11:20:22,336 INFO L403 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 43 more)] === [2025-04-29 11:20:22,336 INFO L155 PredicateUnifier]: Initialized classic predicate unifier [2025-04-29 11:20:22,336 INFO L85 PathProgramCache]: Analyzing trace with hash -1638742947, now seen corresponding path program 3 times [2025-04-29 11:20:22,336 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-04-29 11:20:22,336 INFO L324 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [429073172] [2025-04-29 11:20:22,336 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:20:22,336 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-04-29 11:20:22,352 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 74 statements into 4 equivalence classes. [2025-04-29 11:20:22,378 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 59 of 74 statements. [2025-04-29 11:20:22,378 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:20:22,378 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:24,154 INFO L134 CoverageAnalysis]: Checked inductivity of 79 backedges. 56 proven. 20 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2025-04-29 11:20:24,155 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-04-29 11:20:24,155 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [429073172] [2025-04-29 11:20:24,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [429073172] provided 0 perfect and 1 imperfect interpolant sequences [2025-04-29 11:20:24,155 INFO L324 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1816872854] [2025-04-29 11:20:24,155 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2025-04-29 11:20:24,155 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-04-29 11:20:24,156 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-04-29 11:20:24,157 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-04-29 11:20:24,160 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2025-04-29 11:20:24,348 INFO L108 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 partitioned 74 statements into 4 equivalence classes. [2025-04-29 11:20:24,535 INFO L111 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) and asserted 59 of 74 statements. [2025-04-29 11:20:24,536 INFO L114 AnnotateAndAsserter]: Assert order OUTSIDE_LOOP_FIRST2 issued 3 check-sat command(s) [2025-04-29 11:20:24,536 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-04-29 11:20:24,539 INFO L256 TraceCheckSpWp]: Trace formula consists of 497 conjuncts, 127 conjuncts are in the unsatisfiable core [2025-04-29 11:20:24,543 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-04-29 11:20:24,715 INFO L354 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-04-29 11:20:24,762 INFO L325 Elim1Store]: treesize reduction 29, result has 19.4 percent of original size [2025-04-29 11:20:24,762 INFO L354 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-04-29 11:20:24,980 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_#t~ret1#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret1#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_#t~ret1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_#t~ret1#1.base|) 0) (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (let ((.cse4 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3))) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_39| .cse4) 1) (= |c_ULTIMATE.start_dll_create_#t~ret1#1.base| .cse3)))) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))))) is different from false [2025-04-29 11:20:24,983 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_#t~ret1#1.offset| 0) (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#t~ret1#1.base|) 1) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (or (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_#t~ret1#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse2 (select |c_#valid| .cse2)))) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_#t~ret1#1.base|) 0) (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (let ((.cse4 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3))) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_39| .cse4) 1) (= |c_ULTIMATE.start_dll_create_#t~ret1#1.base| .cse3)))) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1))))) is different from true [2025-04-29 11:20:25,026 WARN L849 $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 (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse2 (select |c_#valid| .cse2)))) (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (let ((.cse4 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3))) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_39| .cse4) 1) (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) is different from false [2025-04-29 11:20:25,029 WARN L871 $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 (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse2 (select |c_#valid| .cse2)))) (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (let ((.cse4 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |c_#memory_$Pointer$#1.base|))) (and (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3 (select |c_#memory_$Pointer$#1.base| .cse3))) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse4) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_39| .cse4) 1) (= .cse3 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|)))) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))))) is different from true [2025-04-29 11:20:25,061 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:20:25,067 INFO L325 Elim1Store]: treesize reduction 25, result has 16.7 percent of original size [2025-04-29 11:20:25,068 INFO L354 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-04-29 11:20:25,083 WARN L849 $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 (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int)))) (and (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse2 (select |c_#valid| .cse2)))) (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (let ((.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse4 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_39| .cse3) 1) (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse4 (select |v_#memory_$Pointer$#1.base_201| .cse4)) |v_#memory_$Pointer$#1.base_201|)))) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_201| |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|))))))) is different from false [2025-04-29 11:20:25,085 WARN L871 $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 (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)))) (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int)))) (and (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse2 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse2 (select |c_#valid| .cse2)))) (exists ((|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (let ((.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse4 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_39| .cse3) 1) (= .cse4 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse4 (select |v_#memory_$Pointer$#1.base_201| .cse4)) |v_#memory_$Pointer$#1.base_201|)))) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_201| |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|))))))) is different from true [2025-04-29 11:20:25,101 INFO L354 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-04-29 11:20:25,113 INFO L354 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-04-29 11:20:25,138 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:20:25,145 INFO L325 Elim1Store]: treesize reduction 45, result has 16.7 percent of original size [2025-04-29 11:20:25,145 INFO L354 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-04-29 11:20:25,170 WARN L849 $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 ((.cse4 (= (select .cse3 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse0 (select |c_#valid| .cse0)))) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_201| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse2 (select |v_#memory_$Pointer$#1.base_201| .cse2)) |v_#memory_$Pointer$#1.base_201|)))) .cse4) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_39| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) .cse4))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) is different from false [2025-04-29 11:20:25,173 WARN L871 $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 ((.cse4 (= (select .cse3 4) |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (or (and (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4)) (.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse0 (select |c_#valid| .cse0)))) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= |c_#memory_$Pointer$#1.base| (store |v_#memory_$Pointer$#1.base_201| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse3)) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse2 (select |v_#memory_$Pointer$#1.base_201| .cse2)) |v_#memory_$Pointer$#1.base_201|)))) .cse4) (let ((.cse6 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4))) (and (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse5 (select |c_#valid| .cse5)))) (= (select |v_#valid_BEFORE_CALL_39| .cse6) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) |c_ULTIMATE.start_dll_create_~head~0#1.base|)) .cse4))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) is different from true [2025-04-29 11:20:25,265 INFO L325 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-04-29 11:20:25,265 INFO L354 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-04-29 11:20:25,272 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:20:25,284 INFO L325 Elim1Store]: treesize reduction 47, result has 26.6 percent of original size [2025-04-29 11:20:25,285 INFO L354 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-04-29 11:20:25,333 INFO L354 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-04-29 11:20:25,362 INFO L354 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-04-29 11:20:25,427 WARN L849 $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 ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse1 (select .cse4 4))) (let ((.cse5 (= (select |c_#valid| .cse1) 1))) (or (and (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse1) 4)) (.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= .cse1 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))) (= (select |v_#valid_BEFORE_CALL_39| .cse3) 1) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_201| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) .cse1 (store (select |v_#memory_$Pointer$#1.base_201| .cse1) 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse2 (select |v_#memory_$Pointer$#1.base_201| .cse2)) |v_#memory_$Pointer$#1.base_201|)))) .cse5) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse7 (select .cse8 4))) (and .cse5 (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse6 (select |c_#valid| .cse6)))) (= (select |v_#valid_BEFORE_CALL_39| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= (select .cse8 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (or (= .cse7 .cse1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) .cse1)))))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) is different from false [2025-04-29 11:20:25,430 WARN L871 $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 ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (let ((.cse1 (select .cse4 4))) (let ((.cse5 (= (select |c_#valid| .cse1) 1))) (or (and (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse1) 4)) (.cse2 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse0 (select |c_#valid| .cse0)))) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= .cse2 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (= .cse1 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))) (= (select |v_#valid_BEFORE_CALL_39| .cse3) 1) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_201| |c_ULTIMATE.start_dll_create_~new_head~0#1.base| .cse4) .cse1 (store (select |v_#memory_$Pointer$#1.base_201| .cse1) 8 |c_ULTIMATE.start_dll_create_~new_head~0#1.base|))) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse2 (select |v_#memory_$Pointer$#1.base_201| .cse2)) |v_#memory_$Pointer$#1.base_201|)))) .cse5) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse7 (select .cse8 4))) (and .cse5 (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse6 (select |c_#valid| .cse6)))) (= (select |v_#valid_BEFORE_CALL_39| .cse7) 1) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 0))) (= (select .cse8 8) |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) (or (= .cse7 .cse1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) .cse1)))))))))) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~new_head~0#1.base|) 4) 0)) is different from true [2025-04-29 11:20:25,495 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (select .cse8 4))) (let ((.cse0 (= (select |c_#valid| .cse2) 1))) (or (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse3 (select .cse1 4))) (and .cse0 (= (select .cse1 8) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (or (= .cse2 .cse3) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))))) (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_39| .cse3) 1)))))) (and .cse0 (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse7 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse2) 4)) (.cse6 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse5 (select |c_#valid| .cse5)))) (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_39| .cse7) 1) (= (store (store |v_#memory_$Pointer$#1.base_201| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse8) .cse2 (store (select |v_#memory_$Pointer$#1.base_201| .cse2) 8 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) |c_#memory_$Pointer$#1.base|) (= (select |v_#valid_BEFORE_CALL_39| .cse2) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) .cse2) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse6 (select |v_#memory_$Pointer$#1.base_201| .cse6)) |v_#memory_$Pointer$#1.base_201|))))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from false [2025-04-29 11:20:25,498 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_ULTIMATE.start_dll_create_~head~0#1.offset| 0) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_~head~0#1.base|))) (let ((.cse2 (select .cse8 4))) (let ((.cse0 (= (select |c_#valid| .cse2) 1))) (or (let ((.cse1 (select |c_#memory_$Pointer$#1.base| .cse2))) (let ((.cse3 (select .cse1 4))) (and .cse0 (= (select .cse1 8) |c_ULTIMATE.start_dll_create_~head~0#1.base|) (or (= .cse2 .cse3) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= .cse2 (select (select |c_#memory_$Pointer$#1.base| .cse3) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))))) (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse4 (select |c_#valid| .cse4)))) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_39| .cse3) 1)))))) (and .cse0 (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse7 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse2) 4)) (.cse6 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= |c_#valid| (let ((.cse5 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse5 (select |c_#valid| .cse5)))) (= .cse6 |c_ULTIMATE.start_dll_create_~head~0#1.base|) (= (select |v_#valid_BEFORE_CALL_39| .cse7) 1) (= (store (store |v_#memory_$Pointer$#1.base_201| |c_ULTIMATE.start_dll_create_~head~0#1.base| .cse8) .cse2 (store (select |v_#memory_$Pointer$#1.base_201| .cse2) 8 |c_ULTIMATE.start_dll_create_~head~0#1.base|)) |c_#memory_$Pointer$#1.base|) (= (select |v_#valid_BEFORE_CALL_39| .cse2) 1) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse7) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) .cse2) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 0) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse6 (select |v_#memory_$Pointer$#1.base_201| .cse6)) |v_#memory_$Pointer$#1.base_201|))))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_create_~head~0#1.base|) 1)) is different from true [2025-04-29 11:20:25,564 WARN L849 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse1 (select .cse3 4))) (let ((.cse5 (= (select |c_#valid| .cse1) 1))) (or (and (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse2 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse1) 4)) (.cse4 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse0 (select |c_#valid| .cse0)))) (= .cse1 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_201| |c_ULTIMATE.start_dll_create_#res#1.base| .cse3) .cse1 (store (select |v_#memory_$Pointer$#1.base_201| .cse1) 8 |c_ULTIMATE.start_dll_create_#res#1.base|))) (= (select |v_#valid_BEFORE_CALL_39| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= .cse4 |c_ULTIMATE.start_dll_create_#res#1.base|) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse4 (select |v_#memory_$Pointer$#1.base_201| .cse4)) |v_#memory_$Pointer$#1.base_201|)))) .cse5) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse6 (select .cse8 4))) (and (or (= .cse6 .cse1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))))) (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse7 (select |c_#valid| .cse7)))) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_39| .cse6) 1))) (= (select .cse8 8) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0)) is different from false [2025-04-29 11:20:25,567 WARN L871 $PredicateComparison]: unable to prove that (and (= (select |c_#valid| |c_ULTIMATE.start_dll_create_#res#1.base|) 1) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_create_#res#1.base|) 4) 0) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_create_#res#1.base|))) (let ((.cse1 (select .cse3 4))) (let ((.cse5 (= (select |c_#valid| .cse1) 1))) (or (and (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse2 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse1) 4)) (.cse4 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= |c_#valid| (let ((.cse0 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse0 (select |c_#valid| .cse0)))) (= .cse1 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse2) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_201| |c_ULTIMATE.start_dll_create_#res#1.base| .cse3) .cse1 (store (select |v_#memory_$Pointer$#1.base_201| .cse1) 8 |c_ULTIMATE.start_dll_create_#res#1.base|))) (= (select |v_#valid_BEFORE_CALL_39| .cse2) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= .cse4 |c_ULTIMATE.start_dll_create_#res#1.base|) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse4 (select |v_#memory_$Pointer$#1.base_201| .cse4)) |v_#memory_$Pointer$#1.base_201|)))) .cse5) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse6 (select .cse8 4))) (and (or (= .cse6 .cse1) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= .cse1 (select (select |c_#memory_$Pointer$#1.base| .cse6) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))))) (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse7 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse7 (select |c_#valid| .cse7)))) (= (select |v_#valid_BEFORE_CALL_39| |c_ULTIMATE.start_dll_create_#res#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_39| .cse6) 1))) (= (select .cse8 8) |c_ULTIMATE.start_dll_create_#res#1.base|) .cse5))))))) (= |c_ULTIMATE.start_main_~#s~0#1.offset| 0) (= |c_ULTIMATE.start_dll_create_#res#1.offset| 0)) is different from true [2025-04-29 11:20:25,627 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_append_~head#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse3 (select .cse2 4))) (let ((.cse6 (= (select |c_#valid| .cse3) 1))) (or (and (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse5 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3) 4)) (.cse4 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_39| .cse0) 0) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_201| .cse0 .cse2) .cse3 (store (select |v_#memory_$Pointer$#1.base_201| .cse3) 8 .cse0))) (= .cse4 .cse0) (= .cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))) (= (select |v_#valid_BEFORE_CALL_39| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse5) 1) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse4 (select |v_#memory_$Pointer$#1.base_201| .cse4)) |v_#memory_$Pointer$#1.base_201|)))) .cse6) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse8 (select .cse7 4))) (and (= (select .cse7 8) .cse0) (or (= .cse3 .cse8) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))))) (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse9 (select |c_#valid| .cse9)))) (= (select |v_#valid_BEFORE_CALL_39| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_39| .cse8) 1))) .cse6))))))) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#0.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-04-29 11:20:25,629 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_append_~head#1.base|) 0))) (and (= (select (select |c_#memory_$Pointer$#1.offset| .cse0) 4) 0) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse3 (select .cse2 4))) (let ((.cse6 (= (select |c_#valid| .cse3) 1))) (or (and (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse5 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3) 4)) (.cse4 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= |c_#valid| (let ((.cse1 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse1 (select |c_#valid| .cse1)))) (= (select |v_#valid_BEFORE_CALL_39| .cse0) 0) (= |c_#memory_$Pointer$#1.base| (store (store |v_#memory_$Pointer$#1.base_201| .cse0 .cse2) .cse3 (store (select |v_#memory_$Pointer$#1.base_201| .cse3) 8 .cse0))) (= .cse4 .cse0) (= .cse3 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse5) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))) (= (select |v_#valid_BEFORE_CALL_39| .cse3) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse5) 1) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse4 (select |v_#memory_$Pointer$#1.base_201| .cse4)) |v_#memory_$Pointer$#1.base_201|)))) .cse6) (let ((.cse7 (select |c_#memory_$Pointer$#1.base| .cse3))) (let ((.cse8 (select .cse7 4))) (and (= (select .cse7 8) .cse0) (or (= .cse3 .cse8) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= .cse3 (select (select |c_#memory_$Pointer$#1.base| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))))) (exists ((|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= |c_#valid| (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_39| |c_#valid|))) (store |v_#valid_BEFORE_CALL_39| .cse9 (select |c_#valid| .cse9)))) (= (select |v_#valid_BEFORE_CALL_39| .cse0) 0) (= (select |v_#valid_BEFORE_CALL_39| .cse8) 1))) .cse6))))))) (= (select |c_#valid| .cse0) 1) (= (select (select |c_#memory_$Pointer$#0.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-04-29 11:20:25,665 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 3 [2025-04-29 11:20:25,689 INFO L325 Elim1Store]: treesize reduction 22, result has 61.4 percent of original size [2025-04-29 11:20:25,690 INFO L354 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 103 treesize of output 65 [2025-04-29 11:20:25,831 WARN L849 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse0 (select (select (store (store |v_#memory_$Pointer$#1.base_201| .cse2 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse2) 4))) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse0) 4)) (.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= .cse0 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))) (= .cse2 .cse3) (= (select |v_#valid_BEFORE_CALL_39| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse2) 0) (= (store (select |v_#memory_$Pointer$#1.base_201| .cse0) 8 .cse2) v_DerPreprocessor_27) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= .cse0 v_DerPreprocessor_25) (= |v_#valid_BEFORE_CALL_40| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse4 (select |v_#valid_BEFORE_CALL_40| .cse4)))) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3 (select |v_#memory_$Pointer$#1.base_201| .cse3)) |v_#memory_$Pointer$#1.base_201|))))) (= (select |v_#valid_BEFORE_CALL_40| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((v_arrayElimCell_159 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_159) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse5) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))))) (= (select |v_#valid_BEFORE_CALL_40| .cse5) 1) (exists ((v_arrayElimCell_161 Int)) (and (not (= .cse5 v_arrayElimCell_161)) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_161) 1))))))))) (= |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-04-29 11:20:25,834 WARN L871 $PredicateComparison]: unable to prove that (and (= |c_#valid| |c_old(#valid)|) (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse0 (select (select (store (store |v_#memory_$Pointer$#1.base_201| .cse2 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse2) 4))) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse0) 4)) (.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= .cse0 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))) (= .cse2 .cse3) (= (select |v_#valid_BEFORE_CALL_39| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse2) 0) (= (store (select |v_#memory_$Pointer$#1.base_201| .cse0) 8 .cse2) v_DerPreprocessor_27) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= .cse0 v_DerPreprocessor_25) (= |v_#valid_BEFORE_CALL_40| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse4 (select |v_#valid_BEFORE_CALL_40| .cse4)))) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3 (select |v_#memory_$Pointer$#1.base_201| .cse3)) |v_#memory_$Pointer$#1.base_201|))))) (= (select |v_#valid_BEFORE_CALL_40| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((v_arrayElimCell_159 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_159) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse5) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))))) (= (select |v_#valid_BEFORE_CALL_40| .cse5) 1) (exists ((v_arrayElimCell_161 Int)) (and (not (= .cse5 v_arrayElimCell_161)) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_161) 1))))))))) (= |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-04-29 11:20:25,922 WARN L849 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse0 (select (select (store (store |v_#memory_$Pointer$#1.base_201| .cse2 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse2) 4))) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse0) 4)) (.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= .cse0 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))) (= .cse2 .cse3) (= (select |v_#valid_BEFORE_CALL_39| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse2) 0) (= (store (select |v_#memory_$Pointer$#1.base_201| .cse0) 8 .cse2) v_DerPreprocessor_27) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= .cse0 v_DerPreprocessor_25) (= |v_#valid_BEFORE_CALL_40| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse4 (select |v_#valid_BEFORE_CALL_40| .cse4)))) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3 (select |v_#memory_$Pointer$#1.base_201| .cse3)) |v_#memory_$Pointer$#1.base_201|))))) (= (select |v_#valid_BEFORE_CALL_40| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((v_arrayElimCell_159 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_159) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse5) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))))) (= (select |v_#valid_BEFORE_CALL_40| .cse5) 1) (exists ((v_arrayElimCell_161 Int)) (and (not (= .cse5 v_arrayElimCell_161)) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_161) 1))))))))) (= |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-04-29 11:20:25,926 WARN L871 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse0 (select (select (store (store |v_#memory_$Pointer$#1.base_201| .cse2 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse2) 4))) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse0) 4)) (.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= .cse0 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))) (= .cse2 .cse3) (= (select |v_#valid_BEFORE_CALL_39| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse2) 0) (= (store (select |v_#memory_$Pointer$#1.base_201| .cse0) 8 .cse2) v_DerPreprocessor_27) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= .cse0 v_DerPreprocessor_25) (= |v_#valid_BEFORE_CALL_40| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse4 (select |v_#valid_BEFORE_CALL_40| .cse4)))) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3 (select |v_#memory_$Pointer$#1.base_201| .cse3)) |v_#memory_$Pointer$#1.base_201|))))) (= (select |v_#valid_BEFORE_CALL_40| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((v_arrayElimCell_159 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_159) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse5) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))))) (= (select |v_#valid_BEFORE_CALL_40| .cse5) 1) (exists ((v_arrayElimCell_161 Int)) (and (not (= .cse5 v_arrayElimCell_161)) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_161) 1))))))))) (= |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-04-29 11:20:26,070 WARN L849 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse0 (select (select (store (store |v_#memory_$Pointer$#1.base_201| .cse2 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse2) 4))) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse0) 4)) (.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= .cse0 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))) (= .cse2 .cse3) (= (select |v_#valid_BEFORE_CALL_39| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse2) 0) (= (store (select |v_#memory_$Pointer$#1.base_201| .cse0) 8 .cse2) v_DerPreprocessor_27) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= .cse0 v_DerPreprocessor_25) (= |v_#valid_BEFORE_CALL_40| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse4 (select |v_#valid_BEFORE_CALL_40| .cse4)))) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3 (select |v_#memory_$Pointer$#1.base_201| .cse3)) |v_#memory_$Pointer$#1.base_201|))))) (= (select |v_#valid_BEFORE_CALL_40| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((v_arrayElimCell_159 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_159) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse5) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))))) (= (select |v_#valid_BEFORE_CALL_40| .cse5) 1) (exists ((v_arrayElimCell_161 Int)) (and (not (= .cse5 v_arrayElimCell_161)) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_161) 1))))))))) (= |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-04-29 11:20:26,073 WARN L871 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse0 (select (select (store (store |v_#memory_$Pointer$#1.base_201| .cse2 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse2) 4))) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse0) 4)) (.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= .cse0 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))) (= .cse2 .cse3) (= (select |v_#valid_BEFORE_CALL_39| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse2) 0) (= (store (select |v_#memory_$Pointer$#1.base_201| .cse0) 8 .cse2) v_DerPreprocessor_27) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= .cse0 v_DerPreprocessor_25) (= |v_#valid_BEFORE_CALL_40| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse4 (select |v_#valid_BEFORE_CALL_40| .cse4)))) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3 (select |v_#memory_$Pointer$#1.base_201| .cse3)) |v_#memory_$Pointer$#1.base_201|))))) (= (select |v_#valid_BEFORE_CALL_40| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((v_arrayElimCell_159 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_159) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse5) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))))) (= (select |v_#valid_BEFORE_CALL_40| .cse5) 1) (exists ((v_arrayElimCell_161 Int)) (and (not (= .cse5 v_arrayElimCell_161)) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_161) 1))))))))) (= |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-04-29 11:20:26,218 WARN L849 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse0 (select (select (store (store |v_#memory_$Pointer$#1.base_201| .cse2 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse2) 4))) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse0) 4)) (.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= .cse0 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))) (= .cse2 .cse3) (= (select |v_#valid_BEFORE_CALL_39| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse2) 0) (= (store (select |v_#memory_$Pointer$#1.base_201| .cse0) 8 .cse2) v_DerPreprocessor_27) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= .cse0 v_DerPreprocessor_25) (= |v_#valid_BEFORE_CALL_40| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse4 (select |v_#valid_BEFORE_CALL_40| .cse4)))) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3 (select |v_#memory_$Pointer$#1.base_201| .cse3)) |v_#memory_$Pointer$#1.base_201|))))) (= (select |v_#valid_BEFORE_CALL_40| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((v_arrayElimCell_159 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_159) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse5) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))))) (= (select |v_#valid_BEFORE_CALL_40| .cse5) 1) (exists ((v_arrayElimCell_161 Int)) (and (not (= .cse5 v_arrayElimCell_161)) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_161) 1))))))))) (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-04-29 11:20:26,221 WARN L871 $PredicateComparison]: unable to prove that (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse0 (select (select (store (store |v_#memory_$Pointer$#1.base_201| .cse2 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse2) 4))) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse0) 4)) (.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= .cse0 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))) (= .cse2 .cse3) (= (select |v_#valid_BEFORE_CALL_39| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse2) 0) (= (store (select |v_#memory_$Pointer$#1.base_201| .cse0) 8 .cse2) v_DerPreprocessor_27) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= .cse0 v_DerPreprocessor_25) (= |v_#valid_BEFORE_CALL_40| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse4 (select |v_#valid_BEFORE_CALL_40| .cse4)))) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3 (select |v_#memory_$Pointer$#1.base_201| .cse3)) |v_#memory_$Pointer$#1.base_201|))))) (= (select |v_#valid_BEFORE_CALL_40| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((v_arrayElimCell_159 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_159) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse5) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))))) (= (select |v_#valid_BEFORE_CALL_40| .cse5) 1) (exists ((v_arrayElimCell_161 Int)) (and (not (= .cse5 v_arrayElimCell_161)) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_161) 1))))))))) (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-04-29 11:20:26,379 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:20:26,379 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-04-29 11:20:26,507 INFO L189 IndexEqualityManager]: detected not equals via solver [2025-04-29 11:20:26,522 INFO L325 Elim1Store]: treesize reduction 64, result has 14.7 percent of original size [2025-04-29 11:20:26,523 INFO L354 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 111 treesize of output 70 [2025-04-29 11:20:26,730 WARN L849 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_append_~head#1.base|) 0))) (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse0 (select (select (store (store |v_#memory_$Pointer$#1.base_201| .cse2 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse2) 4))) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse0) 4)) (.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= .cse0 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))) (= .cse2 .cse3) (= (select |v_#valid_BEFORE_CALL_39| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse2) 0) (= (store (select |v_#memory_$Pointer$#1.base_201| .cse0) 8 .cse2) v_DerPreprocessor_27) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= .cse0 v_DerPreprocessor_25) (= |v_#valid_BEFORE_CALL_40| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse4 (select |v_#valid_BEFORE_CALL_40| .cse4)))) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3 (select |v_#memory_$Pointer$#1.base_201| .cse3)) |v_#memory_$Pointer$#1.base_201|))))) (= (select |v_#valid_BEFORE_CALL_40| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((v_arrayElimCell_159 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_159) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse5) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))))) (= (select |v_#valid_BEFORE_CALL_40| .cse5) 1) (exists ((v_arrayElimCell_161 Int)) (and (not (= .cse5 v_arrayElimCell_161)) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_161) 1))))))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4) 0) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse7))) (or (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (|node_create_~temp~0#1.base| Int) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (v_DerPreprocessor_32 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse13 (store (store |v_#memory_$Pointer$#1.base_201| .cse7 .cse14) v_DerPreprocessor_32 .cse11))) (let ((.cse12 (select (select .cse13 .cse7) 4))) (let ((.cse8 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse12) 4)) (.cse10 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= (select |v_#valid_BEFORE_CALL_39| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse7) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_39| |v_old(#valid)_AFTER_CALL_46|))) (store |v_#valid_BEFORE_CALL_39| .cse9 (select |v_old(#valid)_AFTER_CALL_46| .cse9))) |v_old(#valid)_AFTER_CALL_46|) (= .cse10 .cse7) (= .cse11 (store (select |v_#memory_$Pointer$#1.base_201| .cse12) 8 .cse7)) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) .cse12) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (store .cse13 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#1.base|) (= (select |v_old(#valid)_AFTER_CALL_46| .cse12) 1) (not (= v_DerPreprocessor_32 .cse7)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse7) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= v_DerPreprocessor_32 .cse12) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse10 (select |v_#memory_$Pointer$#1.base_201| .cse10)) |v_#memory_$Pointer$#1.base_201|))))))) (let ((.cse16 (select .cse14 4))) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| .cse16))) (let ((.cse17 (select .cse15 4))) (and (= (select .cse15 8) .cse7) (or (= .cse16 .cse17) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= .cse16 (select (select |c_#memory_$Pointer$#1.base| .cse17) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_39| .cse7) 0) (= (let ((.cse18 (@diff |v_#valid_BEFORE_CALL_39| |v_old(#valid)_AFTER_CALL_46|))) (store |v_#valid_BEFORE_CALL_39| .cse18 (select |v_old(#valid)_AFTER_CALL_46| .cse18))) |v_old(#valid)_AFTER_CALL_46|) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_39| .cse17) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse7) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse16) 1))))))))) (= (select (select |c_#memory_$Pointer$#0.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-04-29 11:20:26,735 WARN L871 $PredicateComparison]: unable to prove that (let ((.cse7 (select (select |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_append_~head#1.base|) 0))) (and (or (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse2 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (v_DerPreprocessor_25 Int) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (v_DerPreprocessor_26 (Array Int Int)) (v_DerPreprocessor_27 (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse0 (select (select (store (store |v_#memory_$Pointer$#1.base_201| .cse2 v_DerPreprocessor_26) v_DerPreprocessor_25 v_DerPreprocessor_27) .cse2) 4))) (let ((.cse1 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse0) 4)) (.cse3 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= .cse0 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse1) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))) (= .cse2 .cse3) (= (select |v_#valid_BEFORE_CALL_39| .cse0) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse2) 0) (= (store (select |v_#memory_$Pointer$#1.base_201| .cse0) 8 .cse2) v_DerPreprocessor_27) (= (select |v_#valid_BEFORE_CALL_39| .cse1) 1) (= .cse0 v_DerPreprocessor_25) (= |v_#valid_BEFORE_CALL_40| (let ((.cse4 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse4 (select |v_#valid_BEFORE_CALL_40| .cse4)))) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse3 (select |v_#memory_$Pointer$#1.base_201| .cse3)) |v_#memory_$Pointer$#1.base_201|))))) (= (select |v_#valid_BEFORE_CALL_40| .cse2) 1)))))) (exists ((|v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8| Int)) (and (= (select (select |c_#memory_$Pointer$#0.offset| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0) 0) (exists ((|v_#valid_BEFORE_CALL_40| (Array Int Int))) (let ((.cse5 (select (select |c_#memory_$Pointer$#0.base| |v_ULTIMATE.start_dll_append_~head#1.base_BEFORE_CALL_8|) 0))) (and (exists ((v_arrayElimCell_159 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_39| v_arrayElimCell_159) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse5) 0) (= |v_#valid_BEFORE_CALL_40| (let ((.cse6 (@diff |v_#valid_BEFORE_CALL_39| |v_#valid_BEFORE_CALL_40|))) (store |v_#valid_BEFORE_CALL_39| .cse6 (select |v_#valid_BEFORE_CALL_40| .cse6)))))) (= (select |v_#valid_BEFORE_CALL_40| .cse5) 1) (exists ((v_arrayElimCell_161 Int)) (and (not (= .cse5 v_arrayElimCell_161)) (= (select |v_#valid_BEFORE_CALL_40| v_arrayElimCell_161) 1))))))))) (= (select (select |c_#memory_$Pointer$#1.offset| .cse7) 4) 0) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse7))) (or (exists ((|v_#memory_$Pointer$#1.base_201| (Array Int (Array Int Int))) (|node_create_~temp~0#1.base| Int) (|v_#memory_$Pointer$#1.base_BEFORE_CALL_14| (Array Int (Array Int Int))) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int) (v_DerPreprocessor_32 Int) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (let ((.cse11 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse13 (store (store |v_#memory_$Pointer$#1.base_201| .cse7 .cse14) v_DerPreprocessor_32 .cse11))) (let ((.cse12 (select (select .cse13 .cse7) 4))) (let ((.cse8 (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse12) 4)) (.cse10 (@diff |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| |v_#memory_$Pointer$#1.base_201|))) (and (= (select |v_#valid_BEFORE_CALL_39| .cse8) 1) (= (select |v_#valid_BEFORE_CALL_39| .cse7) 0) (= (let ((.cse9 (@diff |v_#valid_BEFORE_CALL_39| |v_old(#valid)_AFTER_CALL_46|))) (store |v_#valid_BEFORE_CALL_39| .cse9 (select |v_old(#valid)_AFTER_CALL_46| .cse9))) |v_old(#valid)_AFTER_CALL_46|) (= .cse10 .cse7) (= .cse11 (store (select |v_#memory_$Pointer$#1.base_201| .cse12) 8 .cse7)) (= (select (select |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse8) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8)) .cse12) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (store .cse13 |node_create_~temp~0#1.base| (select |c_#memory_$Pointer$#1.base| |node_create_~temp~0#1.base|)) |c_#memory_$Pointer$#1.base|) (= (select |v_old(#valid)_AFTER_CALL_46| .cse12) 1) (not (= v_DerPreprocessor_32 .cse7)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse7) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= v_DerPreprocessor_32 .cse12) (= (store |v_#memory_$Pointer$#1.base_BEFORE_CALL_14| .cse10 (select |v_#memory_$Pointer$#1.base_201| .cse10)) |v_#memory_$Pointer$#1.base_201|))))))) (let ((.cse16 (select .cse14 4))) (let ((.cse15 (select |c_#memory_$Pointer$#1.base| .cse16))) (let ((.cse17 (select .cse15 4))) (and (= (select .cse15 8) .cse7) (or (= .cse16 .cse17) (exists ((|v_ULTIMATE.start_dll_create_~head~0#1.offset_26| Int)) (= .cse16 (select (select |c_#memory_$Pointer$#1.base| .cse17) (+ |v_ULTIMATE.start_dll_create_~head~0#1.offset_26| 8))))) (exists ((|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (|v_#valid_BEFORE_CALL_39| (Array Int Int))) (and (= (select |v_#valid_BEFORE_CALL_39| .cse7) 0) (= (let ((.cse18 (@diff |v_#valid_BEFORE_CALL_39| |v_old(#valid)_AFTER_CALL_46|))) (store |v_#valid_BEFORE_CALL_39| .cse18 (select |v_old(#valid)_AFTER_CALL_46| .cse18))) |v_old(#valid)_AFTER_CALL_46|) (= (select |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base|) 0) (= (select |v_#valid_BEFORE_CALL_39| .cse17) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse7) 1) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse16) 1))))))))) (= (select (select |c_#memory_$Pointer$#0.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-04-29 11:20:27,354 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:27,355 INFO L354 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 727 treesize of output 527 [2025-04-29 11:20:27,376 INFO L325 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-04-29 11:20:27,376 INFO L354 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-04-29 11:20:27,633 WARN L849 $PredicateComparison]: unable to prove that (and (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_#t~mem6#1.base|))) (or (exists ((v_prenex_68 (Array Int (Array Int Int))) (v_prenex_64 (Array Int Int)) (v_prenex_67 (Array Int (Array Int Int))) (v_prenex_63 Int) (v_prenex_65 Int) (v_prenex_66 (Array Int Int)) (v_DerPreprocessor_32 Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse2 (store (store v_prenex_67 |c_ULTIMATE.start_dll_append_#t~mem6#1.base| .cse6) v_DerPreprocessor_32 .cse5))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_append_#t~mem6#1.base|) 4))) (let ((.cse3 (@diff v_prenex_68 v_prenex_67)) (.cse4 (select (select v_prenex_68 .cse1) 4))) (and (= (let ((.cse0 (@diff v_prenex_66 v_prenex_64))) (store v_prenex_66 .cse0 (select v_prenex_64 .cse0))) v_prenex_64) (= v_DerPreprocessor_32 .cse1) (= |c_#memory_$Pointer$#1.base| (store .cse2 v_prenex_63 (select |c_#memory_$Pointer$#1.base| v_prenex_63))) (= (select v_prenex_64 .cse1) 1) (= (store v_prenex_68 .cse3 (select v_prenex_67 .cse3)) v_prenex_67) (= |c_ULTIMATE.start_dll_append_#t~mem6#1.base| .cse3) (= (select v_prenex_64 v_prenex_63) 0) (not (= |c_ULTIMATE.start_dll_append_#t~mem6#1.base| v_DerPreprocessor_32)) (= (select v_prenex_66 .cse4) 1) (= (store (select v_prenex_67 .cse1) 8 |c_ULTIMATE.start_dll_append_#t~mem6#1.base|) .cse5) (= (select v_prenex_64 |c_ULTIMATE.start_dll_append_#t~mem6#1.base|) 1) (= |c_#valid| (store v_prenex_64 v_prenex_63 1)) (= .cse1 (select (select v_prenex_68 .cse4) (+ v_prenex_65 8))) (= (select v_prenex_66 |c_ULTIMATE.start_dll_append_#t~mem6#1.base|) 0))))))) (let ((.cse7 (select .cse6 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse9 (select .cse10 4))) (and (exists ((v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_#t~mem6#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse7) 1) (= (select v_prenex_70 |c_ULTIMATE.start_dll_append_#t~mem6#1.base|) 0) (= (let ((.cse8 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse8 (select |v_old(#valid)_AFTER_CALL_46| .cse8))) |v_old(#valid)_AFTER_CALL_46|) (= (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)) (= (select v_prenex_70 .cse9) 1))) (or (exists ((v_prenex_69 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse9) (+ v_prenex_69 8)) .cse7)) (= .cse9 .cse7)) (= |c_ULTIMATE.start_dll_append_#t~mem6#1.base| (select .cse10 8)))))))) (= |c_ULTIMATE.start_dll_append_#t~mem6#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_#t~mem6#1.base|) 4) 0)) is different from false [2025-04-29 11:20:27,636 WARN L871 $PredicateComparison]: unable to prove that (and (let ((.cse6 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_#t~mem6#1.base|))) (or (exists ((v_prenex_68 (Array Int (Array Int Int))) (v_prenex_64 (Array Int Int)) (v_prenex_67 (Array Int (Array Int Int))) (v_prenex_63 Int) (v_prenex_65 Int) (v_prenex_66 (Array Int Int)) (v_DerPreprocessor_32 Int)) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse2 (store (store v_prenex_67 |c_ULTIMATE.start_dll_append_#t~mem6#1.base| .cse6) v_DerPreprocessor_32 .cse5))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_dll_append_#t~mem6#1.base|) 4))) (let ((.cse3 (@diff v_prenex_68 v_prenex_67)) (.cse4 (select (select v_prenex_68 .cse1) 4))) (and (= (let ((.cse0 (@diff v_prenex_66 v_prenex_64))) (store v_prenex_66 .cse0 (select v_prenex_64 .cse0))) v_prenex_64) (= v_DerPreprocessor_32 .cse1) (= |c_#memory_$Pointer$#1.base| (store .cse2 v_prenex_63 (select |c_#memory_$Pointer$#1.base| v_prenex_63))) (= (select v_prenex_64 .cse1) 1) (= (store v_prenex_68 .cse3 (select v_prenex_67 .cse3)) v_prenex_67) (= |c_ULTIMATE.start_dll_append_#t~mem6#1.base| .cse3) (= (select v_prenex_64 v_prenex_63) 0) (not (= |c_ULTIMATE.start_dll_append_#t~mem6#1.base| v_DerPreprocessor_32)) (= (select v_prenex_66 .cse4) 1) (= (store (select v_prenex_67 .cse1) 8 |c_ULTIMATE.start_dll_append_#t~mem6#1.base|) .cse5) (= (select v_prenex_64 |c_ULTIMATE.start_dll_append_#t~mem6#1.base|) 1) (= |c_#valid| (store v_prenex_64 v_prenex_63 1)) (= .cse1 (select (select v_prenex_68 .cse4) (+ v_prenex_65 8))) (= (select v_prenex_66 |c_ULTIMATE.start_dll_append_#t~mem6#1.base|) 0))))))) (let ((.cse7 (select .cse6 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse7))) (let ((.cse9 (select .cse10 4))) (and (exists ((v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_#t~mem6#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| .cse7) 1) (= (select v_prenex_70 |c_ULTIMATE.start_dll_append_#t~mem6#1.base|) 0) (= (let ((.cse8 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse8 (select |v_old(#valid)_AFTER_CALL_46| .cse8))) |v_old(#valid)_AFTER_CALL_46|) (= (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)) (= (select v_prenex_70 .cse9) 1))) (or (exists ((v_prenex_69 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse9) (+ v_prenex_69 8)) .cse7)) (= .cse9 .cse7)) (= |c_ULTIMATE.start_dll_append_#t~mem6#1.base| (select .cse10 8)))))))) (= |c_ULTIMATE.start_dll_append_#t~mem6#1.offset| 0) (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_#t~mem6#1.base|) 4) 0)) is different from true [2025-04-29 11:20:27,722 WARN L849 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (let ((.cse1 (select .cse4 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse3 4))) (and (exists ((v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= 0 (select v_prenex_70 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse0 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0))) |v_old(#valid)_AFTER_CALL_46|) (= (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)) (= (select v_prenex_70 .cse2) 1))) (or (exists ((v_prenex_69 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) (+ v_prenex_69 8)) .cse1)) (= .cse2 .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse3 8)))))) (exists ((v_prenex_68 (Array Int (Array Int Int))) (v_prenex_64 (Array Int Int)) (v_prenex_67 (Array Int (Array Int Int))) (v_prenex_63 Int) (v_prenex_65 Int) (v_prenex_66 (Array Int Int)) (v_DerPreprocessor_32 Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse10 (store (store v_prenex_67 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) v_DerPreprocessor_32 .cse9))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse7 (@diff v_prenex_68 v_prenex_67)) (.cse6 (select (select v_prenex_68 .cse8) 4))) (and (= (let ((.cse5 (@diff v_prenex_66 v_prenex_64))) (store v_prenex_66 .cse5 (select v_prenex_64 .cse5))) v_prenex_64) (= (select v_prenex_66 .cse6) 1) (= (select v_prenex_66 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| v_DerPreprocessor_32)) (= (store v_prenex_68 .cse7 (select v_prenex_67 .cse7)) v_prenex_67) (= (select v_prenex_64 v_prenex_63) 0) (= (select v_prenex_64 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse7) (= (store (select v_prenex_67 .cse8) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9) (= |c_#valid| (store v_prenex_64 v_prenex_63 1)) (= (select v_prenex_64 .cse8) 1) (= |c_#memory_$Pointer$#1.base| (store .cse10 v_prenex_63 (select |c_#memory_$Pointer$#1.base| v_prenex_63))) (= v_DerPreprocessor_32 .cse8) (= .cse8 (select (select v_prenex_68 .cse6) (+ v_prenex_65 8))))))))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0)) is different from false [2025-04-29 11:20:27,725 WARN L871 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (let ((.cse1 (select .cse4 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse3 4))) (and (exists ((v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= 0 (select v_prenex_70 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse0 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0))) |v_old(#valid)_AFTER_CALL_46|) (= (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)) (= (select v_prenex_70 .cse2) 1))) (or (exists ((v_prenex_69 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) (+ v_prenex_69 8)) .cse1)) (= .cse2 .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse3 8)))))) (exists ((v_prenex_68 (Array Int (Array Int Int))) (v_prenex_64 (Array Int Int)) (v_prenex_67 (Array Int (Array Int Int))) (v_prenex_63 Int) (v_prenex_65 Int) (v_prenex_66 (Array Int Int)) (v_DerPreprocessor_32 Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse10 (store (store v_prenex_67 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) v_DerPreprocessor_32 .cse9))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse7 (@diff v_prenex_68 v_prenex_67)) (.cse6 (select (select v_prenex_68 .cse8) 4))) (and (= (let ((.cse5 (@diff v_prenex_66 v_prenex_64))) (store v_prenex_66 .cse5 (select v_prenex_64 .cse5))) v_prenex_64) (= (select v_prenex_66 .cse6) 1) (= (select v_prenex_66 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| v_DerPreprocessor_32)) (= (store v_prenex_68 .cse7 (select v_prenex_67 .cse7)) v_prenex_67) (= (select v_prenex_64 v_prenex_63) 0) (= (select v_prenex_64 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse7) (= (store (select v_prenex_67 .cse8) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9) (= |c_#valid| (store v_prenex_64 v_prenex_63 1)) (= (select v_prenex_64 .cse8) 1) (= |c_#memory_$Pointer$#1.base| (store .cse10 v_prenex_63 (select |c_#memory_$Pointer$#1.base| v_prenex_63))) (= v_DerPreprocessor_32 .cse8) (= .cse8 (select (select v_prenex_68 .cse6) (+ v_prenex_65 8))))))))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0)) is different from true [2025-04-29 11:20:27,817 WARN L849 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (let ((.cse1 (select .cse4 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse3 4))) (and (exists ((v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= 0 (select v_prenex_70 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse0 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0))) |v_old(#valid)_AFTER_CALL_46|) (= (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)) (= (select v_prenex_70 .cse2) 1))) (or (exists ((v_prenex_69 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) (+ v_prenex_69 8)) .cse1)) (= .cse2 .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse3 8)))))) (exists ((v_prenex_68 (Array Int (Array Int Int))) (v_prenex_64 (Array Int Int)) (v_prenex_67 (Array Int (Array Int Int))) (v_prenex_63 Int) (v_prenex_65 Int) (v_prenex_66 (Array Int Int)) (v_DerPreprocessor_32 Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse10 (store (store v_prenex_67 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) v_DerPreprocessor_32 .cse9))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse7 (@diff v_prenex_68 v_prenex_67)) (.cse6 (select (select v_prenex_68 .cse8) 4))) (and (= (let ((.cse5 (@diff v_prenex_66 v_prenex_64))) (store v_prenex_66 .cse5 (select v_prenex_64 .cse5))) v_prenex_64) (= (select v_prenex_66 .cse6) 1) (= (select v_prenex_66 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| v_DerPreprocessor_32)) (= (store v_prenex_68 .cse7 (select v_prenex_67 .cse7)) v_prenex_67) (= (select v_prenex_64 v_prenex_63) 0) (= (select v_prenex_64 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse7) (= (store (select v_prenex_67 .cse8) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9) (= |c_#valid| (store v_prenex_64 v_prenex_63 1)) (= (select v_prenex_64 .cse8) 1) (= |c_#memory_$Pointer$#1.base| (store .cse10 v_prenex_63 (select |c_#memory_$Pointer$#1.base| v_prenex_63))) (= v_DerPreprocessor_32 .cse8) (= .cse8 (select (select v_prenex_68 .cse6) (+ v_prenex_65 8))))))))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0)) is different from false [2025-04-29 11:20:27,820 WARN L871 $PredicateComparison]: unable to prove that (and (= (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4) 0) (= (select |c_#valid| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (let ((.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_append_~last~0#1.base|))) (or (let ((.cse1 (select .cse4 4))) (let ((.cse3 (select |c_#memory_$Pointer$#1.base| .cse1))) (let ((.cse2 (select .cse3 4))) (and (exists ((v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= 0 (select v_prenex_70 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse0 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0))) |v_old(#valid)_AFTER_CALL_46|) (= (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)) (= (select v_prenex_70 .cse2) 1))) (or (exists ((v_prenex_69 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse2) (+ v_prenex_69 8)) .cse1)) (= .cse2 .cse1)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse3 8)))))) (exists ((v_prenex_68 (Array Int (Array Int Int))) (v_prenex_64 (Array Int Int)) (v_prenex_67 (Array Int (Array Int Int))) (v_prenex_63 Int) (v_prenex_65 Int) (v_prenex_66 (Array Int Int)) (v_DerPreprocessor_32 Int)) (let ((.cse9 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse10 (store (store v_prenex_67 |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse4) v_DerPreprocessor_32 .cse9))) (let ((.cse8 (select (select .cse10 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 4))) (let ((.cse7 (@diff v_prenex_68 v_prenex_67)) (.cse6 (select (select v_prenex_68 .cse8) 4))) (and (= (let ((.cse5 (@diff v_prenex_66 v_prenex_64))) (store v_prenex_66 .cse5 (select v_prenex_64 .cse5))) v_prenex_64) (= (select v_prenex_66 .cse6) 1) (= (select v_prenex_66 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 0) (not (= |c_ULTIMATE.start_dll_append_~last~0#1.base| v_DerPreprocessor_32)) (= (store v_prenex_68 .cse7 (select v_prenex_67 .cse7)) v_prenex_67) (= (select v_prenex_64 v_prenex_63) 0) (= (select v_prenex_64 |c_ULTIMATE.start_dll_append_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse7) (= (store (select v_prenex_67 .cse8) 8 |c_ULTIMATE.start_dll_append_~last~0#1.base|) .cse9) (= |c_#valid| (store v_prenex_64 v_prenex_63 1)) (= (select v_prenex_64 .cse8) 1) (= |c_#memory_$Pointer$#1.base| (store .cse10 v_prenex_63 (select |c_#memory_$Pointer$#1.base| v_prenex_63))) (= v_DerPreprocessor_32 .cse8) (= .cse8 (select (select v_prenex_68 .cse6) (+ v_prenex_65 8))))))))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0)) is different from true [2025-04-29 11:20:27,930 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2025-04-29 11:20:28,113 WARN L849 $PredicateComparison]: unable to prove that (and (or (exists ((v_prenex_68 (Array Int (Array Int Int))) (v_prenex_64 (Array Int Int)) (v_prenex_67 (Array Int (Array Int Int))) (v_prenex_63 Int) (v_prenex_65 Int) (v_prenex_66 (Array Int Int)) (v_DerPreprocessor_32 Int)) (let ((.cse1 (@diff v_prenex_68 v_prenex_67))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse2 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse6 (store (store v_prenex_67 .cse1 .cse5) v_DerPreprocessor_32 .cse2))) (let ((.cse3 (select (select .cse6 .cse1) 4))) (let ((.cse4 (select (select v_prenex_68 .cse3) 4))) (and (= (let ((.cse0 (@diff v_prenex_66 v_prenex_64))) (store v_prenex_66 .cse0 (select v_prenex_64 .cse0))) v_prenex_64) (not (= v_DerPreprocessor_32 .cse1)) (= .cse2 (store (select v_prenex_67 .cse3) 8 .cse1)) (= v_DerPreprocessor_32 .cse3) (= (store v_prenex_68 .cse1 (select v_prenex_67 .cse1)) v_prenex_67) (= (select v_prenex_64 v_prenex_63) 0) (= (select (select v_prenex_68 .cse4) (+ v_prenex_65 8)) .cse3) (= (select v_prenex_66 .cse1) 0) (= |c_ULTIMATE.start_dll_append_#t~mem8#1.base| (select .cse5 4)) (= (select v_prenex_66 .cse4) 1) (= (store .cse6 v_prenex_63 (select |c_#memory_$Pointer$#1.base| v_prenex_63)) |c_#memory_$Pointer$#1.base|) (= 1 (select v_prenex_64 .cse1)) (= (select v_prenex_64 .cse3) 1) (= |c_#valid| (store v_prenex_64 v_prenex_63 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_70 (Array Int Int))) (and (= (let ((.cse7 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse7 (select |v_old(#valid)_AFTER_CALL_46| .cse7))) |v_old(#valid)_AFTER_CALL_46|) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_40| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse9 (select .cse10 4))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 1) (= |c_ULTIMATE.start_dll_append_#t~mem8#1.base| .cse8) (= (select v_prenex_70 .cse9) 1) (= (select v_prenex_70 |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 0) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_40| (select .cse10 8)) (exists ((v_prenex_69 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse9) (+ v_prenex_69 8)) .cse8)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse8) 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_70 (Array Int Int))) (and (= (let ((.cse11 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse11 (select |v_old(#valid)_AFTER_CALL_46| .cse11))) |v_old(#valid)_AFTER_CALL_46|) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_40| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 4))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse12))) (let ((.cse13 (select .cse14 4))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 1) (= |c_ULTIMATE.start_dll_append_#t~mem8#1.base| .cse12) (= (select v_prenex_70 .cse13) 1) (= (select v_prenex_70 |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 0) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_40| (select .cse14 8)) (= .cse12 .cse13))))))))))) (= |c_ULTIMATE.start_dll_append_#t~mem8#1.offset| 0)) is different from false [2025-04-29 11:20:28,116 WARN L871 $PredicateComparison]: unable to prove that (and (or (exists ((v_prenex_68 (Array Int (Array Int Int))) (v_prenex_64 (Array Int Int)) (v_prenex_67 (Array Int (Array Int Int))) (v_prenex_63 Int) (v_prenex_65 Int) (v_prenex_66 (Array Int Int)) (v_DerPreprocessor_32 Int)) (let ((.cse1 (@diff v_prenex_68 v_prenex_67))) (let ((.cse5 (select |c_#memory_$Pointer$#1.base| .cse1)) (.cse2 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse6 (store (store v_prenex_67 .cse1 .cse5) v_DerPreprocessor_32 .cse2))) (let ((.cse3 (select (select .cse6 .cse1) 4))) (let ((.cse4 (select (select v_prenex_68 .cse3) 4))) (and (= (let ((.cse0 (@diff v_prenex_66 v_prenex_64))) (store v_prenex_66 .cse0 (select v_prenex_64 .cse0))) v_prenex_64) (not (= v_DerPreprocessor_32 .cse1)) (= .cse2 (store (select v_prenex_67 .cse3) 8 .cse1)) (= v_DerPreprocessor_32 .cse3) (= (store v_prenex_68 .cse1 (select v_prenex_67 .cse1)) v_prenex_67) (= (select v_prenex_64 v_prenex_63) 0) (= (select (select v_prenex_68 .cse4) (+ v_prenex_65 8)) .cse3) (= (select v_prenex_66 .cse1) 0) (= |c_ULTIMATE.start_dll_append_#t~mem8#1.base| (select .cse5 4)) (= (select v_prenex_66 .cse4) 1) (= (store .cse6 v_prenex_63 (select |c_#memory_$Pointer$#1.base| v_prenex_63)) |c_#memory_$Pointer$#1.base|) (= 1 (select v_prenex_64 .cse1)) (= (select v_prenex_64 .cse3) 1) (= |c_#valid| (store v_prenex_64 v_prenex_63 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_70 (Array Int Int))) (and (= (let ((.cse7 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse7 (select |v_old(#valid)_AFTER_CALL_46| .cse7))) |v_old(#valid)_AFTER_CALL_46|) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_40| Int)) (let ((.cse8 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 4))) (let ((.cse10 (select |c_#memory_$Pointer$#1.base| .cse8))) (let ((.cse9 (select .cse10 4))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 1) (= |c_ULTIMATE.start_dll_append_#t~mem8#1.base| .cse8) (= (select v_prenex_70 .cse9) 1) (= (select v_prenex_70 |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 0) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_40| (select .cse10 8)) (exists ((v_prenex_69 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse9) (+ v_prenex_69 8)) .cse8)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse8) 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_70 (Array Int Int))) (and (= (let ((.cse11 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse11 (select |v_old(#valid)_AFTER_CALL_46| .cse11))) |v_old(#valid)_AFTER_CALL_46|) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_40| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 4))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse12))) (let ((.cse13 (select .cse14 4))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 1) (= |c_ULTIMATE.start_dll_append_#t~mem8#1.base| .cse12) (= (select v_prenex_70 .cse13) 1) (= (select v_prenex_70 |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 0) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_40| (select .cse14 8)) (= .cse12 .cse13))))))))))) (= |c_ULTIMATE.start_dll_append_#t~mem8#1.offset| 0)) is different from true [2025-04-29 11:20:28,279 WARN L849 $PredicateComparison]: unable to prove that (and (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_70 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_40| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 4))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= (select v_prenex_70 .cse1) 1) (= (select v_prenex_70 |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 0) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_40| (select .cse2 8)) (= .cse0 .cse1)))))) (= (let ((.cse3 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse3 (select |v_old(#valid)_AFTER_CALL_46| .cse3))) |v_old(#valid)_AFTER_CALL_46|))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)))) (exists ((v_prenex_68 (Array Int (Array Int Int))) (v_prenex_64 (Array Int Int)) (v_prenex_67 (Array Int (Array Int Int))) (v_prenex_63 Int) (v_prenex_65 Int) (v_prenex_66 (Array Int Int)) (v_DerPreprocessor_32 Int)) (let ((.cse5 (@diff v_prenex_68 v_prenex_67))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse6 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse10 (store (store v_prenex_67 .cse5 .cse8) v_DerPreprocessor_32 .cse6))) (let ((.cse7 (select (select .cse10 .cse5) 4))) (let ((.cse9 (select (select v_prenex_68 .cse7) 4))) (and (= (let ((.cse4 (@diff v_prenex_66 v_prenex_64))) (store v_prenex_66 .cse4 (select v_prenex_64 .cse4))) v_prenex_64) (not (= v_DerPreprocessor_32 .cse5)) (= .cse6 (store (select v_prenex_67 .cse7) 8 .cse5)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse8 4)) (= v_DerPreprocessor_32 .cse7) (= (store v_prenex_68 .cse5 (select v_prenex_67 .cse5)) v_prenex_67) (= (select v_prenex_64 v_prenex_63) 0) (= (select (select v_prenex_68 .cse9) (+ v_prenex_65 8)) .cse7) (= (select v_prenex_66 .cse5) 0) (= (select v_prenex_66 .cse9) 1) (= (store .cse10 v_prenex_63 (select |c_#memory_$Pointer$#1.base| v_prenex_63)) |c_#memory_$Pointer$#1.base|) (= 1 (select v_prenex_64 .cse5)) (= (select v_prenex_64 .cse7) 1) (= |c_#valid| (store v_prenex_64 v_prenex_63 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) (exists ((v_prenex_70 (Array Int Int))) (and (= (let ((.cse11 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse11 (select |v_old(#valid)_AFTER_CALL_46| .cse11))) |v_old(#valid)_AFTER_CALL_46|) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_40| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 4))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse12))) (let ((.cse13 (select .cse14 4))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse12) (= (select v_prenex_70 .cse13) 1) (= (select v_prenex_70 |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 0) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_40| (select .cse14 8)) (exists ((v_prenex_69 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse13) (+ v_prenex_69 8)) .cse12)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse12) 1)))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0)) is different from false [2025-04-29 11:20:28,282 WARN L871 $PredicateComparison]: unable to prove that (and (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_70 (Array Int Int))) (and (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_40| Int)) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 4))) (let ((.cse2 (select |c_#memory_$Pointer$#1.base| .cse0))) (let ((.cse1 (select .cse2 4))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse0) (= (select v_prenex_70 .cse1) 1) (= (select v_prenex_70 |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 0) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_40| (select .cse2 8)) (= .cse0 .cse1)))))) (= (let ((.cse3 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse3 (select |v_old(#valid)_AFTER_CALL_46| .cse3))) |v_old(#valid)_AFTER_CALL_46|))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)))) (exists ((v_prenex_68 (Array Int (Array Int Int))) (v_prenex_64 (Array Int Int)) (v_prenex_67 (Array Int (Array Int Int))) (v_prenex_63 Int) (v_prenex_65 Int) (v_prenex_66 (Array Int Int)) (v_DerPreprocessor_32 Int)) (let ((.cse5 (@diff v_prenex_68 v_prenex_67))) (let ((.cse8 (select |c_#memory_$Pointer$#1.base| .cse5)) (.cse6 (select |c_#memory_$Pointer$#1.base| v_DerPreprocessor_32))) (let ((.cse10 (store (store v_prenex_67 .cse5 .cse8) v_DerPreprocessor_32 .cse6))) (let ((.cse7 (select (select .cse10 .cse5) 4))) (let ((.cse9 (select (select v_prenex_68 .cse7) 4))) (and (= (let ((.cse4 (@diff v_prenex_66 v_prenex_64))) (store v_prenex_66 .cse4 (select v_prenex_64 .cse4))) v_prenex_64) (not (= v_DerPreprocessor_32 .cse5)) (= .cse6 (store (select v_prenex_67 .cse7) 8 .cse5)) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select .cse8 4)) (= v_DerPreprocessor_32 .cse7) (= (store v_prenex_68 .cse5 (select v_prenex_67 .cse5)) v_prenex_67) (= (select v_prenex_64 v_prenex_63) 0) (= (select (select v_prenex_68 .cse9) (+ v_prenex_65 8)) .cse7) (= (select v_prenex_66 .cse5) 0) (= (select v_prenex_66 .cse9) 1) (= (store .cse10 v_prenex_63 (select |c_#memory_$Pointer$#1.base| v_prenex_63)) |c_#memory_$Pointer$#1.base|) (= 1 (select v_prenex_64 .cse5)) (= (select v_prenex_64 .cse7) 1) (= |c_#valid| (store v_prenex_64 v_prenex_63 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) (exists ((v_prenex_70 (Array Int Int))) (and (= (let ((.cse11 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse11 (select |v_old(#valid)_AFTER_CALL_46| .cse11))) |v_old(#valid)_AFTER_CALL_46|) (exists ((|v_ULTIMATE.start_dll_append_~last~0#1.base_40| Int)) (let ((.cse12 (select (select |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 4))) (let ((.cse14 (select |c_#memory_$Pointer$#1.base| .cse12))) (let ((.cse13 (select .cse14 4))) (and (= (select |v_old(#valid)_AFTER_CALL_46| |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| .cse12) (= (select v_prenex_70 .cse13) 1) (= (select v_prenex_70 |v_ULTIMATE.start_dll_append_~last~0#1.base_40|) 0) (= |v_ULTIMATE.start_dll_append_~last~0#1.base_40| (select .cse14 8)) (exists ((v_prenex_69 Int)) (= (select (select |c_#memory_$Pointer$#1.base| .cse13) (+ v_prenex_69 8)) .cse12)) (= (select |v_old(#valid)_AFTER_CALL_46| .cse12) 1)))))))) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1))))) (= |c_ULTIMATE.start_dll_append_~last~0#1.offset| 0)) is different from true [2025-04-29 11:20:28,528 INFO L325 Elim1Store]: treesize reduction 35, result has 28.6 percent of original size [2025-04-29 11:20:28,529 INFO L354 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 66 treesize of output 39 [2025-04-29 11:20:28,593 INFO L325 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-04-29 11:20:28,594 INFO L354 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 51 treesize of output 18 [2025-04-29 11:20:28,637 WARN L849 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_arrayElimCell_180 Int)) (and (= (select v_prenex_70 |c_ULTIMATE.start_dll_append_#t~mem8#1.base|) 1) (= (let ((.cse0 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0))) |v_old(#valid)_AFTER_CALL_46|) (= (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) (= (select v_prenex_70 v_arrayElimCell_180) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)))) (exists ((v_prenex_68 (Array Int (Array Int Int))) (v_prenex_64 (Array Int Int)) (v_prenex_67 (Array Int (Array Int Int))) (v_prenex_63 Int) (v_DerPreprocessor_37 (Array Int Int)) (v_prenex_65 Int) (v_prenex_66 (Array Int Int)) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse4 (@diff v_prenex_68 v_prenex_67))) (let ((.cse6 (store (store (store v_prenex_67 .cse4 v_DerPreprocessor_35) v_DerPreprocessor_32 v_DerPreprocessor_36) v_prenex_63 v_DerPreprocessor_37))) (let ((.cse7 (select .cse6 .cse4)) (.cse5 (select .cse6 v_DerPreprocessor_32))) (let ((.cse3 (select (select (store (store v_prenex_67 .cse4 .cse7) v_DerPreprocessor_32 .cse5) .cse4) 4))) (let ((.cse2 (select (select v_prenex_68 .cse3) 4))) (and (= (let ((.cse1 (@diff v_prenex_66 v_prenex_64))) (store v_prenex_66 .cse1 (select v_prenex_64 .cse1))) v_prenex_64) (= (select (select v_prenex_68 .cse2) (+ v_prenex_65 8)) .cse3) (not (= v_DerPreprocessor_32 .cse4)) (= v_DerPreprocessor_32 .cse3) (= .cse5 (store (select v_prenex_67 .cse3) 8 .cse4)) (= (store v_prenex_68 .cse4 (select v_prenex_67 .cse4)) v_prenex_67) (= (select v_prenex_64 v_prenex_63) 0) (= |c_ULTIMATE.start_dll_append_#t~mem8#1.base| (select (select .cse6 (select .cse7 4)) 4)) (= (select v_prenex_66 .cse4) 0) (= 1 (select v_prenex_64 .cse4)) (= |c_#valid| (store v_prenex_64 v_prenex_63 1)) (= (select v_prenex_64 .cse3) 1) (= (select v_prenex_66 .cse2) 1)))))))) (exists ((v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_arrayElimCell_177 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_arrayElimCell_176 Int)) (and (= (select v_prenex_70 |c_ULTIMATE.start_dll_append_#t~mem8#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_176) 1) (= (select v_prenex_70 v_arrayElimCell_176) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_177) 1) (= (let ((.cse8 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse8 (select |v_old(#valid)_AFTER_CALL_46| .cse8))) |v_old(#valid)_AFTER_CALL_46|) (= (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)) (not (= v_arrayElimCell_177 v_arrayElimCell_176))))) is different from false [2025-04-29 11:20:34,038 WARN L871 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_arrayElimCell_180 Int)) (and (= (select v_prenex_70 |c_ULTIMATE.start_dll_append_#t~mem8#1.base|) 1) (= (let ((.cse0 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0))) |v_old(#valid)_AFTER_CALL_46|) (= (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) (= (select v_prenex_70 v_arrayElimCell_180) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)))) (exists ((v_prenex_68 (Array Int (Array Int Int))) (v_prenex_64 (Array Int Int)) (v_prenex_67 (Array Int (Array Int Int))) (v_prenex_63 Int) (v_DerPreprocessor_37 (Array Int Int)) (v_prenex_65 Int) (v_prenex_66 (Array Int Int)) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse4 (@diff v_prenex_68 v_prenex_67))) (let ((.cse6 (store (store (store v_prenex_67 .cse4 v_DerPreprocessor_35) v_DerPreprocessor_32 v_DerPreprocessor_36) v_prenex_63 v_DerPreprocessor_37))) (let ((.cse7 (select .cse6 .cse4)) (.cse5 (select .cse6 v_DerPreprocessor_32))) (let ((.cse3 (select (select (store (store v_prenex_67 .cse4 .cse7) v_DerPreprocessor_32 .cse5) .cse4) 4))) (let ((.cse2 (select (select v_prenex_68 .cse3) 4))) (and (= (let ((.cse1 (@diff v_prenex_66 v_prenex_64))) (store v_prenex_66 .cse1 (select v_prenex_64 .cse1))) v_prenex_64) (= (select (select v_prenex_68 .cse2) (+ v_prenex_65 8)) .cse3) (not (= v_DerPreprocessor_32 .cse4)) (= v_DerPreprocessor_32 .cse3) (= .cse5 (store (select v_prenex_67 .cse3) 8 .cse4)) (= (store v_prenex_68 .cse4 (select v_prenex_67 .cse4)) v_prenex_67) (= (select v_prenex_64 v_prenex_63) 0) (= |c_ULTIMATE.start_dll_append_#t~mem8#1.base| (select (select .cse6 (select .cse7 4)) 4)) (= (select v_prenex_66 .cse4) 0) (= 1 (select v_prenex_64 .cse4)) (= |c_#valid| (store v_prenex_64 v_prenex_63 1)) (= (select v_prenex_64 .cse3) 1) (= (select v_prenex_66 .cse2) 1)))))))) (exists ((v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_arrayElimCell_177 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_arrayElimCell_176 Int)) (and (= (select v_prenex_70 |c_ULTIMATE.start_dll_append_#t~mem8#1.base|) 1) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_176) 1) (= (select v_prenex_70 v_arrayElimCell_176) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_177) 1) (= (let ((.cse8 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse8 (select |v_old(#valid)_AFTER_CALL_46| .cse8))) |v_old(#valid)_AFTER_CALL_46|) (= (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)) (not (= v_arrayElimCell_177 v_arrayElimCell_176))))) is different from true [2025-04-29 11:20:34,254 WARN L849 $PredicateComparison]: unable to prove that (or (exists ((v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_arrayElimCell_180 Int)) (and (= 1 (select v_prenex_70 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (let ((.cse0 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse0 (select |v_old(#valid)_AFTER_CALL_46| .cse0))) |v_old(#valid)_AFTER_CALL_46|) (= (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) (= (select v_prenex_70 v_arrayElimCell_180) 0) (= |c_#valid| (store |v_old(#valid)_AFTER_CALL_46| |node_create_~temp~0#1.base| 1)))) (exists ((v_prenex_70 (Array Int Int)) (|node_create_~temp~0#1.base| Int) (v_arrayElimCell_177 Int) (|v_old(#valid)_AFTER_CALL_46| (Array Int Int)) (v_arrayElimCell_176 Int)) (and (= 1 (select v_prenex_70 |c_ULTIMATE.start_dll_append_~last~0#1.base|)) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_176) 1) (= (select v_prenex_70 v_arrayElimCell_176) 0) (= (select |v_old(#valid)_AFTER_CALL_46| v_arrayElimCell_177) 1) (= (let ((.cse1 (@diff v_prenex_70 |v_old(#valid)_AFTER_CALL_46|))) (store v_prenex_70 .cse1 (select |v_old(#valid)_AFTER_CALL_46| .cse1))) |v_old(#valid)_AFTER_CALL_46|) (= (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)) (not (= v_arrayElimCell_177 v_arrayElimCell_176)))) (exists ((v_prenex_68 (Array Int (Array Int Int))) (v_prenex_64 (Array Int Int)) (v_prenex_67 (Array Int (Array Int Int))) (v_prenex_63 Int) (v_DerPreprocessor_37 (Array Int Int)) (v_prenex_65 Int) (v_prenex_66 (Array Int Int)) (v_DerPreprocessor_32 Int) (v_DerPreprocessor_35 (Array Int Int)) (v_DerPreprocessor_36 (Array Int Int))) (let ((.cse5 (@diff v_prenex_68 v_prenex_67))) (let ((.cse7 (store (store (store v_prenex_67 .cse5 v_DerPreprocessor_35) v_DerPreprocessor_32 v_DerPreprocessor_36) v_prenex_63 v_DerPreprocessor_37))) (let ((.cse8 (select .cse7 .cse5)) (.cse6 (select .cse7 v_DerPreprocessor_32))) (let ((.cse4 (select (select (store (store v_prenex_67 .cse5 .cse8) v_DerPreprocessor_32 .cse6) .cse5) 4))) (let ((.cse3 (select (select v_prenex_68 .cse4) 4))) (and (= (let ((.cse2 (@diff v_prenex_66 v_prenex_64))) (store v_prenex_66 .cse2 (select v_prenex_64 .cse2))) v_prenex_64) (= (select (select v_prenex_68 .cse3) (+ v_prenex_65 8)) .cse4) (not (= v_DerPreprocessor_32 .cse5)) (= v_DerPreprocessor_32 .cse4) (= .cse6 (store (select v_prenex_67 .cse4) 8 .cse5)) (= (store v_prenex_68 .cse5 (select v_prenex_67 .cse5)) v_prenex_67) (= (select v_prenex_64 v_prenex_63) 0) (= (select v_prenex_66 .cse5) 0) (= 1 (select v_prenex_64 .cse5)) (= |c_#valid| (store v_prenex_64 v_prenex_63 1)) (= (select v_prenex_64 .cse4) 1) (= (select v_prenex_66 .cse3) 1) (= |c_ULTIMATE.start_dll_append_~last~0#1.base| (select (select .cse7 (select .cse8 4)) 4)))))))))) is different from false Killed by 15