./Ultimate.py --spec ../sv-benchmarks/c/properties/unreach-call.prp --file ../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for ERROR reachability Using default analysis Version 3289d67d Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/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.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerReach.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G ! call(reach_error())) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-3289d67-m [2024-11-16 06:39:08,370 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-16 06:39:08,462 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-16 06:39:08,468 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-16 06:39:08,468 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-16 06:39:08,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-16 06:39:08,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-16 06:39:08,503 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-16 06:39:08,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-16 06:39:08,504 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-16 06:39:08,504 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-16 06:39:08,505 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-16 06:39:08,506 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-16 06:39:08,510 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-16 06:39:08,510 INFO L153 SettingsManager]: * Use SBE=true [2024-11-16 06:39:08,511 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-16 06:39:08,511 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-16 06:39:08,511 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-16 06:39:08,511 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-16 06:39:08,512 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-16 06:39:08,512 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-16 06:39:08,513 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-16 06:39:08,514 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-16 06:39:08,514 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-16 06:39:08,514 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-16 06:39:08,514 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-16 06:39:08,515 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-16 06:39:08,515 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-16 06:39:08,515 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-16 06:39:08,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-16 06:39:08,516 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-16 06:39:08,516 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-16 06:39:08,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:39:08,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-16 06:39:08,517 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-16 06:39:08,517 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-16 06:39:08,518 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-16 06:39:08,518 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-16 06:39:08,519 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-16 06:39:08,519 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-16 06:39:08,519 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-16 06:39:08,519 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-16 06:39:08,520 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G ! call(reach_error())) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> 4fb6aa6206205a747f158782e93b3c9333c1a2cdc4e8dab70046fca960e31961 [2024-11-16 06:39:08,777 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-16 06:39:08,801 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-16 06:39:08,807 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-16 06:39:08,808 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-16 06:39:08,808 INFO L274 PluginConnector]: CDTParser initialized [2024-11-16 06:39:08,809 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 [2024-11-16 06:39:10,276 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-16 06:39:10,553 INFO L384 CDTParser]: Found 1 translation units. [2024-11-16 06:39:10,554 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2024-11-16 06:39:10,569 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/358e2cc0f/b5c37aa65096482aa755ed7aa18c9642/FLAG2f075bd9d [2024-11-16 06:39:10,851 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/358e2cc0f/b5c37aa65096482aa755ed7aa18c9642 [2024-11-16 06:39:10,854 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-16 06:39:10,855 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-16 06:39:10,857 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-16 06:39:10,857 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-16 06:39:10,864 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-16 06:39:10,864 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:39:10" (1/1) ... [2024-11-16 06:39:10,865 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@600909d4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:10, skipping insertion in model container [2024-11-16 06:39:10,866 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 16.11 06:39:10" (1/1) ... [2024-11-16 06:39:10,907 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-16 06:39:11,200 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2024-11-16 06:39:11,205 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:39:11,214 INFO L200 MainTranslator]: Completed pre-run [2024-11-16 06:39:11,267 WARN L250 ndardFunctionHandler]: Function reach_error is already implemented but we override the implementation for the call at /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i[24211,24224] [2024-11-16 06:39:11,268 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-16 06:39:11,293 INFO L204 MainTranslator]: Completed translation [2024-11-16 06:39:11,294 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:11 WrapperNode [2024-11-16 06:39:11,294 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-16 06:39:11,295 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-16 06:39:11,295 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-16 06:39:11,296 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-16 06:39:11,302 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:11" (1/1) ... [2024-11-16 06:39:11,314 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:11" (1/1) ... [2024-11-16 06:39:11,333 INFO L138 Inliner]: procedures = 122, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 90 [2024-11-16 06:39:11,336 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-16 06:39:11,336 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-16 06:39:11,336 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-16 06:39:11,337 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-16 06:39:11,344 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:11" (1/1) ... [2024-11-16 06:39:11,344 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:11" (1/1) ... [2024-11-16 06:39:11,348 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:11" (1/1) ... [2024-11-16 06:39:11,362 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]. [2024-11-16 06:39:11,363 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:11" (1/1) ... [2024-11-16 06:39:11,363 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:11" (1/1) ... [2024-11-16 06:39:11,370 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:11" (1/1) ... [2024-11-16 06:39:11,371 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:11" (1/1) ... [2024-11-16 06:39:11,372 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:11" (1/1) ... [2024-11-16 06:39:11,373 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:11" (1/1) ... [2024-11-16 06:39:11,376 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-16 06:39:11,377 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-16 06:39:11,377 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-16 06:39:11,377 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-16 06:39:11,382 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:11" (1/1) ... [2024-11-16 06:39:11,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-16 06:39:11,402 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:39:11,422 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) [2024-11-16 06:39:11,430 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 [2024-11-16 06:39:11,478 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-16 06:39:11,478 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-16 06:39:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-16 06:39:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-16 06:39:11,479 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-16 06:39:11,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-16 06:39:11,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-16 06:39:11,480 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-16 06:39:11,480 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-16 06:39:11,481 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-16 06:39:11,481 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-16 06:39:11,482 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-16 06:39:11,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-16 06:39:11,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-16 06:39:11,482 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-16 06:39:11,482 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-16 06:39:11,482 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-16 06:39:11,600 INFO L256 CfgBuilder]: Building ICFG [2024-11-16 06:39:11,603 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-16 06:39:11,642 INFO L1250 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-16 06:39:11,818 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-16 06:39:11,818 INFO L307 CfgBuilder]: Performing block encoding [2024-11-16 06:39:11,834 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-16 06:39:11,835 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-16 06:39:11,836 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:39:11 BoogieIcfgContainer [2024-11-16 06:39:11,836 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-16 06:39:11,838 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-16 06:39:11,840 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-16 06:39:11,845 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-16 06:39:11,846 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 16.11 06:39:10" (1/3) ... [2024-11-16 06:39:11,847 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f02ad8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:39:11, skipping insertion in model container [2024-11-16 06:39:11,847 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 16.11 06:39:11" (2/3) ... [2024-11-16 06:39:11,848 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@f02ad8f and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 16.11 06:39:11, skipping insertion in model container [2024-11-16 06:39:11,848 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 16.11 06:39:11" (3/3) ... [2024-11-16 06:39:11,850 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2024-11-16 06:39:11,863 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-16 06:39:11,863 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-16 06:39:11,918 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-16 06:39:11,926 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=LoopHeads, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4d9c88b7, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-16 06:39:11,927 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-16 06:39:11,931 INFO L276 IsEmpty]: Start isEmpty. Operand has 29 states, 25 states have (on average 1.44) internal successors, (36), 27 states have internal predecessors, (36), 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) [2024-11-16 06:39:11,938 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-16 06:39:11,938 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:39:11,939 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:39:11,939 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:39:11,945 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:39:11,946 INFO L85 PathProgramCache]: Analyzing trace with hash -2059439064, now seen corresponding path program 1 times [2024-11-16 06:39:11,955 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:39:11,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [556525493] [2024-11-16 06:39:11,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:39:11,957 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:39:12,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:39:12,160 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:39:12,161 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:39:12,161 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [556525493] [2024-11-16 06:39:12,161 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [556525493] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:39:12,161 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:39:12,162 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-16 06:39:12,163 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1298534182] [2024-11-16 06:39:12,164 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:39:12,168 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-16 06:39:12,168 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:39:12,190 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-16 06:39:12,191 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 06:39:12,193 INFO L87 Difference]: Start difference. First operand has 29 states, 25 states have (on average 1.44) internal successors, (36), 27 states have internal predecessors, (36), 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 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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) [2024-11-16 06:39:12,212 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:39:12,213 INFO L93 Difference]: Finished difference Result 45 states and 59 transitions. [2024-11-16 06:39:12,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-16 06:39:12,215 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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 [2024-11-16 06:39:12,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:39:12,221 INFO L225 Difference]: With dead ends: 45 [2024-11-16 06:39:12,221 INFO L226 Difference]: Without dead ends: 20 [2024-11-16 06:39:12,225 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 0 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-16 06:39:12,229 INFO L432 NwaCegarLoop]: 33 mSDtfsCounter, 0 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 0 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 33 SdHoareTripleChecker+Invalid, 0 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 0 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-16 06:39:12,232 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 33 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:39:12,248 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 20 states. [2024-11-16 06:39:12,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 20 to 20. [2024-11-16 06:39:12,262 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 20 states, 19 states have (on average 1.2105263157894737) internal successors, (23), 19 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) [2024-11-16 06:39:12,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 23 transitions. [2024-11-16 06:39:12,265 INFO L78 Accepts]: Start accepts. Automaton has 20 states and 23 transitions. Word has length 11 [2024-11-16 06:39:12,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:39:12,265 INFO L471 AbstractCegarLoop]: Abstraction has 20 states and 23 transitions. [2024-11-16 06:39:12,266 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.5) internal successors, (11), 2 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) [2024-11-16 06:39:12,266 INFO L276 IsEmpty]: Start isEmpty. Operand 20 states and 23 transitions. [2024-11-16 06:39:12,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-11-16 06:39:12,267 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:39:12,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:39:12,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-16 06:39:12,268 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:39:12,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:39:12,269 INFO L85 PathProgramCache]: Analyzing trace with hash -71645996, now seen corresponding path program 1 times [2024-11-16 06:39:12,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:39:12,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1522165239] [2024-11-16 06:39:12,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:39:12,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:39:12,330 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:39:12,491 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:39:12,491 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:39:12,521 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1522165239] [2024-11-16 06:39:12,521 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1522165239] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-16 06:39:12,521 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-16 06:39:12,521 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-16 06:39:12,522 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038686212] [2024-11-16 06:39:12,522 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-16 06:39:12,523 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-16 06:39:12,523 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:39:12,523 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-16 06:39:12,524 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:39:12,524 INFO L87 Difference]: Start difference. First operand 20 states and 23 transitions. Second operand has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2024-11-16 06:39:12,545 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:39:12,546 INFO L93 Difference]: Finished difference Result 36 states and 42 transitions. [2024-11-16 06:39:12,546 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-16 06:39:12,546 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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 12 [2024-11-16 06:39:12,546 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:39:12,547 INFO L225 Difference]: With dead ends: 36 [2024-11-16 06:39:12,547 INFO L226 Difference]: Without dead ends: 24 [2024-11-16 06:39:12,547 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-16 06:39:12,548 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 2 mSDsluCounter, 16 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 37 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 [2024-11-16 06:39:12,549 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 37 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-16 06:39:12,550 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 24 states. [2024-11-16 06:39:12,578 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 24 to 22. [2024-11-16 06:39:12,579 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 22 states, 21 states have (on average 1.1904761904761905) internal successors, (25), 21 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) [2024-11-16 06:39:12,579 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 22 states to 22 states and 25 transitions. [2024-11-16 06:39:12,580 INFO L78 Accepts]: Start accepts. Automaton has 22 states and 25 transitions. Word has length 12 [2024-11-16 06:39:12,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:39:12,580 INFO L471 AbstractCegarLoop]: Abstraction has 22 states and 25 transitions. [2024-11-16 06:39:12,580 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 4.0) internal successors, (12), 3 states have internal predecessors, (12), 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) [2024-11-16 06:39:12,581 INFO L276 IsEmpty]: Start isEmpty. Operand 22 states and 25 transitions. [2024-11-16 06:39:12,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-16 06:39:12,581 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:39:12,581 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:39:12,581 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-16 06:39:12,582 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:39:12,582 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:39:12,583 INFO L85 PathProgramCache]: Analyzing trace with hash 1015478384, now seen corresponding path program 1 times [2024-11-16 06:39:12,583 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:39:12,583 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039869022] [2024-11-16 06:39:12,583 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:39:12,584 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:39:12,618 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:39:12,730 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:39:12,731 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:39:12,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039869022] [2024-11-16 06:39:12,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039869022] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:39:12,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1098979084] [2024-11-16 06:39:12,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:39:12,732 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:39:12,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:39:12,735 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) [2024-11-16 06:39:12,736 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-16 06:39:12,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:39:12,898 INFO L255 TraceCheckSpWp]: Trace formula consists of 169 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-16 06:39:12,911 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:39:12,973 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:39:12,975 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:39:13,012 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:39:13,013 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1098979084] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:39:13,013 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:39:13,014 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-16 06:39:13,014 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1631386637] [2024-11-16 06:39:13,014 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:39:13,015 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-16 06:39:13,015 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:39:13,016 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-16 06:39:13,016 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 06:39:13,016 INFO L87 Difference]: Start difference. First operand 22 states and 25 transitions. Second operand has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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) [2024-11-16 06:39:13,084 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:39:13,086 INFO L93 Difference]: Finished difference Result 46 states and 54 transitions. [2024-11-16 06:39:13,086 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-16 06:39:13,087 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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 16 [2024-11-16 06:39:13,088 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:39:13,088 INFO L225 Difference]: With dead ends: 46 [2024-11-16 06:39:13,089 INFO L226 Difference]: Without dead ends: 34 [2024-11-16 06:39:13,089 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 4 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-16 06:39:13,091 INFO L432 NwaCegarLoop]: 21 mSDtfsCounter, 4 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 86 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-16 06:39:13,093 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 86 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-16 06:39:13,094 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 34 states. [2024-11-16 06:39:13,101 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 34 to 34. [2024-11-16 06:39:13,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 34 states, 33 states have (on average 1.121212121212121) internal successors, (37), 33 states have internal predecessors, (37), 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) [2024-11-16 06:39:13,103 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 34 states to 34 states and 37 transitions. [2024-11-16 06:39:13,103 INFO L78 Accepts]: Start accepts. Automaton has 34 states and 37 transitions. Word has length 16 [2024-11-16 06:39:13,104 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:39:13,104 INFO L471 AbstractCegarLoop]: Abstraction has 34 states and 37 transitions. [2024-11-16 06:39:13,105 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.571428571428571) internal successors, (32), 7 states have internal predecessors, (32), 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) [2024-11-16 06:39:13,105 INFO L276 IsEmpty]: Start isEmpty. Operand 34 states and 37 transitions. [2024-11-16 06:39:13,105 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-11-16 06:39:13,106 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:39:13,106 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:39:13,124 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-11-16 06:39:13,311 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:39:13,312 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:39:13,313 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:39:13,313 INFO L85 PathProgramCache]: Analyzing trace with hash -1608220860, now seen corresponding path program 2 times [2024-11-16 06:39:13,313 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:39:13,313 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2064082250] [2024-11-16 06:39:13,313 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:39:13,314 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:39:13,436 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:39:14,209 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 14 refuted. 0 times theorem prover too weak. 8 trivial. 0 not checked. [2024-11-16 06:39:14,211 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:39:14,211 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2064082250] [2024-11-16 06:39:14,211 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2064082250] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:39:14,213 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [955093783] [2024-11-16 06:39:14,213 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-16 06:39:14,213 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:39:14,214 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:39:14,215 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) [2024-11-16 06:39:14,217 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-16 06:39:14,374 INFO L227 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-16 06:39:14,374 INFO L228 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-16 06:39:14,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 325 conjuncts, 56 conjuncts are in the unsatisfiable core [2024-11-16 06:39:14,381 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:39:14,415 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 [2024-11-16 06:39:14,496 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-16 06:39:14,497 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 [2024-11-16 06:39:14,543 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-16 06:39:14,544 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 [2024-11-16 06:39:14,639 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-16 06:39:14,640 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 [2024-11-16 06:39:14,770 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-16 06:39:14,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-16 06:39:14,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-16 06:39:14,854 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 [2024-11-16 06:39:14,910 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:14,913 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 26 treesize of output 23 [2024-11-16 06:39:14,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 11 [2024-11-16 06:39:15,001 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 12 proven. 14 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-11-16 06:39:15,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:39:15,031 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_356 (Array Int Int))) (= (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_356) |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|)) is different from false [2024-11-16 06:39:15,050 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:15,051 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 21 treesize of output 22 [2024-11-16 06:39:15,054 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 122 treesize of output 110 [2024-11-16 06:39:15,069 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 16 [2024-11-16 06:39:15,084 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 [2024-11-16 06:39:15,653 INFO L134 CoverageAnalysis]: Checked inductivity of 32 backedges. 10 proven. 6 refuted. 0 times theorem prover too weak. 8 trivial. 8 not checked. [2024-11-16 06:39:15,653 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [955093783] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-16 06:39:15,653 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-16 06:39:15,653 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 11, 10] total 24 [2024-11-16 06:39:15,654 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1924118194] [2024-11-16 06:39:15,654 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-16 06:39:15,654 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2024-11-16 06:39:15,654 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-16 06:39:15,655 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2024-11-16 06:39:15,656 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=66, Invalid=443, Unknown=1, NotChecked=42, Total=552 [2024-11-16 06:39:15,657 INFO L87 Difference]: Start difference. First operand 34 states and 37 transitions. Second operand has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 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) [2024-11-16 06:39:16,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-16 06:39:16,051 INFO L93 Difference]: Finished difference Result 39 states and 42 transitions. [2024-11-16 06:39:16,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2024-11-16 06:39:16,051 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 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 28 [2024-11-16 06:39:16,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-16 06:39:16,053 INFO L225 Difference]: With dead ends: 39 [2024-11-16 06:39:16,053 INFO L226 Difference]: Without dead ends: 36 [2024-11-16 06:39:16,053 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 70 GetRequests, 39 SyntacticMatches, 3 SemanticMatches, 28 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 169 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=135, Invalid=680, Unknown=1, NotChecked=54, Total=870 [2024-11-16 06:39:16,055 INFO L432 NwaCegarLoop]: 15 mSDtfsCounter, 11 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 179 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 156 SdHoareTripleChecker+Invalid, 203 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 179 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 17 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-16 06:39:16,056 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 156 Invalid, 203 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 179 Invalid, 0 Unknown, 17 Unchecked, 0.2s Time] [2024-11-16 06:39:16,057 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 36 states. [2024-11-16 06:39:16,060 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 36 to 36. [2024-11-16 06:39:16,063 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 36 states, 35 states have (on average 1.1142857142857143) internal successors, (39), 35 states have internal predecessors, (39), 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) [2024-11-16 06:39:16,064 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 39 transitions. [2024-11-16 06:39:16,064 INFO L78 Accepts]: Start accepts. Automaton has 36 states and 39 transitions. Word has length 28 [2024-11-16 06:39:16,064 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-16 06:39:16,065 INFO L471 AbstractCegarLoop]: Abstraction has 36 states and 39 transitions. [2024-11-16 06:39:16,065 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.625) internal successors, (63), 24 states have internal predecessors, (63), 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) [2024-11-16 06:39:16,066 INFO L276 IsEmpty]: Start isEmpty. Operand 36 states and 39 transitions. [2024-11-16 06:39:16,067 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-16 06:39:16,067 INFO L207 NwaCegarLoop]: Found error trace [2024-11-16 06:39:16,067 INFO L215 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-16 06:39:16,086 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Forceful destruction successful, exit code 0 [2024-11-16 06:39:16,267 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,SelfDestructingSolverStorable3 [2024-11-16 06:39:16,268 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-16 06:39:16,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-16 06:39:16,268 INFO L85 PathProgramCache]: Analyzing trace with hash -76614900, now seen corresponding path program 1 times [2024-11-16 06:39:16,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-16 06:39:16,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [112507867] [2024-11-16 06:39:16,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:39:16,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-16 06:39:16,414 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:39:17,982 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 4 proven. 30 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-16 06:39:17,982 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-16 06:39:17,982 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [112507867] [2024-11-16 06:39:17,983 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [112507867] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-16 06:39:17,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1996402325] [2024-11-16 06:39:17,985 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-16 06:39:17,985 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-16 06:39:17,985 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-16 06:39:17,989 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) [2024-11-16 06:39:17,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-16 06:39:18,161 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-16 06:39:18,164 INFO L255 TraceCheckSpWp]: Trace formula consists of 348 conjuncts, 81 conjuncts are in the unsatisfiable core [2024-11-16 06:39:18,170 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-16 06:39:18,236 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 [2024-11-16 06:39:18,336 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-16 06:39:18,337 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 [2024-11-16 06:39:18,410 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 0 case distinctions, treesize of input 16 treesize of output 16 [2024-11-16 06:39:18,415 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 [2024-11-16 06:39:18,500 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-16 06:39:18,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-16 06:39:18,566 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:18,569 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 26 treesize of output 23 [2024-11-16 06:39:18,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 23 [2024-11-16 06:39:18,589 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-16 06:39:18,590 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 66 treesize of output 59 [2024-11-16 06:39:18,594 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2024-11-16 06:39:18,601 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 39 treesize of output 15 [2024-11-16 06:39:18,606 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 0 case distinctions, treesize of input 15 treesize of output 7 [2024-11-16 06:39:18,693 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 0 case distinctions, treesize of input 34 treesize of output 34 [2024-11-16 06:39:18,700 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 67 treesize of output 23 [2024-11-16 06:39:18,738 INFO L349 Elim1Store]: treesize reduction 28, result has 57.6 percent of original size [2024-11-16 06:39:18,738 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 59 treesize of output 63 [2024-11-16 06:39:18,752 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 93 treesize of output 48 [2024-11-16 06:39:18,767 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 20 treesize of output 1 [2024-11-16 06:39:18,782 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 15 [2024-11-16 06:39:18,802 INFO L349 Elim1Store]: treesize reduction 25, result has 21.9 percent of original size [2024-11-16 06:39:18,803 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 51 treesize of output 29 [2024-11-16 06:39:19,111 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-16 06:39:19,112 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 89 treesize of output 66 [2024-11-16 06:39:19,124 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:19,125 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 2 case distinctions, treesize of input 81 treesize of output 56 [2024-11-16 06:39:19,154 INFO L349 Elim1Store]: treesize reduction 32, result has 37.3 percent of original size [2024-11-16 06:39:19,155 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 49 [2024-11-16 06:39:19,168 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-16 06:39:19,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 37 treesize of output 31 [2024-11-16 06:39:19,182 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-16 06:39:19,182 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 22 treesize of output 10 [2024-11-16 06:39:19,340 INFO L134 CoverageAnalysis]: Checked inductivity of 34 backedges. 10 proven. 22 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-16 06:39:19,340 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-16 06:39:19,532 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse2 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) (.cse3 (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1))) (and (forall ((v_ArrVal_593 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int) (v_ArrVal_588 (Array Int Int))) (or (= (select (select (store |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (not (= (store (select |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_588 .cse0)) v_ArrVal_588)) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_588) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_593) .cse2) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((v_ArrVal_593 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int) (v_ArrVal_588 (Array Int Int))) (or (not (= (store (select |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 (select v_ArrVal_588 .cse0)) v_ArrVal_588)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1)) (= (select (select (store (store |c_#memory_int#1| |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_588) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_593) .cse2) .cse3) |c_ULTIMATE.start_main_~data_init~0#1|)))))) is different from false [2024-11-16 06:39:19,624 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:19,625 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 227 treesize of output 194 [2024-11-16 06:39:19,667 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:19,667 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 554 treesize of output 540 [2024-11-16 06:39:19,686 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 375 treesize of output 351 [2024-11-16 06:39:19,736 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:19,737 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 806 treesize of output 808 [2024-11-16 06:39:19,810 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 431 treesize of output 407 [2024-11-16 06:39:23,043 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:23,045 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 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-16 06:39:23,059 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 [2024-11-16 06:39:23,208 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 [2024-11-16 06:39:23,712 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:23,713 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 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-16 06:39:23,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-16 06:39:24,278 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:24,280 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 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-16 06:39:24,297 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 [2024-11-16 06:39:24,511 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 [2024-11-16 06:39:24,613 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:24,616 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 0 case distinctions, treesize of input 22 treesize of output 1 [2024-11-16 06:39:24,630 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 [2024-11-16 06:39:24,855 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 4443 treesize of output 4171 [2024-11-16 06:39:25,792 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (let ((.cse9 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (.cse19 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse11 (not .cse4))) (let ((.cse15 (and .cse19 .cse11)) (.cse8 (not .cse9)) (.cse5 (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|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse7 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|))) (and (forall ((v_prenex_1400 Int) (v_prenex_1399 Int) (v_prenex_1398 Int) (v_prenex_1397 (Array Int Int)) (v_prenex_1402 (Array Int Int)) (v_prenex_1401 (Array Int Int)) (v_prenex_1403 (Array Int Int))) (let ((.cse1 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1402)) (.cse0 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1397) v_prenex_1399 v_prenex_1403) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1401))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= v_prenex_1400 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_1397 (store (select .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_prenex_1397 .cse2)))) (= v_prenex_1399 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= v_prenex_1399 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_1403 (store (select (store .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1397) v_prenex_1399) .cse3 (select v_prenex_1403 .cse3)))) (= (select (select .cse0 v_prenex_1400) v_prenex_1398) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or .cse4 (and (forall ((v_prenex_1172 (Array Int Int)) (v_prenex_1174 (Array Int Int)) (v_prenex_1176 (Array Int Int)) (v_prenex_1175 (Array Int Int)) (v_prenex_1173 Int)) (or (= v_prenex_1173 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_1172 (store .cse5 .cse2 (select v_prenex_1172 .cse2)))) (not (= v_prenex_1176 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1175) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1172) v_prenex_1173) .cse3 (select v_prenex_1176 .cse3)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1172) v_prenex_1173 v_prenex_1176) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1174) |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|))) (forall ((v_prenex_1390 (Array Int Int)) (v_prenex_1392 (Array Int Int)) (v_prenex_1391 (Array Int Int)) (v_prenex_1389 Int) (v_prenex_1388 Int) (v_prenex_1387 Int) (v_prenex_1386 (Array Int Int))) (let ((.cse6 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1386) v_prenex_1388 v_prenex_1392) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1390))) (or (= v_prenex_1388 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse6 |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_prenex_1386 (store .cse5 .cse2 (select v_prenex_1386 .cse2)))) (not (= v_prenex_1392 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1391) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1386) v_prenex_1388) .cse3 (select v_prenex_1392 .cse3)))) (= (select (select .cse6 v_prenex_1389) v_prenex_1387) |c_ULTIMATE.start_main_~data_init~0#1|)))))) (or (and (or (and .cse4 .cse7) (and (or .cse4 (and (or (forall ((v_prenex_697 (Array Int Int)) (v_prenex_698 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_698) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_697) |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 (= (store .cse5 .cse3 (select v_prenex_698 .cse3)) v_prenex_698)))) .cse8) (or .cse9 (forall ((v_prenex_1328 (Array Int Int)) (v_prenex_1327 (Array Int Int))) (or (not (= v_prenex_1328 (store (store .cse5 .cse2 (select v_prenex_1328 .cse2)) .cse3 (select v_prenex_1328 .cse3)))) (= |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| v_prenex_1328) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1327) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))))) (or (forall ((v_prenex_704 (Array Int Int)) (v_prenex_706 (Array Int Int)) (v_prenex_705 Int) (v_prenex_703 Int) (v_prenex_1435 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_706) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_704))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_703) (= (select (select .cse10 v_prenex_705) v_prenex_703) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse10 |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 (= (store (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1435) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_prenex_706 .cse2)) .cse3 (select v_prenex_706 .cse3)) v_prenex_706))))) .cse9) (or (and (or (forall ((v_prenex_1325 Int) (v_prenex_1323 Int) (v_prenex_1324 (Array Int Int)) (v_prenex_1326 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1324) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1326) v_prenex_1325) v_prenex_1323) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1323 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) .cse9) (or (forall ((v_prenex_699 Int) (v_prenex_702 (Array Int Int)) (v_prenex_701 Int) (v_prenex_700 (Array Int Int))) (or (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_699) (= |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| v_prenex_702) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_700) v_prenex_701) v_prenex_699)))) .cse8)) .cse11) (or (forall ((v_prenex_1329 (Array Int Int)) (v_prenex_1332 Int) (v_prenex_1330 (Array Int Int)) (v_prenex_1331 Int) (v_prenex_1333 (Array Int Int))) (let ((.cse12 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1330) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1329))) (or (not (= (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1333) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_1330 .cse3)) v_prenex_1330)) (= (select (select .cse12 |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|) (= v_prenex_1332 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse12 v_prenex_1331) v_prenex_1332))))) .cse8))) (or .cse4 (and (or (forall ((v_prenex_1436 Int) (v_prenex_1434 (Array Int Int)) (v_prenex_1437 (Array Int Int)) (v_prenex_1438 Int)) (let ((.cse13 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1437) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1434))) (or (= (select (select .cse13 |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_prenex_1437 (store .cse5 .cse3 (select v_prenex_1437 .cse3)))) (= (select (select .cse13 v_prenex_1438) v_prenex_1436) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse8) (or (forall ((v_prenex_695 (Array Int Int)) (v_prenex_696 (Array Int Int))) (or (not (= v_prenex_696 (store (store .cse5 .cse2 (select v_prenex_696 .cse2)) .cse3 (select v_prenex_696 .cse3)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_696) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_695) |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|))) .cse9) (or .cse9 (forall ((v_prenex_1336 Int) (v_prenex_1334 Int) (v_prenex_1335 (Array Int Int)) (v_prenex_1337 (Array Int Int))) (let ((.cse14 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1337) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1335))) (or (= (select (select .cse14 |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_prenex_1337 (store (store .cse5 .cse2 (select v_prenex_1337 .cse2)) .cse3 (select v_prenex_1337 .cse3)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse14 v_prenex_1336) v_prenex_1334)))))) (or .cse8 (forall ((v_prenex_1339 (Array Int Int)) (v_prenex_1338 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1339) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1338) |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_prenex_1339 (store .cse5 .cse3 (select v_prenex_1339 .cse3)))))))))) .cse15) (or (and (forall ((v_prenex_1170 (Array Int Int)) (v_prenex_1171 (Array Int Int)) (v_prenex_1168 Int) (v_prenex_1167 (Array Int Int)) (v_prenex_1169 (Array Int Int))) (or (not (= v_prenex_1167 (store .cse5 .cse2 (select v_prenex_1167 .cse2)))) (= v_prenex_1168 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_1171 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1170) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1167) v_prenex_1168) .cse3 (select v_prenex_1171 .cse3)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1167) v_prenex_1168 v_prenex_1171) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1169) |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|))) (forall ((v_prenex_1383 (Array Int Int)) (v_prenex_1385 (Array Int Int)) (v_prenex_1384 (Array Int Int)) (v_prenex_1382 Int) (v_prenex_1381 Int) (v_prenex_1379 (Array Int Int)) (v_prenex_1380 Int)) (let ((.cse16 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1379) v_prenex_1381 v_prenex_1385) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1383))) (or (not (= v_prenex_1379 (store .cse5 .cse2 (select v_prenex_1379 .cse2)))) (= (select (select .cse16 |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|) (= v_prenex_1382 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_1385 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1384) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1379) v_prenex_1381) .cse3 (select v_prenex_1385 .cse3)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse16 v_prenex_1382) v_prenex_1380)) (= v_prenex_1381 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) .cse4 .cse7) (or .cse4 (and (or .cse7 (forall ((v_prenex_1134 Int) (v_prenex_1133 (Array Int Int)) (v_prenex_1136 (Array Int Int)) (v_prenex_1135 (Array Int Int)) (v_prenex_1137 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1133) v_prenex_1134 v_prenex_1137) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1135) |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_prenex_1133 (store .cse5 .cse2 (select v_prenex_1133 .cse2)))) (= v_prenex_1134 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1136) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1133) v_prenex_1134) .cse3 (select v_prenex_1137 .cse3)) v_prenex_1137))))) (forall ((v_prenex_1357 Int) (v_prenex_1360 (Array Int Int)) (v_prenex_1356 (Array Int Int)) (v_prenex_1358 (Array Int Int)) (v_prenex_1359 (Array Int Int))) (or (= v_prenex_1357 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= v_prenex_1360 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1359) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1356) v_prenex_1357) .cse3 (select v_prenex_1360 .cse3)))) (= v_prenex_1357 |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_1356) v_prenex_1357 v_prenex_1360) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1358) |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_prenex_1356 (store .cse5 .cse2 (select v_prenex_1356 .cse2)))))))) (forall ((v_prenex_1427 (Array Int Int)) (v_prenex_1430 Int) (v_prenex_1431 (Array Int Int)) (v_prenex_1433 (Array Int Int)) (v_prenex_1432 (Array Int Int)) (v_prenex_1429 Int) (v_prenex_1428 Int)) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1432)) (.cse18 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1427) v_prenex_1429 v_prenex_1433) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1431))) (or (not (= v_prenex_1427 (store (select .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_prenex_1427 .cse2)))) (= v_prenex_1429 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= v_prenex_1430 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse18 |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_prenex_1433 (store (select (store .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1427) v_prenex_1429) .cse3 (select v_prenex_1433 .cse3)))) (= (select (select .cse18 v_prenex_1430) v_prenex_1428) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (and .cse11 (or .cse19 .cse7)) (and (or (and (or (forall ((v_prenex_1140 (Array Int Int)) (v_prenex_1142 (Array Int Int)) (v_prenex_1143 Int) (v_prenex_1141 Int)) (or (= |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| v_prenex_1140) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1142) v_prenex_1143) v_prenex_1141)) (= v_prenex_1141 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) .cse11) (or .cse4 (forall ((v_prenex_1138 (Array Int Int)) (v_prenex_1139 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1138) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1139) |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_prenex_1138 (store .cse5 .cse2 (select v_prenex_1138 .cse2))))))) (forall ((v_prenex_1363 (Array Int Int)) (v_prenex_1364 Int) (v_prenex_1362 (Array Int Int)) (v_ArrVal_593 (Array Int Int)) (v_prenex_1361 Int)) (let ((.cse20 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1363) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_593))) (or (= (select (select .cse20 v_prenex_1364) v_prenex_1361) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1361 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_1363 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1362) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_prenex_1363 .cse2)))) (= (select (select .cse20 |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|))))) .cse7) (or .cse4 (and (forall ((v_prenex_1149 Int) (v_prenex_1147 Int) (v_prenex_1146 (Array Int Int)) (v_prenex_1148 (Array Int Int))) (let ((.cse21 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1146) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1148))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse21 |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| (select (select .cse21 v_prenex_1149) v_prenex_1147)) (not (= v_prenex_1146 (store .cse5 .cse2 (select v_prenex_1146 .cse2))))))) (forall ((v_prenex_1145 (Array Int Int)) (v_prenex_1144 (Array Int Int))) (or (not (= v_prenex_1144 (store .cse5 .cse2 (select v_prenex_1144 .cse2)))) (= |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| v_prenex_1144) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1145) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))))) (or .cse4 .cse7 (and (forall ((v_prenex_1393 (Array Int Int)) (v_prenex_1396 (Array Int Int)) (v_prenex_1395 Int) (v_prenex_1394 Int)) (let ((.cse22 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1393) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1396))) (or (= v_prenex_1395 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_1393 (store .cse5 .cse2 (select v_prenex_1393 .cse2)))) (= (select (select .cse22 v_prenex_1395) v_prenex_1394) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse22 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (forall ((v_prenex_1178 (Array Int Int)) (v_prenex_1177 (Array Int Int))) (or (not (= v_prenex_1177 (store .cse5 .cse2 (select v_prenex_1177 .cse2)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1177) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1178) |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|))))) (or (forall ((v_prenex_1343 Int) (v_prenex_1340 (Array Int Int)) (v_prenex_1342 Int) (v_prenex_1341 Int) (v_prenex_1345 (Array Int Int)) (v_prenex_1344 (Array Int Int)) (v_prenex_1346 (Array Int Int))) (or (not (= v_prenex_1340 (store v_prenex_1345 .cse2 (select v_prenex_1340 .cse2)))) (not (= v_prenex_1346 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1345) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1340) v_prenex_1342) .cse3 (select v_prenex_1346 .cse3)))) (= v_prenex_1342 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= v_prenex_1343 |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_1340) v_prenex_1342 v_prenex_1346) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1344) v_prenex_1343) v_prenex_1341) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse11) (or .cse4 (and (forall ((v_prenex_1132 (Array Int Int)) (v_prenex_1131 (Array Int Int))) (or (not (= v_prenex_1131 (store .cse5 .cse2 (select v_prenex_1131 .cse2)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1131) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1132) |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|))) (forall ((v_prenex_1349 Int) (v_prenex_1348 Int) (v_prenex_1350 (Array Int Int)) (v_prenex_1347 (Array Int Int))) (let ((.cse23 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1347) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1350))) (or (= (select (select .cse23 |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|) (= (select (select .cse23 v_prenex_1349) v_prenex_1348) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store .cse5 .cse2 (select v_prenex_1347 .cse2)) v_prenex_1347)))))) .cse7) (or (forall ((v_prenex_1412 Int) (v_prenex_1411 Int) (v_prenex_1409 (Array Int Int)) (v_prenex_1410 Int) (v_prenex_1413 (Array Int Int)) (v_prenex_1415 (Array Int Int)) (v_prenex_1414 (Array Int Int))) (or (= v_prenex_1411 |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_1409) v_prenex_1411 v_prenex_1415) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1413) v_prenex_1412) v_prenex_1410) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= (store v_prenex_1414 .cse2 (select v_prenex_1409 .cse2)) v_prenex_1409)) (= v_prenex_1412 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_1415 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1414) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1409) v_prenex_1411) .cse3 (select v_prenex_1415 .cse3)))))) .cse11) (or (and (or (and (forall ((v_prenex_1181 (Array Int Int)) (v_prenex_1180 (Array Int Int)) (v_prenex_1183 (Array Int Int)) (v_prenex_1296 Int) (v_prenex_1179 (Array Int Int)) (v_prenex_1293 Int) (v_prenex_1182 Int)) (let ((.cse24 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1181)) (.cse25 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1179) v_prenex_1182 v_prenex_1183) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1180))) (or (not (= v_prenex_1179 (store (select .cse24 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_prenex_1179 .cse2)))) (= (select (select .cse25 v_prenex_1296) v_prenex_1293) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1293 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_1183 (store (select (store .cse24 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1179) v_prenex_1182) .cse3 (select v_prenex_1183 .cse3)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse25 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= v_prenex_1182 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) (or .cse11 (forall ((v_prenex_1196 (Array Int Int)) (v_prenex_1201 Int) (v_prenex_1198 (Array Int Int)) (v_prenex_1199 Int) (v_prenex_1200 (Array Int Int)) (v_prenex_1197 Int) (v_prenex_1202 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1196) v_prenex_1201 v_prenex_1202) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1198) v_prenex_1199) v_prenex_1197) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_1196 (store v_prenex_1200 .cse2 (select v_prenex_1196 .cse2)))) (= v_prenex_1197 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_1202 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1200) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1196) v_prenex_1201) .cse3 (select v_prenex_1202 .cse3))))))) (or .cse4 (forall ((v_prenex_1291 (Array Int Int)) (v_prenex_1292 (Array Int Int)) (v_prenex_1295 (Array Int Int)) (v_prenex_1294 (Array Int Int)) (v_prenex_1297 Int)) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1295) v_prenex_1297 v_prenex_1294) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1291) |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_prenex_1295 (store .cse5 .cse2 (select v_prenex_1295 .cse2)))) (not (= v_prenex_1294 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1292) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1295) v_prenex_1297) .cse3 (select v_prenex_1294 .cse3))))))) (or (forall ((v_prenex_1192 (Array Int Int)) (v_prenex_1191 (Array Int Int)) (v_prenex_1193 (Array Int Int)) (v_prenex_1195 (Array Int Int)) (v_prenex_1194 Int)) (or (= v_prenex_1194 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= v_prenex_1195 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1193) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1191) v_prenex_1194) .cse3 (select v_prenex_1195 .cse3)))) (not (= v_prenex_1191 (store .cse5 .cse2 (select v_prenex_1191 .cse2)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1191) v_prenex_1194 v_prenex_1195) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1192) |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|))) .cse4) (forall ((v_prenex_1184 (Array Int Int)) (v_prenex_1189 Int) (v_prenex_1186 (Array Int Int)) (v_prenex_1187 Int) (v_prenex_1188 (Array Int Int)) (v_prenex_1185 Int) (v_prenex_1190 (Array Int Int))) (let ((.cse26 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1184) v_prenex_1189 v_prenex_1190) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1186)) (.cse27 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1188))) (or (= (select (select .cse26 |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|) (= (select (select .cse26 v_prenex_1187) v_prenex_1185) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1185 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_1184 (store (select .cse27 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_prenex_1184 .cse2)))) (not (= v_prenex_1190 (store (select (store .cse27 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1184) v_prenex_1189) .cse3 (select v_prenex_1190 .cse3)))))))) .cse19 .cse7) (forall ((v_prenex_1281 (Array Int Int)) (v_prenex_1283 (Array Int Int)) (v_prenex_1285 (Array Int Int)) (v_prenex_1284 Int) (v_prenex_1279 (Array Int Int)) (v_prenex_1282 Int) (v_prenex_1280 Int)) (let ((.cse29 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1283)) (.cse28 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1279) v_prenex_1284 v_prenex_1285) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1281))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= v_prenex_1280 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_1279 (store (select .cse29 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_prenex_1279 .cse2)))) (not (= v_prenex_1285 (store (select (store .cse29 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1279) v_prenex_1284) .cse3 (select v_prenex_1285 .cse3)))) (= v_prenex_1284 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= v_prenex_1284 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= (select (select .cse28 v_prenex_1282) v_prenex_1280) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (and (forall ((v_prenex_1239 Int) (v_prenex_1306 (Array Int Int)) (v_prenex_1237 Int) (v_prenex_1240 (Array Int Int)) (v_prenex_1303 (Array Int Int)) (v_prenex_1308 Int) (v_prenex_1238 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1306) v_prenex_1308 v_prenex_1240) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1238))) (or (= (select (select .cse30 v_prenex_1239) v_prenex_1237) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1308 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= v_prenex_1308 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_1306 (store .cse5 .cse2 (select v_prenex_1306 .cse2)))) (= (select (select .cse30 |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_prenex_1240 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1303) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1306) v_prenex_1308) .cse3 (select v_prenex_1240 .cse3))))))) (forall ((v_prenex_1250 (Array Int Int)) (v_prenex_1252 (Array Int Int)) (v_prenex_1251 Int) (v_prenex_1248 (Array Int Int)) (v_prenex_1249 (Array Int Int))) (or (not (= (store .cse5 .cse2 (select v_prenex_1248 .cse2)) v_prenex_1248)) (not (= (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1250) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1248) v_prenex_1251) .cse3 (select v_prenex_1252 .cse3)) v_prenex_1252)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1248) v_prenex_1251 v_prenex_1252) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1249) |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|) (= v_prenex_1251 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= v_prenex_1251 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or (and (or .cse9 (forall ((v_prenex_643 (Array Int Int)) (v_prenex_644 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_644) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_643) |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 (= (store (store .cse5 .cse2 (select v_prenex_644 .cse2)) .cse3 (select v_prenex_644 .cse3)) v_prenex_644))))) (or (forall ((v_prenex_1216 Int) (v_prenex_1214 Int) (v_prenex_1215 (Array Int Int)) (v_prenex_1217 (Array Int Int))) (let ((.cse31 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1217) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1215))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse31 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= v_prenex_1214 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse31 v_prenex_1216) v_prenex_1214)) (not (= v_prenex_1217 (store .cse5 .cse3 (select v_prenex_1217 .cse3))))))) .cse8) (or (forall ((v_prenex_1219 (Array Int Int)) (v_prenex_1218 (Array Int Int))) (or (not (= v_prenex_1219 (store .cse5 .cse3 (select v_prenex_1219 .cse3)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1219) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1218) |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|))) .cse8) (or .cse9 (forall ((v_prenex_1304 Int) (v_prenex_1309 (Array Int Int)) (v_prenex_1305 (Array Int Int)) (v_prenex_1307 Int)) (let ((.cse32 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1305) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1309))) (or (= (select (select .cse32 |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|) (= (select (select .cse32 v_prenex_1307) v_prenex_1304) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_1305 (store (store .cse5 .cse2 (select v_prenex_1305 .cse2)) .cse3 (select v_prenex_1305 .cse3)))) (= v_prenex_1304 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))))) .cse7) (or .cse7 (and (forall ((v_prenex_1223 Int) (v_prenex_1220 (Array Int Int)) (v_prenex_1222 (Array Int Int)) (v_prenex_1221 (Array Int Int)) (v_prenex_1224 (Array Int Int))) (or (not (= v_prenex_1224 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1222) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1220) v_prenex_1223) .cse3 (select v_prenex_1224 .cse3)))) (not (= v_prenex_1220 (store .cse5 .cse2 (select v_prenex_1220 .cse2)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1220) v_prenex_1223 v_prenex_1224) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1221) |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|))) (forall ((v_prenex_1247 Int) (v_prenex_1246 Int) (v_prenex_1242 (Array Int Int)) (v_prenex_1244 (Array Int Int)) (v_prenex_1241 Int) (v_prenex_1243 (Array Int Int)) (v_prenex_1245 (Array Int Int))) (let ((.cse33 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1245) v_prenex_1247 v_prenex_1244) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1242))) (or (not (= v_prenex_1245 (store .cse5 .cse2 (select v_prenex_1245 .cse2)))) (not (= v_prenex_1244 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1243) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1245) v_prenex_1247) .cse3 (select v_prenex_1244 .cse3)))) (= v_prenex_1241 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse33 v_prenex_1246) v_prenex_1241)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) (forall ((v_prenex_1228 Int) (v_prenex_1229 (Array Int Int)) (v_prenex_1226 Int) (v_prenex_1231 (Array Int Int)) (v_prenex_1230 Int) (v_prenex_1225 (Array Int Int)) (v_prenex_1227 (Array Int Int))) (let ((.cse34 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1225) v_prenex_1230 v_prenex_1231) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1227))) (or (= v_prenex_1230 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= (select (select .cse34 |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|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse34 v_prenex_1228) v_prenex_1226)) (not (= v_prenex_1231 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1229) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1225) v_prenex_1230) .cse3 (select v_prenex_1231 .cse3)))) (not (= v_prenex_1225 (store .cse5 .cse2 (select v_prenex_1225 .cse2))))))) (forall ((v_prenex_1235 Int) (v_prenex_1233 (Array Int Int)) (v_prenex_1232 (Array Int Int)) (v_prenex_1234 (Array Int Int)) (v_prenex_1236 (Array Int Int))) (or (= v_prenex_1235 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= v_prenex_1232 (store .cse5 .cse2 (select v_prenex_1232 .cse2)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1232) v_prenex_1235 v_prenex_1236) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1233) |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_prenex_1236 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1234) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1232) v_prenex_1235) .cse3 (select v_prenex_1236 .cse3)))))))) (forall ((v_prenex_1256 Int) (v_prenex_1253 (Array Int Int)) (v_prenex_1255 (Array Int Int)) (v_prenex_1254 (Array Int Int)) (v_prenex_1257 (Array Int Int))) (or (= v_prenex_1256 |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_1253) v_prenex_1256 v_prenex_1257) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1254) |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_prenex_1257 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1255) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1253) v_prenex_1256) .cse3 (select v_prenex_1257 .cse3)))) (not (= v_prenex_1253 (store .cse5 .cse2 (select v_prenex_1253 .cse2)))))) (forall ((v_prenex_1260 (Array Int Int)) (v_prenex_1259 Int) (v_prenex_1262 (Array Int Int)) (v_prenex_1264 (Array Int Int)) (v_prenex_1263 Int) (v_prenex_1261 Int) (v_prenex_1258 (Array Int Int))) (let ((.cse35 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1258) v_prenex_1263 v_prenex_1264) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1260))) (or (not (= v_prenex_1258 (store .cse5 .cse2 (select v_prenex_1258 .cse2)))) (= (select (select .cse35 v_prenex_1261) v_prenex_1259) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse35 |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|) (= v_prenex_1263 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_1264 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1262) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1258) v_prenex_1263) .cse3 (select v_prenex_1264 .cse3)))))))) .cse4) (or (forall ((v_prenex_1290 (Array Int Int)) (v_prenex_1289 Int) (v_prenex_1286 (Array Int Int)) (v_prenex_1288 (Array Int Int)) (v_prenex_1287 (Array Int Int))) (or (= v_prenex_1289 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= (store .cse5 .cse2 (select v_prenex_1286 .cse2)) v_prenex_1286)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1286) v_prenex_1289 v_prenex_1290) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1287) |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_prenex_1290 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1288) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1286) v_prenex_1289) .cse3 (select v_prenex_1290 .cse3)))))) .cse4) (or .cse7 (and (or .cse4 (and (or .cse9 (forall ((v_prenex_646 (Array Int Int)) (v_prenex_645 (Array Int Int))) (or (not (= (store (store .cse5 .cse2 (select v_prenex_646 .cse2)) .cse3 (select v_prenex_646 .cse3)) v_prenex_646)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_646) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_645) |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|)))) (or (forall ((v_prenex_1204 (Array Int Int)) (v_prenex_1203 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1203) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1204) |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_prenex_1203 (store .cse5 .cse3 (select v_prenex_1203 .cse3)))))) .cse8))) (or .cse8 (forall ((v_prenex_1302 Int) (v_prenex_1298 Int) (v_prenex_1299 (Array Int Int)) (v_prenex_1301 (Array Int Int)) (v_prenex_1300 (Array Int Int))) (let ((.cse36 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1301) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1299))) (or (= (select (select .cse36 |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|) (= (select (select .cse36 v_prenex_1302) v_prenex_1298) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1298 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (not (= v_prenex_1301 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1300) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse3 (select v_prenex_1301 .cse3)))))))) (or .cse11 (and (or (forall ((v_prenex_1208 Int) (v_prenex_1206 (Array Int Int)) (v_prenex_1205 (Array Int Int)) (v_prenex_1207 Int)) (or (= v_prenex_1208 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1206) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1205) v_prenex_1207) v_prenex_1208) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse8) (or .cse9 (forall ((v_prenex_648 (Array Int Int)) (v_prenex_650 (Array Int Int)) (v_prenex_649 Int) (v_prenex_647 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_650) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_648) v_prenex_649) v_prenex_647) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| v_prenex_647)))))) (or (forall ((v_prenex_1211 Int) (v_prenex_1210 (Array Int Int)) (v_prenex_1213 (Array Int Int)) (v_prenex_1212 (Array Int Int)) (v_prenex_1209 Int)) (let ((.cse37 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1213) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1210))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse37 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= v_prenex_1213 (store (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1212) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_prenex_1213 .cse2)) .cse3 (select v_prenex_1213 .cse3)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse37 v_prenex_1211) v_prenex_1209)) (= v_prenex_1209 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) .cse9))) (or (forall ((v_prenex_1271 (Array Int Int)) (v_prenex_1268 Int) (v_prenex_1266 Int) (v_prenex_1265 (Array Int Int)) (v_prenex_1267 (Array Int Int)) (v_prenex_1270 Int) (v_prenex_1269 (Array Int Int))) (or (not (= v_prenex_1265 (store v_prenex_1269 .cse2 (select v_prenex_1265 .cse2)))) (= v_prenex_1266 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= v_prenex_1270 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= v_prenex_1271 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1269) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1265) v_prenex_1270) .cse3 (select v_prenex_1271 .cse3)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1265) v_prenex_1270 v_prenex_1271) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1267) v_prenex_1268) v_prenex_1266) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse11) (or .cse11 (forall ((v_prenex_1406 (Array Int Int)) (v_prenex_1405 (Array Int Int)) (v_prenex_1408 Int) (v_prenex_1407 Int) (v_prenex_1404 (Array Int Int)) (|ULTIMATE.start_dll_circular_create_~last~0#1.base| Int) (v_ArrVal_588 (Array Int Int))) (or (not (= v_prenex_1405 (store v_prenex_1404 .cse2 (select v_prenex_1405 .cse2)))) (not (= v_ArrVal_588 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1404) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1405) |ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 (select v_ArrVal_588 .cse3)))) (= |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_1405) |ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_588) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1406) v_prenex_1408) v_prenex_1407)) (= v_prenex_1407 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= |ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (or .cse4 (forall ((v_prenex_1313 Int) (v_prenex_1310 (Array Int Int)) (v_prenex_1312 (Array Int Int)) (v_prenex_1311 (Array Int Int)) (v_prenex_1314 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1310) v_prenex_1313 v_prenex_1314) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1311) |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_prenex_1310 (store .cse5 .cse2 (select v_prenex_1310 .cse2)))) (not (= v_prenex_1314 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1312) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1310) v_prenex_1313) .cse3 (select v_prenex_1314 .cse3)))) (= v_prenex_1313 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= v_prenex_1313 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (forall ((v_prenex_1272 (Array Int Int)) (v_prenex_1277 Int) (v_prenex_1274 (Array Int Int)) (v_prenex_1275 Int) (v_prenex_1276 (Array Int Int)) (v_prenex_1273 Int) (v_prenex_1278 (Array Int Int))) (let ((.cse39 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1272) v_prenex_1277 v_prenex_1278) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1274)) (.cse38 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1276))) (or (= v_prenex_1277 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_1272 (store (select .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_prenex_1272 .cse2)))) (= (select (select .cse39 v_prenex_1275) v_prenex_1273) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1273 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) (= (select (select .cse39 |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_prenex_1278 (store (select (store .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1272) v_prenex_1277) .cse3 (select v_prenex_1278 .cse3)))))))) .cse15) (or .cse4 (forall ((v_prenex_1351 (Array Int Int)) (v_prenex_1352 Int) (v_prenex_1354 (Array Int Int)) (v_prenex_1353 (Array Int Int)) (v_prenex_1355 (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_1351) v_prenex_1352 v_prenex_1355) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1353) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= (store .cse5 .cse2 (select v_prenex_1351 .cse2)) v_prenex_1351)) (not (= v_prenex_1355 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1354) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1351) v_prenex_1352) .cse3 (select v_prenex_1355 .cse3)))) (= v_prenex_1352 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)))) (or .cse4 (and (or (forall ((v_prenex_1316 (Array Int Int)) (v_prenex_1417 Int) (v_prenex_1315 (Array Int Int)) (v_prenex_1416 Int)) (let ((.cse40 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1316) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1315))) (or (= (select (select .cse40 v_prenex_1417) v_prenex_1416) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_prenex_1316 (store (store .cse5 .cse2 (select v_prenex_1316 .cse2)) .cse3 (select v_prenex_1316 .cse3)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse40 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))))) .cse9) (or (forall ((v_prenex_1320 Int) (v_prenex_1321 (Array Int Int)) (v_prenex_1322 (Array Int Int)) (v_prenex_1319 Int)) (let ((.cse41 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1322) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1321))) (or (not (= v_prenex_1322 (store .cse5 .cse3 (select v_prenex_1322 .cse3)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse41 v_prenex_1320) v_prenex_1319)) (= (select (select .cse41 |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|)))) .cse8) (or (forall ((v_prenex_1318 (Array Int Int)) (v_prenex_1317 (Array Int Int))) (or (not (= v_prenex_1318 (store .cse5 .cse3 (select v_prenex_1318 .cse3)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1318) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1317) |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|))) .cse8) (or (forall ((v_prenex_1419 (Array Int Int)) (v_prenex_1418 (Array Int Int))) (or (not (= v_prenex_1419 (store (store .cse5 .cse2 (select v_prenex_1419 .cse2)) .cse3 (select v_prenex_1419 .cse3)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1419) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1418) |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|))) .cse9))) (or (and (forall ((v_ArrVal_579 (Array Int Int)) (v_arrayElimCell_52 Int) (v_prenex_5 Int) (v_arrayElimCell_49 Int) (v_ArrVal_575 (Array Int Int)) (v_prenex_4 (Array Int Int)) (v_prenex_6 (Array Int Int))) (let ((.cse42 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_579) v_prenex_5 v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_4))) (or (not (= (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_575) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_579) v_prenex_5) .cse3 (select v_prenex_6 .cse3)) v_prenex_6)) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_5) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 v_arrayElimCell_49) v_arrayElimCell_52)) (= v_prenex_5 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse42 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= v_ArrVal_579 (store .cse5 .cse2 (select v_ArrVal_579 .cse2))))))) (or (and (forall ((v_prenex_1119 (Array Int Int)) (v_prenex_1123 (Array Int Int)) (v_prenex_1121 Int) (v_prenex_1125 (Array Int Int)) (v_prenex_1124 (Array Int Int))) (or (= v_prenex_1121 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (not (= v_prenex_1125 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1124) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1119) v_prenex_1121) .cse3 (select v_prenex_1125 .cse3)))) (not (= v_prenex_1119 (store .cse5 .cse2 (select v_prenex_1119 .cse2)))) (= |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_1119) v_prenex_1121 v_prenex_1125) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1123) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_prenex_1115 Int) (v_prenex_1122 Int) (v_prenex_1120 Int) (v_prenex_1114 (Array Int Int)) (v_prenex_1116 (Array Int Int)) (v_prenex_1118 (Array Int Int)) (v_prenex_1117 (Array Int Int))) (let ((.cse43 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1114) v_prenex_1115 v_prenex_1118) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1116))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse43 v_prenex_1122) v_prenex_1120)) (= (select (select .cse43 |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_prenex_1114 (store .cse5 .cse2 (select v_prenex_1114 .cse2)))) (not (= v_prenex_1118 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1117) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1114) v_prenex_1115) .cse3 (select v_prenex_1118 .cse3)))) (= v_prenex_1115 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))))) .cse7) (forall ((v_prenex_1127 Int) (v_prenex_1130 (Array Int Int)) (v_prenex_1126 (Array Int Int)) (v_prenex_1129 (Array Int Int)) (v_prenex_1128 (Array Int Int))) (or (= v_prenex_1127 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (= v_prenex_1127 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_1126 (store .cse5 .cse2 (select v_prenex_1126 .cse2)))) (not (= (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1129) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1126) v_prenex_1127) .cse3 (select v_prenex_1130 .cse3)) v_prenex_1130)) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1126) v_prenex_1127 v_prenex_1130) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1128) |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|)))) .cse4) (or .cse7 (and (or .cse4 (forall ((v_prenex_1150 (Array Int Int)) (v_prenex_1152 (Array Int Int)) (v_prenex_1154 (Array Int Int)) (v_prenex_1153 (Array Int Int)) (v_prenex_1151 Int)) (or (not (= v_prenex_1150 (store .cse5 .cse2 (select v_prenex_1150 .cse2)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1150) v_prenex_1151 v_prenex_1154) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1152) |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_prenex_1154 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1153) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1150) v_prenex_1151) .cse3 (select v_prenex_1154 .cse3))))))) (forall ((v_prenex_1365 Int) (v_prenex_1367 (Array Int Int)) (v_prenex_1366 (Array Int Int)) (v_prenex_1371 Int) (v_prenex_1369 (Array Int Int)) (v_prenex_1370 Int) (v_prenex_1368 (Array Int Int))) (let ((.cse44 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1369) v_prenex_1370 v_prenex_1368) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1366)) (.cse45 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1367))) (or (= (select (select .cse44 |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_prenex_1369 (store (select .cse45 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse2 (select v_prenex_1369 .cse2)))) (= v_prenex_1371 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse44 v_prenex_1371) v_prenex_1365)) (not (= v_prenex_1368 (store (select (store .cse45 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1369) v_prenex_1370) .cse3 (select v_prenex_1368 .cse3))))))) (or (forall ((v_prenex_1161 (Array Int Int)) (v_prenex_1160 (Array Int Int)) (v_prenex_1158 Int) (v_prenex_1157 Int) (v_prenex_1156 Int) (v_prenex_1155 (Array Int Int)) (v_prenex_1159 (Array Int Int))) (or (= v_prenex_1158 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_1161 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1160) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1155) v_prenex_1157) .cse3 (select v_prenex_1161 .cse3)))) (not (= v_prenex_1155 (store v_prenex_1160 .cse2 (select v_prenex_1155 .cse2)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1155) v_prenex_1157 v_prenex_1161) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1159) v_prenex_1158) v_prenex_1156) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse11))) (or (and (forall ((v_prenex_1162 (Array Int Int)) (v_prenex_1165 (Array Int Int)) (v_prenex_1164 (Array Int Int)) (v_prenex_1166 (Array Int Int)) (v_prenex_1163 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_1162) v_prenex_1163 v_prenex_1166) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1164) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= v_prenex_1166 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1165) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1162) v_prenex_1163) .cse3 (select v_prenex_1166 .cse3)))) (not (= v_prenex_1162 (store .cse5 .cse2 (select v_prenex_1162 .cse2)))))) (forall ((v_prenex_1372 (Array Int Int)) (v_prenex_1375 Int) (v_prenex_1376 (Array Int Int)) (v_prenex_1374 Int) (v_prenex_1373 Int) (v_prenex_1378 (Array Int Int)) (v_prenex_1377 (Array Int Int))) (let ((.cse46 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1372) v_prenex_1374 v_prenex_1378) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1376))) (or (not (= v_prenex_1372 (store .cse5 .cse2 (select v_prenex_1372 .cse2)))) (not (= v_prenex_1378 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1377) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1372) v_prenex_1374) .cse3 (select v_prenex_1378 .cse3)))) (= (select (select .cse46 v_prenex_1375) v_prenex_1373) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1375 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse46 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) .cse4 .cse7) (or (forall ((v_prenex_1423 Int) (v_prenex_1422 Int) (v_prenex_1421 Int) (v_prenex_1420 (Array Int Int)) (v_prenex_1424 (Array Int Int)) (v_prenex_1426 (Array Int Int)) (v_prenex_1425 (Array Int Int))) (let ((.cse47 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1420) v_prenex_1422 v_prenex_1426) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1424))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse47 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse47 v_prenex_1423) v_prenex_1421) |c_ULTIMATE.start_main_~data_init~0#1|) (= v_prenex_1423 |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (not (= v_prenex_1420 (store .cse5 .cse2 (select v_prenex_1420 .cse2)))) (not (= v_prenex_1426 (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_prenex_1425) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_1420) v_prenex_1422) .cse3 (select v_prenex_1426 .cse3)))) (= v_prenex_1422 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) .cse4 .cse7))))) is different from false [2024-11-16 06:39:28,020 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 [2024-11-16 06:39:28,071 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 [2024-11-16 06:39:28,606 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 [2024-11-16 06:39:28,648 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 [2024-11-16 06:39:28,697 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 [2024-11-16 06:39:28,874 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:28,981 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 [2024-11-16 06:39:29,077 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 [2024-11-16 06:39:29,365 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:29,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2024-11-16 06:39:35,177 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:35,216 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-16 06:39:35,217 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 274 treesize of output 284 [2024-11-16 06:39:35,244 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:35,245 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 297 treesize of output 293 [2024-11-16 06:39:35,254 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:35,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:35,273 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 313 treesize of output 313 [2024-11-16 06:39:35,297 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 246 [2024-11-16 06:39:35,321 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-16 06:39:35,839 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:35,841 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 [2024-11-16 06:39:35,864 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:35,865 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:35,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:35,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 210 treesize of output 213 [2024-11-16 06:39:35,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 132 treesize of output 126 [2024-11-16 06:39:35,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:35,893 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 82 treesize of output 86 [2024-11-16 06:39:35,905 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:35,905 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 2 case distinctions, treesize of input 113 treesize of output 141 [2024-11-16 06:39:35,915 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:35,916 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 64 treesize of output 59 [2024-11-16 06:39:35,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:35,929 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 30 treesize of output 37 [2024-11-16 06:39:35,977 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 12 treesize of output 8 [2024-11-16 06:39:35,989 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 12 treesize of output 8 [2024-11-16 06:39:36,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 12 treesize of output 8 [2024-11-16 06:39:36,006 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 39 [2024-11-16 06:39:36,022 INFO L349 Elim1Store]: treesize reduction 35, result has 27.1 percent of original size [2024-11-16 06:39:36,022 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 4 case distinctions, treesize of input 57 treesize of output 38 [2024-11-16 06:39:36,025 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 11 [2024-11-16 06:39:36,039 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:36,040 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:36,040 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:36,074 INFO L349 Elim1Store]: treesize reduction 21, result has 62.5 percent of original size [2024-11-16 06:39:36,074 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 320 treesize of output 340 [2024-11-16 06:39:36,122 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:36,122 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 2 case distinctions, treesize of input 304 treesize of output 308 [2024-11-16 06:39:36,146 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 238 treesize of output 230 [2024-11-16 06:39:36,215 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2024-11-16 06:39:36,215 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 369 treesize of output 398 [2024-11-16 06:39:36,242 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 [2024-11-16 06:39:36,379 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 [2024-11-16 06:39:36,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 5 treesize of output 3 [2024-11-16 06:39:36,558 INFO L349 Elim1Store]: treesize reduction 17, result has 43.3 percent of original size [2024-11-16 06:39:36,558 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 39 treesize of output 37 [2024-11-16 06:39:36,585 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 [2024-11-16 06:39:36,741 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 324 treesize of output 320 [2024-11-16 06:39:36,928 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:36,929 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 18 treesize of output 22 [2024-11-16 06:39:36,960 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 12 treesize of output 8 [2024-11-16 06:39:37,011 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:37,012 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 89 treesize of output 91 [2024-11-16 06:39:37,043 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:37,046 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:37,047 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 41 treesize of output 41 [2024-11-16 06:39:37,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 61 [2024-11-16 06:39:37,054 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:37,061 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:37,062 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 1 new quantified variables, introduced 2 case distinctions, treesize of input 54 treesize of output 61 [2024-11-16 06:39:37,068 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:37,088 INFO L349 Elim1Store]: treesize reduction 16, result has 70.4 percent of original size [2024-11-16 06:39:37,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 43 treesize of output 60 [2024-11-16 06:39:37,095 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:37,096 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 17 [2024-11-16 06:39:37,110 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:37,115 INFO L349 Elim1Store]: treesize reduction 5, result has 50.0 percent of original size [2024-11-16 06:39:37,116 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2024-11-16 06:39:37,120 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 26 [2024-11-16 06:39:37,131 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:37,133 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:37,135 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:37,171 INFO L349 Elim1Store]: treesize reduction 21, result has 62.5 percent of original size [2024-11-16 06:39:37,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 687 treesize of output 701 [2024-11-16 06:39:37,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:37,206 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 2 case distinctions, treesize of input 235 treesize of output 239 [2024-11-16 06:39:37,264 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2024-11-16 06:39:37,264 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 227 treesize of output 256 [2024-11-16 06:39:37,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:37,284 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 73 treesize of output 68 [2024-11-16 06:39:37,341 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 12 treesize of output 8 [2024-11-16 06:39:37,406 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 [2024-11-16 06:39:37,926 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2024-11-16 06:39:37,927 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 613 treesize of output 609 [2024-11-16 06:39:38,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:38,112 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 [2024-11-16 06:39:38,145 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:38,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 20 [2024-11-16 06:39:38,179 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:38,179 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 [2024-11-16 06:39:38,465 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 12 treesize of output 8 [2024-11-16 06:39:38,498 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 12 treesize of output 8 [2024-11-16 06:39:38,511 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 12 treesize of output 8 [2024-11-16 06:39:38,531 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:38,531 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 52 treesize of output 54 [2024-11-16 06:39:38,550 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:38,553 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-16 06:39:38,620 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2024-11-16 06:39:38,621 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 2055 treesize of output 2076 [2024-11-16 06:39:38,637 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 230 treesize of output 214 [2024-11-16 06:39:38,677 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-16 06:39:38,677 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 372 treesize of output 380 [2024-11-16 06:39:38,763 INFO L349 Elim1Store]: treesize reduction 132, result has 35.9 percent of original size [2024-11-16 06:39:38,763 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 365 treesize of output 415 [2024-11-16 06:39:39,043 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 [2024-11-16 06:39:43,589 INFO L349 Elim1Store]: treesize reduction 909, result has 28.2 percent of original size [2024-11-16 06:39:43,590 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 8 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 9 new quantified variables, introduced 29 case distinctions, treesize of input 3511 treesize of output 4110 [2024-11-16 06:39:50,111 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,123 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,126 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,131 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,133 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,139 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,140 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,142 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,143 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,145 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,146 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,148 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 7 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 580 [2024-11-16 06:39:50,243 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,252 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,268 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,270 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,280 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,367 INFO L224 Elim1Store]: Index analysis took 136 ms [2024-11-16 06:39:50,477 INFO L349 Elim1Store]: treesize reduction 249, result has 3.9 percent of original size [2024-11-16 06:39:50,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 7 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 30 case distinctions, treesize of input 241 treesize of output 619 [2024-11-16 06:39:50,718 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,727 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,742 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,744 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,749 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,841 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:50,853 INFO L224 Elim1Store]: Index analysis took 154 ms [2024-11-16 06:39:50,960 INFO L349 Elim1Store]: treesize reduction 249, result has 3.9 percent of original size [2024-11-16 06:39:50,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 7 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 30 case distinctions, treesize of input 241 treesize of output 619 [2024-11-16 06:39:51,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:51,324 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:51,336 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:51,344 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:51,349 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:51,428 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:51,438 INFO L224 Elim1Store]: Index analysis took 130 ms [2024-11-16 06:39:51,575 INFO L349 Elim1Store]: treesize reduction 249, result has 3.9 percent of original size [2024-11-16 06:39:51,575 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 7 stores, 3 select indices, 3 select index equivalence classes, 2 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 30 case distinctions, treesize of input 241 treesize of output 619 [2024-11-16 06:39:52,059 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,064 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,077 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,079 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,083 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,183 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,194 INFO L224 Elim1Store]: Index analysis took 147 ms [2024-11-16 06:39:52,286 INFO L349 Elim1Store]: treesize reduction 249, result has 3.9 percent of original size [2024-11-16 06:39:52,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 7 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 30 case distinctions, treesize of input 241 treesize of output 619 [2024-11-16 06:39:52,444 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,448 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,460 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,464 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,533 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,541 INFO L224 Elim1Store]: Index analysis took 108 ms [2024-11-16 06:39:52,688 INFO L349 Elim1Store]: treesize reduction 249, result has 3.9 percent of original size [2024-11-16 06:39:52,689 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 7 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 30 case distinctions, treesize of input 241 treesize of output 619 [2024-11-16 06:39:52,839 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,844 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,855 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,856 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,859 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,862 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,864 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,869 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,870 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,871 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,873 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:52,875 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 7 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 208 treesize of output 580 [2024-11-16 06:39:53,020 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:53,025 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:53,037 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:53,040 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:53,044 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:53,117 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:53,124 INFO L224 Elim1Store]: Index analysis took 124 ms [2024-11-16 06:39:53,214 INFO L349 Elim1Store]: treesize reduction 249, result has 3.9 percent of original size [2024-11-16 06:39:53,214 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 7 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 30 case distinctions, treesize of input 241 treesize of output 619 [2024-11-16 06:39:53,733 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:53,737 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:53,752 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:53,754 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:53,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:53,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-16 06:39:53,858 INFO L224 Elim1Store]: Index analysis took 135 ms [2024-11-16 06:39:53,984 INFO L349 Elim1Store]: treesize reduction 249, result has 3.9 percent of original size [2024-11-16 06:39:53,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 7 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 30 case distinctions, treesize of input 241 treesize of output 619