./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 8fc3dc66 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 ../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -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 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.3.0-?-8fc3dc6-m [2025-03-17 12:19:33,360 INFO L188 SettingsManager]: Resetting all preferences to default values... [2025-03-17 12:19:33,413 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2025-03-17 12:19:33,416 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2025-03-17 12:19:33,417 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2025-03-17 12:19:33,430 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2025-03-17 12:19:33,431 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2025-03-17 12:19:33,431 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2025-03-17 12:19:33,432 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2025-03-17 12:19:33,432 INFO L153 SettingsManager]: * Use memory slicer=true [2025-03-17 12:19:33,432 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2025-03-17 12:19:33,432 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2025-03-17 12:19:33,432 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2025-03-17 12:19:33,432 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2025-03-17 12:19:33,432 INFO L153 SettingsManager]: * Use SBE=true [2025-03-17 12:19:33,432 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2025-03-17 12:19:33,432 INFO L153 SettingsManager]: * sizeof long=4 [2025-03-17 12:19:33,432 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2025-03-17 12:19:33,433 INFO L153 SettingsManager]: * sizeof POINTER=4 [2025-03-17 12:19:33,433 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2025-03-17 12:19:33,433 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2025-03-17 12:19:33,433 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2025-03-17 12:19:33,433 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2025-03-17 12:19:33,433 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2025-03-17 12:19:33,433 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2025-03-17 12:19:33,433 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2025-03-17 12:19:33,433 INFO L153 SettingsManager]: * sizeof long double=12 [2025-03-17 12:19:33,433 INFO L153 SettingsManager]: * Behaviour of calls to undefined functions=OVERAPPROXIMATE_BEHAVIOUR [2025-03-17 12:19:33,433 INFO L153 SettingsManager]: * Use constant arrays=true [2025-03-17 12:19:33,433 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2025-03-17 12:19:33,433 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2025-03-17 12:19:33,433 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2025-03-17 12:19:33,433 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2025-03-17 12:19:33,433 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:19:33,433 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2025-03-17 12:19:33,433 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2025-03-17 12:19:33,433 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2025-03-17 12:19:33,434 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2025-03-17 12:19:33,434 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2025-03-17 12:19:33,434 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2025-03-17 12:19:33,434 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2025-03-17 12:19:33,434 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2025-03-17 12:19:33,434 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 -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2025-03-17 12:19:33,645 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2025-03-17 12:19:33,650 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2025-03-17 12:19:33,652 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2025-03-17 12:19:33,652 INFO L270 PluginConnector]: Initializing CDTParser... [2025-03-17 12:19:33,653 INFO L274 PluginConnector]: CDTParser initialized [2025-03-17 12:19:33,653 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2025-03-17 12:19:34,779 INFO L533 CDTParser]: Created temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa3315c0a/9180cc921c8642a1946f16f73de392fc/FLAGa562a2331 [2025-03-17 12:19:35,064 INFO L384 CDTParser]: Found 1 translation units. [2025-03-17 12:19:35,066 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2025-03-17 12:19:35,077 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa3315c0a/9180cc921c8642a1946f16f73de392fc/FLAGa562a2331 [2025-03-17 12:19:35,355 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/fa3315c0a/9180cc921c8642a1946f16f73de392fc [2025-03-17 12:19:35,357 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2025-03-17 12:19:35,359 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2025-03-17 12:19:35,360 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2025-03-17 12:19:35,360 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2025-03-17 12:19:35,364 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2025-03-17 12:19:35,365 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:19:35" (1/1) ... [2025-03-17 12:19:35,365 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@6c9d998e and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:19:35, skipping insertion in model container [2025-03-17 12:19:35,365 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 17.03 12:19:35" (1/1) ... [2025-03-17 12:19:35,397 INFO L175 MainTranslator]: Built tables and reachable declarations [2025-03-17 12:19:35,565 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:19:35,573 INFO L200 MainTranslator]: Completed pre-run [2025-03-17 12:19:35,608 INFO L210 PostProcessor]: Analyzing one entry point: main [2025-03-17 12:19:35,629 INFO L204 MainTranslator]: Completed translation [2025-03-17 12:19:35,629 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:19:35 WrapperNode [2025-03-17 12:19:35,629 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2025-03-17 12:19:35,630 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2025-03-17 12:19:35,630 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2025-03-17 12:19:35,630 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2025-03-17 12:19:35,634 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:19:35" (1/1) ... [2025-03-17 12:19:35,641 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:19:35" (1/1) ... [2025-03-17 12:19:35,654 INFO L138 Inliner]: procedures = 122, calls = 28, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 93 [2025-03-17 12:19:35,655 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2025-03-17 12:19:35,655 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2025-03-17 12:19:35,655 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2025-03-17 12:19:35,655 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2025-03-17 12:19:35,660 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:19:35" (1/1) ... [2025-03-17 12:19:35,660 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:19:35" (1/1) ... [2025-03-17 12:19:35,662 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:19:35" (1/1) ... [2025-03-17 12:19:35,674 INFO L175 MemorySlicer]: Split 17 memory accesses to 2 slices as follows [2, 15]. 88 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0]. The 10 writes are split as follows [0, 10]. [2025-03-17 12:19:35,674 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:19:35" (1/1) ... [2025-03-17 12:19:35,674 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:19:35" (1/1) ... [2025-03-17 12:19:35,678 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:19:35" (1/1) ... [2025-03-17 12:19:35,679 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:19:35" (1/1) ... [2025-03-17 12:19:35,680 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:19:35" (1/1) ... [2025-03-17 12:19:35,681 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:19:35" (1/1) ... [2025-03-17 12:19:35,682 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2025-03-17 12:19:35,683 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2025-03-17 12:19:35,683 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2025-03-17 12:19:35,683 INFO L274 PluginConnector]: IcfgBuilder initialized [2025-03-17 12:19:35,683 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:19:35" (1/1) ... [2025-03-17 12:19:35,687 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2025-03-17 12:19:35,694 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:19:35,705 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2025-03-17 12:19:35,707 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2025-03-17 12:19:35,722 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2025-03-17 12:19:35,722 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2025-03-17 12:19:35,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2025-03-17 12:19:35,722 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2025-03-17 12:19:35,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2025-03-17 12:19:35,722 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2025-03-17 12:19:35,722 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2025-03-17 12:19:35,723 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2025-03-17 12:19:35,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2025-03-17 12:19:35,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2025-03-17 12:19:35,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2025-03-17 12:19:35,723 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2025-03-17 12:19:35,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2025-03-17 12:19:35,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2025-03-17 12:19:35,723 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2025-03-17 12:19:35,723 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2025-03-17 12:19:35,723 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2025-03-17 12:19:35,806 INFO L256 CfgBuilder]: Building ICFG [2025-03-17 12:19:35,807 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2025-03-17 12:19:35,840 INFO L1322 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2025-03-17 12:19:36,090 INFO L? ?]: Removed 76 outVars from TransFormulas that were not future-live. [2025-03-17 12:19:36,090 INFO L307 CfgBuilder]: Performing block encoding [2025-03-17 12:19:36,101 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2025-03-17 12:19:36,101 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2025-03-17 12:19:36,102 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:19:36 BoogieIcfgContainer [2025-03-17 12:19:36,103 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2025-03-17 12:19:36,105 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2025-03-17 12:19:36,105 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2025-03-17 12:19:36,108 INFO L274 PluginConnector]: TraceAbstraction initialized [2025-03-17 12:19:36,108 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 17.03 12:19:35" (1/3) ... [2025-03-17 12:19:36,109 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172c58d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:19:36, skipping insertion in model container [2025-03-17 12:19:36,109 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 17.03 12:19:35" (2/3) ... [2025-03-17 12:19:36,110 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@172c58d2 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 17.03 12:19:36, skipping insertion in model container [2025-03-17 12:19:36,110 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 17.03 12:19:36" (3/3) ... [2025-03-17 12:19:36,110 INFO L128 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2025-03-17 12:19:36,121 INFO L216 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2025-03-17 12:19:36,123 INFO L151 ceAbstractionStarter]: Applying trace abstraction to ICFG dll_circular_traversal-2.i that has 2 procedures, 82 locations, 1 initial locations, 3 loop locations, and 35 error locations. [2025-03-17 12:19:36,150 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2025-03-17 12:19:36,157 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@52f6438a, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2025-03-17 12:19:36,158 INFO L334 AbstractCegarLoop]: Starting to check reachability of 35 error locations. [2025-03-17 12:19:36,161 INFO L276 IsEmpty]: Start isEmpty. Operand has 81 states, 43 states have (on average 2.046511627906977) internal successors, (88), 79 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:36,166 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 12:19:36,166 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:36,167 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 12:19:36,167 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr33REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-17 12:19:36,172 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:36,172 INFO L85 PathProgramCache]: Analyzing trace with hash 123097, now seen corresponding path program 1 times [2025-03-17 12:19:36,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:36,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1020820469] [2025-03-17 12:19:36,177 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:36,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:36,226 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 12:19:36,237 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 12:19:36,237 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:36,237 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:36,322 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:36,323 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:36,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1020820469] [2025-03-17 12:19:36,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1020820469] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:19:36,325 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:19:36,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:19:36,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1610730570] [2025-03-17 12:19:36,327 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:19:36,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:19:36,331 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:36,349 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:19:36,350 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:19:36,352 INFO L87 Difference]: Start difference. First operand has 81 states, 43 states have (on average 2.046511627906977) internal successors, (88), 79 states have internal predecessors, (88), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:36,436 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:36,436 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2025-03-17 12:19:36,437 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:19:36,438 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-17 12:19:36,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:36,443 INFO L225 Difference]: With dead ends: 76 [2025-03-17 12:19:36,443 INFO L226 Difference]: Without dead ends: 70 [2025-03-17 12:19:36,445 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:19:36,447 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 21 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 46 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 21 SdHoareTripleChecker+Valid, 92 SdHoareTripleChecker+Invalid, 50 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 46 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:36,448 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [21 Valid, 92 Invalid, 50 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 46 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:19:36,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2025-03-17 12:19:36,472 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2025-03-17 12:19:36,473 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 39 states have (on average 1.8717948717948718) internal successors, (73), 69 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:36,477 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 73 transitions. [2025-03-17 12:19:36,479 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 73 transitions. Word has length 3 [2025-03-17 12:19:36,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:36,480 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 73 transitions. [2025-03-17 12:19:36,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:36,480 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 73 transitions. [2025-03-17 12:19:36,481 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2025-03-17 12:19:36,481 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:36,481 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1] [2025-03-17 12:19:36,482 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2025-03-17 12:19:36,482 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-17 12:19:36,482 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:36,482 INFO L85 PathProgramCache]: Analyzing trace with hash 123098, now seen corresponding path program 1 times [2025-03-17 12:19:36,482 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:36,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [136141954] [2025-03-17 12:19:36,482 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:36,483 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:36,491 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 3 statements into 1 equivalence classes. [2025-03-17 12:19:36,500 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 3 of 3 statements. [2025-03-17 12:19:36,501 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:36,501 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:36,593 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:36,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:36,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [136141954] [2025-03-17 12:19:36,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [136141954] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:19:36,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:19:36,594 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2025-03-17 12:19:36,594 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [216096314] [2025-03-17 12:19:36,594 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:19:36,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:19:36,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:36,595 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:19:36,595 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:19:36,596 INFO L87 Difference]: Start difference. First operand 70 states and 73 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:36,643 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:36,643 INFO L93 Difference]: Finished difference Result 72 states and 76 transitions. [2025-03-17 12:19:36,643 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:19:36,644 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2025-03-17 12:19:36,644 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:36,644 INFO L225 Difference]: With dead ends: 72 [2025-03-17 12:19:36,644 INFO L226 Difference]: Without dead ends: 72 [2025-03-17 12:19:36,644 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:19:36,645 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 8 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 35 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 99 SdHoareTripleChecker+Invalid, 38 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 35 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:36,645 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 99 Invalid, 38 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 35 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:19:36,646 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2025-03-17 12:19:36,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 69. [2025-03-17 12:19:36,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 69 states, 41 states have (on average 1.7804878048780488) internal successors, (73), 68 states have internal predecessors, (73), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:36,649 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 69 states to 69 states and 73 transitions. [2025-03-17 12:19:36,649 INFO L78 Accepts]: Start accepts. Automaton has 69 states and 73 transitions. Word has length 3 [2025-03-17 12:19:36,649 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:36,649 INFO L471 AbstractCegarLoop]: Abstraction has 69 states and 73 transitions. [2025-03-17 12:19:36,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:36,649 INFO L276 IsEmpty]: Start isEmpty. Operand 69 states and 73 transitions. [2025-03-17 12:19:36,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 12:19:36,649 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:36,649 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:36,650 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2025-03-17 12:19:36,650 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-17 12:19:36,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:36,650 INFO L85 PathProgramCache]: Analyzing trace with hash -418293454, now seen corresponding path program 1 times [2025-03-17 12:19:36,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:36,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1657101940] [2025-03-17 12:19:36,650 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:36,651 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:36,659 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 12:19:36,669 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 12:19:36,670 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:36,670 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:36,754 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:36,754 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:36,754 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1657101940] [2025-03-17 12:19:36,754 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1657101940] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:19:36,754 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:19:36,754 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:19:36,754 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [932642055] [2025-03-17 12:19:36,754 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:19:36,755 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:19:36,755 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:36,755 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:19:36,755 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:19:36,755 INFO L87 Difference]: Start difference. First operand 69 states and 73 transitions. Second operand has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:36,765 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:36,765 INFO L93 Difference]: Finished difference Result 79 states and 82 transitions. [2025-03-17 12:19:36,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:19:36,765 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 12:19:36,766 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:36,766 INFO L225 Difference]: With dead ends: 79 [2025-03-17 12:19:36,766 INFO L226 Difference]: Without dead ends: 79 [2025-03-17 12:19:36,766 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:19:36,767 INFO L435 NwaCegarLoop]: 68 mSDtfsCounter, 11 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 128 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:36,767 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 128 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:19:36,768 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 79 states. [2025-03-17 12:19:36,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 79 to 68. [2025-03-17 12:19:36,772 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 40 states have (on average 1.775) internal successors, (71), 67 states have internal predecessors, (71), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:36,773 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 71 transitions. [2025-03-17 12:19:36,774 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 71 transitions. Word has length 9 [2025-03-17 12:19:36,774 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:36,774 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 71 transitions. [2025-03-17 12:19:36,774 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.0) internal successors, (9), 2 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:36,774 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 71 transitions. [2025-03-17 12:19:36,774 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 12:19:36,775 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:36,776 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:36,776 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2025-03-17 12:19:36,776 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr27REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-17 12:19:36,776 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:36,776 INFO L85 PathProgramCache]: Analyzing trace with hash -418293937, now seen corresponding path program 1 times [2025-03-17 12:19:36,776 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:36,776 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2023618246] [2025-03-17 12:19:36,776 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:36,776 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:36,788 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 12:19:36,797 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 12:19:36,797 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:36,797 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:36,862 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:36,862 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:36,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2023618246] [2025-03-17 12:19:36,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2023618246] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:19:36,862 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:19:36,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:19:36,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1351698751] [2025-03-17 12:19:36,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:19:36,863 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:19:36,863 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:36,863 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:19:36,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:19:36,863 INFO L87 Difference]: Start difference. First operand 68 states and 71 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:36,918 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:36,918 INFO L93 Difference]: Finished difference Result 66 states and 69 transitions. [2025-03-17 12:19:36,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:19:36,919 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 12:19:36,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:36,919 INFO L225 Difference]: With dead ends: 66 [2025-03-17 12:19:36,919 INFO L226 Difference]: Without dead ends: 66 [2025-03-17 12:19:36,920 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:19:36,921 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 5 mSDsluCounter, 33 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 93 SdHoareTripleChecker+Invalid, 37 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:36,921 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 93 Invalid, 37 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:19:36,921 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 66 states. [2025-03-17 12:19:36,926 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 66 to 66. [2025-03-17 12:19:36,926 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 66 states, 40 states have (on average 1.725) internal successors, (69), 65 states have internal predecessors, (69), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:36,927 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 66 states to 66 states and 69 transitions. [2025-03-17 12:19:36,928 INFO L78 Accepts]: Start accepts. Automaton has 66 states and 69 transitions. Word has length 9 [2025-03-17 12:19:36,928 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:36,928 INFO L471 AbstractCegarLoop]: Abstraction has 66 states and 69 transitions. [2025-03-17 12:19:36,928 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:36,928 INFO L276 IsEmpty]: Start isEmpty. Operand 66 states and 69 transitions. [2025-03-17 12:19:36,928 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2025-03-17 12:19:36,928 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:36,929 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:36,929 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2025-03-17 12:19:36,929 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr28REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-17 12:19:36,929 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:36,929 INFO L85 PathProgramCache]: Analyzing trace with hash -418293936, now seen corresponding path program 1 times [2025-03-17 12:19:36,929 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:36,930 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [209064344] [2025-03-17 12:19:36,930 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:36,930 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:36,944 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 9 statements into 1 equivalence classes. [2025-03-17 12:19:36,956 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 9 of 9 statements. [2025-03-17 12:19:36,958 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:36,958 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:37,028 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:37,029 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:37,029 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [209064344] [2025-03-17 12:19:37,029 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [209064344] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:19:37,029 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:19:37,029 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2025-03-17 12:19:37,029 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1401203598] [2025-03-17 12:19:37,029 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:19:37,029 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2025-03-17 12:19:37,029 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:37,030 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2025-03-17 12:19:37,030 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:19:37,030 INFO L87 Difference]: Start difference. First operand 66 states and 69 transitions. Second operand has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:37,078 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:37,078 INFO L93 Difference]: Finished difference Result 64 states and 67 transitions. [2025-03-17 12:19:37,079 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2025-03-17 12:19:37,079 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2025-03-17 12:19:37,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:37,080 INFO L225 Difference]: With dead ends: 64 [2025-03-17 12:19:37,080 INFO L226 Difference]: Without dead ends: 64 [2025-03-17 12:19:37,080 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2025-03-17 12:19:37,080 INFO L435 NwaCegarLoop]: 60 mSDtfsCounter, 5 mSDsluCounter, 35 mSDsCounter, 0 mSdLazyCounter, 30 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 95 SdHoareTripleChecker+Invalid, 31 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 30 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:37,080 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 95 Invalid, 31 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 30 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:19:37,081 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 64 states. [2025-03-17 12:19:37,082 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 64 to 64. [2025-03-17 12:19:37,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 64 states, 40 states have (on average 1.675) internal successors, (67), 63 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:37,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 64 states to 64 states and 67 transitions. [2025-03-17 12:19:37,087 INFO L78 Accepts]: Start accepts. Automaton has 64 states and 67 transitions. Word has length 9 [2025-03-17 12:19:37,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:37,087 INFO L471 AbstractCegarLoop]: Abstraction has 64 states and 67 transitions. [2025-03-17 12:19:37,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 4.5) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:37,087 INFO L276 IsEmpty]: Start isEmpty. Operand 64 states and 67 transitions. [2025-03-17 12:19:37,087 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 12:19:37,087 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:37,089 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:37,089 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2025-03-17 12:19:37,089 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-17 12:19:37,090 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:37,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1746453644, now seen corresponding path program 1 times [2025-03-17 12:19:37,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:37,090 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [89954458] [2025-03-17 12:19:37,090 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:37,090 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:37,103 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 12:19:37,114 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 12:19:37,116 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:37,116 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:37,245 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:37,245 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:37,245 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [89954458] [2025-03-17 12:19:37,245 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [89954458] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:19:37,245 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:19:37,245 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:19:37,245 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [922434475] [2025-03-17 12:19:37,246 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:19:37,246 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:19:37,246 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:37,246 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:19:37,246 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:19:37,246 INFO L87 Difference]: Start difference. First operand 64 states and 67 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:37,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:37,345 INFO L93 Difference]: Finished difference Result 68 states and 72 transitions. [2025-03-17 12:19:37,345 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:19:37,345 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 12:19:37,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:37,346 INFO L225 Difference]: With dead ends: 68 [2025-03-17 12:19:37,346 INFO L226 Difference]: Without dead ends: 68 [2025-03-17 12:19:37,346 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:19:37,347 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 18 mSDsluCounter, 87 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 137 SdHoareTripleChecker+Invalid, 109 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:37,348 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 137 Invalid, 109 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:19:37,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 68 states. [2025-03-17 12:19:37,351 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 68 to 68. [2025-03-17 12:19:37,351 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 68 states, 44 states have (on average 1.6363636363636365) internal successors, (72), 67 states have internal predecessors, (72), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:37,351 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 68 states to 68 states and 72 transitions. [2025-03-17 12:19:37,352 INFO L78 Accepts]: Start accepts. Automaton has 68 states and 72 transitions. Word has length 11 [2025-03-17 12:19:37,352 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:37,352 INFO L471 AbstractCegarLoop]: Abstraction has 68 states and 72 transitions. [2025-03-17 12:19:37,352 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:37,352 INFO L276 IsEmpty]: Start isEmpty. Operand 68 states and 72 transitions. [2025-03-17 12:19:37,352 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2025-03-17 12:19:37,352 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:37,352 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:37,353 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2025-03-17 12:19:37,353 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-17 12:19:37,353 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:37,353 INFO L85 PathProgramCache]: Analyzing trace with hash 1746453645, now seen corresponding path program 1 times [2025-03-17 12:19:37,353 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:37,353 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [606068386] [2025-03-17 12:19:37,353 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:37,354 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:37,365 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 11 statements into 1 equivalence classes. [2025-03-17 12:19:37,375 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 11 of 11 statements. [2025-03-17 12:19:37,375 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:37,375 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:37,526 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:37,528 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:37,528 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [606068386] [2025-03-17 12:19:37,528 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [606068386] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:19:37,528 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:19:37,528 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:19:37,528 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [245654026] [2025-03-17 12:19:37,528 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:19:37,528 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:19:37,528 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:37,529 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:19:37,531 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:19:37,531 INFO L87 Difference]: Start difference. First operand 68 states and 72 transitions. Second operand has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:37,627 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:37,627 INFO L93 Difference]: Finished difference Result 67 states and 70 transitions. [2025-03-17 12:19:37,628 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:19:37,628 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2025-03-17 12:19:37,628 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:37,628 INFO L225 Difference]: With dead ends: 67 [2025-03-17 12:19:37,628 INFO L226 Difference]: Without dead ends: 67 [2025-03-17 12:19:37,628 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:19:37,629 INFO L435 NwaCegarLoop]: 50 mSDtfsCounter, 20 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 88 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 20 SdHoareTripleChecker+Valid, 135 SdHoareTripleChecker+Invalid, 93 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 88 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:37,629 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [20 Valid, 135 Invalid, 93 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 88 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:19:37,629 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 67 states. [2025-03-17 12:19:37,630 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 67 to 67. [2025-03-17 12:19:37,631 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 67 states, 44 states have (on average 1.5909090909090908) internal successors, (70), 66 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:37,631 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 67 states to 67 states and 70 transitions. [2025-03-17 12:19:37,631 INFO L78 Accepts]: Start accepts. Automaton has 67 states and 70 transitions. Word has length 11 [2025-03-17 12:19:37,631 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:37,631 INFO L471 AbstractCegarLoop]: Abstraction has 67 states and 70 transitions. [2025-03-17 12:19:37,632 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.2) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:37,632 INFO L276 IsEmpty]: Start isEmpty. Operand 67 states and 70 transitions. [2025-03-17 12:19:37,632 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 12:19:37,632 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:37,632 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:37,632 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2025-03-17 12:19:37,632 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-17 12:19:37,633 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:37,633 INFO L85 PathProgramCache]: Analyzing trace with hash 1843182519, now seen corresponding path program 1 times [2025-03-17 12:19:37,633 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:37,633 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [119160983] [2025-03-17 12:19:37,633 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:37,633 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:37,647 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 12:19:37,654 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 12:19:37,654 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:37,654 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:37,693 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:37,693 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:37,693 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [119160983] [2025-03-17 12:19:37,693 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [119160983] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:19:37,694 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:19:37,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:19:37,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [690600329] [2025-03-17 12:19:37,694 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:19:37,694 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:19:37,694 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:37,695 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:19:37,695 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:19:37,695 INFO L87 Difference]: Start difference. First operand 67 states and 70 transitions. Second operand has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:37,754 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:37,755 INFO L93 Difference]: Finished difference Result 65 states and 68 transitions. [2025-03-17 12:19:37,755 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:19:37,755 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 12:19:37,755 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:37,756 INFO L225 Difference]: With dead ends: 65 [2025-03-17 12:19:37,757 INFO L226 Difference]: Without dead ends: 65 [2025-03-17 12:19:37,757 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:19:37,757 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 6 mSDsluCounter, 60 mSDsCounter, 0 mSdLazyCounter, 72 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 75 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 72 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:37,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 113 Invalid, 75 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 72 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:19:37,759 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 65 states. [2025-03-17 12:19:37,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 65 to 65. [2025-03-17 12:19:37,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 65 states, 44 states have (on average 1.5454545454545454) internal successors, (68), 64 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:37,762 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 65 states to 65 states and 68 transitions. [2025-03-17 12:19:37,762 INFO L78 Accepts]: Start accepts. Automaton has 65 states and 68 transitions. Word has length 15 [2025-03-17 12:19:37,762 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:37,762 INFO L471 AbstractCegarLoop]: Abstraction has 65 states and 68 transitions. [2025-03-17 12:19:37,762 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.0) internal successors, (15), 4 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:37,763 INFO L276 IsEmpty]: Start isEmpty. Operand 65 states and 68 transitions. [2025-03-17 12:19:37,764 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2025-03-17 12:19:37,764 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:37,764 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:37,764 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2025-03-17 12:19:37,764 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-17 12:19:37,764 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:37,765 INFO L85 PathProgramCache]: Analyzing trace with hash 1843182520, now seen corresponding path program 1 times [2025-03-17 12:19:37,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:37,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1384365162] [2025-03-17 12:19:37,765 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:37,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:37,785 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 12:19:37,790 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 12:19:37,790 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:37,790 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:37,830 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:37,830 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:37,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1384365162] [2025-03-17 12:19:37,830 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1384365162] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:37,830 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1447581214] [2025-03-17 12:19:37,831 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:37,831 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:37,831 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:19:37,833 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:19:37,834 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2025-03-17 12:19:37,889 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 15 statements into 1 equivalence classes. [2025-03-17 12:19:37,910 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 15 of 15 statements. [2025-03-17 12:19:37,911 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:37,911 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:37,913 INFO L256 TraceCheckSpWp]: Trace formula consists of 181 conjuncts, 5 conjuncts are in the unsatisfiable core [2025-03-17 12:19:37,915 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:19:37,952 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:37,953 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:19:37,984 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:37,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1447581214] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:19:37,985 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:19:37,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 5 [2025-03-17 12:19:37,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [208874096] [2025-03-17 12:19:37,986 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:19:37,986 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:19:37,986 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:37,987 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:19:37,987 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:19:37,987 INFO L87 Difference]: Start difference. First operand 65 states and 68 transitions. Second operand has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:38,001 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:38,001 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2025-03-17 12:19:38,001 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:19:38,001 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2025-03-17 12:19:38,002 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:38,002 INFO L225 Difference]: With dead ends: 81 [2025-03-17 12:19:38,002 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 12:19:38,002 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 27 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=15, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:19:38,003 INFO L435 NwaCegarLoop]: 61 mSDtfsCounter, 15 mSDsluCounter, 63 mSDsCounter, 0 mSdLazyCounter, 11 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 124 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 11 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:38,003 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 124 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 11 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:19:38,004 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 12:19:38,005 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 79. [2025-03-17 12:19:38,005 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 58 states have (on average 1.4482758620689655) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:38,008 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2025-03-17 12:19:38,009 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 15 [2025-03-17 12:19:38,009 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:38,009 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2025-03-17 12:19:38,009 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 4.666666666666667) internal successors, (28), 5 states have internal predecessors, (28), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:38,009 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2025-03-17 12:19:38,009 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2025-03-17 12:19:38,009 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:38,009 INFO L218 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:38,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2025-03-17 12:19:38,210 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:38,210 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-17 12:19:38,210 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:38,211 INFO L85 PathProgramCache]: Analyzing trace with hash 1771411922, now seen corresponding path program 1 times [2025-03-17 12:19:38,211 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:38,211 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1775465339] [2025-03-17 12:19:38,211 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:38,211 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:38,223 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 12:19:38,234 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 12:19:38,235 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:38,235 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:38,382 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:38,383 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:38,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1775465339] [2025-03-17 12:19:38,383 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1775465339] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:38,383 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1902092797] [2025-03-17 12:19:38,383 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:38,383 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:38,383 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:19:38,385 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:19:38,387 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2025-03-17 12:19:38,451 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 17 statements into 1 equivalence classes. [2025-03-17 12:19:38,472 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 17 of 17 statements. [2025-03-17 12:19:38,473 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:38,473 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:38,474 INFO L256 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 13 conjuncts are in the unsatisfiable core [2025-03-17 12:19:38,475 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:19:38,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:19:38,539 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:19:38,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 12:19:38,570 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:38,571 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:19:38,666 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:38,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1902092797] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:19:38,666 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:19:38,666 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 8 [2025-03-17 12:19:38,667 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1369712857] [2025-03-17 12:19:38,667 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:19:38,667 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2025-03-17 12:19:38,667 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:38,667 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2025-03-17 12:19:38,668 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2025-03-17 12:19:38,668 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:38,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:38,758 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2025-03-17 12:19:38,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:19:38,758 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2025-03-17 12:19:38,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:38,759 INFO L225 Difference]: With dead ends: 77 [2025-03-17 12:19:38,759 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 12:19:38,759 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 38 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2025-03-17 12:19:38,759 INFO L435 NwaCegarLoop]: 53 mSDtfsCounter, 13 mSDsluCounter, 98 mSDsCounter, 0 mSdLazyCounter, 87 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 87 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:38,759 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 151 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 87 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:19:38,760 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 12:19:38,761 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-17 12:19:38,761 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 58 states have (on average 1.3793103448275863) internal successors, (80), 76 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:38,761 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2025-03-17 12:19:38,765 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 17 [2025-03-17 12:19:38,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:38,766 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2025-03-17 12:19:38,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 4.125) internal successors, (33), 9 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:38,769 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2025-03-17 12:19:38,770 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:19:38,770 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:38,770 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:38,776 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2025-03-17 12:19:38,974 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable9 [2025-03-17 12:19:38,974 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-17 12:19:38,974 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:38,974 INFO L85 PathProgramCache]: Analyzing trace with hash 1902624482, now seen corresponding path program 1 times [2025-03-17 12:19:38,974 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:38,975 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [21788712] [2025-03-17 12:19:38,975 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:38,975 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:38,996 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:19:39,008 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:19:39,009 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:39,009 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:39,109 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 12:19:39,110 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:39,110 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [21788712] [2025-03-17 12:19:39,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [21788712] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:19:39,110 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:19:39,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2025-03-17 12:19:39,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1180762523] [2025-03-17 12:19:39,110 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:19:39,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2025-03-17 12:19:39,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:39,111 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2025-03-17 12:19:39,111 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:19:39,111 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:39,168 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:39,168 INFO L93 Difference]: Finished difference Result 74 states and 78 transitions. [2025-03-17 12:19:39,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2025-03-17 12:19:39,169 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-17 12:19:39,169 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:39,169 INFO L225 Difference]: With dead ends: 74 [2025-03-17 12:19:39,169 INFO L226 Difference]: Without dead ends: 74 [2025-03-17 12:19:39,170 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2025-03-17 12:19:39,170 INFO L435 NwaCegarLoop]: 45 mSDtfsCounter, 14 mSDsluCounter, 34 mSDsCounter, 0 mSdLazyCounter, 75 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 14 SdHoareTripleChecker+Valid, 79 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 75 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:39,170 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [14 Valid, 79 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 75 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:19:39,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2025-03-17 12:19:39,172 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2025-03-17 12:19:39,172 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 59 states have (on average 1.3220338983050848) internal successors, (78), 73 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:39,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 78 transitions. [2025-03-17 12:19:39,172 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 78 transitions. Word has length 35 [2025-03-17 12:19:39,173 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:39,173 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 78 transitions. [2025-03-17 12:19:39,173 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 5.666666666666667) internal successors, (17), 4 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:39,173 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 78 transitions. [2025-03-17 12:19:39,173 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 36 [2025-03-17 12:19:39,173 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:39,173 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:39,174 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2025-03-17 12:19:39,174 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-17 12:19:39,174 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:39,174 INFO L85 PathProgramCache]: Analyzing trace with hash 1902624483, now seen corresponding path program 1 times [2025-03-17 12:19:39,174 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:39,174 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1435521804] [2025-03-17 12:19:39,174 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:39,174 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:39,197 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 35 statements into 1 equivalence classes. [2025-03-17 12:19:39,209 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 35 of 35 statements. [2025-03-17 12:19:39,209 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:39,209 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:39,409 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 12:19:39,409 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:39,409 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1435521804] [2025-03-17 12:19:39,409 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1435521804] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:19:39,409 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:19:39,410 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:19:39,410 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2147024462] [2025-03-17 12:19:39,410 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:19:39,410 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:19:39,410 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:39,410 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:19:39,410 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:19:39,411 INFO L87 Difference]: Start difference. First operand 74 states and 78 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:39,504 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:39,505 INFO L93 Difference]: Finished difference Result 81 states and 84 transitions. [2025-03-17 12:19:39,505 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2025-03-17 12:19:39,506 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 35 [2025-03-17 12:19:39,506 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:39,506 INFO L225 Difference]: With dead ends: 81 [2025-03-17 12:19:39,506 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 12:19:39,506 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 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-03-17 12:19:39,507 INFO L435 NwaCegarLoop]: 46 mSDtfsCounter, 10 mSDsluCounter, 74 mSDsCounter, 0 mSdLazyCounter, 109 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 120 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 109 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:39,507 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 120 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 109 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:19:39,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 12:19:39,509 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 77. [2025-03-17 12:19:39,509 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.3064516129032258) internal successors, (81), 76 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:39,509 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 81 transitions. [2025-03-17 12:19:39,509 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 81 transitions. Word has length 35 [2025-03-17 12:19:39,510 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:39,510 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 81 transitions. [2025-03-17 12:19:39,510 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:39,510 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 81 transitions. [2025-03-17 12:19:39,510 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2025-03-17 12:19:39,510 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:39,510 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:39,511 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2025-03-17 12:19:39,511 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-17 12:19:39,511 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:39,511 INFO L85 PathProgramCache]: Analyzing trace with hash -405558154, now seen corresponding path program 1 times [2025-03-17 12:19:39,511 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:39,511 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [984626359] [2025-03-17 12:19:39,511 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:39,511 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:39,533 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 12:19:39,572 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 12:19:39,573 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:39,573 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:40,065 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 17 proven. 11 refuted. 0 times theorem prover too weak. 12 trivial. 0 not checked. [2025-03-17 12:19:40,065 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:40,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [984626359] [2025-03-17 12:19:40,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [984626359] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:40,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1523607517] [2025-03-17 12:19:40,066 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:40,066 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:40,066 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:19:40,068 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:19:40,069 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2025-03-17 12:19:40,153 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 39 statements into 1 equivalence classes. [2025-03-17 12:19:40,214 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 39 of 39 statements. [2025-03-17 12:19:40,214 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:40,215 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:40,217 INFO L256 TraceCheckSpWp]: Trace formula consists of 424 conjuncts, 43 conjuncts are in the unsatisfiable core [2025-03-17 12:19:40,219 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:19:40,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:19:40,408 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:19:40,408 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:19:40,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:19:40,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:19:40,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2025-03-17 12:19:40,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 12:19:40,579 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2025-03-17 12:19:40,624 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 13 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 12:19:40,624 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:19:40,653 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= (select (select (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_843 (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (store (select |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_843 .cse0))))))) is different from false [2025-03-17 12:19:40,670 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= v_ArrVal_843 (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (store (select |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_843 .cse0))))))) is different from false [2025-03-17 12:19:40,681 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_843 (Array Int Int)) (v_ArrVal_842 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int)) (let ((.cse0 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_842))) (or (= (select (select (store .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_843) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_843 (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4))) (store (select .cse0 |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse1 (select v_ArrVal_843 .cse1)))))))) is different from false [2025-03-17 12:19:40,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:40,694 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 40 [2025-03-17 12:19:40,706 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:40,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 160 treesize of output 160 [2025-03-17 12:19:40,724 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2025-03-17 12:19:40,725 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 62 treesize of output 76 [2025-03-17 12:19:40,768 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2025-03-17 12:19:40,812 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2025-03-17 12:19:40,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 45 [2025-03-17 12:19:40,832 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:40,833 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 59 [2025-03-17 12:19:40,885 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2025-03-17 12:19:40,886 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 58 [2025-03-17 12:19:40,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:40,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2025-03-17 12:19:40,926 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:40,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2025-03-17 12:19:40,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 62 treesize of output 56 [2025-03-17 12:19:41,160 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 22 refuted. 0 times theorem prover too weak. 8 trivial. 10 not checked. [2025-03-17 12:19:41,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1523607517] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:19:41,161 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:19:41,161 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 28 [2025-03-17 12:19:41,161 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1228485386] [2025-03-17 12:19:41,161 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:19:41,161 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2025-03-17 12:19:41,162 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:41,163 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2025-03-17 12:19:41,163 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=569, Unknown=3, NotChecked=150, Total=812 [2025-03-17 12:19:41,163 INFO L87 Difference]: Start difference. First operand 77 states and 81 transitions. Second operand has 29 states, 29 states have (on average 3.0) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:41,562 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:41,562 INFO L93 Difference]: Finished difference Result 77 states and 80 transitions. [2025-03-17 12:19:41,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2025-03-17 12:19:41,563 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 29 states have (on average 3.0) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2025-03-17 12:19:41,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:41,564 INFO L225 Difference]: With dead ends: 77 [2025-03-17 12:19:41,564 INFO L226 Difference]: Without dead ends: 77 [2025-03-17 12:19:41,565 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 62 SyntacticMatches, 0 SemanticMatches, 34 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 217 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=199, Invalid=866, Unknown=3, NotChecked=192, Total=1260 [2025-03-17 12:19:41,565 INFO L435 NwaCegarLoop]: 41 mSDtfsCounter, 18 mSDsluCounter, 573 mSDsCounter, 0 mSdLazyCounter, 456 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 614 SdHoareTripleChecker+Invalid, 563 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 456 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 102 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:41,565 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 614 Invalid, 563 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 456 Invalid, 0 Unknown, 102 Unchecked, 0.2s Time] [2025-03-17 12:19:41,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2025-03-17 12:19:41,570 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 77. [2025-03-17 12:19:41,570 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 62 states have (on average 1.2903225806451613) internal successors, (80), 76 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:41,570 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 80 transitions. [2025-03-17 12:19:41,571 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 80 transitions. Word has length 39 [2025-03-17 12:19:41,571 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:41,571 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 80 transitions. [2025-03-17 12:19:41,571 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 29 states have (on average 3.0) internal successors, (87), 28 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:41,571 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 80 transitions. [2025-03-17 12:19:41,571 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:19:41,571 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:41,571 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:41,583 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2025-03-17 12:19:41,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:41,772 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr17REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-17 12:19:41,772 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:41,772 INFO L85 PathProgramCache]: Analyzing trace with hash 1164516040, now seen corresponding path program 1 times [2025-03-17 12:19:41,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:41,773 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1907715832] [2025-03-17 12:19:41,773 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:41,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:41,791 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:19:41,836 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:19:41,836 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:41,836 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:42,488 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 6 proven. 33 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2025-03-17 12:19:42,488 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:42,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1907715832] [2025-03-17 12:19:42,488 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1907715832] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:42,488 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [740430118] [2025-03-17 12:19:42,488 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:42,489 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:42,489 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:19:42,490 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:19:42,492 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2025-03-17 12:19:42,584 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:19:42,634 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:19:42,635 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:42,635 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:42,642 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 51 conjuncts are in the unsatisfiable core [2025-03-17 12:19:42,645 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:19:42,682 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2025-03-17 12:19:42,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 16 [2025-03-17 12:19:42,719 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2025-03-17 12:19:42,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2025-03-17 12:19:42,774 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2025-03-17 12:19:42,774 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 16 treesize of output 18 [2025-03-17 12:19:42,798 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2025-03-17 12:19:42,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2025-03-17 12:19:42,838 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2025-03-17 12:19:42,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 41 [2025-03-17 12:19:42,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 23 [2025-03-17 12:19:42,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 19 [2025-03-17 12:19:42,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 19 [2025-03-17 12:19:42,941 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2025-03-17 12:19:42,944 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 4 proven. 36 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2025-03-17 12:19:42,944 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:19:43,016 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1087 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1087) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) 1)) is different from false [2025-03-17 12:19:43,026 INFO L349 Elim1Store]: treesize reduction 5, result has 75.0 percent of original size [2025-03-17 12:19:43,026 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 23 [2025-03-17 12:19:47,084 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1087 (Array Int Int)) (v_ArrVal_1086 (Array Int Int)) (v_ArrVal_1085 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1085) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1086) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1087) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1085 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1085)))) is different from false [2025-03-17 12:19:47,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 142 treesize of output 140 [2025-03-17 12:19:47,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 29 treesize of output 25 [2025-03-17 12:19:47,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 16 [2025-03-17 12:19:47,251 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2025-03-17 12:19:47,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 15 [2025-03-17 12:19:47,258 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 8 proven. 24 refuted. 1 times theorem prover too weak. 2 trivial. 6 not checked. [2025-03-17 12:19:47,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [740430118] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:19:47,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:19:47,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 36 [2025-03-17 12:19:47,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [780284339] [2025-03-17 12:19:47,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:19:47,260 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 37 states [2025-03-17 12:19:47,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:47,261 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 37 interpolants. [2025-03-17 12:19:47,262 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1046, Unknown=24, NotChecked=134, Total=1332 [2025-03-17 12:19:47,262 INFO L87 Difference]: Start difference. First operand 77 states and 80 transitions. Second operand has 37 states, 36 states have (on average 2.888888888888889) internal successors, (104), 37 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:47,900 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:47,900 INFO L93 Difference]: Finished difference Result 81 states and 87 transitions. [2025-03-17 12:19:47,901 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2025-03-17 12:19:47,901 INFO L78 Accepts]: Start accepts. Automaton has has 37 states, 36 states have (on average 2.888888888888889) internal successors, (104), 37 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-17 12:19:47,901 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:47,901 INFO L225 Difference]: With dead ends: 81 [2025-03-17 12:19:47,901 INFO L226 Difference]: Without dead ends: 81 [2025-03-17 12:19:47,902 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 110 GetRequests, 62 SyntacticMatches, 3 SemanticMatches, 45 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 567 ImplicationChecksByTransitivity, 4.7s TimeCoverageRelationStatistics Valid=290, Invalid=1673, Unknown=25, NotChecked=174, Total=2162 [2025-03-17 12:19:47,903 INFO L435 NwaCegarLoop]: 27 mSDtfsCounter, 42 mSDsluCounter, 393 mSDsCounter, 0 mSdLazyCounter, 720 mSolverCounterSat, 31 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 42 SdHoareTripleChecker+Valid, 420 SdHoareTripleChecker+Invalid, 860 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 31 IncrementalHoareTripleChecker+Valid, 720 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 109 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:47,903 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [42 Valid, 420 Invalid, 860 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [31 Valid, 720 Invalid, 0 Unknown, 109 Unchecked, 0.3s Time] [2025-03-17 12:19:47,903 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2025-03-17 12:19:47,904 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2025-03-17 12:19:47,904 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 66 states have (on average 1.3181818181818181) internal successors, (87), 80 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:47,906 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 87 transitions. [2025-03-17 12:19:47,906 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 87 transitions. Word has length 41 [2025-03-17 12:19:47,907 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:47,907 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 87 transitions. [2025-03-17 12:19:47,907 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 37 states, 36 states have (on average 2.888888888888889) internal successors, (104), 37 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:47,907 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 87 transitions. [2025-03-17 12:19:47,908 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2025-03-17 12:19:47,909 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:47,909 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:47,916 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2025-03-17 12:19:48,109 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:48,110 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-17 12:19:48,110 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:48,110 INFO L85 PathProgramCache]: Analyzing trace with hash 1164516041, now seen corresponding path program 1 times [2025-03-17 12:19:48,110 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:48,110 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230435243] [2025-03-17 12:19:48,110 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:48,110 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:48,135 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:19:48,180 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:19:48,180 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:48,180 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:49,136 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 2 proven. 39 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:49,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:49,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230435243] [2025-03-17 12:19:49,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230435243] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:49,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1052989685] [2025-03-17 12:19:49,137 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:49,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:49,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:19:49,140 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:19:49,141 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2025-03-17 12:19:49,233 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 41 statements into 1 equivalence classes. [2025-03-17 12:19:49,277 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 41 of 41 statements. [2025-03-17 12:19:49,277 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:49,277 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:49,280 INFO L256 TraceCheckSpWp]: Trace formula consists of 454 conjuncts, 77 conjuncts are in the unsatisfiable core [2025-03-17 12:19:49,285 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:19:49,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2025-03-17 12:19:49,311 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2025-03-17 12:19:49,397 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2025-03-17 12:19:49,398 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2025-03-17 12:19:49,407 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2025-03-17 12:19:49,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2025-03-17 12:19:49,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:19:49,456 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:19:49,497 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:19:49,504 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:19:49,524 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:19:49,524 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2025-03-17 12:19:49,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 12:19:49,626 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2025-03-17 12:19:49,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 29 treesize of output 28 [2025-03-17 12:19:49,644 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2025-03-17 12:19:49,644 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 18 [2025-03-17 12:19:49,743 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 12:19:49,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 49 [2025-03-17 12:19:49,750 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 12:19:49,750 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2025-03-17 12:19:49,914 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 12:19:49,914 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 66 treesize of output 49 [2025-03-17 12:19:49,920 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2025-03-17 12:19:49,921 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 73 treesize of output 64 [2025-03-17 12:19:49,958 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:49,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 46 [2025-03-17 12:19:49,968 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:49,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 42 [2025-03-17 12:19:50,122 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 7 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2025-03-17 12:19:50,122 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:19:50,443 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (or (forall ((v_ArrVal_1338 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (forall ((v_ArrVal_1337 (Array Int Int))) (< 0 (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1337) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) 1)))) (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1337) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< (+ .cse1 3) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1337 (Array Int Int))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1337) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (< 0 (+ .cse2 1)) (= .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (= .cse3 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< (+ (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1337) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) 3) (select |c_#length| .cse3))))))) is different from false [2025-03-17 12:19:50,539 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse2 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (or (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1336 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1336 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1336)) (= (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1337 (Array Int Int)) (v_ArrVal_1335 (Array Int Int))) (or (< 0 (+ (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1335) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1337) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1) 1)) (not (= (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1335 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1335))))) (forall ((v_ArrVal_1335 (Array Int Int))) (or (forall ((v_ArrVal_1337 (Array Int Int))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1335) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1337) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse3) (< 0 (+ .cse3 1))))) (not (= (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1335 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1335)))) (forall ((v_ArrVal_1335 (Array Int Int))) (or (forall ((v_ArrVal_1336 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1336 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1336)) (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (< (+ 3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1335) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1337) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)) (select |c_#length| .cse4)) (= .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) (not (= (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1335 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1335)))) (forall ((v_ArrVal_1335 (Array Int Int))) (or (forall ((v_ArrVal_1336 (Array Int Int))) (or (not (= (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1336 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1336)) (forall ((v_ArrVal_1338 (Array Int Int)) (v_ArrVal_1337 (Array Int Int))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1335) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1337) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| .cse5) (< (+ 3 .cse5) (select |c_#length| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1336) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1338) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1)))))))) (not (= (store .cse2 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1335 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1335)))))) is different from false [2025-03-17 12:19:50,568 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 72 treesize of output 70 [2025-03-17 12:19:50,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 129 treesize of output 127 [2025-03-17 12:19:50,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-17 12:19:50,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 19 [2025-03-17 12:19:50,608 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:19:50,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2025-03-17 12:19:50,619 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:50,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-17 12:19:50,623 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 8 [2025-03-17 12:19:50,626 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:19:50,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 24 [2025-03-17 12:19:50,636 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:50,636 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-17 12:19:50,640 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 10 [2025-03-17 12:19:50,645 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:19:50,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 45 [2025-03-17 12:19:50,651 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:19:50,654 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 30 [2025-03-17 12:19:50,666 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:50,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 14 treesize of output 8 [2025-03-17 12:19:50,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 12 [2025-03-17 12:19:50,676 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:19:50,678 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 31 [2025-03-17 12:19:50,683 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:19:50,684 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 1 [2025-03-17 12:19:50,861 INFO L134 CoverageAnalysis]: Checked inductivity of 41 backedges. 26 proven. 5 refuted. 0 times theorem prover too weak. 8 trivial. 2 not checked. [2025-03-17 12:19:50,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1052989685] provided 0 perfect and 2 imperfect interpolant sequences [2025-03-17 12:19:50,861 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2025-03-17 12:19:50,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 12, 12] total 40 [2025-03-17 12:19:50,862 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1740033772] [2025-03-17 12:19:50,862 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2025-03-17 12:19:50,862 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 41 states [2025-03-17 12:19:50,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:50,862 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 41 interpolants. [2025-03-17 12:19:50,863 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=1352, Unknown=2, NotChecked=150, Total=1640 [2025-03-17 12:19:50,863 INFO L87 Difference]: Start difference. First operand 81 states and 87 transitions. Second operand has 41 states, 40 states have (on average 2.65) internal successors, (106), 41 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:52,235 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:52,235 INFO L93 Difference]: Finished difference Result 87 states and 91 transitions. [2025-03-17 12:19:52,235 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2025-03-17 12:19:52,236 INFO L78 Accepts]: Start accepts. Automaton has has 41 states, 40 states have (on average 2.65) internal successors, (106), 41 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2025-03-17 12:19:52,236 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:52,236 INFO L225 Difference]: With dead ends: 87 [2025-03-17 12:19:52,236 INFO L226 Difference]: Without dead ends: 87 [2025-03-17 12:19:52,237 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 118 GetRequests, 61 SyntacticMatches, 2 SemanticMatches, 55 ConstructedPredicates, 2 IntricatePredicates, 1 DeprecatedPredicates, 670 ImplicationChecksByTransitivity, 1.6s TimeCoverageRelationStatistics Valid=385, Invalid=2591, Unknown=2, NotChecked=214, Total=3192 [2025-03-17 12:19:52,238 INFO L435 NwaCegarLoop]: 29 mSDtfsCounter, 64 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 913 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 64 SdHoareTripleChecker+Valid, 449 SdHoareTripleChecker+Invalid, 1073 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 913 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:52,238 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [64 Valid, 449 Invalid, 1073 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 913 Invalid, 0 Unknown, 130 Unchecked, 0.5s Time] [2025-03-17 12:19:52,238 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2025-03-17 12:19:52,239 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 83. [2025-03-17 12:19:52,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 82 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:52,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2025-03-17 12:19:52,239 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 41 [2025-03-17 12:19:52,240 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:52,240 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2025-03-17 12:19:52,240 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 41 states, 40 states have (on average 2.65) internal successors, (106), 41 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:52,240 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2025-03-17 12:19:52,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 12:19:52,240 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:52,240 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:52,247 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2025-03-17 12:19:52,441 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2025-03-17 12:19:52,441 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr9REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-17 12:19:52,442 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:52,442 INFO L85 PathProgramCache]: Analyzing trace with hash -1886534155, now seen corresponding path program 1 times [2025-03-17 12:19:52,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:52,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [734223419] [2025-03-17 12:19:52,442 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:52,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:52,460 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 12:19:52,468 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 12:19:52,468 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:52,468 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:52,559 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 40 trivial. 0 not checked. [2025-03-17 12:19:52,560 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:52,560 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [734223419] [2025-03-17 12:19:52,560 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [734223419] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:19:52,560 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:19:52,560 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2025-03-17 12:19:52,560 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [485241488] [2025-03-17 12:19:52,560 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:19:52,561 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2025-03-17 12:19:52,561 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:52,561 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2025-03-17 12:19:52,561 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:19:52,562 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:52,610 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:52,611 INFO L93 Difference]: Finished difference Result 85 states and 89 transitions. [2025-03-17 12:19:52,611 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2025-03-17 12:19:52,611 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-17 12:19:52,611 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:52,612 INFO L225 Difference]: With dead ends: 85 [2025-03-17 12:19:52,612 INFO L226 Difference]: Without dead ends: 85 [2025-03-17 12:19:52,612 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2025-03-17 12:19:52,612 INFO L435 NwaCegarLoop]: 43 mSDtfsCounter, 13 mSDsluCounter, 38 mSDsCounter, 0 mSdLazyCounter, 63 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 81 SdHoareTripleChecker+Invalid, 68 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 63 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:52,612 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 81 Invalid, 68 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 63 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2025-03-17 12:19:52,612 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 85 states. [2025-03-17 12:19:52,613 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 85 to 81. [2025-03-17 12:19:52,614 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 80 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:52,614 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2025-03-17 12:19:52,614 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 43 [2025-03-17 12:19:52,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:52,614 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2025-03-17 12:19:52,614 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.25) internal successors, (25), 5 states have internal predecessors, (25), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:52,614 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2025-03-17 12:19:52,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 44 [2025-03-17 12:19:52,617 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:52,617 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:52,617 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2025-03-17 12:19:52,617 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-17 12:19:52,617 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:52,617 INFO L85 PathProgramCache]: Analyzing trace with hash -1886534154, now seen corresponding path program 1 times [2025-03-17 12:19:52,617 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:52,617 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [650285938] [2025-03-17 12:19:52,618 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:52,618 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:52,633 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 43 statements into 1 equivalence classes. [2025-03-17 12:19:52,640 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 43 of 43 statements. [2025-03-17 12:19:52,644 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:52,644 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:52,795 INFO L134 CoverageAnalysis]: Checked inductivity of 40 backedges. 19 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2025-03-17 12:19:52,795 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:52,795 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [650285938] [2025-03-17 12:19:52,795 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [650285938] provided 1 perfect and 0 imperfect interpolant sequences [2025-03-17 12:19:52,796 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2025-03-17 12:19:52,796 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2025-03-17 12:19:52,796 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1611273032] [2025-03-17 12:19:52,796 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2025-03-17 12:19:52,796 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2025-03-17 12:19:52,796 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2025-03-17 12:19:52,797 INFO L144 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2025-03-17 12:19:52,797 INFO L146 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2025-03-17 12:19:52,797 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:52,873 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2025-03-17 12:19:52,873 INFO L93 Difference]: Finished difference Result 84 states and 88 transitions. [2025-03-17 12:19:52,873 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2025-03-17 12:19:52,873 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 43 [2025-03-17 12:19:52,874 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2025-03-17 12:19:52,874 INFO L225 Difference]: With dead ends: 84 [2025-03-17 12:19:52,874 INFO L226 Difference]: Without dead ends: 84 [2025-03-17 12:19:52,874 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2025-03-17 12:19:52,875 INFO L435 NwaCegarLoop]: 35 mSDtfsCounter, 16 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 106 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2025-03-17 12:19:52,875 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 111 Invalid, 106 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2025-03-17 12:19:52,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 84 states. [2025-03-17 12:19:52,876 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 84 to 80. [2025-03-17 12:19:52,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 79 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:52,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2025-03-17 12:19:52,878 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 43 [2025-03-17 12:19:52,878 INFO L84 Accepts]: Finished accepts. word is rejected. [2025-03-17 12:19:52,878 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2025-03-17 12:19:52,878 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.2) internal successors, (31), 6 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2025-03-17 12:19:52,878 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2025-03-17 12:19:52,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2025-03-17 12:19:52,880 INFO L210 NwaCegarLoop]: Found error trace [2025-03-17 12:19:52,880 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2025-03-17 12:19:52,880 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2025-03-17 12:19:52,880 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 32 more)] === [2025-03-17 12:19:52,880 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2025-03-17 12:19:52,880 INFO L85 PathProgramCache]: Analyzing trace with hash -497506980, now seen corresponding path program 1 times [2025-03-17 12:19:52,880 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2025-03-17 12:19:52,880 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1953851301] [2025-03-17 12:19:52,881 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:52,881 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2025-03-17 12:19:52,895 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 12:19:52,934 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 12:19:52,934 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:52,934 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:54,222 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:54,222 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2025-03-17 12:19:54,222 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1953851301] [2025-03-17 12:19:54,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1953851301] provided 0 perfect and 1 imperfect interpolant sequences [2025-03-17 12:19:54,223 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1424116140] [2025-03-17 12:19:54,223 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2025-03-17 12:19:54,223 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2025-03-17 12:19:54,223 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2025-03-17 12:19:54,225 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2025-03-17 12:19:54,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2025-03-17 12:19:54,328 INFO L108 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY partitioned 45 statements into 1 equivalence classes. [2025-03-17 12:19:54,369 INFO L111 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) and asserted 45 of 45 statements. [2025-03-17 12:19:54,369 INFO L114 AnnotateAndAsserter]: Assert order NOT_INCREMENTALLY issued 1 check-sat command(s) [2025-03-17 12:19:54,369 INFO L115 AnnotateAndAsserter]: Conjunction of SSA is unsat [2025-03-17 12:19:54,371 INFO L256 TraceCheckSpWp]: Trace formula consists of 463 conjuncts, 94 conjuncts are in the unsatisfiable core [2025-03-17 12:19:54,377 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2025-03-17 12:19:54,460 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2025-03-17 12:19:54,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2025-03-17 12:19:54,548 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2025-03-17 12:19:54,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2025-03-17 12:19:54,638 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:19:54,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:19:54,824 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2025-03-17 12:19:54,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 12:19:54,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2025-03-17 12:19:54,882 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2025-03-17 12:19:54,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:19:54,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:19:54,950 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:19:54,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:19:54,985 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2025-03-17 12:19:54,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 74 [2025-03-17 12:19:54,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 15 [2025-03-17 12:19:54,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2025-03-17 12:19:55,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 12:19:55,106 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 27 [2025-03-17 12:19:55,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2025-03-17 12:19:55,145 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-03-17 12:19:55,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 12:19:55,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:19:55,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2025-03-17 12:19:55,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2025-03-17 12:19:55,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2025-03-17 12:19:55,240 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2025-03-17 12:19:55,245 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2025-03-17 12:19:55,368 INFO L134 CoverageAnalysis]: Checked inductivity of 42 backedges. 5 proven. 37 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2025-03-17 12:19:55,368 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2025-03-17 12:19:55,741 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse2 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse1 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2)) (.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2))) (and (or (= .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_1851 (Array Int Int)) (v_prenex_24 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1851) .cse0) v_prenex_24)) (< .cse1 v_prenex_24) (< v_prenex_24 0)))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_ArrVal_1851 (Array Int Int))) (or (< .cse1 |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_34| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1851) .cse0) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~data_init~0#1|)))))) is different from false [2025-03-17 12:19:55,787 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) (or (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| .cse0) (forall ((v_ArrVal_1851 (Array Int Int)) (v_prenex_24 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1851) .cse0) v_prenex_24) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_24 0) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1) v_prenex_24)))))) (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1851 (Array Int Int))) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_34| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1851) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~data_init~0#1|))))) is different from false [2025-03-17 12:19:55,833 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1851 (Array Int Int))) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_34| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1851) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0)) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0))) (or (forall ((v_ArrVal_1851 (Array Int Int)) (v_prenex_24 Int)) (or (< (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0) v_prenex_24) (< v_prenex_24 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1851) .cse1) v_prenex_24) |c_ULTIMATE.start_main_~data_init~0#1|))) (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))))) is different from false [2025-03-17 12:19:56,225 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse4 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (and (forall ((v_ArrVal_1834 (Array Int Int))) (or (not (= v_ArrVal_1834 (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1834 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1835 (Array Int Int))) (or (forall ((v_ArrVal_1837 Int) (v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (let ((.cse1 (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1838) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2))) (or (= .cse1 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_ArrVal_1851 (Array Int Int)) (v_prenex_24 Int)) (or (< (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) v_prenex_24) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 v_ArrVal_1837)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1851) .cse1) v_prenex_24) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_24 0)))))) (not (= (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1835 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1835)))))) (forall ((v_ArrVal_1834 (Array Int Int))) (or (not (= v_ArrVal_1834 (store .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1834 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (forall ((v_ArrVal_1835 (Array Int Int))) (or (forall ((v_ArrVal_1837 Int) (|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_ArrVal_1833 (Array Int Int)) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1841 (Array Int Int)) (v_ArrVal_1840 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_ArrVal_1838 (Array Int Int)) (v_ArrVal_1836 (Array Int Int))) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_34| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1834) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1836) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1840) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 v_ArrVal_1837)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1851) (select (select (store (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1835) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1838) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1841) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2)) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)))) (not (= (store .cse4 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| (select v_ArrVal_1835 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) v_ArrVal_1835)))))))) is different from false [2025-03-17 12:19:56,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 855 treesize of output 851 [2025-03-17 12:19:56,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 463 treesize of output 459 [2025-03-17 12:19:56,266 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 459 treesize of output 451 [2025-03-17 12:19:56,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 451 treesize of output 435 [2025-03-17 12:19:56,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 513 treesize of output 509 [2025-03-17 12:19:56,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:56,304 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 525 treesize of output 556 [2025-03-17 12:19:56,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 505 treesize of output 497 [2025-03-17 12:19:56,345 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:56,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 4 case distinctions, treesize of input 497 treesize of output 528 [2025-03-17 12:19:56,362 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 477 treesize of output 473 [2025-03-17 12:19:56,387 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 473 treesize of output 465 [2025-03-17 12:19:56,407 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 465 treesize of output 457 [2025-03-17 12:19:56,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 457 treesize of output 453 [2025-03-17 12:19:56,663 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:56,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-17 12:19:56,717 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:56,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 12:19:56,732 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:56,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-17 12:19:57,625 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:57,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 45 [2025-03-17 12:19:57,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:57,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2025-03-17 12:19:58,044 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:58,045 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2025-03-17 12:19:58,082 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:58,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 12:19:58,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:58,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 45 [2025-03-17 12:19:58,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:58,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 12:19:58,269 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:58,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2025-03-17 12:19:58,682 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:58,682 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2025-03-17 12:19:58,710 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:58,710 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 12:19:58,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:58,739 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 45 [2025-03-17 12:19:58,768 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:58,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 12:19:58,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:58,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2025-03-17 12:19:59,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:59,152 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 46 [2025-03-17 12:19:59,183 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:59,183 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 29 [2025-03-17 12:19:59,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 27 [2025-03-17 12:19:59,303 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:59,303 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-17 12:19:59,435 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:59,435 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-17 12:19:59,574 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:19:59,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-17 12:20:00,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:00,461 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 47 treesize of output 45 [2025-03-17 12:20:00,495 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:00,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2025-03-17 12:20:00,518 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:00,518 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2025-03-17 12:20:00,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:00,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 12:20:00,612 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:00,613 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 12:20:00,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:00,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2025-03-17 12:20:00,689 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:00,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 12:20:00,711 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:00,711 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 68 treesize of output 61 [2025-03-17 12:20:01,321 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:01,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 41 [2025-03-17 12:20:01,348 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:20:01,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 12:20:01,433 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:03,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:06,099 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:06,305 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:06,328 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:06,348 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:06,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:06,460 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:06,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:06,708 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:06,781 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:06,907 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:06,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:07,002 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:07,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5050 treesize of output 5014 [2025-03-17 12:20:08,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:08,199 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:08,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:08,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:08,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:08,355 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:08,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:08,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:08,769 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:08,791 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:08,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:09,031 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 6 [2025-03-17 12:20:09,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5011 treesize of output 4815 [2025-03-17 12:20:16,235 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse1 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse5 (not .cse0)) (.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse3 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse4 (not .cse1))) (and (or .cse0 (and (or .cse1 (forall ((v_prenex_2044 (Array Int Int)) (v_prenex_2045 (Array Int Int)) (v_arrayElimCell_110 Int) (v_prenex_2043 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_arrayElimCell_110)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2044) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2045) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2043)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2043) (= v_prenex_2043 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_2043 0)))) (forall ((v_prenex_2117 Int) (v_arrayElimArr_24 (Array Int Int)) (v_prenex_2114 Int) (v_prenex_2115 (Array Int Int)) (v_prenex_2116 (Array Int Int))) (or (= v_prenex_2114 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_2114 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2115) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2116) v_prenex_2117) v_prenex_2114) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 (select v_arrayElimArr_24 .cse3))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2115) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2116) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2114) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2114))) (or (forall ((v_prenex_2046 Int) (v_prenex_2048 (Array Int Int)) (v_prenex_2049 (Array Int Int)) (v_prenex_2047 (Array Int Int)) (v_prenex_2050 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2047) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2048) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2049) v_prenex_2050) v_prenex_2046) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2046 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2046) (= v_prenex_2046 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) .cse4))) (or (and (forall ((v_prenex_2037 (Array Int Int)) (v_prenex_2042 Int) (v_prenex_2038 (Array Int Int)) (v_prenex_2039 (Array Int Int)) (v_prenex_2040 Int) (v_prenex_2041 Int)) (or (< v_prenex_2041 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2041) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2039) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 v_prenex_2040)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2038) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2037) v_prenex_2042) v_prenex_2041) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2042 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (or .cse1 (forall ((v_prenex_1965 Int) (v_prenex_1963 (Array Int Int)) (v_prenex_1967 Int) (v_prenex_1964 (Array Int Int)) (v_prenex_1966 Int)) (or (= v_prenex_1967 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1966) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1965)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1964) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1963) v_prenex_1967) v_prenex_1966)) (< v_prenex_1966 0))))) .cse5) (or (and (or (and (forall ((v_prenex_1779 (Array Int Int)) (v_prenex_1981 Int) (v_prenex_1781 Int) (v_prenex_1780 Int) (v_prenex_1778 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1780)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1779) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1778))) (or (= (select (select .cse6 v_prenex_1981) v_prenex_1781) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1781 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1781) (= (select (select .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1781) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1987 Int) (v_prenex_1983 (Array Int Int)) (v_prenex_1984 (Array Int Int)) (v_prenex_1979 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1979) (< v_prenex_1979 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1987)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1984) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1983) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1979) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_1789 Int) (v_prenex_1788 Int) (v_prenex_1791 Int) (v_prenex_1790 Int) (v_prenex_1787 (Array Int Int)) (v_prenex_1786 (Array Int Int))) (let ((.cse7 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1788)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1787) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1786))) (or (= (select (select .cse7 v_prenex_1791) v_prenex_1789) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1789) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1789 0) (= (select (select .cse7 v_prenex_1790) v_prenex_1789) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1789)))) (forall ((v_prenex_1785 Int) (v_prenex_1784 Int) (v_prenex_1980 Int) (v_prenex_1783 (Array Int Int)) (v_prenex_1782 (Array Int Int))) (let ((.cse8 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1784)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1783) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1782))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1785) (< v_prenex_1785 0) (= (select (select .cse8 v_prenex_1980) v_prenex_1785) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1785)))))) .cse1) (forall ((v_prenex_1813 (Array Int Int)) (v_prenex_1814 (Array Int Int)) (v_prenex_1817 Int) (v_prenex_1816 Int) (v_prenex_1985 (Array Int Int)) (v_prenex_1815 Int)) (let ((.cse9 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1985) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 v_prenex_1815)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1814) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1813))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1816) (< v_prenex_1816 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1816)) (= (select (select .cse9 v_prenex_1817) v_prenex_1816) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1817 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (or (forall ((v_prenex_1833 Int) (v_prenex_1832 Int) (v_prenex_1831 (Array Int Int)) (v_prenex_1830 (Array Int Int)) (v_prenex_1835 Int) (v_prenex_1834 Int)) (let ((.cse10 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1832)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1831) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1830))) (or (< v_prenex_1833 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1833) (= (select (select .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1833) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse10 v_prenex_1835) v_prenex_1833) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1834 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse10 v_prenex_1834) v_prenex_1833))))) .cse1) (or (and (forall ((v_prenex_1846 (Array Int Int)) (v_prenex_1844 Int) (v_prenex_1845 (Array Int Int)) (v_prenex_1843 Int) (v_prenex_1842 Int) (v_arrayElimArr_12 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_12) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1845))) (or (= (select (select .cse11 v_prenex_1843) v_prenex_1842) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1843 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse11 v_prenex_1844) v_prenex_1842) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1842) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1842 0)))) (forall ((v_prenex_1801 (Array Int Int)) (v_prenex_1804 Int) (v_prenex_1841 (Array Int Int)) (v_prenex_1803 Int) (v_prenex_1800 (Array Int Int)) (v_prenex_1802 Int)) (let ((.cse12 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1841) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1801) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1800))) (or (< v_prenex_1802 0) (= (select (select .cse12 v_prenex_1803) v_prenex_1802) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1803 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse12 v_prenex_1804) v_prenex_1802) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1811 Int) (v_prenex_1847 (Array Int Int)) (v_prenex_1809 (Array Int Int)) (v_prenex_1810 (Array Int Int)) (v_prenex_1812 Int)) (or (< v_prenex_1811 0) (= v_prenex_1812 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1847) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1810) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1809) v_prenex_1812) v_prenex_1811) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_arrayElimArr_11 (Array Int Int)) (v_prenex_1806 (Array Int Int)) (v_prenex_1805 (Array Int Int)) (v_prenex_1808 Int) (v_prenex_1807 Int)) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_11) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1806) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1805))) (or (< v_prenex_1807 0) (= (select (select .cse13 v_prenex_1808) v_prenex_1807) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1808 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1807) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse4) (or (and (forall ((v_prenex_1799 Int) (v_prenex_1798 Int) (v_prenex_1840 Int) (v_prenex_1796 (Array Int Int)) (v_prenex_1982 (Array Int Int)) (v_prenex_1797 (Array Int Int))) (let ((.cse14 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1982) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1797) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1796))) (or (= (select (select .cse14 v_prenex_1840) v_prenex_1798) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse14 v_prenex_1799) v_prenex_1798) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1798) (= v_prenex_1799 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1798 0)))) (forall ((v_prenex_1837 (Array Int Int)) (v_prenex_1836 (Array Int Int)) (v_prenex_1839 Int) (v_prenex_1838 Int) (v_prenex_1986 (Array Int Int))) (or (= v_prenex_1839 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1838) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1986) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1836) v_prenex_1839) v_prenex_1838) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1838 0)))) .cse4) (or (and (forall ((v_prenex_1826 (Array Int Int)) (v_prenex_1825 (Array Int Int)) (v_prenex_1828 Int) (v_prenex_1827 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1827)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1826) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1825) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1828) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1828 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1828))) (forall ((v_prenex_1795 Int) (v_prenex_1794 Int) (v_prenex_1792 (Array Int Int)) (v_prenex_1793 (Array Int Int)) (v_prenex_1829 Int)) (let ((.cse15 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1794)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1793) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1792))) (or (< v_prenex_1795 0) (= (select (select .cse15 v_prenex_1829) v_prenex_1795) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1795) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1795))))) .cse1) (forall ((v_prenex_1822 Int) (v_prenex_1821 Int) (v_prenex_1819 (Array Int Int)) (v_prenex_1818 (Array Int Int)) (v_prenex_1820 (Array Int Int)) (v_prenex_1824 Int) (v_prenex_1823 Int)) (let ((.cse16 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1820) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 v_prenex_1821)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1819) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1818))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1822) (= (select (select .cse16 v_prenex_1824) v_prenex_1822) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse16 v_prenex_1823) v_prenex_1822) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1822)) (= v_prenex_1823 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1822 0))))) .cse0) (or (and (or .cse0 (forall ((v_prenex_1859 (Array Int Int)) (v_prenex_1858 (Array Int Int)) (v_prenex_1861 Int) (v_prenex_1860 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1860)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1859) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1858) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1861) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1861) (< v_prenex_1861 0)))) (or .cse0 (forall ((v_prenex_1866 Int) (v_prenex_1865 Int) (v_prenex_1864 Int) (v_prenex_1862 (Array Int Int)) (v_prenex_1863 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1864)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1863) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1862))) (or (= (select (select .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1865) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1865) (< v_prenex_1865 0) (= (select (select .cse17 v_prenex_1866) v_prenex_1865) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (forall ((v_prenex_1848 (Array Int Int)) (v_prenex_1852 Int) (v_prenex_1851 Int) (v_prenex_1850 Int) (v_prenex_1849 (Array Int Int))) (or (< v_prenex_1851 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1850)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1849) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1848) v_prenex_1852) v_prenex_1851) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1852 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1851))) .cse5) (forall ((v_prenex_1855 Int) (v_prenex_1853 (Array Int Int)) (v_prenex_1857 Int) (v_prenex_1989 Int) (v_prenex_1854 (Array Int Int)) (v_prenex_1856 Int)) (let ((.cse18 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1855)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1854) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1853))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1856) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse18 v_prenex_1989) v_prenex_1856)) (= (select (select .cse18 v_prenex_1857) v_prenex_1856) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1856 0) (= v_prenex_1857 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse18 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1856) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1991 Int) (v_prenex_1992 (Array Int Int)) (v_prenex_1990 Int) (v_prenex_1993 (Array Int Int)) (v_prenex_1988 Int)) (let ((.cse19 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1991)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1993) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1992))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1988) (< v_prenex_1988 0) (= (select (select .cse19 v_prenex_1990) v_prenex_1988) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse19 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1988) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1990 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse1) (or (forall ((v_prenex_2035 Int) (v_prenex_2036 Int) (v_prenex_2031 (Array Int Int)) (v_prenex_2032 (Array Int Int)) (v_prenex_2033 Int) (v_prenex_2034 Int)) (let ((.cse20 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_2033)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2032) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2031))) (or (= (select (select .cse20 v_prenex_2035) v_prenex_2034) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse20 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2034) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2034 0) (= v_prenex_2035 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse20 v_prenex_2036) v_prenex_2034) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2036 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2034)))) .cse1) (or (and (or (forall ((v_prenex_2149 Int) (v_prenex_2147 (Array Int Int)) (v_prenex_2145 (Array Int Int)) (v_prenex_2146 (Array Int Int)) (v_prenex_2144 Int)) (or (= v_prenex_2144 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_2144 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2144) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2145) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2146) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2147) v_prenex_2149) v_prenex_2144)))) .cse5) (forall ((v_prenex_2105 Int) (v_prenex_2148 Int) (v_prenex_2107 (Array Int Int)) (v_prenex_2109 Int) (v_prenex_2108 (Array Int Int)) (v_prenex_2106 (Array Int Int))) (let ((.cse21 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2106) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2107) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2108))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2105) (= v_prenex_2105 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_2105 0) (= (select (select .cse21 v_prenex_2148) v_prenex_2105) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse21 v_prenex_2109) v_prenex_2105) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse4) (forall ((v_prenex_2129 Int) (v_prenex_2124 Int) (v_prenex_2125 Int) (v_prenex_2130 Int) (v_prenex_2126 (Array Int Int)) (v_prenex_2127 (Array Int Int)) (v_prenex_2128 (Array Int Int))) (or (= v_prenex_2125 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_2125 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2125) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_2124)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2127) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2128) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2125)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2126) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 v_prenex_2124)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2127) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2128) v_prenex_2130) v_prenex_2125) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_prenex_2126 .cse3 v_prenex_2124)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2127) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2128) v_prenex_2129) v_prenex_2125) |c_ULTIMATE.start_main_~data_init~0#1|))) (or (forall ((v_ArrVal_1837 Int) (v_ArrVal_1833 (Array Int Int)) (v_prenex_2111 (Array Int Int)) (v_prenex_2113 Int) (v_prenex_2112 (Array Int Int)) (v_prenex_2110 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2110) (= v_prenex_2110 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 v_ArrVal_1837)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2111) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2112) v_prenex_2113) v_prenex_2110)) (< v_prenex_2110 0))) .cse5) (or .cse4 (and (forall ((v_prenex_1743 Int) (v_prenex_1738 (Array Int Int)) (v_prenex_1742 Int) (v_prenex_1741 Int) (v_prenex_1739 (Array Int Int)) (v_prenex_1740 (Array Int Int))) (let ((.cse22 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1739) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1740) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1738))) (or (= (select (select .cse22 v_prenex_1742) v_prenex_1741) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1741 0) (= (select (select .cse22 v_prenex_1743) v_prenex_1741) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1742 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= v_prenex_1743 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (or (and (forall ((v_prenex_1730 Int) (v_prenex_1729 Int) (v_prenex_1728 Int) (v_prenex_1732 (Array Int Int)) (v_prenex_1973 (Array Int Int)) (v_prenex_1731 (Array Int Int))) (let ((.cse23 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1973) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1732) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1731))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1728) (= v_prenex_1730 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse23 v_prenex_1729) v_prenex_1728) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse23 v_prenex_1730) v_prenex_1728)) (< v_prenex_1728 0)))) (forall ((v_arrayElimArr_32 (Array Int Int)) (v_prenex_1685 Int) (v_prenex_1682 (Array Int Int)) (v_prenex_1684 Int) (v_prenex_1683 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1684) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_32) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1683) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1682) v_prenex_1685) v_prenex_1684) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1685 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1684 0))) (forall ((v_arrayElimArr_33 (Array Int Int)) (v_prenex_1689 Int) (v_prenex_1688 Int) (v_prenex_1686 (Array Int Int)) (v_prenex_1690 Int) (v_prenex_1687 (Array Int Int))) (let ((.cse24 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_33) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1687) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1686))) (or (= (select (select .cse24 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1688) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1690 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse24 v_prenex_1690) v_prenex_1688) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1688 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse24 v_prenex_1689) v_prenex_1688)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1688))))) .cse5) (or (forall ((v_prenex_1749 (Array Int Int)) (v_arrayElimArr_34 (Array Int Int)) (v_prenex_1748 (Array Int Int)) (v_prenex_1751 Int) (v_prenex_1750 Int)) (or (< v_prenex_1750 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_34) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1749) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1748) v_prenex_1751) v_prenex_1750) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1750) (= v_prenex_1751 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse5) (or (forall ((v_prenex_1757 (Array Int Int)) (v_arrayElimArr_15 (Array Int Int)) (v_prenex_1759 Int) (v_prenex_1756 (Array Int Int)) (v_prenex_1758 Int)) (let ((.cse25 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_15) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1757) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1756))) (or (= v_prenex_1759 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse25 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1758)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse25 v_prenex_1759) v_prenex_1758)) (< v_prenex_1758 0)))) .cse0) (or (forall ((v_prenex_1755 Int) (v_prenex_1754 Int) (v_arrayElimArr_28 (Array Int Int)) (v_prenex_1752 (Array Int Int)) (v_prenex_1753 (Array Int Int))) (let ((.cse26 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_28) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1753) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1752))) (or (= v_prenex_1755 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1754 0) (= (select (select .cse26 v_prenex_1755) v_prenex_1754) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1754) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1754)))) .cse0) (or (and (forall ((v_prenex_1714 (Array Int Int)) (v_arrayElimArr_13 (Array Int Int)) (v_prenex_1715 (Array Int Int)) (v_prenex_1718 Int) (v_prenex_1717 Int) (v_prenex_1716 Int)) (let ((.cse27 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_13) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1715) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1714))) (or (= (select (select .cse27 v_prenex_1717) v_prenex_1716) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse27 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1716) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1718 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1716 0) (= (select (select .cse27 v_prenex_1718) v_prenex_1716) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1712 Int) (v_arrayElimArr_14 (Array Int Int)) (v_prenex_1710 (Array Int Int)) (v_prenex_1711 (Array Int Int)) (v_prenex_1713 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_14) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1711) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1710) v_prenex_1713) v_prenex_1712)) (< v_prenex_1712 0) (= v_prenex_1713 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_prenex_1775 Int) (v_prenex_1774 Int) (v_prenex_1773 Int) (v_prenex_1772 (Array Int Int)) (v_prenex_1776 (Array Int Int)) (v_prenex_1777 (Array Int Int))) (let ((.cse28 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1772) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1777) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1776))) (or (= (select (select .cse28 v_prenex_1775) v_prenex_1773) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1775 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1773 0) (= (select (select .cse28 v_prenex_1774) v_prenex_1773) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse5) (forall ((v_prenex_1978 (Array Int Int)) (v_prenex_1976 Int) (v_arrayElimArr_10 (Array Int Int)) (v_prenex_1977 (Array Int Int)) (v_prenex_1975 Int) (v_prenex_1974 Int)) (let ((.cse29 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1978) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1977))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse29 v_prenex_1975) v_prenex_1974)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse29 v_prenex_1976) v_prenex_1974)) (= v_prenex_1975 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1974 0) (= v_prenex_1976 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1974)))) (or (forall ((v_arrayElimArr_16 (Array Int Int)) (v_prenex_1745 (Array Int Int)) (v_prenex_1747 Int) (v_prenex_1746 Int) (v_prenex_1744 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_16) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1745) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1744) v_prenex_1747) v_prenex_1746)) (< v_prenex_1746 0) (= v_prenex_1747 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse5) (or (and (forall ((v_prenex_1700 Int) (v_prenex_1699 Int) (v_prenex_1698 Int) (v_prenex_1697 (Array Int Int)) (v_prenex_1696 (Array Int Int)) (v_arrayElimArr_30 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_30) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1697) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1696))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse30 v_prenex_1700) v_prenex_1698)) (< v_prenex_1698 0) (= (select (select .cse30 v_prenex_1699) v_prenex_1698) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1698)) (= v_prenex_1700 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_prenex_1763 Int) (v_prenex_1762 Int) (v_prenex_1761 Int) (v_arrayElimArr_29 (Array Int Int)) (v_prenex_1765 (Array Int Int)) (v_prenex_1766 (Array Int Int))) (let ((.cse31 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_29) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1766) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1765))) (or (< v_prenex_1761 0) (= v_prenex_1763 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= v_prenex_1762 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse31 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1761)) (= (select (select .cse31 v_prenex_1762) v_prenex_1761) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse31 v_prenex_1763) v_prenex_1761) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1691 (Array Int Int)) (v_prenex_1695 Int) (v_prenex_1692 (Array Int Int)) (v_prenex_1694 Int) (v_prenex_1693 Int) (v_prenex_1764 (Array Int Int))) (let ((.cse32 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1764) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1692) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1691))) (or (= v_prenex_1694 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1693 0) (= (select (select .cse32 v_prenex_1694) v_prenex_1693) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse32 v_prenex_1695) v_prenex_1693)) (= v_prenex_1695 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_prenex_1702 (Array Int Int)) (v_prenex_1704 Int) (v_arrayElimArr_31 (Array Int Int)) (v_prenex_1701 (Array Int Int)) (v_prenex_1703 Int)) (or (= v_prenex_1704 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_31) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1702) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1701) v_prenex_1704) v_prenex_1703) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1703 0))) (forall ((v_prenex_1705 (Array Int Int)) (v_prenex_1706 (Array Int Int)) (v_prenex_1709 Int) (v_prenex_1760 (Array Int Int)) (v_prenex_1708 Int) (v_prenex_1707 Int)) (let ((.cse33 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1760) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1706) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1705))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse33 v_prenex_1708) v_prenex_1707)) (= v_prenex_1709 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse33 v_prenex_1709) v_prenex_1707) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1707 0))))) .cse5) (or (forall ((v_prenex_1725 (Array Int Int)) (v_prenex_1724 (Array Int Int)) (v_prenex_1727 Int) (v_arrayElimArr_9 (Array Int Int)) (v_prenex_1726 Int)) (or (< v_prenex_1726 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_9) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1725) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1724) v_prenex_1727) v_prenex_1726) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1726) (= v_prenex_1727 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse0) (forall ((v_prenex_1723 Int) (v_prenex_1722 Int) (v_prenex_1721 Int) (v_arrayElimArr_17 (Array Int Int)) (v_prenex_1719 (Array Int Int)) (v_prenex_1720 (Array Int Int))) (let ((.cse34 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_17) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1720) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1719))) (or (= (select (select .cse34 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1721) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1723 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse34 v_prenex_1722) v_prenex_1721) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1722 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1721 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse34 v_prenex_1723) v_prenex_1721))))) (forall ((v_prenex_1768 (Array Int Int)) (v_arrayElimArr_35 (Array Int Int)) (v_prenex_1771 Int) (v_prenex_1770 Int) (v_prenex_1767 (Array Int Int)) (v_prenex_1769 Int)) (let ((.cse35 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_35) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1768) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1767))) (or (= (select (select .cse35 v_prenex_1770) v_prenex_1769) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1769) (= (select (select .cse35 v_prenex_1771) v_prenex_1769) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1769 0) (= v_prenex_1770 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse35 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1769) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1771 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (or .cse0 (forall ((v_prenex_1737 (Array Int Int)) (v_prenex_1736 Int) (v_prenex_1734 (Array Int Int)) (v_prenex_1733 (Array Int Int)) (v_prenex_1735 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1737) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1734) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1733) v_prenex_1736) v_prenex_1735)) (= v_prenex_1736 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1735 0)))))) (or (and (forall ((v_prenex_1657 Int) (v_prenex_80 (Array Int Int)) (v_prenex_1970 Int) (v_prenex_1655 (Array Int Int)) (v_prenex_1656 (Array Int Int)) (v_prenex_1658 Int)) (or (= v_prenex_1658 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1657 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1657) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_80) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 v_prenex_1970)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1656) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1655) v_prenex_1658) v_prenex_1657) |c_ULTIMATE.start_main_~data_init~0#1|))) (or (forall ((v_prenex_1659 (Array Int Int)) (v_prenex_1664 Int) (v_prenex_1663 Int) (v_prenex_1660 (Array Int Int)) (v_prenex_1662 Int) (v_prenex_1661 Int)) (let ((.cse36 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1661)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1660) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1659))) (or (< v_prenex_1662 0) (= v_prenex_1664 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse36 v_prenex_1663) v_prenex_1662)) (= (select (select .cse36 v_prenex_1664) v_prenex_1662) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse36 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1662)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1662)))) .cse1) (forall ((v_prenex_1679 Int) (v_prenex_1678 Int) (v_prenex_1681 Int) (v_prenex_1675 (Array Int Int)) (v_prenex_1680 Int) (v_prenex_1677 (Array Int Int)) (v_prenex_1676 (Array Int Int))) (let ((.cse37 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1677) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 v_prenex_1678)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1676) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1675))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse37 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1679)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1679) (= v_prenex_1681 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1679 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse37 v_prenex_1681) v_prenex_1679)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse37 v_prenex_1680) v_prenex_1679))))) (or .cse1 (forall ((v_prenex_1668 Int) (v_prenex_1667 Int) (v_prenex_1666 (Array Int Int)) (v_prenex_1665 (Array Int Int)) (v_prenex_1669 Int)) (or (= v_prenex_1669 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1668 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1667)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1666) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1665) v_prenex_1669) v_prenex_1668) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1668)))) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_102 Int) (v_prenex_1972 (Array Int Int)) (v_prenex_1971 (Array Int Int)) (v_prenex_1969 Int) (v_prenex_1968 Int)) (let ((.cse38 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1972) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1971))) (or (= (select (select .cse38 v_arrayElimCell_102) v_prenex_1968) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1968 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse38 v_prenex_1969) v_prenex_1968)) (= v_prenex_1969 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1968)))) .cse4) (or .cse1 (forall ((v_prenex_1674 Int) (v_prenex_1671 (Array Int Int)) (v_prenex_1673 Int) (v_prenex_1672 Int) (v_prenex_1670 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1672)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1671) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1670))) (or (< v_prenex_1673 0) (= v_prenex_1674 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse39 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1673) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse39 v_prenex_1674) v_prenex_1673)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1673)))))) .cse5) (or .cse4 (and (or .cse0 (forall ((v_prenex_1943 Int) (v_prenex_1941 (Array Int Int)) (v_arrayElimArr_20 (Array Int Int)) (v_prenex_1942 (Array Int Int)) (v_prenex_1944 Int)) (let ((.cse40 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_20) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1942) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1941))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse40 v_prenex_1944) v_prenex_1943)) (< v_prenex_1943 0) (= v_prenex_1944 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse40 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1943) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (forall ((v_arrayElimArr_21 (Array Int Int)) (v_prenex_1955 (Array Int Int)) (v_prenex_1957 Int) (v_prenex_1956 Int) (v_prenex_1954 (Array Int Int))) (or (= v_prenex_1957 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1956 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_21) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1955) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1954) v_prenex_1957) v_prenex_1956) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse5) (or (and (forall ((v_prenex_1936 (Array Int Int)) (v_prenex_1940 Int) (v_prenex_1937 (Array Int Int)) (v_prenex_1939 Int) (v_arrayElimArr_18 (Array Int Int)) (v_prenex_1938 Int)) (let ((.cse41 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_18) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1937) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1936))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse41 v_prenex_1939) v_prenex_1938)) (= v_prenex_1940 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse41 v_prenex_1940) v_prenex_1938)) (< v_prenex_1938 0) (= (select (select .cse41 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1938) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1933 (Array Int Int)) (v_arrayElimArr_19 (Array Int Int)) (v_prenex_1935 Int) (v_prenex_1932 (Array Int Int)) (v_prenex_1934 Int)) (or (< v_prenex_1934 0) (= v_prenex_1935 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_19) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1933) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1932) v_prenex_1935) v_prenex_1934) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_2023 (Array Int Int)) (v_prenex_1960 Int) (v_prenex_1961 (Array Int Int)) (v_prenex_1959 Int) (v_prenex_1958 Int) (v_prenex_1962 (Array Int Int))) (let ((.cse42 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2023) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1962) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1961))) (or (< v_prenex_1958 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 v_prenex_1960) v_prenex_1958)) (= v_prenex_1960 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 v_prenex_1959) v_prenex_1958)))))) .cse5) (forall ((v_arrayElimArr_22 (Array Int Int)) (v_prenex_2024 Int) (v_prenex_2025 Int) (v_prenex_2026 Int) (v_prenex_2028 (Array Int Int)) (v_prenex_2029 (Array Int Int))) (let ((.cse43 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_22) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2029) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2028))) (or (= (select (select .cse43 v_prenex_2026) v_prenex_2024) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2026 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_2024 0) (= (select (select .cse43 v_prenex_2025) v_prenex_2024) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2025 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse43 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2024))))) (or .cse0 (forall ((v_prenex_1945 (Array Int Int)) (v_prenex_2030 (Array Int Int)) (v_prenex_1946 (Array Int Int)) (v_prenex_1948 Int) (v_prenex_1947 Int)) (or (= v_prenex_1948 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1947 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2030) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1946) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1945) v_prenex_1948) v_prenex_1947))))) (forall ((v_prenex_1953 Int) (v_prenex_1952 Int) (v_prenex_1951 Int) (v_prenex_1949 (Array Int Int)) (v_prenex_2027 (Array Int Int)) (v_prenex_1950 (Array Int Int))) (let ((.cse44 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2027) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1950) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1949))) (or (= v_prenex_1953 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1951 0) (= v_prenex_1952 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse44 v_prenex_1952) v_prenex_1951) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse44 v_prenex_1953) v_prenex_1951))))))) (or (and (or .cse1 (and (forall ((v_prenex_1929 Int) (v_prenex_1928 Int) (v_prenex_1927 Int) (v_prenex_1926 Int) (v_prenex_1930 (Array Int Int)) (v_prenex_1931 (Array Int Int))) (let ((.cse45 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1926)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1931) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1930))) (or (< v_prenex_1927 0) (= (select (select .cse45 v_prenex_1928) v_prenex_1927) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1929 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse45 v_prenex_1929) v_prenex_1927)) (= (select (select .cse45 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1927) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1880 Int) (v_prenex_1877 (Array Int Int)) (v_prenex_1879 Int) (v_prenex_1878 Int) (v_prenex_1876 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1878)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1877) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1876) v_prenex_1880) v_prenex_1879)) (= v_prenex_1880 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1879 0))) (forall ((v_prenex_1875 Int) (v_prenex_1874 Int) (v_prenex_1873 Int) (v_prenex_1871 (Array Int Int)) (v_prenex_1872 (Array Int Int))) (let ((.cse46 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1873)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1872) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1871))) (or (= v_prenex_1875 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse46 v_prenex_1875) v_prenex_1874) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse46 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1874) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1874 0)))))) (or (forall ((v_prenex_2017 Int) (v_prenex_2015 Int) (v_prenex_2020 (Array Int Int)) (v_prenex_2016 Int) (v_prenex_2014 (Array Int Int)) (v_prenex_2019 (Array Int Int))) (let ((.cse47 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2014) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2020) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2019))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse47 v_prenex_2017) v_prenex_2015)) (= v_prenex_2017 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse47 v_prenex_2016) v_prenex_2015) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2015 0)))) .cse4) (or (forall ((v_prenex_1896 Int) (v_prenex_1895 Int) (v_prenex_1894 Int) (v_prenex_1893 Int) (v_prenex_1891 (Array Int Int)) (v_prenex_1892 (Array Int Int))) (let ((.cse48 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1893)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1892) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1891))) (or (= (select (select .cse48 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1894) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse48 v_prenex_1896) v_prenex_1894) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse48 v_prenex_1895) v_prenex_1894) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1894 0) (= v_prenex_1896 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) .cse1) (forall ((v_prenex_1903 (Array Int Int)) (v_prenex_1902 (Array Int Int)) (v_prenex_1904 (Array Int Int)) (v_prenex_1907 Int) (v_prenex_1906 Int) (v_prenex_1905 Int)) (or (< v_prenex_1906 0) (= v_prenex_1907 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1904) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 v_prenex_1905)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1903) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1902) v_prenex_1907) v_prenex_1906)))) (or .cse4 (forall ((v_prenex_1888 Int) (v_prenex_1890 Int) (v_prenex_1886 (Array Int Int)) (v_prenex_1889 Int) (v_prenex_2018 (Array Int Int)) (v_prenex_1887 (Array Int Int))) (let ((.cse49 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2018) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1887) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1886))) (or (= v_prenex_1890 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1888 0) (= v_prenex_1889 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse49 v_prenex_1889) v_prenex_1888)) (= (select (select .cse49 v_prenex_1890) v_prenex_1888) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((v_prenex_1919 (Array Int Int)) (v_prenex_1925 Int) (v_prenex_1924 Int) (v_prenex_1923 Int) (v_prenex_1921 (Array Int Int)) (v_prenex_1922 Int) (v_prenex_1920 (Array Int Int))) (let ((.cse50 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1921) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 v_prenex_1922)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1920) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1919))) (or (= (select (select .cse50 v_prenex_1925) v_prenex_1923) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1925 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse50 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1923)) (< v_prenex_1923 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse50 v_prenex_1924) v_prenex_1923))))) (or (forall ((v_prenex_1914 (Array Int Int)) (v_prenex_1915 (Array Int Int)) (v_prenex_1918 Int) (v_prenex_1917 Int) (v_prenex_1916 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1916)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1915) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1914) v_prenex_1918) v_prenex_1917) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1917 0) (= v_prenex_1918 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse1) (or .cse1 (forall ((v_prenex_1899 Int) (v_prenex_1897 (Array Int Int)) (v_prenex_1901 Int) (v_prenex_1900 Int) (v_prenex_1898 (Array Int Int))) (let ((.cse51 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1899)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1898) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1897))) (or (= (select (select .cse51 v_prenex_1901) v_prenex_1900) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1901 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1900 0) (= (select (select .cse51 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1900) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (forall ((v_prenex_1910 Int) (v_prenex_1909 (Array Int Int)) (v_prenex_1908 (Array Int Int)) (v_prenex_1913 Int) (v_prenex_1912 Int) (v_prenex_1911 Int)) (let ((.cse52 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1910)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1909) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1908))) (or (= v_prenex_1912 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1911 0) (= (select (select .cse52 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1911) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse52 v_prenex_1913) v_prenex_1911) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1913 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse52 v_prenex_1912) v_prenex_1911) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse1) (forall ((v_prenex_1885 Int) (v_prenex_1884 Int) (v_prenex_1883 Int) (v_prenex_2021 (Array Int Int)) (v_prenex_1882 (Array Int Int)) (v_prenex_1881 (Array Int Int)) (v_prenex_2022 Int)) (let ((.cse53 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2021) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 v_prenex_2022)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1882) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1881))) (or (< v_prenex_1883 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse53 v_prenex_1884) v_prenex_1883)) (= v_prenex_1884 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= v_prenex_1885 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse53 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1883) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse53 v_prenex_1885) v_prenex_1883)))))) .cse5) (or (and (forall ((v_prenex_2092 Int) (v_prenex_2132 (Array Int Int)) (v_prenex_2088 Int) (v_prenex_2089 Int) (v_prenex_2093 Int) (v_prenex_2091 (Array Int Int)) (v_prenex_2090 (Array Int Int))) (or (= v_prenex_2089 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2132) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 v_prenex_2088)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2090) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2091) v_prenex_2093) v_prenex_2089) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2089 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_prenex_2132 .cse3 v_prenex_2088)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2090) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2091) v_prenex_2092) v_prenex_2089)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_2088)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2090) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2091) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2089) |c_ULTIMATE.start_main_~data_init~0#1|))) (or (and (forall ((v_prenex_2082 (Array Int Int)) (v_prenex_2079 Int) (v_prenex_2080 (Array Int Int)) (v_prenex_2081 (Array Int Int)) (v_prenex_2083 Int)) (or (< v_prenex_2079 0) (= v_prenex_2079 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2080) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2081) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2082) v_prenex_2083) v_prenex_2079) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_2085 (Array Int Int)) (v_prenex_2133 (Array Int Int)) (v_prenex_2135 Int) (v_prenex_2086 (Array Int Int)) (v_prenex_2087 Int) (v_prenex_2084 Int)) (let ((.cse54 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2133) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2085) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2086))) (or (= (select (select .cse54 v_prenex_2087) v_prenex_2084) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse54 v_prenex_2135) v_prenex_2084) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2084 0) (= v_prenex_2084 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))))) .cse4) (or (forall ((v_arrayElimArr_26 (Array Int Int)) (v_prenex_2103 Int) (v_prenex_2104 Int) (v_prenex_2101 (Array Int Int)) (v_prenex_2102 (Array Int Int)) (v_prenex_2100 Int)) (let ((.cse55 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_26) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2101) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2102))) (or (= v_prenex_2100 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_2100 0) (= (select (select .cse55 v_prenex_2103) v_prenex_2100) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse55 v_prenex_2104) v_prenex_2100) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse4) (or .cse1 (forall ((v_prenex_2136 Int) (v_prenex_2137 Int) (v_prenex_2131 Int) (v_prenex_2134 (Array Int Int)) (v_prenex_2138 (Array Int Int))) (let ((.cse56 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_2131)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2138) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2134))) (or (= v_prenex_2137 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select .cse56 v_prenex_2136) v_prenex_2137) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse56 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2137) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2137 0))))) (forall ((v_prenex_2096 (Array Int Int)) (v_prenex_2097 (Array Int Int)) (v_prenex_2098 (Array Int Int)) (v_prenex_2099 Int) (v_prenex_2094 Int) (v_prenex_2095 Int)) (or (= v_prenex_2095 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_2095 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2096) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 v_prenex_2094)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2097) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2098) v_prenex_2099) v_prenex_2095) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse5) (or (and (or (forall ((v_prenex_2066 (Array Int Int)) (v_prenex_2067 (Array Int Int)) (v_prenex_2069 Int) (v_prenex_2065 Int) (v_prenex_2068 (Array Int Int))) (or (= v_prenex_2065 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_2065 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2066) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2067) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2068) v_prenex_2069) v_prenex_2065)))) .cse5) (forall ((v_arrayElimArr_23 (Array Int Int)) (v_prenex_2120 Int) (v_prenex_2123 (Array Int Int)) (v_prenex_2121 Int) (v_prenex_2122 Int) (v_prenex_2119 (Array Int Int))) (let ((.cse57 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_23) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2123) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2119))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse57 v_prenex_2120) v_prenex_2122)) (= (select (select .cse57 v_prenex_2121) v_prenex_2122) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2122 0) (= v_prenex_2122 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (or .cse0 (and (forall ((v_prenex_2077 (Array Int Int)) (v_prenex_2076 (Array Int Int)) (v_prenex_2075 Int) (v_prenex_2078 Int) (v_prenex_2118 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2118) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2076) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2077) v_prenex_2078) v_prenex_2075)) (= v_prenex_2075 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< v_prenex_2075 0))) (forall ((v_prenex_2052 (Array Int Int)) (v_prenex_2053 (Array Int Int)) (v_prenex_2054 (Array Int Int)) (v_prenex_2055 Int) (v_prenex_2051 Int)) (or (< v_prenex_2051 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 (select v_prenex_2052 .cse3))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2053) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2054) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2051)) (= v_prenex_2051 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2052) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2053) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2054) v_prenex_2055) v_prenex_2051) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((v_prenex_2059 Int) (v_arrayElimArr_27 (Array Int Int)) (v_prenex_2057 (Array Int Int)) (v_prenex_2056 Int) (v_prenex_2058 (Array Int Int)) (v_prenex_2060 Int)) (let ((.cse58 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_27) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2057) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2058))) (or (< v_prenex_2056 0) (= v_prenex_2056 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse58 v_prenex_2059) v_prenex_2056)) (= (select (select .cse58 v_prenex_2060) v_prenex_2056) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_2071 (Array Int Int)) (v_prenex_2070 Int) (v_prenex_2072 (Array Int Int)) (v_arrayElimArr_36 (Array Int Int)) (v_prenex_2073 Int) (v_prenex_2074 Int)) (let ((.cse59 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_36) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2071) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2072))) (or (= (select (select .cse59 v_prenex_2074) v_prenex_2070) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2070 0) (= v_prenex_2070 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 (select v_arrayElimArr_36 .cse3))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2071) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2072) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2070) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse59 v_prenex_2073) v_prenex_2070) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (forall ((v_prenex_2062 (Array Int Int)) (v_prenex_2063 (Array Int Int)) (v_arrayElimArr_37 (Array Int Int)) (v_prenex_2064 Int) (v_prenex_2061 Int)) (or (= v_prenex_2061 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_37) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2062) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2063) v_prenex_2064) v_prenex_2061) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2061 0))) .cse5)) .cse4) (or .cse4 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_ArrVal_1842 (Array Int Int)) (v_arrayElimArr_25 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_108 Int)) (let ((.cse60 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_25) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1851))) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_34| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse60 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|)) (= (select (select .cse60 v_arrayElimCell_101) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))))) (or (forall ((v_prenex_2006 Int) (v_prenex_2001 (Array Int Int)) (v_prenex_2004 Int) (v_prenex_2005 Int) (v_prenex_2002 (Array Int Int)) (v_prenex_2003 (Array Int Int))) (let ((.cse61 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2003) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 v_prenex_2004)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2002) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2001))) (or (= (select (select .cse61 v_prenex_2006) v_prenex_2005) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2005 0) (= v_prenex_2006 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse61 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2005) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2005)))) .cse0) (or (and (or .cse0 (forall ((v_prenex_1654 Int) (v_prenex_1653 Int) (v_prenex_1651 (Array Int Int)) (v_prenex_1652 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1654) (< v_prenex_1654 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_1653)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1652) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1651) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1654))))) (forall ((v_prenex_83 (Array Int Int)) (v_prenex_81 (Array Int Int)) (v_prenex_77 Int) (v_prenex_24 Int) (v_arrayElimCell_103 Int)) (let ((.cse62 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_77)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_81) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_83))) (or (= v_arrayElimCell_103 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_24 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse62 v_arrayElimCell_103) v_prenex_24)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse62 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_24)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_24))))) .cse1) (or .cse1 (forall ((v_prenex_2139 Int) (v_prenex_2141 (Array Int Int)) (v_prenex_2142 (Array Int Int)) (v_prenex_2143 Int) (v_prenex_2140 Int)) (let ((.cse63 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse2 .cse3 v_prenex_2139)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2141) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2142))) (or (= (select (select .cse63 v_prenex_2143) v_prenex_2140) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2140 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select .cse63 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2140) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2140) (< v_prenex_2140 0))))) (forall ((v_prenex_2013 Int) (v_prenex_2010 Int) (v_prenex_2011 Int) (v_prenex_2012 Int) (v_prenex_2008 (Array Int Int)) (v_prenex_2009 (Array Int Int)) (v_prenex_2007 (Array Int Int))) (let ((.cse64 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2009) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 v_prenex_2010)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2008) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2007))) (or (= (select (select .cse64 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2011) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2013 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse64 v_prenex_2012) v_prenex_2011)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse64 v_prenex_2013) v_prenex_2011)) (< v_prenex_2011 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2011) (= v_prenex_2012 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (or .cse4 (and (forall ((v_prenex_1998 Int) (v_prenex_1997 Int) (v_prenex_1994 (Array Int Int)) (v_prenex_1996 (Array Int Int)) (v_prenex_1995 (Array Int Int)) (v_prenex_1999 Int)) (let ((.cse65 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1995) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1996) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1994))) (or (= v_prenex_1999 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse65 v_prenex_1998) v_prenex_1997) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1998 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1997 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1997) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse65 v_prenex_1999) v_prenex_1997))))) (or .cse0 (forall ((v_prenex_1868 (Array Int Int)) (v_prenex_1867 (Array Int Int)) (v_prenex_2000 (Array Int Int)) (v_prenex_1870 Int) (v_prenex_1869 Int)) (or (< v_prenex_1869 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1869) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2000) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1868) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1867) v_prenex_1870) v_prenex_1869)) (= v_prenex_1870 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))))))) is different from true [2025-03-17 12:20:23,801 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse9 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse4 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (.cse5 (not .cse9)) (.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse2 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse10 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_1785 Int) (v_prenex_1784 Int) (v_prenex_1980 Int) (v_prenex_1783 (Array Int Int)) (v_prenex_1782 (Array Int Int))) (let ((.cse0 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1784)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1783) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1782))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse0 v_prenex_1980) v_prenex_1785)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1785) (< v_prenex_1785 0) (= (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1785) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_1855 Int) (v_prenex_1853 (Array Int Int)) (v_prenex_1857 Int) (v_prenex_1989 Int) (v_prenex_1854 (Array Int Int)) (v_prenex_1856 Int)) (let ((.cse3 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1855)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1854) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1853))) (or (= (select (select .cse3 v_prenex_1857) v_prenex_1856) |c_ULTIMATE.start_main_~data_init~0#1|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1857) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1856) (< v_prenex_1856 0) (= (select (select .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1856) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse3 v_prenex_1989) v_prenex_1856))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)))) (or .cse4 (and (or .cse5 (forall ((v_prenex_2067 (Array Int Int)) (v_prenex_2069 Int) (v_prenex_2065 Int) (v_prenex_2068 (Array Int Int))) (or (< v_prenex_2065 0) (= v_prenex_2065 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2067) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2068) v_prenex_2069) v_prenex_2065) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_2071 (Array Int Int)) (v_prenex_2070 Int) (v_prenex_2072 (Array Int Int)) (v_prenex_2073 Int) (v_prenex_2074 Int)) (let ((.cse6 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2071) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2072))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse6 v_prenex_2073) v_prenex_2070)) (= (select v_prenex_2072 v_prenex_2070) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2070 0) (= (select (select .cse6 v_prenex_2074) v_prenex_2070) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2070 0)))) (forall ((v_prenex_2120 Int) (v_prenex_2123 (Array Int Int)) (v_prenex_2121 Int) (v_prenex_2122 Int) (v_prenex_2119 (Array Int Int))) (let ((.cse7 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2123) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2119))) (or (= (select (select .cse7 v_prenex_2121) v_prenex_2122) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2122 0) (< v_prenex_2122 0) (= (select (select .cse7 v_prenex_2120) v_prenex_2122) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_2059 Int) (v_prenex_2057 (Array Int Int)) (v_prenex_2056 Int) (v_prenex_2058 (Array Int Int)) (v_prenex_2060 Int)) (let ((.cse8 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2057) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2058))) (or (< v_prenex_2056 0) (= (select (select .cse8 v_prenex_2060) v_prenex_2056) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2056 0) (= (select (select .cse8 v_prenex_2059) v_prenex_2056) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (forall ((v_prenex_2062 (Array Int Int)) (v_prenex_2063 (Array Int Int)) (v_prenex_2064 Int) (v_prenex_2061 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2062) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2063) v_prenex_2064) v_prenex_2061) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2061 0) (< v_prenex_2061 0))) .cse5) (or .cse9 (and (forall ((v_prenex_2053 (Array Int Int)) (v_prenex_2054 (Array Int Int)) (v_prenex_2055 Int) (v_prenex_2051 Int)) (or (< v_prenex_2051 0) (= (select v_prenex_2054 v_prenex_2051) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2053) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2054) v_prenex_2055) v_prenex_2051)) (= v_prenex_2051 0))) (forall ((v_prenex_2077 (Array Int Int)) (v_prenex_2076 (Array Int Int)) (v_prenex_2075 Int) (v_prenex_2078 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2076) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2077) v_prenex_2078) v_prenex_2075)) (= v_prenex_2075 0) (< v_prenex_2075 0))))))) (or (forall ((v_ArrVal_1837 Int) (v_ArrVal_1833 (Array Int Int)) (v_prenex_2113 Int) (v_prenex_2110 Int) (v_prenex_2112 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2110) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_ArrVal_1837)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2112) v_prenex_2113) v_prenex_2110)) (= v_prenex_2110 0) (< v_prenex_2110 0))) .cse10) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (forall ((v_prenex_1779 (Array Int Int)) (v_prenex_1981 Int) (v_prenex_1781 Int) (v_prenex_1780 Int) (v_prenex_1778 (Array Int Int))) (let ((.cse11 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1780)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1779) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1778))) (or (= (select (select .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1781) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse11 v_prenex_1981) v_prenex_1781) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1781 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1781)))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_83 (Array Int Int)) (v_prenex_81 (Array Int Int)) (v_prenex_77 Int) (v_prenex_24 Int) (v_arrayElimCell_103 Int)) (let ((.cse12 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_77)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_81) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_83))) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_arrayElimCell_103) (= (select (select .cse12 v_arrayElimCell_103) v_prenex_24) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse12 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_24) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_24 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_24)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_1991 Int) (v_prenex_1992 (Array Int Int)) (v_prenex_1990 Int) (v_prenex_1993 (Array Int Int)) (v_prenex_1988 Int)) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1991)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1993) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1992))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1988) (< v_prenex_1988 0) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1990) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1988)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse13 v_prenex_1990) v_prenex_1988))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)))) (or (forall ((v_prenex_1848 (Array Int Int)) (v_prenex_1852 Int) (v_prenex_1851 Int) (v_prenex_1850 Int)) (or (= v_prenex_1852 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< v_prenex_1851 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1851) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1850)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1848) v_prenex_1852) v_prenex_1851) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse9 .cse10) (or .cse4 (and (or (forall ((v_prenex_1745 (Array Int Int)) (v_prenex_1747 Int) (v_prenex_1746 Int) (v_prenex_1744 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1745) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1744) v_prenex_1747) v_prenex_1746) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1746 0) (= v_prenex_1747 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) .cse5) (or (and (forall ((v_prenex_1702 (Array Int Int)) (v_prenex_1704 Int) (v_prenex_1701 (Array Int Int)) (v_prenex_1703 Int)) (or (= v_prenex_1704 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1702) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1701) v_prenex_1704) v_prenex_1703) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1703 0))) (forall ((v_prenex_1705 (Array Int Int)) (v_prenex_1706 (Array Int Int)) (v_prenex_1709 Int) (v_prenex_1708 Int) (v_prenex_1707 Int)) (let ((.cse14 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1706) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1705))) (or (= (select (select .cse14 v_prenex_1709) v_prenex_1707) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse14 v_prenex_1708) v_prenex_1707) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1707 0) (= v_prenex_1709 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1763 Int) (v_prenex_1762 Int) (v_prenex_1761 Int) (v_prenex_1765 (Array Int Int)) (v_prenex_1766 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1766) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1765))) (or (< v_prenex_1761 0) (= v_prenex_1762 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select v_prenex_1765 v_prenex_1761) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1763 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select .cse15 v_prenex_1762) v_prenex_1761) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse15 v_prenex_1763) v_prenex_1761) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1691 (Array Int Int)) (v_prenex_1695 Int) (v_prenex_1692 (Array Int Int)) (v_prenex_1694 Int) (v_prenex_1693 Int)) (let ((.cse16 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1692) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1691))) (or (< v_prenex_1693 0) (= v_prenex_1694 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select .cse16 v_prenex_1694) v_prenex_1693) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1695 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select .cse16 v_prenex_1695) v_prenex_1693) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1700 Int) (v_prenex_1699 Int) (v_prenex_1698 Int) (v_prenex_1697 (Array Int Int)) (v_prenex_1696 (Array Int Int))) (let ((.cse17 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1697) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1696))) (or (= v_prenex_1700 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< v_prenex_1698 0) (= (select v_prenex_1696 v_prenex_1698) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse17 v_prenex_1700) v_prenex_1698)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse17 v_prenex_1699) v_prenex_1698)))))) .cse5) (or .cse5 (and (forall ((v_prenex_1685 Int) (v_prenex_1682 (Array Int Int)) (v_prenex_1684 Int) (v_prenex_1683 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1684) (= v_prenex_1685 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1683) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1682) v_prenex_1685) v_prenex_1684) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1684 0))) (forall ((v_prenex_1689 Int) (v_prenex_1688 Int) (v_prenex_1686 (Array Int Int)) (v_prenex_1690 Int) (v_prenex_1687 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1687) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1686))) (or (= (select (select .cse18 v_prenex_1690) v_prenex_1688) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1690 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select v_prenex_1686 v_prenex_1688) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse18 v_prenex_1689) v_prenex_1688) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1688 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1688)))) (forall ((v_prenex_1730 Int) (v_prenex_1729 Int) (v_prenex_1728 Int) (v_prenex_1732 (Array Int Int)) (v_prenex_1731 (Array Int Int))) (let ((.cse19 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1732) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1731))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1728) (= v_prenex_1730 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select .cse19 v_prenex_1730) v_prenex_1728) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse19 v_prenex_1729) v_prenex_1728) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1728 0)))))) (or .cse5 (forall ((v_prenex_1749 (Array Int Int)) (v_prenex_1748 (Array Int Int)) (v_prenex_1751 Int) (v_prenex_1750 Int)) (or (< v_prenex_1750 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1749) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1748) v_prenex_1751) v_prenex_1750)) (= v_prenex_1751 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1750)))) (or .cse9 (forall ((v_prenex_1755 Int) (v_prenex_1754 Int) (v_prenex_1752 (Array Int Int)) (v_prenex_1753 (Array Int Int))) (or (= (select v_prenex_1752 v_prenex_1754) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1754 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1753) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1752) v_prenex_1755) v_prenex_1754) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1755 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1754)))) (forall ((v_prenex_1723 Int) (v_prenex_1722 Int) (v_prenex_1721 Int) (v_prenex_1719 (Array Int Int)) (v_prenex_1720 (Array Int Int))) (let ((.cse20 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1720) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1719))) (or (= (select (select .cse20 v_prenex_1722) v_prenex_1721) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1723 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< v_prenex_1721 0) (= (select v_prenex_1719 v_prenex_1721) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse20 v_prenex_1723) v_prenex_1721) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1722 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (or .cse9 (forall ((v_prenex_1725 (Array Int Int)) (v_prenex_1724 (Array Int Int)) (v_prenex_1727 Int) (v_prenex_1726 Int)) (or (< v_prenex_1726 0) (= v_prenex_1727 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1725) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1724) v_prenex_1727) v_prenex_1726) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1726)))) (or .cse9 (forall ((v_prenex_1757 (Array Int Int)) (v_prenex_1759 Int) (v_prenex_1756 (Array Int Int)) (v_prenex_1758 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1757) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1756) v_prenex_1759) v_prenex_1758) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1758 0) (= (select v_prenex_1756 v_prenex_1758) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1759 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1978 (Array Int Int)) (v_prenex_1976 Int) (v_prenex_1977 (Array Int Int)) (v_prenex_1975 Int) (v_prenex_1974 Int)) (let ((.cse21 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1978) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1977))) (or (= (select (select .cse21 v_prenex_1976) v_prenex_1974) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse21 v_prenex_1975) v_prenex_1974)) (< v_prenex_1974 0) (= v_prenex_1976 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= v_prenex_1975 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1974)))) (forall ((v_prenex_1768 (Array Int Int)) (v_prenex_1771 Int) (v_prenex_1770 Int) (v_prenex_1767 (Array Int Int)) (v_prenex_1769 Int)) (let ((.cse22 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1768) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1767))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1769) (= v_prenex_1771 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select .cse22 v_prenex_1770) v_prenex_1769) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1770 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< v_prenex_1769 0) (= (select (select .cse22 v_prenex_1771) v_prenex_1769) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_1767 v_prenex_1769) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1743 Int) (v_prenex_1738 (Array Int Int)) (v_prenex_1742 Int) (v_prenex_1741 Int) (v_prenex_1740 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1740) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1738))) (or (= v_prenex_1742 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< v_prenex_1741 0) (= (select (select .cse23 v_prenex_1743) v_prenex_1741) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse23 v_prenex_1742) v_prenex_1741) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1743 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (or (and (forall ((v_prenex_1712 Int) (v_prenex_1710 (Array Int Int)) (v_prenex_1711 (Array Int Int)) (v_prenex_1713 Int)) (or (< v_prenex_1712 0) (= v_prenex_1713 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1711) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1710) v_prenex_1713) v_prenex_1712) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_1714 (Array Int Int)) (v_prenex_1715 (Array Int Int)) (v_prenex_1718 Int) (v_prenex_1717 Int) (v_prenex_1716 Int)) (let ((.cse24 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1715) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1714))) (or (= (select (select .cse24 v_prenex_1718) v_prenex_1716) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_1714 v_prenex_1716) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1716 0) (= v_prenex_1718 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select .cse24 v_prenex_1717) v_prenex_1716) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1775 Int) (v_prenex_1774 Int) (v_prenex_1773 Int) (v_prenex_1776 (Array Int Int)) (v_prenex_1777 (Array Int Int))) (let ((.cse25 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1777) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1776))) (or (= v_prenex_1775 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< v_prenex_1773 0) (= (select (select .cse25 v_prenex_1775) v_prenex_1773) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse25 v_prenex_1774) v_prenex_1773) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse5) (or .cse9 (forall ((v_prenex_1736 Int) (v_prenex_1734 (Array Int Int)) (v_prenex_1733 (Array Int Int)) (v_prenex_1735 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1734) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1733) v_prenex_1736) v_prenex_1735)) (= v_prenex_1736 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< v_prenex_1735 0)))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_2044 (Array Int Int)) (v_prenex_2045 (Array Int Int)) (v_arrayElimCell_110 Int) (v_prenex_2043 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_arrayElimCell_110)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2044) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2045) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2043) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2043 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2043) (< v_prenex_2043 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_1866 Int) (v_prenex_1865 Int) (v_prenex_1864 Int) (v_prenex_1862 (Array Int Int)) (v_prenex_1863 (Array Int Int))) (let ((.cse26 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1864)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1863) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1862))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1865) (= (select (select .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1865) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1865 0) (= (select (select .cse26 v_prenex_1866) v_prenex_1865) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and (forall ((v_prenex_1801 (Array Int Int)) (v_prenex_1804 Int) (v_prenex_1803 Int) (v_prenex_1800 (Array Int Int)) (v_prenex_1802 Int)) (let ((.cse27 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1801) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1800))) (or (< v_prenex_1802 0) (= (select (select .cse27 v_prenex_1803) v_prenex_1802) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1803 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select .cse27 v_prenex_1804) v_prenex_1802) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1846 (Array Int Int)) (v_prenex_1844 Int) (v_prenex_1845 (Array Int Int)) (v_prenex_1843 Int) (v_prenex_1842 Int)) (let ((.cse28 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1846) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1845))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse28 v_prenex_1843) v_prenex_1842)) (= v_prenex_1843 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select .cse28 v_prenex_1844) v_prenex_1842) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_1845 v_prenex_1842) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1842 0)))) (forall ((v_prenex_1811 Int) (v_prenex_1809 (Array Int Int)) (v_prenex_1810 (Array Int Int)) (v_prenex_1812 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1810) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1809) v_prenex_1812) v_prenex_1811) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1812 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< v_prenex_1811 0))) (forall ((v_prenex_1806 (Array Int Int)) (v_prenex_1805 (Array Int Int)) (v_prenex_1808 Int) (v_prenex_1807 Int)) (or (< v_prenex_1807 0) (= v_prenex_1808 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_1805 v_prenex_1807)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1806) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1805) v_prenex_1808) v_prenex_1807) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse9 .cse4) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_1795 Int) (v_prenex_1794 Int) (v_prenex_1792 (Array Int Int)) (v_prenex_1793 (Array Int Int)) (v_prenex_1829 Int)) (let ((.cse29 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1794)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1793) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1792))) (or (< v_prenex_1795 0) (= (select (select .cse29 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1795) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse29 v_prenex_1829) v_prenex_1795) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1795)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (forall ((v_prenex_2013 Int) (v_prenex_2010 Int) (v_prenex_2011 Int) (v_prenex_2012 Int) (v_prenex_2008 (Array Int Int)) (v_prenex_2009 (Array Int Int)) (v_prenex_2007 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2009) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_prenex_2010)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2008) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2007))) (or (= (select (select .cse30 v_prenex_2013) v_prenex_2011) |c_ULTIMATE.start_main_~data_init~0#1|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2012) (= (select (select .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2011) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2011 0) (= (select (select .cse30 v_prenex_2012) v_prenex_2011) |c_ULTIMATE.start_main_~data_init~0#1|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2013) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2011)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_1789 Int) (v_prenex_1788 Int) (v_prenex_1791 Int) (v_prenex_1790 Int) (v_prenex_1787 (Array Int Int)) (v_prenex_1786 (Array Int Int))) (let ((.cse31 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1788)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1787) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1786))) (or (= (select (select .cse31 v_prenex_1790) v_prenex_1789) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse31 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1789) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1789 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse31 v_prenex_1791) v_prenex_1789)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1789)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (forall ((v_prenex_2006 Int) (v_prenex_2001 (Array Int Int)) (v_prenex_2004 Int) (v_prenex_2005 Int) (v_prenex_2002 (Array Int Int)) (v_prenex_2003 (Array Int Int))) (let ((.cse32 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2003) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_prenex_2004)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2002) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2001))) (or (< v_prenex_2005 0) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2006) (= (select (select .cse32 v_prenex_2006) v_prenex_2005) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2005) (= (select (select .cse32 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2005) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_2139 Int) (v_prenex_2141 (Array Int Int)) (v_prenex_2142 (Array Int Int)) (v_prenex_2143 Int) (v_prenex_2140 Int)) (let ((.cse33 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_2139)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2141) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2142))) (or (= (select (select .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2140) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2140 0) (= (select (select .cse33 v_prenex_2143) v_prenex_2140) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2140) (< v_prenex_2140 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)))) (or .cse4 (and (or .cse9 (forall ((v_prenex_1945 (Array Int Int)) (v_prenex_1946 (Array Int Int)) (v_prenex_1948 Int) (v_prenex_1947 Int)) (or (< v_prenex_1947 0) (= v_prenex_1948 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1946) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1945) v_prenex_1948) v_prenex_1947))))) (forall ((v_prenex_2024 Int) (v_prenex_2025 Int) (v_prenex_2026 Int) (v_prenex_2028 (Array Int Int)) (v_prenex_2029 (Array Int Int))) (let ((.cse34 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2029) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2028))) (or (= v_prenex_2026 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select .cse34 v_prenex_2025) v_prenex_2024) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse34 v_prenex_2026) v_prenex_2024) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2024 0) (= (select v_prenex_2028 v_prenex_2024) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2025 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (or (forall ((v_prenex_1955 (Array Int Int)) (v_prenex_1957 Int) (v_prenex_1956 Int) (v_prenex_1954 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1955) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1954) v_prenex_1957) v_prenex_1956) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1957 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< v_prenex_1956 0))) .cse5) (or .cse9 (forall ((v_prenex_1943 Int) (v_prenex_1941 (Array Int Int)) (v_prenex_1942 (Array Int Int)) (v_prenex_1944 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_1941 v_prenex_1943)) (< v_prenex_1943 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1942) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1941) v_prenex_1944) v_prenex_1943) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1944 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (or (and (forall ((v_prenex_1960 Int) (v_prenex_1961 (Array Int Int)) (v_prenex_1959 Int) (v_prenex_1958 Int) (v_prenex_1962 (Array Int Int))) (let ((.cse35 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1962) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1961))) (or (< v_prenex_1958 0) (= (select (select .cse35 v_prenex_1959) v_prenex_1958) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse35 v_prenex_1960) v_prenex_1958)) (= v_prenex_1960 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (forall ((v_prenex_1933 (Array Int Int)) (v_prenex_1935 Int) (v_prenex_1932 (Array Int Int)) (v_prenex_1934 Int)) (or (< v_prenex_1934 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1933) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1932) v_prenex_1935) v_prenex_1934)) (= v_prenex_1935 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_prenex_1936 (Array Int Int)) (v_prenex_1940 Int) (v_prenex_1937 (Array Int Int)) (v_prenex_1939 Int) (v_prenex_1938 Int)) (let ((.cse36 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1937) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1936))) (or (= (select (select .cse36 v_prenex_1939) v_prenex_1938) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse36 v_prenex_1940) v_prenex_1938) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1940 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_1936 v_prenex_1938)) (< v_prenex_1938 0))))) .cse5) (forall ((v_prenex_1953 Int) (v_prenex_1952 Int) (v_prenex_1951 Int) (v_prenex_1949 (Array Int Int)) (v_prenex_1950 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1950) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1949))) (or (= v_prenex_1952 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= v_prenex_1953 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< v_prenex_1951 0) (= (select (select .cse37 v_prenex_1953) v_prenex_1951) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse37 v_prenex_1952) v_prenex_1951) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (forall ((v_prenex_1833 Int) (v_prenex_1832 Int) (v_prenex_1831 (Array Int Int)) (v_prenex_1830 (Array Int Int)) (v_prenex_1835 Int) (v_prenex_1834 Int)) (let ((.cse38 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1832)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1831) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1830))) (or (= (select (select .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1833) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1833 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1833) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse38 v_prenex_1834) v_prenex_1833)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1834) (= (select (select .cse38 v_prenex_1835) v_prenex_1833) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or .cse4 (and (forall ((v_prenex_2105 Int) (v_prenex_2148 Int) (v_prenex_2107 (Array Int Int)) (v_prenex_2109 Int) (v_prenex_2108 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2107) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2108))) (or (= v_prenex_2105 0) (= (select (select .cse39 v_prenex_2148) v_prenex_2105) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2105) (= (select (select .cse39 v_prenex_2109) v_prenex_2105) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2105 0)))) (or .cse5 (forall ((v_prenex_2149 Int) (v_prenex_2147 (Array Int Int)) (v_prenex_2146 (Array Int Int)) (v_prenex_2144 Int)) (or (= v_prenex_2144 0) (< v_prenex_2144 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2146) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2147) v_prenex_2149) v_prenex_2144) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2144)))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (forall ((v_prenex_2129 Int) (v_prenex_2124 Int) (v_prenex_2125 Int) (v_prenex_2130 Int) (v_prenex_2126 (Array Int Int)) (v_prenex_2127 (Array Int Int)) (v_prenex_2128 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_2124)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2127) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2128) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2125) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2125 0) (< v_prenex_2125 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2125) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2126) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_prenex_2124)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2127) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2128) v_prenex_2130) v_prenex_2125) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_prenex_2126 .cse2 v_prenex_2124)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2127) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2128) v_prenex_2129) v_prenex_2125) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (and (forall ((v_prenex_1885 Int) (v_prenex_1884 Int) (v_prenex_1883 Int) (v_prenex_2021 (Array Int Int)) (v_prenex_1881 (Array Int Int)) (v_prenex_2022 Int)) (let ((.cse40 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2021) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_prenex_2022)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1881))) (or (= v_prenex_1885 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select .cse40 v_prenex_1885) v_prenex_1883) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1883 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse40 v_prenex_1884) v_prenex_1883)) (= v_prenex_1884 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select .cse40 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1883) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (forall ((v_prenex_1899 Int) (v_prenex_1897 (Array Int Int)) (v_prenex_1901 Int) (v_prenex_1900 Int)) (let ((.cse41 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1899)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1897))) (or (= (select (select .cse41 v_prenex_1901) v_prenex_1900) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse41 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1900)) (< v_prenex_1900 0) (= v_prenex_1901 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) .cse9) (or .cse5 (forall ((v_prenex_1888 Int) (v_prenex_1890 Int) (v_prenex_1886 (Array Int Int)) (v_prenex_1889 Int) (v_prenex_2018 (Array Int Int))) (let ((.cse42 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2018) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1886))) (or (= v_prenex_1890 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= v_prenex_1889 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 v_prenex_1890) v_prenex_1888)) (= (select (select .cse42 v_prenex_1889) v_prenex_1888) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1888 0))))) (or .cse9 (and (forall ((v_prenex_1875 Int) (v_prenex_1874 Int) (v_prenex_1873 Int) (v_prenex_1871 (Array Int Int))) (let ((.cse43 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1873)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1871))) (or (= v_prenex_1875 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select .cse43 v_prenex_1875) v_prenex_1874) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1874 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse43 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1874))))) (forall ((v_prenex_1880 Int) (v_prenex_1879 Int) (v_prenex_1878 Int) (v_prenex_1876 (Array Int Int))) (or (= v_prenex_1880 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1878)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1876) v_prenex_1880) v_prenex_1879)) (< v_prenex_1879 0))) (forall ((v_prenex_1929 Int) (v_prenex_1928 Int) (v_prenex_1927 Int) (v_prenex_1926 Int) (v_prenex_1930 (Array Int Int))) (let ((.cse44 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1926)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1930))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse44 v_prenex_1928) v_prenex_1927)) (= (select (select .cse44 v_prenex_1929) v_prenex_1927) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1927 0) (= (select (select .cse44 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1927) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1929 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))) (or .cse9 (forall ((v_prenex_1914 (Array Int Int)) (v_prenex_1918 Int) (v_prenex_1917 Int) (v_prenex_1916 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1916)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1914) v_prenex_1918) v_prenex_1917) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1918 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< v_prenex_1917 0)))) (or .cse9 (forall ((v_prenex_1910 Int) (v_prenex_1908 (Array Int Int)) (v_prenex_1913 Int) (v_prenex_1912 Int) (v_prenex_1911 Int)) (let ((.cse45 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1910)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1908))) (or (= v_prenex_1913 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select .cse45 v_prenex_1912) v_prenex_1911) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1911 0) (= (select (select .cse45 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1911) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1912 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse45 v_prenex_1913) v_prenex_1911)))))) (or .cse9 (forall ((v_prenex_1896 Int) (v_prenex_1895 Int) (v_prenex_1894 Int) (v_prenex_1893 Int) (v_prenex_1891 (Array Int Int))) (let ((.cse46 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1893)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1891))) (or (= v_prenex_1896 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse46 v_prenex_1896) v_prenex_1894)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse46 v_prenex_1895) v_prenex_1894)) (= (select (select .cse46 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1894) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1894 0))))) (forall ((v_prenex_1919 (Array Int Int)) (v_prenex_1925 Int) (v_prenex_1924 Int) (v_prenex_1923 Int) (v_prenex_1921 (Array Int Int)) (v_prenex_1922 Int)) (let ((.cse47 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1921) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_prenex_1922)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1919))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse47 v_prenex_1925) v_prenex_1923)) (= v_prenex_1925 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select .cse47 v_prenex_1924) v_prenex_1923) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1923 0) (= (select (select .cse47 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1923) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or .cse5 (forall ((v_prenex_2017 Int) (v_prenex_2015 Int) (v_prenex_2016 Int) (v_prenex_2014 (Array Int Int)) (v_prenex_2019 (Array Int Int))) (let ((.cse48 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2014) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2019))) (or (= (select (select .cse48 v_prenex_2016) v_prenex_2015) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse48 v_prenex_2017) v_prenex_2015)) (= v_prenex_2017 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< v_prenex_2015 0))))) (forall ((v_prenex_1902 (Array Int Int)) (v_prenex_1904 (Array Int Int)) (v_prenex_1907 Int) (v_prenex_1906 Int) (v_prenex_1905 Int)) (or (< v_prenex_1906 0) (= v_prenex_1907 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1904) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_prenex_1905)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1902) v_prenex_1907) v_prenex_1906))))) .cse10) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_1654 Int) (v_prenex_1653 Int) (v_prenex_1651 (Array Int Int)) (v_prenex_1652 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1654) (< v_prenex_1654 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1653)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1652) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1651) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1654) |c_ULTIMATE.start_main_~data_init~0#1|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (forall ((v_prenex_1813 (Array Int Int)) (v_prenex_1814 (Array Int Int)) (v_prenex_1817 Int) (v_prenex_1816 Int) (v_prenex_1985 (Array Int Int)) (v_prenex_1815 Int)) (let ((.cse49 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1985) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_prenex_1815)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1814) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1813))) (or (= (select (select .cse49 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1816) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1816) (< v_prenex_1816 0) (= (select (select .cse49 v_prenex_1817) v_prenex_1816) |c_ULTIMATE.start_main_~data_init~0#1|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1817)))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (forall ((v_prenex_1859 (Array Int Int)) (v_prenex_1858 (Array Int Int)) (v_prenex_1861 Int) (v_prenex_1860 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1860)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1859) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1858) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1861) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1861) (< v_prenex_1861 0))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or .cse9 .cse4 (forall ((v_prenex_2046 Int) (v_prenex_2048 (Array Int Int)) (v_prenex_2049 (Array Int Int)) (v_prenex_2050 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2048) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2049) v_prenex_2050) v_prenex_2046)) (= v_prenex_2046 0) (< v_prenex_2046 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2046)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_1987 Int) (v_prenex_1983 (Array Int Int)) (v_prenex_1984 (Array Int Int)) (v_prenex_1979 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1979) (< v_prenex_1979 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1987)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1984) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1983) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1979) |c_ULTIMATE.start_main_~data_init~0#1|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (forall ((v_prenex_1822 Int) (v_prenex_1821 Int) (v_prenex_1819 (Array Int Int)) (v_prenex_1818 (Array Int Int)) (v_prenex_1820 (Array Int Int)) (v_prenex_1824 Int) (v_prenex_1823 Int)) (let ((.cse50 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1820) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_prenex_1821)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1819) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1818))) (or (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1822) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1823) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse50 v_prenex_1824) v_prenex_1822)) (= (select (select .cse50 v_prenex_1823) v_prenex_1822) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse50 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1822) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1822 0)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or .cse9 .cse4 (and (forall ((v_prenex_1837 (Array Int Int)) (v_prenex_1836 (Array Int Int)) (v_prenex_1839 Int) (v_prenex_1838 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1837) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1836) v_prenex_1839) v_prenex_1838) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1838) (< v_prenex_1838 0) (= v_prenex_1839 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_prenex_1799 Int) (v_prenex_1798 Int) (v_prenex_1840 Int) (v_prenex_1796 (Array Int Int)) (v_prenex_1797 (Array Int Int))) (let ((.cse51 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1797) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1796))) (or (= (select (select .cse51 v_prenex_1840) v_prenex_1798) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse51 v_prenex_1799) v_prenex_1798) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1798) (= v_prenex_1799 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (< v_prenex_1798 0)))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (forall ((v_prenex_2035 Int) (v_prenex_2036 Int) (v_prenex_2031 (Array Int Int)) (v_prenex_2032 (Array Int Int)) (v_prenex_2033 Int) (v_prenex_2034 Int)) (let ((.cse52 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_2033)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2032) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2031))) (or (= (select (select .cse52 v_prenex_2035) v_prenex_2034) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2034 0) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2036) (= (select (select .cse52 v_prenex_2036) v_prenex_2034) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse52 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2034) |c_ULTIMATE.start_main_~data_init~0#1|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2035) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2034)))))) (or (and (or (forall ((v_arrayElimArr_26 (Array Int Int)) (v_prenex_2103 Int) (v_prenex_2104 Int) (v_prenex_2102 (Array Int Int)) (v_prenex_2100 Int)) (let ((.cse53 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_26) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2102))) (or (= (select (select .cse53 v_prenex_2104) v_prenex_2100) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2100 0) (= v_prenex_2100 0) (= (select (select .cse53 v_prenex_2103) v_prenex_2100) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse5) (or .cse5 (and (forall ((v_prenex_2133 (Array Int Int)) (v_prenex_2135 Int) (v_prenex_2086 (Array Int Int)) (v_prenex_2087 Int) (v_prenex_2084 Int)) (let ((.cse54 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2133) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2086))) (or (< v_prenex_2084 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse54 v_prenex_2135) v_prenex_2084)) (= (select (select .cse54 v_prenex_2087) v_prenex_2084) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2084 0)))) (forall ((v_prenex_2082 (Array Int Int)) (v_prenex_2079 Int) (v_prenex_2080 (Array Int Int)) (v_prenex_2083 Int)) (or (= v_prenex_2079 0) (< v_prenex_2079 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2080) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2082) v_prenex_2083) v_prenex_2079) |c_ULTIMATE.start_main_~data_init~0#1|))))) (forall ((v_prenex_2096 (Array Int Int)) (v_prenex_2098 (Array Int Int)) (v_prenex_2099 Int) (v_prenex_2094 Int) (v_prenex_2095 Int)) (or (< v_prenex_2095 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2096) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_prenex_2094)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2098) v_prenex_2099) v_prenex_2095)) (= v_prenex_2095 0))) (forall ((v_prenex_2092 Int) (v_prenex_2132 (Array Int Int)) (v_prenex_2088 Int) (v_prenex_2089 Int) (v_prenex_2093 Int) (v_prenex_2091 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store v_prenex_2132 .cse2 v_prenex_2088)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2091) v_prenex_2092) v_prenex_2089) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_2088)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2091) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2089) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2089 0) (= v_prenex_2089 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2132) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_prenex_2088)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2091) v_prenex_2093) v_prenex_2089)))) (or .cse9 (forall ((v_prenex_2136 Int) (v_prenex_2137 Int) (v_prenex_2131 Int) (v_prenex_2134 (Array Int Int))) (let ((.cse55 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_2131)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2134))) (or (= v_prenex_2137 0) (< v_prenex_2137 0) (= (select (select .cse55 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2137) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse55 v_prenex_2136) v_prenex_2137))))))) .cse10) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (forall ((v_prenex_2117 Int) (v_arrayElimArr_24 (Array Int Int)) (v_prenex_2114 Int) (v_prenex_2115 (Array Int Int)) (v_prenex_2116 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 (select v_arrayElimArr_24 .cse2))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2115) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2116) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_2114)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2115) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2116) v_prenex_2117) v_prenex_2114)) (= v_prenex_2114 0) (< v_prenex_2114 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2114))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_prenex_1826 (Array Int Int)) (v_prenex_1825 (Array Int Int)) (v_prenex_1828 Int) (v_prenex_1827 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1827)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1826) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1825) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1828)) (< v_prenex_1828 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1828))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or .cse4 (and (forall ((v_prenex_1998 Int) (v_prenex_1997 Int) (v_prenex_1994 (Array Int Int)) (v_prenex_1996 (Array Int Int)) (v_prenex_1999 Int)) (let ((.cse56 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1996) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1994))) (or (= v_prenex_1999 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse56 v_prenex_1998) v_prenex_1997)) (< v_prenex_1997 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1997) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse56 v_prenex_1999) v_prenex_1997)) (= v_prenex_1998 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (or .cse9 (forall ((v_prenex_1868 (Array Int Int)) (v_prenex_1867 (Array Int Int)) (v_prenex_1870 Int) (v_prenex_1869 Int)) (or (< v_prenex_1869 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1869) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1868) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1867) v_prenex_1870) v_prenex_1869) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1870 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))))) (or .cse4 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_108 Int)) (let ((.cse57 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1851))) (or (= (select (select .cse57 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~data_init~0#1|) (= |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (= (select (select .cse57 v_arrayElimCell_101) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|))))) (or (and (or .cse9 (forall ((v_prenex_1965 Int) (v_prenex_1963 (Array Int Int)) (v_prenex_1967 Int) (v_prenex_1966 Int)) (or (= v_prenex_1967 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1965)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1963) v_prenex_1967) v_prenex_1966)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1966) (< v_prenex_1966 0)))) (forall ((v_prenex_2037 (Array Int Int)) (v_prenex_2042 Int) (v_prenex_2039 (Array Int Int)) (v_prenex_2040 Int) (v_prenex_2041 Int)) (or (< v_prenex_2041 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_2041) (= v_prenex_2042 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2039) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_prenex_2040)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2037) v_prenex_2042) v_prenex_2041))))) .cse10) (or (and (or .cse9 (forall ((v_prenex_1674 Int) (v_prenex_1673 Int) (v_prenex_1672 Int) (v_prenex_1670 (Array Int Int))) (let ((.cse58 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1672)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1670))) (or (< v_prenex_1673 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1673) (= v_prenex_1674 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse58 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1673)) (= (select (select .cse58 v_prenex_1674) v_prenex_1673) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_102 Int) (v_prenex_1971 (Array Int Int)) (v_prenex_1969 Int) (v_prenex_1968 Int)) (let ((.cse59 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1971))) (or (< v_prenex_1968 0) (= v_prenex_1969 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select .cse59 v_arrayElimCell_102) v_prenex_1968) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1968) (= (select (select .cse59 v_prenex_1969) v_prenex_1968) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse5) (forall ((v_prenex_1679 Int) (v_prenex_1678 Int) (v_prenex_1681 Int) (v_prenex_1675 (Array Int Int)) (v_prenex_1680 Int) (v_prenex_1677 (Array Int Int))) (let ((.cse60 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1677) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_prenex_1678)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1675))) (or (= (select (select .cse60 v_prenex_1681) v_prenex_1679) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1679) (< v_prenex_1679 0) (= (select (select .cse60 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1679) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse60 v_prenex_1680) v_prenex_1679) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1681 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (or (forall ((v_prenex_1659 (Array Int Int)) (v_prenex_1664 Int) (v_prenex_1663 Int) (v_prenex_1662 Int) (v_prenex_1661 Int)) (let ((.cse61 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1661)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1659))) (or (< v_prenex_1662 0) (= (select (select .cse61 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) v_prenex_1662) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse61 v_prenex_1663) v_prenex_1662) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1664 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse61 v_prenex_1664) v_prenex_1662)) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1662)))) .cse9) (forall ((v_prenex_1657 Int) (v_prenex_80 (Array Int Int)) (v_prenex_1970 Int) (v_prenex_1655 (Array Int Int)) (v_prenex_1658 Int)) (or (= v_prenex_1658 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< v_prenex_1657 0) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1657) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_80) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 v_prenex_1970)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1655) v_prenex_1658) v_prenex_1657) |c_ULTIMATE.start_main_~data_init~0#1|))) (or .cse9 (forall ((v_prenex_1668 Int) (v_prenex_1667 Int) (v_prenex_1665 (Array Int Int)) (v_prenex_1669 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (store .cse1 .cse2 v_prenex_1667)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1665) v_prenex_1669) v_prenex_1668) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1668 0) (= v_prenex_1669 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset| v_prenex_1668))))) .cse10)))) is different from true [2025-03-17 12:20:29,504 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse3 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 0))) (.cse10 (not .cse4)) (.cse12 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (.cse1 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse2 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 8))) (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (forall ((v_prenex_1795 Int) (v_prenex_1794 Int) (v_prenex_1792 (Array Int Int)) (v_prenex_1793 (Array Int Int)) (v_prenex_1829 Int)) (let ((.cse0 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1794)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1793) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1792))) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1795) (< v_prenex_1795 0) (= (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1795) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse0 v_prenex_1829) v_prenex_1795) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or .cse3 .cse4 (forall ((v_prenex_2046 Int) (v_prenex_2048 (Array Int Int)) (v_prenex_2049 (Array Int Int)) (v_prenex_2050 Int)) (or (= v_prenex_2046 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2048) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2049) v_prenex_2050) v_prenex_2046) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2046 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2046)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_prenex_1991 Int) (v_prenex_1992 (Array Int Int)) (v_prenex_1990 Int) (v_prenex_1993 (Array Int Int)) (v_prenex_1988 Int)) (let ((.cse5 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1991)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1993) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1992))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1988)) (< v_prenex_1988 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse5 v_prenex_1990) v_prenex_1988)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1990) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1988)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (forall ((v_prenex_1789 Int) (v_prenex_1788 Int) (v_prenex_1791 Int) (v_prenex_1790 Int) (v_prenex_1787 (Array Int Int)) (v_prenex_1786 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1788)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1787) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1786))) (or (= (select (select .cse6 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1789) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse6 v_prenex_1790) v_prenex_1789) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse6 v_prenex_1791) v_prenex_1789) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1789 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1789)))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_prenex_2035 Int) (v_prenex_2036 Int) (v_prenex_2031 (Array Int Int)) (v_prenex_2032 (Array Int Int)) (v_prenex_2033 Int) (v_prenex_2034 Int)) (let ((.cse7 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_2033)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2032) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2031))) (or (= (select (select .cse7 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_2034) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2034 0) (= (select (select .cse7 v_prenex_2035) v_prenex_2034) |c_ULTIMATE.start_main_~data_init~0#1|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2036) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2034) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2035) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse7 v_prenex_2036) v_prenex_2034))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)))) (or .cse3 (and (forall ((v_prenex_2120 Int) (v_prenex_2123 (Array Int Int)) (v_prenex_2121 Int) (v_prenex_2122 Int) (v_prenex_2119 (Array Int Int))) (let ((.cse8 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2123) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2119))) (or (= v_prenex_2122 0) (< v_prenex_2122 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse8 v_prenex_2120) v_prenex_2122)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse8 v_prenex_2121) v_prenex_2122))))) (forall ((v_prenex_2059 Int) (v_prenex_2057 (Array Int Int)) (v_prenex_2056 Int) (v_prenex_2058 (Array Int Int)) (v_prenex_2060 Int)) (let ((.cse9 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2057) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2058))) (or (= (select (select .cse9 v_prenex_2059) v_prenex_2056) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2056 0) (= (select (select .cse9 v_prenex_2060) v_prenex_2056) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2056 0)))) (or (and (forall ((v_prenex_2053 (Array Int Int)) (v_prenex_2054 (Array Int Int)) (v_prenex_2055 Int) (v_prenex_2051 Int)) (or (< v_prenex_2051 0) (= (select v_prenex_2054 v_prenex_2051) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2051 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2053) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2054) v_prenex_2055) v_prenex_2051)))) (forall ((v_prenex_2077 (Array Int Int)) (v_prenex_2076 (Array Int Int)) (v_prenex_2075 Int) (v_prenex_2078 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2076) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2077) v_prenex_2078) v_prenex_2075) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2075 0) (< v_prenex_2075 0)))) .cse4) (or (forall ((v_prenex_2062 (Array Int Int)) (v_prenex_2063 (Array Int Int)) (v_prenex_2064 Int) (v_prenex_2061 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2062) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2063) v_prenex_2064) v_prenex_2061) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2061 0) (< v_prenex_2061 0))) .cse10) (or (forall ((v_prenex_2067 (Array Int Int)) (v_prenex_2069 Int) (v_prenex_2065 Int) (v_prenex_2068 (Array Int Int))) (or (< v_prenex_2065 0) (= v_prenex_2065 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2067) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2068) v_prenex_2069) v_prenex_2065) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse10) (forall ((v_prenex_2071 (Array Int Int)) (v_prenex_2070 Int) (v_prenex_2072 (Array Int Int)) (v_prenex_2073 Int) (v_prenex_2074 Int)) (let ((.cse11 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2071) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2072))) (or (= (select (select .cse11 v_prenex_2074) v_prenex_2070) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_2072 v_prenex_2070) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2070 0) (= v_prenex_2070 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse11 v_prenex_2073) v_prenex_2070))))))) (or (and (forall ((v_prenex_2037 (Array Int Int)) (v_prenex_2042 Int) (v_prenex_2039 (Array Int Int)) (v_prenex_2040 Int) (v_prenex_2041 Int)) (or (< v_prenex_2041 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2039) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2 v_prenex_2040)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2037) v_prenex_2042) v_prenex_2041) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2041) (= v_prenex_2042 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or .cse4 (forall ((v_prenex_1965 Int) (v_prenex_1963 (Array Int Int)) (v_prenex_1967 Int) (v_prenex_1966 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1966) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1965)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1963) v_prenex_1967) v_prenex_1966) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1967 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< v_prenex_1966 0))))) .cse12) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_prenex_1987 Int) (v_prenex_1983 (Array Int Int)) (v_prenex_1984 (Array Int Int)) (v_prenex_1979 Int)) (or (< v_prenex_1979 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1979) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1987)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1984) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1983) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1979) |c_ULTIMATE.start_main_~data_init~0#1|))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and (forall ((v_prenex_1811 Int) (v_prenex_1809 (Array Int Int)) (v_prenex_1810 (Array Int Int)) (v_prenex_1812 Int)) (or (< v_prenex_1811 0) (= v_prenex_1812 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1810) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1809) v_prenex_1812) v_prenex_1811)))) (forall ((v_prenex_1846 (Array Int Int)) (v_prenex_1844 Int) (v_prenex_1845 (Array Int Int)) (v_prenex_1843 Int) (v_prenex_1842 Int)) (let ((.cse13 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1846) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1845))) (or (= v_prenex_1843 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse13 v_prenex_1844) v_prenex_1842) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse13 v_prenex_1843) v_prenex_1842) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_1845 v_prenex_1842) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1842 0)))) (forall ((v_prenex_1801 (Array Int Int)) (v_prenex_1804 Int) (v_prenex_1803 Int) (v_prenex_1800 (Array Int Int)) (v_prenex_1802 Int)) (let ((.cse14 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1801) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1800))) (or (< v_prenex_1802 0) (= v_prenex_1803 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse14 v_prenex_1804) v_prenex_1802)) (= (select (select .cse14 v_prenex_1803) v_prenex_1802) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1806 (Array Int Int)) (v_prenex_1805 (Array Int Int)) (v_prenex_1808 Int) (v_prenex_1807 Int)) (or (< v_prenex_1807 0) (= v_prenex_1808 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_1805 v_prenex_1807)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1806) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1805) v_prenex_1808) v_prenex_1807))))) .cse3 .cse4) (or .cse3 (and (or .cse4 (forall ((v_prenex_1945 (Array Int Int)) (v_prenex_1946 (Array Int Int)) (v_prenex_1948 Int) (v_prenex_1947 Int)) (or (= v_prenex_1948 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1946) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1945) v_prenex_1948) v_prenex_1947)) (< v_prenex_1947 0)))) (forall ((v_prenex_1953 Int) (v_prenex_1952 Int) (v_prenex_1951 Int) (v_prenex_1949 (Array Int Int)) (v_prenex_1950 (Array Int Int))) (let ((.cse15 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1950) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1949))) (or (= v_prenex_1953 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1951 0) (= (select (select .cse15 v_prenex_1953) v_prenex_1951) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1952 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse15 v_prenex_1952) v_prenex_1951))))) (or (and (forall ((v_prenex_1960 Int) (v_prenex_1961 (Array Int Int)) (v_prenex_1959 Int) (v_prenex_1958 Int) (v_prenex_1962 (Array Int Int))) (let ((.cse16 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1962) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1961))) (or (= (select (select .cse16 v_prenex_1959) v_prenex_1958) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1958 0) (= (select (select .cse16 v_prenex_1960) v_prenex_1958) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1960 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_prenex_1933 (Array Int Int)) (v_prenex_1935 Int) (v_prenex_1932 (Array Int Int)) (v_prenex_1934 Int)) (or (< v_prenex_1934 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1933) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1932) v_prenex_1935) v_prenex_1934) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1935 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_prenex_1936 (Array Int Int)) (v_prenex_1940 Int) (v_prenex_1937 (Array Int Int)) (v_prenex_1939 Int) (v_prenex_1938 Int)) (let ((.cse17 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1937) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1936))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse17 v_prenex_1940) v_prenex_1938)) (= (select (select .cse17 v_prenex_1939) v_prenex_1938) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1940 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_1936 v_prenex_1938)) (< v_prenex_1938 0))))) .cse10) (forall ((v_prenex_2024 Int) (v_prenex_2025 Int) (v_prenex_2026 Int) (v_prenex_2028 (Array Int Int)) (v_prenex_2029 (Array Int Int))) (let ((.cse18 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2029) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2028))) (or (= (select (select .cse18 v_prenex_2025) v_prenex_2024) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2026 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_2024 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse18 v_prenex_2026) v_prenex_2024)) (= v_prenex_2025 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select v_prenex_2028 v_prenex_2024) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or .cse4 (forall ((v_prenex_1943 Int) (v_prenex_1941 (Array Int Int)) (v_prenex_1942 (Array Int Int)) (v_prenex_1944 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_prenex_1941 v_prenex_1943)) (< v_prenex_1943 0) (= v_prenex_1944 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1942) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1941) v_prenex_1944) v_prenex_1943) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (forall ((v_prenex_1955 (Array Int Int)) (v_prenex_1957 Int) (v_prenex_1956 Int) (v_prenex_1954 (Array Int Int))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1955) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1954) v_prenex_1957) v_prenex_1956)) (= v_prenex_1957 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1956 0))) .cse10))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (forall ((v_prenex_2013 Int) (v_prenex_2010 Int) (v_prenex_2011 Int) (v_prenex_2012 Int) (v_prenex_2008 (Array Int Int)) (v_prenex_2009 (Array Int Int)) (v_prenex_2007 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2009) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2 v_prenex_2010)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2008) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2007))) (or (= (select (select .cse19 v_prenex_2013) v_prenex_2011) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse19 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_2011)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2012) (< v_prenex_2011 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2011) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2013) (= (select (select .cse19 v_prenex_2012) v_prenex_2011) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (forall ((v_prenex_2117 Int) (v_arrayElimArr_24 (Array Int Int)) (v_prenex_2114 Int) (v_prenex_2115 (Array Int Int)) (v_prenex_2116 (Array Int Int))) (or (= v_prenex_2114 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_24) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2115) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2116) v_prenex_2117) v_prenex_2114) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2114 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2114) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 (select v_arrayElimArr_24 .cse2))) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2115) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2116) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_2114) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (forall ((v_prenex_1813 (Array Int Int)) (v_prenex_1814 (Array Int Int)) (v_prenex_1817 Int) (v_prenex_1816 Int) (v_prenex_1985 (Array Int Int)) (v_prenex_1815 Int)) (let ((.cse20 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1985) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2 v_prenex_1815)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1814) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1813))) (or (< v_prenex_1816 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1816) (= (select (select .cse20 v_prenex_1817) v_prenex_1816) |c_ULTIMATE.start_main_~data_init~0#1|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1817) (= (select (select .cse20 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1816) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and (or .cse4 (forall ((v_prenex_1757 (Array Int Int)) (v_prenex_1759 Int) (v_prenex_1756 (Array Int Int)) (v_prenex_1758 Int)) (or (= v_prenex_1759 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1758 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1757) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1756) v_prenex_1759) v_prenex_1758)) (= (select v_prenex_1756 v_prenex_1758) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (and (forall ((v_prenex_1691 (Array Int Int)) (v_prenex_1695 Int) (v_prenex_1692 (Array Int Int)) (v_prenex_1694 Int) (v_prenex_1693 Int)) (let ((.cse21 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1692) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1691))) (or (= v_prenex_1694 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1693 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse21 v_prenex_1694) v_prenex_1693)) (= (select (select .cse21 v_prenex_1695) v_prenex_1693) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1695 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_prenex_1763 Int) (v_prenex_1762 Int) (v_prenex_1761 Int) (v_prenex_1765 (Array Int Int)) (v_prenex_1766 (Array Int Int))) (let ((.cse22 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1766) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1765))) (or (< v_prenex_1761 0) (= v_prenex_1763 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select v_prenex_1765 v_prenex_1761) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1762 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse22 v_prenex_1762) v_prenex_1761) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse22 v_prenex_1763) v_prenex_1761) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1705 (Array Int Int)) (v_prenex_1706 (Array Int Int)) (v_prenex_1709 Int) (v_prenex_1708 Int) (v_prenex_1707 Int)) (let ((.cse23 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1706) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1705))) (or (= (select (select .cse23 v_prenex_1708) v_prenex_1707) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse23 v_prenex_1709) v_prenex_1707)) (= v_prenex_1709 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1707 0)))) (forall ((v_prenex_1702 (Array Int Int)) (v_prenex_1704 Int) (v_prenex_1701 (Array Int Int)) (v_prenex_1703 Int)) (or (= v_prenex_1704 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1703 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1702) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1701) v_prenex_1704) v_prenex_1703) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_1700 Int) (v_prenex_1699 Int) (v_prenex_1698 Int) (v_prenex_1697 (Array Int Int)) (v_prenex_1696 (Array Int Int))) (let ((.cse24 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1697) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1696))) (or (< v_prenex_1698 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse24 v_prenex_1699) v_prenex_1698)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse24 v_prenex_1700) v_prenex_1698)) (= (select v_prenex_1696 v_prenex_1698) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1700 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse10) (or .cse4 (forall ((v_prenex_1725 (Array Int Int)) (v_prenex_1724 (Array Int Int)) (v_prenex_1727 Int) (v_prenex_1726 Int)) (or (< v_prenex_1726 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1726) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1725) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1724) v_prenex_1727) v_prenex_1726) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1727 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_prenex_1768 (Array Int Int)) (v_prenex_1771 Int) (v_prenex_1770 Int) (v_prenex_1767 (Array Int Int)) (v_prenex_1769 Int)) (let ((.cse25 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1768) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1767))) (or (= (select (select .cse25 v_prenex_1771) v_prenex_1769) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1769) (= (select (select .cse25 v_prenex_1770) v_prenex_1769) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1769 0) (= v_prenex_1770 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select v_prenex_1767 v_prenex_1769) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1771 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_prenex_1723 Int) (v_prenex_1722 Int) (v_prenex_1721 Int) (v_prenex_1719 (Array Int Int)) (v_prenex_1720 (Array Int Int))) (let ((.cse26 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1720) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1719))) (or (= (select (select .cse26 v_prenex_1723) v_prenex_1721) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse26 v_prenex_1722) v_prenex_1721) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1723 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= v_prenex_1722 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1721 0) (= (select v_prenex_1719 v_prenex_1721) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1978 (Array Int Int)) (v_prenex_1976 Int) (v_prenex_1977 (Array Int Int)) (v_prenex_1975 Int) (v_prenex_1974 Int)) (let ((.cse27 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1978) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1977))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse27 v_prenex_1975) v_prenex_1974)) (= v_prenex_1975 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1974) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse27 v_prenex_1976) v_prenex_1974)) (< v_prenex_1974 0) (= v_prenex_1976 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (or (and (forall ((v_prenex_1730 Int) (v_prenex_1729 Int) (v_prenex_1728 Int) (v_prenex_1732 (Array Int Int)) (v_prenex_1731 (Array Int Int))) (let ((.cse28 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1732) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1731))) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1728) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse28 v_prenex_1729) v_prenex_1728)) (= (select (select .cse28 v_prenex_1730) v_prenex_1728) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1730 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1728 0)))) (forall ((v_prenex_1685 Int) (v_prenex_1682 (Array Int Int)) (v_prenex_1684 Int) (v_prenex_1683 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1684) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1683) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1682) v_prenex_1685) v_prenex_1684) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1685 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1684 0))) (forall ((v_prenex_1689 Int) (v_prenex_1688 Int) (v_prenex_1686 (Array Int Int)) (v_prenex_1690 Int) (v_prenex_1687 (Array Int Int))) (let ((.cse29 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1687) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1686))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse29 v_prenex_1690) v_prenex_1688)) (= v_prenex_1690 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select v_prenex_1686 v_prenex_1688) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse29 v_prenex_1689) v_prenex_1688) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1688 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1688))))) .cse10) (or (and (forall ((v_prenex_1712 Int) (v_prenex_1710 (Array Int Int)) (v_prenex_1711 (Array Int Int)) (v_prenex_1713 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1711) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1710) v_prenex_1713) v_prenex_1712)) (< v_prenex_1712 0) (= v_prenex_1713 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_prenex_1775 Int) (v_prenex_1774 Int) (v_prenex_1773 Int) (v_prenex_1776 (Array Int Int)) (v_prenex_1777 (Array Int Int))) (let ((.cse30 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1777) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1776))) (or (= v_prenex_1775 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1773 0) (= (select (select .cse30 v_prenex_1775) v_prenex_1773) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse30 v_prenex_1774) v_prenex_1773) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1714 (Array Int Int)) (v_prenex_1715 (Array Int Int)) (v_prenex_1718 Int) (v_prenex_1717 Int) (v_prenex_1716 Int)) (let ((.cse31 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1715) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1714))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse31 v_prenex_1717) v_prenex_1716)) (= v_prenex_1718 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse31 v_prenex_1718) v_prenex_1716) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select v_prenex_1714 v_prenex_1716) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1716 0))))) .cse10) (forall ((v_prenex_1743 Int) (v_prenex_1738 (Array Int Int)) (v_prenex_1742 Int) (v_prenex_1741 Int) (v_prenex_1740 (Array Int Int))) (let ((.cse32 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1740) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1738))) (or (= (select (select .cse32 v_prenex_1742) v_prenex_1741) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1741 0) (= v_prenex_1742 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse32 v_prenex_1743) v_prenex_1741) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1743 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (or (forall ((v_prenex_1736 Int) (v_prenex_1734 (Array Int Int)) (v_prenex_1733 (Array Int Int)) (v_prenex_1735 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1734) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1733) v_prenex_1736) v_prenex_1735)) (= v_prenex_1736 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1735 0))) .cse4) (or (forall ((v_prenex_1755 Int) (v_prenex_1754 Int) (v_prenex_1752 (Array Int Int)) (v_prenex_1753 (Array Int Int))) (or (= (select v_prenex_1752 v_prenex_1754) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1753) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1752) v_prenex_1755) v_prenex_1754) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1755 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1754 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1754))) .cse4) (or (forall ((v_prenex_1749 (Array Int Int)) (v_prenex_1748 (Array Int Int)) (v_prenex_1751 Int) (v_prenex_1750 Int)) (or (< v_prenex_1750 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1749) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1748) v_prenex_1751) v_prenex_1750) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1751 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1750))) .cse10) (or (forall ((v_prenex_1745 (Array Int Int)) (v_prenex_1747 Int) (v_prenex_1746 Int) (v_prenex_1744 (Array Int Int))) (or (< v_prenex_1746 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1745) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1744) v_prenex_1747) v_prenex_1746) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1747 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse10)) .cse3) (or (forall ((v_prenex_1848 (Array Int Int)) (v_prenex_1852 Int) (v_prenex_1851 Int) (v_prenex_1850 Int)) (or (= v_prenex_1852 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< v_prenex_1851 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1850)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1848) v_prenex_1852) v_prenex_1851)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1851))) .cse4 .cse12) (or .cse3 (and (forall ((v_prenex_1998 Int) (v_prenex_1997 Int) (v_prenex_1994 (Array Int Int)) (v_prenex_1996 (Array Int Int)) (v_prenex_1999 Int)) (let ((.cse33 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1996) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1994))) (or (= v_prenex_1999 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse33 v_prenex_1998) v_prenex_1997) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1998 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1997 0) (= (select (select .cse33 v_prenex_1999) v_prenex_1997) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1997)))) (or (forall ((v_prenex_1868 (Array Int Int)) (v_prenex_1867 (Array Int Int)) (v_prenex_1870 Int) (v_prenex_1869 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1869) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1868) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1867) v_prenex_1870) v_prenex_1869) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1869 0) (= v_prenex_1870 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) .cse4))) (or (and (forall ((v_prenex_1902 (Array Int Int)) (v_prenex_1904 (Array Int Int)) (v_prenex_1907 Int) (v_prenex_1906 Int) (v_prenex_1905 Int)) (or (< v_prenex_1906 0) (= v_prenex_1907 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1904) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2 v_prenex_1905)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1902) v_prenex_1907) v_prenex_1906)))) (or (forall ((v_prenex_2017 Int) (v_prenex_2015 Int) (v_prenex_2016 Int) (v_prenex_2014 (Array Int Int)) (v_prenex_2019 (Array Int Int))) (let ((.cse34 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2014) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2019))) (or (= v_prenex_2017 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< v_prenex_2015 0) (= (select (select .cse34 v_prenex_2016) v_prenex_2015) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse34 v_prenex_2017) v_prenex_2015) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse10) (forall ((v_prenex_1919 (Array Int Int)) (v_prenex_1925 Int) (v_prenex_1924 Int) (v_prenex_1923 Int) (v_prenex_1921 (Array Int Int)) (v_prenex_1922 Int)) (let ((.cse35 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1921) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2 v_prenex_1922)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1919))) (or (= (select (select .cse35 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1923) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1925 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select .cse35 v_prenex_1925) v_prenex_1923) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse35 v_prenex_1924) v_prenex_1923) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1923 0)))) (or (forall ((v_prenex_1896 Int) (v_prenex_1895 Int) (v_prenex_1894 Int) (v_prenex_1893 Int) (v_prenex_1891 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1893)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1891))) (or (= v_prenex_1896 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select .cse36 v_prenex_1896) v_prenex_1894) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1894 0) (= (select (select .cse36 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1894) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse36 v_prenex_1895) v_prenex_1894) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse4) (or (forall ((v_prenex_1888 Int) (v_prenex_1890 Int) (v_prenex_1886 (Array Int Int)) (v_prenex_1889 Int) (v_prenex_2018 (Array Int Int))) (let ((.cse37 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2018) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1886))) (or (= v_prenex_1890 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= v_prenex_1889 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse37 v_prenex_1889) v_prenex_1888)) (< v_prenex_1888 0) (= (select (select .cse37 v_prenex_1890) v_prenex_1888) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse10) (or (and (forall ((v_prenex_1880 Int) (v_prenex_1879 Int) (v_prenex_1878 Int) (v_prenex_1876 (Array Int Int))) (or (= v_prenex_1880 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< v_prenex_1879 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1878)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1876) v_prenex_1880) v_prenex_1879)))) (forall ((v_prenex_1929 Int) (v_prenex_1928 Int) (v_prenex_1927 Int) (v_prenex_1926 Int) (v_prenex_1930 (Array Int Int))) (let ((.cse38 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1926)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1930))) (or (< v_prenex_1927 0) (= (select (select .cse38 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1927) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1929 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select .cse38 v_prenex_1928) v_prenex_1927) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse38 v_prenex_1929) v_prenex_1927) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_prenex_1875 Int) (v_prenex_1874 Int) (v_prenex_1873 Int) (v_prenex_1871 (Array Int Int))) (let ((.cse39 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1873)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1871))) (or (= v_prenex_1875 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse39 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1874)) (= (select (select .cse39 v_prenex_1875) v_prenex_1874) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1874 0))))) .cse4) (or .cse4 (forall ((v_prenex_1910 Int) (v_prenex_1908 (Array Int Int)) (v_prenex_1913 Int) (v_prenex_1912 Int) (v_prenex_1911 Int)) (let ((.cse40 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1910)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1908))) (or (= v_prenex_1913 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select .cse40 v_prenex_1912) v_prenex_1911) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse40 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1911) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1911 0) (= v_prenex_1912 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select .cse40 v_prenex_1913) v_prenex_1911) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse4 (forall ((v_prenex_1899 Int) (v_prenex_1897 (Array Int Int)) (v_prenex_1901 Int) (v_prenex_1900 Int)) (let ((.cse41 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1899)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1897))) (or (= (select (select .cse41 v_prenex_1901) v_prenex_1900) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse41 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1900)) (< v_prenex_1900 0) (= v_prenex_1901 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))))) (or .cse4 (forall ((v_prenex_1914 (Array Int Int)) (v_prenex_1918 Int) (v_prenex_1917 Int) (v_prenex_1916 Int)) (or (= v_prenex_1918 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1916)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1914) v_prenex_1918) v_prenex_1917) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1917 0)))) (forall ((v_prenex_1885 Int) (v_prenex_1884 Int) (v_prenex_1883 Int) (v_prenex_2021 (Array Int Int)) (v_prenex_1881 (Array Int Int)) (v_prenex_2022 Int)) (let ((.cse42 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2021) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2 v_prenex_2022)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1881))) (or (= v_prenex_1885 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 v_prenex_1884) v_prenex_1883)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 v_prenex_1885) v_prenex_1883)) (< v_prenex_1883 0) (= v_prenex_1884 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select .cse42 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1883) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse12) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (forall ((v_prenex_1822 Int) (v_prenex_1821 Int) (v_prenex_1819 (Array Int Int)) (v_prenex_1818 (Array Int Int)) (v_prenex_1820 (Array Int Int)) (v_prenex_1824 Int) (v_prenex_1823 Int)) (let ((.cse43 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1820) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2 v_prenex_1821)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1819) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1818))) (or (= (select (select .cse43 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1822) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse43 v_prenex_1824) v_prenex_1822) |c_ULTIMATE.start_main_~data_init~0#1|) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1823) (= (select (select .cse43 v_prenex_1823) v_prenex_1822) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1822 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1822)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and (forall ((v_prenex_1837 (Array Int Int)) (v_prenex_1836 (Array Int Int)) (v_prenex_1839 Int) (v_prenex_1838 Int)) (or (= v_prenex_1839 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1838) (< v_prenex_1838 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1837) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1836) v_prenex_1839) v_prenex_1838)))) (forall ((v_prenex_1799 Int) (v_prenex_1798 Int) (v_prenex_1840 Int) (v_prenex_1796 (Array Int Int)) (v_prenex_1797 (Array Int Int))) (let ((.cse44 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1797) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1796))) (or (= (select (select .cse44 v_prenex_1840) v_prenex_1798) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse44 v_prenex_1799) v_prenex_1798) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1799 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (< v_prenex_1798 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1798))))) .cse3 .cse4) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (forall ((v_prenex_1826 (Array Int Int)) (v_prenex_1825 (Array Int Int)) (v_prenex_1828 Int) (v_prenex_1827 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1828) (< v_prenex_1828 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1827)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1826) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1825) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1828) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (or (and (or (forall ((v_prenex_1668 Int) (v_prenex_1667 Int) (v_prenex_1665 (Array Int Int)) (v_prenex_1669 Int)) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1667)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1665) v_prenex_1669) v_prenex_1668)) (< v_prenex_1668 0) (= v_prenex_1669 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1668))) .cse4) (or (forall ((v_prenex_1659 (Array Int Int)) (v_prenex_1664 Int) (v_prenex_1663 Int) (v_prenex_1662 Int) (v_prenex_1661 Int)) (let ((.cse45 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1661)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1659))) (or (= (select (select .cse45 v_prenex_1663) v_prenex_1662) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1662 0) (= (select (select .cse45 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1662) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1664 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= (select (select .cse45 v_prenex_1664) v_prenex_1662) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1662)))) .cse4) (or (forall ((v_prenex_1674 Int) (v_prenex_1673 Int) (v_prenex_1672 Int) (v_prenex_1670 (Array Int Int))) (let ((.cse46 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1672)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1670))) (or (< v_prenex_1673 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse46 v_prenex_1674) v_prenex_1673)) (= v_prenex_1674 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse46 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1673)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1673)))) .cse4) (or (forall ((v_arrayElimArr_8 (Array Int Int)) (v_arrayElimCell_102 Int) (v_prenex_1971 (Array Int Int)) (v_prenex_1969 Int) (v_prenex_1968 Int)) (let ((.cse47 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1971))) (or (= (select (select .cse47 v_arrayElimCell_102) v_prenex_1968) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1968 0) (= v_prenex_1969 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1968) (= (select (select .cse47 v_prenex_1969) v_prenex_1968) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse10) (forall ((v_prenex_1679 Int) (v_prenex_1678 Int) (v_prenex_1681 Int) (v_prenex_1675 (Array Int Int)) (v_prenex_1680 Int) (v_prenex_1677 (Array Int Int))) (let ((.cse48 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1677) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2 v_prenex_1678)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1675))) (or (< v_prenex_1679 0) (= (select (select .cse48 v_prenex_1681) v_prenex_1679) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse48 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1679) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1679) (= (select (select .cse48 v_prenex_1680) v_prenex_1679) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1681 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) (forall ((v_prenex_1657 Int) (v_prenex_80 (Array Int Int)) (v_prenex_1970 Int) (v_prenex_1655 (Array Int Int)) (v_prenex_1658 Int)) (or (= v_prenex_1658 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (< v_prenex_1657 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1657) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_80) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2 v_prenex_1970)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1655) v_prenex_1658) v_prenex_1657) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse12) (or .cse3 (forall ((|v_ULTIMATE.start_main_~ptr~0#1.offset_34| Int) (v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1851 (Array Int Int)) (v_arrayElimCell_101 Int) (v_arrayElimCell_108 Int)) (let ((.cse49 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_1851))) (or (= |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |v_ULTIMATE.start_main_~ptr~0#1.offset_34| 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) (= (select (select .cse49 v_arrayElimCell_101) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse49 v_arrayElimCell_108) |v_ULTIMATE.start_main_~ptr~0#1.offset_34|) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse3 (and (forall ((v_prenex_2105 Int) (v_prenex_2148 Int) (v_prenex_2107 (Array Int Int)) (v_prenex_2109 Int) (v_prenex_2108 (Array Int Int))) (let ((.cse50 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2107) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2108))) (or (= v_prenex_2105 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse50 v_prenex_2109) v_prenex_2105)) (= (select (select .cse50 v_prenex_2148) v_prenex_2105) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2105 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2105)))) (or (forall ((v_prenex_2149 Int) (v_prenex_2147 (Array Int Int)) (v_prenex_2146 (Array Int Int)) (v_prenex_2144 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2146) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2147) v_prenex_2149) v_prenex_2144) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2144 0) (< v_prenex_2144 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2144))) .cse10))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (forall ((v_prenex_1866 Int) (v_prenex_1865 Int) (v_prenex_1864 Int) (v_prenex_1862 (Array Int Int)) (v_prenex_1863 (Array Int Int))) (let ((.cse51 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1864)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1863) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1862))) (or (= (select (select .cse51 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1865) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1865) (= (select (select .cse51 v_prenex_1866) v_prenex_1865) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1865 0)))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (forall ((v_prenex_83 (Array Int Int)) (v_prenex_81 (Array Int Int)) (v_prenex_77 Int) (v_prenex_24 Int) (v_arrayElimCell_103 Int)) (let ((.cse52 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_77)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_81) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_83))) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_arrayElimCell_103) (= (select (select .cse52 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_24) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse52 v_arrayElimCell_103) v_prenex_24) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_24 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_24)))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)))) (or (and (or (forall ((v_arrayElimArr_26 (Array Int Int)) (v_prenex_2103 Int) (v_prenex_2104 Int) (v_prenex_2102 (Array Int Int)) (v_prenex_2100 Int)) (let ((.cse53 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_arrayElimArr_26) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2102))) (or (= (select (select .cse53 v_prenex_2103) v_prenex_2100) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2100 0) (= (select (select .cse53 v_prenex_2104) v_prenex_2100) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2100 0)))) .cse10) (forall ((v_prenex_2092 Int) (v_prenex_2132 (Array Int Int)) (v_prenex_2088 Int) (v_prenex_2089 Int) (v_prenex_2093 Int) (v_prenex_2091 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_prenex_2132 .cse2 v_prenex_2088)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2091) v_prenex_2092) v_prenex_2089) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2089 0) (= v_prenex_2089 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2132) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2 v_prenex_2088)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2091) v_prenex_2093) v_prenex_2089) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_2088)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2091) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_2089) |c_ULTIMATE.start_main_~data_init~0#1|))) (or .cse4 (forall ((v_prenex_2136 Int) (v_prenex_2137 Int) (v_prenex_2131 Int) (v_prenex_2134 (Array Int Int))) (let ((.cse54 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_2131)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2134))) (or (= v_prenex_2137 0) (< v_prenex_2137 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse54 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_2137)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse54 v_prenex_2136) v_prenex_2137)))))) (or (and (forall ((v_prenex_2082 (Array Int Int)) (v_prenex_2079 Int) (v_prenex_2080 (Array Int Int)) (v_prenex_2083 Int)) (or (= v_prenex_2079 0) (< v_prenex_2079 0) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2080) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2082) v_prenex_2083) v_prenex_2079) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_prenex_2133 (Array Int Int)) (v_prenex_2135 Int) (v_prenex_2086 (Array Int Int)) (v_prenex_2087 Int) (v_prenex_2084 Int)) (let ((.cse55 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_2133) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2086))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse55 v_prenex_2135) v_prenex_2084)) (< v_prenex_2084 0) (= (select (select .cse55 v_prenex_2087) v_prenex_2084) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2084 0))))) .cse10) (forall ((v_prenex_2096 (Array Int Int)) (v_prenex_2098 (Array Int Int)) (v_prenex_2099 Int) (v_prenex_2094 Int) (v_prenex_2095 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2096) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2 v_prenex_2094)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2098) v_prenex_2099) v_prenex_2095) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2095 0) (= v_prenex_2095 0)))) .cse12) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_prenex_1785 Int) (v_prenex_1784 Int) (v_prenex_1980 Int) (v_prenex_1783 (Array Int Int)) (v_prenex_1782 (Array Int Int))) (let ((.cse56 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1784)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1783) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1782))) (or (= (select (select .cse56 v_prenex_1980) v_prenex_1785) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1785 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1785) (= (select (select .cse56 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1785) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_prenex_2044 (Array Int Int)) (v_prenex_2045 (Array Int Int)) (v_arrayElimCell_110 Int) (v_prenex_2043 Int)) (or (= v_prenex_2043 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_arrayElimCell_110)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2044) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2045) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_2043) |c_ULTIMATE.start_main_~data_init~0#1|) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2043) (< v_prenex_2043 0))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (forall ((v_prenex_1833 Int) (v_prenex_1832 Int) (v_prenex_1831 (Array Int Int)) (v_prenex_1830 (Array Int Int)) (v_prenex_1835 Int) (v_prenex_1834 Int)) (let ((.cse57 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1832)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1831) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1830))) (or (< v_prenex_1833 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse57 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1833)) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1833) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1834) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse57 v_prenex_1835) v_prenex_1833)) (= (select (select .cse57 v_prenex_1834) v_prenex_1833) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (forall ((v_prenex_2129 Int) (v_prenex_2124 Int) (v_prenex_2125 Int) (v_prenex_2130 Int) (v_prenex_2126 (Array Int Int)) (v_prenex_2127 (Array Int Int)) (v_prenex_2128 (Array Int Int))) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2125) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store v_prenex_2126 .cse2 v_prenex_2124)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2127) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2128) v_prenex_2129) v_prenex_2125) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_2125 0) (< v_prenex_2125 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_2124)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2127) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2128) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_2125) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2126) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2 v_prenex_2124)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2127) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2128) v_prenex_2130) v_prenex_2125)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (forall ((v_prenex_1855 Int) (v_prenex_1853 (Array Int Int)) (v_prenex_1857 Int) (v_prenex_1989 Int) (v_prenex_1854 (Array Int Int)) (v_prenex_1856 Int)) (let ((.cse58 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1855)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1854) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1853))) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1856) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1857) (< v_prenex_1856 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse58 v_prenex_1989) v_prenex_1856)) (= (select (select .cse58 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1856) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse58 v_prenex_1857) v_prenex_1856))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (forall ((v_prenex_2139 Int) (v_prenex_2141 (Array Int Int)) (v_prenex_2142 (Array Int Int)) (v_prenex_2143 Int) (v_prenex_2140 Int)) (let ((.cse59 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_2139)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2141) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2142))) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2140) (= v_prenex_2140 0) (= (select (select .cse59 v_prenex_2143) v_prenex_2140) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2140 0) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse59 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_2140))))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)))) (or (forall ((v_ArrVal_1837 Int) (v_ArrVal_1833 (Array Int Int)) (v_prenex_2113 Int) (v_prenex_2110 Int) (v_prenex_2112 (Array Int Int))) (or (= v_prenex_2110 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2110) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1833) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2 v_ArrVal_1837)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2112) v_prenex_2113) v_prenex_2110) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2110 0))) .cse12) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (forall ((v_prenex_1859 (Array Int Int)) (v_prenex_1858 (Array Int Int)) (v_prenex_1861 Int) (v_prenex_1860 Int)) (or (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1861) (< v_prenex_1861 0) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1860)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1859) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1858) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1861) |c_ULTIMATE.start_main_~data_init~0#1|))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (forall ((v_prenex_1779 (Array Int Int)) (v_prenex_1981 Int) (v_prenex_1781 Int) (v_prenex_1780 Int) (v_prenex_1778 (Array Int Int))) (let ((.cse60 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1780)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1779) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1778))) (or (< v_prenex_1781 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1781) (= (select (select .cse60 v_prenex_1981) v_prenex_1781) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse60 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1781) |c_ULTIMATE.start_main_~data_init~0#1|)))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (forall ((v_prenex_2006 Int) (v_prenex_2001 (Array Int Int)) (v_prenex_2004 Int) (v_prenex_2005 Int) (v_prenex_2002 (Array Int Int)) (v_prenex_2003 (Array Int Int))) (let ((.cse61 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store (select (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2003) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse2 v_prenex_2004)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2002) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2001))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse61 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_2005)) (= (select (select .cse61 v_prenex_2006) v_prenex_2005) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_2005 0) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_2006) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_2005)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| Int)) (or (forall ((v_prenex_1654 Int) (v_prenex_1653 Int) (v_prenex_1651 (Array Int Int)) (v_prenex_1652 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (store .cse1 .cse2 v_prenex_1653)) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1652) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| v_prenex_1651) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) v_prenex_1654) |c_ULTIMATE.start_main_~data_init~0#1|) (< v_prenex_1654 0) (< |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_1654))) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_43| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))))) is different from true [2025-03-17 12:21:02,509 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:02,513 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-17 12:21:02,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2025-03-17 12:21:02,529 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-03-17 12:21:02,562 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:02,563 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:02,564 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:02,564 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:02,575 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:02,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 43 treesize of output 43 [2025-03-17 12:21:02,581 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 15 [2025-03-17 12:21:02,603 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:02,609 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:02,609 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2025-03-17 12:21:02,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-03-17 12:21:02,624 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:02,628 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2025-03-17 12:21:02,633 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:02,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:02,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2025-03-17 12:21:02,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-17 12:21:02,757 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:02,829 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-17 12:21:02,829 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 186 treesize of output 172 [2025-03-17 12:21:02,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:02,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 105 [2025-03-17 12:21:02,857 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:02,860 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 82 [2025-03-17 12:21:02,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:21:02,921 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:02,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:02,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 57 treesize of output 59 [2025-03-17 12:21:02,978 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:02,980 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:02,984 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:03,069 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2025-03-17 12:21:03,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 3 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 490 treesize of output 474 [2025-03-17 12:21:03,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:03,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 351 treesize of output 359 [2025-03-17 12:21:03,122 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:03,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 325 treesize of output 311 [2025-03-17 12:21:03,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 292 treesize of output 274 [2025-03-17 12:21:03,494 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:21:03,599 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:21:03,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:21:03,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:21:03,827 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:03,839 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:03,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 288 treesize of output 284 [2025-03-17 12:21:04,466 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:21:04,471 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:21:04,476 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:04,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:04,482 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2025-03-17 12:21:04,496 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-03-17 12:21:04,500 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:04,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2025-03-17 12:21:04,506 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:04,516 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:04,516 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2025-03-17 12:21:04,522 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-17 12:21:04,593 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:04,651 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-17 12:21:04,652 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1139 treesize of output 1077 [2025-03-17 12:21:04,679 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:04,679 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 232 treesize of output 230 [2025-03-17 12:21:04,692 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:04,696 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 298 treesize of output 290 [2025-03-17 12:21:04,707 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 271 treesize of output 261 [2025-03-17 12:21:04,717 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 254 treesize of output 238 [2025-03-17 12:21:04,906 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:21:04,996 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:04,996 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 25 [2025-03-17 12:21:05,035 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:05,078 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-17 12:21:05,078 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 1139 treesize of output 1077 [2025-03-17 12:21:05,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:05,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 231 treesize of output 229 [2025-03-17 12:21:05,112 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:05,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 184 treesize of output 176 [2025-03-17 12:21:05,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 157 treesize of output 147 [2025-03-17 12:21:05,137 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 98 [2025-03-17 12:21:05,256 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:21:05,315 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:05,326 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:05,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2025-03-17 12:21:05,565 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:05,570 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:05,620 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-17 12:21:05,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 686 treesize of output 624 [2025-03-17 12:21:05,631 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:05,646 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:05,646 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 169 [2025-03-17 12:21:05,654 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:05,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 116 [2025-03-17 12:21:05,668 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 64 treesize of output 54 [2025-03-17 12:21:05,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:21:05,763 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:05,777 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:05,777 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2025-03-17 12:21:05,920 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:21:05,926 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:06,009 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2025-03-17 12:21:06,010 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 836 treesize of output 836 [2025-03-17 12:21:06,029 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:06,062 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:06,062 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 363 treesize of output 375 [2025-03-17 12:21:06,076 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:06,080 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 417 treesize of output 407 [2025-03-17 12:21:06,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 506 treesize of output 488 [2025-03-17 12:21:06,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 481 treesize of output 449 [2025-03-17 12:21:06,126 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:06,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 202 treesize of output 198 [2025-03-17 12:21:06,187 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-17 12:21:06,222 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-17 12:21:06,268 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-17 12:21:07,085 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:07,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 115 [2025-03-17 12:21:07,170 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:07,193 INFO L349 Elim1Store]: treesize reduction 8, result has 75.8 percent of original size [2025-03-17 12:21:07,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 872 treesize of output 832 [2025-03-17 12:21:07,238 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:07,238 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 358 treesize of output 370 [2025-03-17 12:21:07,253 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 376 treesize of output 366 [2025-03-17 12:21:07,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 340 treesize of output 328 [2025-03-17 12:21:07,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 361 treesize of output 343 [2025-03-17 12:21:07,493 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:21:07,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:21:07,576 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2025-03-17 12:21:07,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:21:07,830 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:07,831 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 487 treesize of output 477 [2025-03-17 12:21:08,060 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,072 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:08,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2025-03-17 12:21:08,085 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-03-17 12:21:08,089 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,101 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:08,102 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 41 [2025-03-17 12:21:08,105 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2025-03-17 12:21:08,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-17 12:21:08,168 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,168 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,169 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:21:08,175 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,175 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,176 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:21:08,179 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,179 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,180 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:21:08,181 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,181 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,182 WARN L214 Elim1Store]: Array PQE input equivalent to true [2025-03-17 12:21:08,189 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,193 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 52 treesize of output 48 [2025-03-17 12:21:08,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2025-03-17 12:21:08,204 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-03-17 12:21:08,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:21:08,228 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:08,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 38 [2025-03-17 12:21:08,244 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 42 [2025-03-17 12:21:08,248 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,250 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 28 [2025-03-17 12:21:08,254 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,267 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:08,267 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 34 [2025-03-17 12:21:08,274 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 7 [2025-03-17 12:21:08,327 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,329 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,368 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2025-03-17 12:21:08,368 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 343 treesize of output 321 [2025-03-17 12:21:08,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:08,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 172 treesize of output 170 [2025-03-17 12:21:08,395 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,400 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 178 treesize of output 170 [2025-03-17 12:21:08,410 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 151 treesize of output 141 [2025-03-17 12:21:08,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:21:08,551 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,563 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:08,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 106 treesize of output 106 [2025-03-17 12:21:08,759 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,761 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,846 INFO L349 Elim1Store]: treesize reduction 30, result has 63.9 percent of original size [2025-03-17 12:21:08,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 5728 treesize of output 5292 [2025-03-17 12:21:08,907 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:08,907 INFO L378 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 3 case distinctions, treesize of input 357 treesize of output 365 [2025-03-17 12:21:08,921 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:08,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 331 treesize of output 317 [2025-03-17 12:21:08,945 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 262 treesize of output 246 [2025-03-17 12:21:08,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 257 treesize of output 239 [2025-03-17 12:21:09,143 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2025-03-17 12:21:09,838 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:21:09,877 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2025-03-17 12:21:09,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 51 [2025-03-17 12:21:10,215 INFO L173 IndexEqualityManager]: detected equality via solver [2025-03-17 12:21:10,230 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2025-03-17 12:21:10,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 352 treesize of output 348