./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 8be7027f 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-wip.dk.perfect-tracechecks-8be7027-m [2024-11-11 19:39:19,363 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-11 19:39:19,434 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-Reach-32bit-Automizer_Default.epf [2024-11-11 19:39:19,440 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-11 19:39:19,443 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-11 19:39:19,461 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-11 19:39:19,462 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-11 19:39:19,462 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-11 19:39:19,463 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-11 19:39:19,463 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-11 19:39:19,463 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-11 19:39:19,464 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-11 19:39:19,464 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-11 19:39:19,465 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-11 19:39:19,465 INFO L153 SettingsManager]: * Use SBE=true [2024-11-11 19:39:19,465 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-11 19:39:19,466 INFO L153 SettingsManager]: * Pointer base address is valid at dereference=IGNORE [2024-11-11 19:39:19,466 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-11 19:39:19,466 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-11 19:39:19,467 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-11 19:39:19,470 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-11 19:39:19,471 INFO L153 SettingsManager]: * Pointer to allocated memory at dereference=IGNORE [2024-11-11 19:39:19,471 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-11 19:39:19,471 INFO L153 SettingsManager]: * Check array bounds for arrays that are off heap=IGNORE [2024-11-11 19:39:19,472 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-11 19:39:19,472 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-11 19:39:19,472 INFO L153 SettingsManager]: * Check if freed pointer was valid=false [2024-11-11 19:39:19,473 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-11 19:39:19,473 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-11-11 19:39:19,473 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-11 19:39:19,474 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-11 19:39:19,474 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-11 19:39:19,474 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:39:19,474 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-11 19:39:19,475 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-11 19:39:19,475 INFO L153 SettingsManager]: * Positions where we compute the Hoare Annotation=LoopHeads [2024-11-11 19:39:19,475 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-11 19:39:19,475 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-11 19:39:19,476 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-11 19:39:19,476 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-11 19:39:19,476 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-11 19:39:19,477 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-11 19:39:19,477 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-11 19:39:19,753 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-11 19:39:19,781 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-11 19:39:19,784 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-11 19:39:19,785 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-11 19:39:19,785 INFO L274 PluginConnector]: CDTParser initialized [2024-11-11 19:39:19,787 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-11 19:39:21,326 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-11 19:39:21,575 INFO L384 CDTParser]: Found 1 translation units. [2024-11-11 19:39:21,577 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_circular_traversal-2.i [2024-11-11 19:39:21,590 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52c89f8e1/9a28f1bbd53b4541b25e069a9c41bc8e/FLAG1e7f48c59 [2024-11-11 19:39:21,604 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/52c89f8e1/9a28f1bbd53b4541b25e069a9c41bc8e [2024-11-11 19:39:21,607 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-11 19:39:21,608 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-11 19:39:21,609 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-11 19:39:21,609 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-11 19:39:21,615 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-11 19:39:21,615 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:39:21" (1/1) ... [2024-11-11 19:39:21,618 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@46b2a3f0 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:39:21, skipping insertion in model container [2024-11-11 19:39:21,618 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.11 07:39:21" (1/1) ... [2024-11-11 19:39:21,662 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-11 19:39:21,963 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-11 19:39:21,967 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:39:21,979 INFO L200 MainTranslator]: Completed pre-run [2024-11-11 19:39:22,026 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-11 19:39:22,027 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-11 19:39:22,055 INFO L204 MainTranslator]: Completed translation [2024-11-11 19:39:22,056 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:39:22 WrapperNode [2024-11-11 19:39:22,056 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-11 19:39:22,057 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-11 19:39:22,057 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-11 19:39:22,057 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-11 19:39:22,063 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:39:22" (1/1) ... [2024-11-11 19:39:22,075 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:39:22" (1/1) ... [2024-11-11 19:39:22,098 INFO L138 Inliner]: procedures = 122, calls = 27, calls flagged for inlining = 3, calls inlined = 3, statements flattened = 93 [2024-11-11 19:39:22,099 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-11 19:39:22,099 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-11 19:39:22,099 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-11 19:39:22,100 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-11 19:39:22,110 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:39:22" (1/1) ... [2024-11-11 19:39:22,111 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:39:22" (1/1) ... [2024-11-11 19:39:22,116 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:39:22" (1/1) ... [2024-11-11 19:39:22,133 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-11 19:39:22,135 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:39:22" (1/1) ... [2024-11-11 19:39:22,135 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:39:22" (1/1) ... [2024-11-11 19:39:22,141 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:39:22" (1/1) ... [2024-11-11 19:39:22,145 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:39:22" (1/1) ... [2024-11-11 19:39:22,146 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:39:22" (1/1) ... [2024-11-11 19:39:22,147 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:39:22" (1/1) ... [2024-11-11 19:39:22,153 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-11 19:39:22,154 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-11-11 19:39:22,154 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-11-11 19:39:22,154 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-11-11 19:39:22,155 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:39:22" (1/1) ... [2024-11-11 19:39:22,160 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-11 19:39:22,169 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:39:22,185 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-11 19:39:22,189 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-11 19:39:22,231 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-11 19:39:22,232 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-11 19:39:22,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#0 [2024-11-11 19:39:22,233 INFO L130 BoogieDeclarations]: Found specification of procedure read~int#1 [2024-11-11 19:39:22,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#0 [2024-11-11 19:39:22,233 INFO L130 BoogieDeclarations]: Found specification of procedure write~int#1 [2024-11-11 19:39:22,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-11 19:39:22,233 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2024-11-11 19:39:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-11 19:39:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2024-11-11 19:39:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-11 19:39:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2024-11-11 19:39:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-11 19:39:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2024-11-11 19:39:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2024-11-11 19:39:22,234 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-11 19:39:22,234 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-11 19:39:22,370 INFO L238 CfgBuilder]: Building ICFG [2024-11-11 19:39:22,372 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-11 19:39:22,406 INFO L735 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-11 19:39:22,580 INFO L? ?]: Removed 19 outVars from TransFormulas that were not future-live. [2024-11-11 19:39:22,580 INFO L287 CfgBuilder]: Performing block encoding [2024-11-11 19:39:22,601 INFO L311 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-11 19:39:22,601 INFO L316 CfgBuilder]: Removed 3 assume(true) statements. [2024-11-11 19:39:22,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:39:22 BoogieIcfgContainer [2024-11-11 19:39:22,602 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-11-11 19:39:22,606 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-11 19:39:22,606 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-11 19:39:22,609 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-11 19:39:22,610 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.11 07:39:21" (1/3) ... [2024-11-11 19:39:22,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f1f02c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:39:22, skipping insertion in model container [2024-11-11 19:39:22,611 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.11 07:39:22" (2/3) ... [2024-11-11 19:39:22,611 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@68f1f02c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.11 07:39:22, skipping insertion in model container [2024-11-11 19:39:22,612 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.11 07:39:22" (3/3) ... [2024-11-11 19:39:22,613 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_circular_traversal-2.i [2024-11-11 19:39:22,627 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:LoopHeads NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-11 19:39:22,627 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 1 error locations. [2024-11-11 19:39:22,677 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-11 19:39:22,683 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;@41cfac46, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-11 19:39:22,683 INFO L334 AbstractCegarLoop]: Starting to check reachability of 1 error locations. [2024-11-11 19:39:22,687 INFO L276 IsEmpty]: Start isEmpty. Operand has 26 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 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-11 19:39:22,691 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 19:39:22,691 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:39:22,692 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:39:22,692 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:39:22,696 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:39:22,697 INFO L85 PathProgramCache]: Analyzing trace with hash 70364748, now seen corresponding path program 1 times [2024-11-11 19:39:22,704 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:39:22,704 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1991575105] [2024-11-11 19:39:22,705 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:39:22,705 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:39:22,853 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:39:22,936 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-11 19:39:22,937 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:39:22,937 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1991575105] [2024-11-11 19:39:22,937 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1991575105] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:39:22,938 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:39:22,938 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-11 19:39:22,939 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [59647105] [2024-11-11 19:39:22,941 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:39:22,945 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 2 states [2024-11-11 19:39:22,946 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:39:22,970 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 2 interpolants. [2024-11-11 19:39:22,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=1, Invalid=1, Unknown=0, NotChecked=0, Total=2 [2024-11-11 19:39:22,973 INFO L87 Difference]: Start difference. First operand has 26 states, 22 states have (on average 1.5) internal successors, (33), 24 states have internal predecessors, (33), 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.0) internal successors, (10), 2 states have internal predecessors, (10), 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-11 19:39:22,991 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:39:22,992 INFO L93 Difference]: Finished difference Result 41 states and 55 transitions. [2024-11-11 19:39:22,993 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 2 states. [2024-11-11 19:39:22,994 INFO L78 Accepts]: Start accepts. Automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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 10 [2024-11-11 19:39:22,994 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:39:22,999 INFO L225 Difference]: With dead ends: 41 [2024-11-11 19:39:22,999 INFO L226 Difference]: Without dead ends: 18 [2024-11-11 19:39:23,001 INFO L434 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-11 19:39:23,004 INFO L435 NwaCegarLoop]: 31 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, 31 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-11 19:39:23,005 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 31 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 0 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:39:23,033 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 18 states. [2024-11-11 19:39:23,044 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 18 to 18. [2024-11-11 19:39:23,046 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 18 states, 17 states have (on average 1.2352941176470589) internal successors, (21), 17 states have internal predecessors, (21), 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-11 19:39:23,047 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 18 states to 18 states and 21 transitions. [2024-11-11 19:39:23,048 INFO L78 Accepts]: Start accepts. Automaton has 18 states and 21 transitions. Word has length 10 [2024-11-11 19:39:23,049 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:39:23,049 INFO L471 AbstractCegarLoop]: Abstraction has 18 states and 21 transitions. [2024-11-11 19:39:23,050 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 2 states, 2 states have (on average 5.0) internal successors, (10), 2 states have internal predecessors, (10), 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-11 19:39:23,050 INFO L276 IsEmpty]: Start isEmpty. Operand 18 states and 21 transitions. [2024-11-11 19:39:23,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-11 19:39:23,051 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:39:23,052 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:39:23,052 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-11 19:39:23,053 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:39:23,053 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:39:23,053 INFO L85 PathProgramCache]: Analyzing trace with hash -273185064, now seen corresponding path program 1 times [2024-11-11 19:39:23,054 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:39:23,054 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1698214489] [2024-11-11 19:39:23,058 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:39:23,058 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:39:23,123 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:39:23,305 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-11 19:39:23,306 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:39:23,306 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1698214489] [2024-11-11 19:39:23,306 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1698214489] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-11 19:39:23,306 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-11 19:39:23,306 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-11 19:39:23,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890123751] [2024-11-11 19:39:23,306 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-11 19:39:23,307 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-11 19:39:23,308 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:39:23,309 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-11 19:39:23,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:39:23,310 INFO L87 Difference]: Start difference. First operand 18 states and 21 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11 19:39:23,338 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:39:23,338 INFO L93 Difference]: Finished difference Result 32 states and 38 transitions. [2024-11-11 19:39:23,338 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-11 19:39:23,339 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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 10 [2024-11-11 19:39:23,339 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:39:23,339 INFO L225 Difference]: With dead ends: 32 [2024-11-11 19:39:23,339 INFO L226 Difference]: Without dead ends: 21 [2024-11-11 19:39:23,342 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-11 19:39:23,343 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 2 mSDsluCounter, 14 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 2 SdHoareTripleChecker+Valid, 33 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-11 19:39:23,344 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [2 Valid, 33 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:39:23,345 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 21 states. [2024-11-11 19:39:23,348 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 21 to 19. [2024-11-11 19:39:23,349 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 19 states, 18 states have (on average 1.2222222222222223) internal successors, (22), 18 states have internal predecessors, (22), 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-11 19:39:23,350 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 19 states to 19 states and 22 transitions. [2024-11-11 19:39:23,350 INFO L78 Accepts]: Start accepts. Automaton has 19 states and 22 transitions. Word has length 10 [2024-11-11 19:39:23,350 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:39:23,350 INFO L471 AbstractCegarLoop]: Abstraction has 19 states and 22 transitions. [2024-11-11 19:39:23,350 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 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-11 19:39:23,351 INFO L276 IsEmpty]: Start isEmpty. Operand 19 states and 22 transitions. [2024-11-11 19:39:23,351 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 14 [2024-11-11 19:39:23,351 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:39:23,351 INFO L218 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:39:23,351 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-11 19:39:23,351 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:39:23,352 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:39:23,352 INFO L85 PathProgramCache]: Analyzing trace with hash 2002783240, now seen corresponding path program 1 times [2024-11-11 19:39:23,352 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:39:23,352 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [82418489] [2024-11-11 19:39:23,352 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:39:23,353 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:39:23,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:39:23,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:39:23,526 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:39:23,526 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [82418489] [2024-11-11 19:39:23,526 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [82418489] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:39:23,527 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [145056273] [2024-11-11 19:39:23,527 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:39:23,528 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:39:23,528 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:39:23,530 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-11 19:39:23,532 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-11 19:39:23,653 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:39:23,657 INFO L256 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-11 19:39:23,663 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:39:23,712 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:39:23,713 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:39:23,746 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-11 19:39:23,750 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [145056273] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:39:23,753 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:39:23,753 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 7 [2024-11-11 19:39:23,753 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [94255427] [2024-11-11 19:39:23,753 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:39:23,753 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-11 19:39:23,754 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:39:23,754 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-11 19:39:23,754 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=21, Unknown=0, NotChecked=0, Total=42 [2024-11-11 19:39:23,755 INFO L87 Difference]: Start difference. First operand 19 states and 22 transitions. Second operand has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-11 19:39:23,809 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:39:23,810 INFO L93 Difference]: Finished difference Result 39 states and 47 transitions. [2024-11-11 19:39:23,810 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-11-11 19:39:23,811 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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 13 [2024-11-11 19:39:23,812 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:39:23,812 INFO L225 Difference]: With dead ends: 39 [2024-11-11 19:39:23,813 INFO L226 Difference]: Without dead ends: 28 [2024-11-11 19:39:23,813 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 23 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-11 19:39:23,815 INFO L435 NwaCegarLoop]: 19 mSDtfsCounter, 4 mSDsluCounter, 55 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 74 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-11 19:39:23,816 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 74 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-11 19:39:23,817 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 28 states. [2024-11-11 19:39:23,822 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 28 to 28. [2024-11-11 19:39:23,823 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 28 states, 27 states have (on average 1.1481481481481481) internal successors, (31), 27 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:39:23,824 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 28 states to 28 states and 31 transitions. [2024-11-11 19:39:23,824 INFO L78 Accepts]: Start accepts. Automaton has 28 states and 31 transitions. Word has length 13 [2024-11-11 19:39:23,825 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:39:23,825 INFO L471 AbstractCegarLoop]: Abstraction has 28 states and 31 transitions. [2024-11-11 19:39:23,825 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 3.7142857142857144) internal successors, (26), 7 states have internal predecessors, (26), 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-11 19:39:23,826 INFO L276 IsEmpty]: Start isEmpty. Operand 28 states and 31 transitions. [2024-11-11 19:39:23,826 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-11-11 19:39:23,826 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:39:23,826 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:39:23,846 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-11 19:39:24,027 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-11 19:39:24,027 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:39:24,028 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:39:24,028 INFO L85 PathProgramCache]: Analyzing trace with hash 1740729048, now seen corresponding path program 2 times [2024-11-11 19:39:24,028 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:39:24,028 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [950260555] [2024-11-11 19:39:24,028 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:39:24,028 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:39:24,237 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:39:25,066 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 7 proven. 10 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 19:39:25,066 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:39:25,066 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [950260555] [2024-11-11 19:39:25,067 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [950260555] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:39:25,067 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994574840] [2024-11-11 19:39:25,067 INFO L95 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2024-11-11 19:39:25,067 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:39:25,067 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:39:25,070 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-11 19:39:25,071 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-11 19:39:25,237 INFO L229 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2024-11-11 19:39:25,238 INFO L230 tOrderPrioritization]: Conjunction of SSA is unsat [2024-11-11 19:39:25,241 INFO L256 TraceCheckSpWp]: Trace formula consists of 319 conjuncts, 43 conjuncts are in the unsatisfiable core [2024-11-11 19:39:25,244 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:39:25,377 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-11 19:39:25,477 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-11 19:39:25,477 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-11 19:39:25,552 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-11 19:39:25,559 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-11 19:39:25,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:39:25,632 INFO L349 Elim1Store]: treesize reduction 21, result has 4.5 percent of original size [2024-11-11 19:39:25,633 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 11 [2024-11-11 19:39:25,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2024-11-11 19:39:25,719 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 11 proven. 6 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 19:39:25,719 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:39:25,804 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:25,806 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 39 treesize of output 32 [2024-11-11 19:39:25,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:25,818 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 146 treesize of output 144 [2024-11-11 19:39:25,839 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 154 treesize of output 146 [2024-11-11 19:39:25,955 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 39 treesize of output 33 [2024-11-11 19:39:26,204 INFO L134 CoverageAnalysis]: Checked inductivity of 22 backedges. 0 proven. 17 refuted. 0 times theorem prover too weak. 5 trivial. 0 not checked. [2024-11-11 19:39:26,204 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994574840] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:39:26,204 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:39:26,204 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 10, 10] total 23 [2024-11-11 19:39:26,204 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [983095911] [2024-11-11 19:39:26,204 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:39:26,205 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-11-11 19:39:26,205 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:39:26,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-11-11 19:39:26,208 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=439, Unknown=0, NotChecked=0, Total=506 [2024-11-11 19:39:26,209 INFO L87 Difference]: Start difference. First operand 28 states and 31 transitions. Second operand has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 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-11 19:39:26,630 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-11 19:39:26,631 INFO L93 Difference]: Finished difference Result 32 states and 35 transitions. [2024-11-11 19:39:26,631 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-11 19:39:26,631 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 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 22 [2024-11-11 19:39:26,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-11 19:39:26,632 INFO L225 Difference]: With dead ends: 32 [2024-11-11 19:39:26,632 INFO L226 Difference]: Without dead ends: 30 [2024-11-11 19:39:26,633 INFO L434 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 157 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=162, Invalid=768, Unknown=0, NotChecked=0, Total=930 [2024-11-11 19:39:26,634 INFO L435 NwaCegarLoop]: 13 mSDtfsCounter, 12 mSDsluCounter, 120 mSDsCounter, 0 mSdLazyCounter, 197 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 133 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 197 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-11 19:39:26,634 INFO L436 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 133 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 197 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-11 19:39:26,635 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 30 states. [2024-11-11 19:39:26,638 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 30 to 30. [2024-11-11 19:39:26,640 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 30 states, 29 states have (on average 1.1379310344827587) internal successors, (33), 29 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-11 19:39:26,641 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 30 states to 30 states and 33 transitions. [2024-11-11 19:39:26,642 INFO L78 Accepts]: Start accepts. Automaton has 30 states and 33 transitions. Word has length 22 [2024-11-11 19:39:26,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-11 19:39:26,642 INFO L471 AbstractCegarLoop]: Abstraction has 30 states and 33 transitions. [2024-11-11 19:39:26,643 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 23 states have (on average 2.1739130434782608) internal successors, (50), 23 states have internal predecessors, (50), 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-11 19:39:26,644 INFO L276 IsEmpty]: Start isEmpty. Operand 30 states and 33 transitions. [2024-11-11 19:39:26,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-11 19:39:26,644 INFO L210 NwaCegarLoop]: Found error trace [2024-11-11 19:39:26,644 INFO L218 NwaCegarLoop]: trace histogram [4, 4, 4, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-11 19:39:26,663 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-11 19:39:26,845 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-11 19:39:26,845 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION === [ULTIMATE.startErr0ASSERT_VIOLATIONERROR_FUNCTION] === [2024-11-11 19:39:26,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-11 19:39:26,846 INFO L85 PathProgramCache]: Analyzing trace with hash 625081166, now seen corresponding path program 1 times [2024-11-11 19:39:26,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-11 19:39:26,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [665546605] [2024-11-11 19:39:26,846 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:39:26,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-11 19:39:26,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:39:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:39:28,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-11 19:39:28,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [665546605] [2024-11-11 19:39:28,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [665546605] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-11 19:39:28,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1116525711] [2024-11-11 19:39:28,769 INFO L97 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-11 19:39:28,769 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-11 19:39:28,771 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-11 19:39:28,773 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-11 19:39:28,802 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-11 19:39:28,961 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-11 19:39:28,964 INFO L256 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 87 conjuncts are in the unsatisfiable core [2024-11-11 19:39:28,969 INFO L279 TraceCheckSpWp]: Computing forward predicates... [2024-11-11 19:39:28,978 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-11 19:39:29,026 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-11-11 19:39:29,026 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-11 19:39:29,068 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-11 19:39:29,068 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-11 19:39:29,164 INFO L349 Elim1Store]: treesize reduction 36, result has 34.5 percent of original size [2024-11-11 19:39:29,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 22 treesize of output 33 [2024-11-11 19:39:29,269 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-11 19:39:29,274 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-11 19:39:29,365 INFO L349 Elim1Store]: treesize reduction 12, result has 52.0 percent of original size [2024-11-11 19:39:29,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 4 select indices, 4 select index equivalence classes, 3 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 3 case distinctions, treesize of input 21 treesize of output 25 [2024-11-11 19:39:29,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:39:29,422 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 42 treesize of output 31 [2024-11-11 19:39:29,427 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-11 19:39:29,434 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 43 treesize of output 19 [2024-11-11 19:39:29,443 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-11-11 19:39:29,449 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 27 treesize of output 31 [2024-11-11 19:39:29,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2024-11-11 19:39:29,523 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 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 30 [2024-11-11 19:39:29,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 2 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 42 [2024-11-11 19:39:29,543 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 67 treesize of output 23 [2024-11-11 19:39:29,548 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 20 [2024-11-11 19:39:29,552 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 18 [2024-11-11 19:39:29,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-11 19:39:29,671 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2024-11-11 19:39:29,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 15 [2024-11-11 19:39:29,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 15 [2024-11-11 19:39:29,694 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 15 treesize of output 7 [2024-11-11 19:39:29,748 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 8 proven. 15 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-11-11 19:39:29,748 INFO L312 TraceCheckSpWp]: Computing backward predicates... [2024-11-11 19:39:29,764 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_595 (Array Int Int))) (= (let ((.cse0 (+ |c_ULTIMATE.start_main_~ptr~0#1.offset| 4))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_main_~ptr~0#1.base| v_ArrVal_595) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~ptr~0#1.base|) .cse0))) |c_ULTIMATE.start_main_~data_init~0#1|)) is different from false [2024-11-11 19:39:29,774 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_595 (Array Int Int))) (= |c_ULTIMATE.start_main_~data_init~0#1| (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_#res#1.offset|))) (select (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_#res#1.base| v_ArrVal_595) (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0)) (select (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_dll_circular_create_#res#1.base|) .cse0))))) is different from false [2024-11-11 19:39:29,894 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:29,895 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 3006 treesize of output 3004 [2024-11-11 19:39:29,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:29,942 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 2 case distinctions, treesize of input 746 treesize of output 556 [2024-11-11 19:39:29,971 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:29,971 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 3456 treesize of output 3398 [2024-11-11 19:39:29,996 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 500 treesize of output 484 [2024-11-11 19:39:30,009 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 620 treesize of output 596 [2024-11-11 19:39:30,364 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 415 [2024-11-11 19:39:31,424 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse19 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse18 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse23 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse26 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse24 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse32 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_578 (store .cse18 .cse1 (select v_ArrVal_578 .cse1))))))) (.cse5 (not .cse19))) (let ((.cse21 (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse5)) (.cse22 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse38 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse37 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse37 |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 .cse37 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= v_ArrVal_578 (store (select .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))))))) (.cse25 (or .cse19 .cse32)) (.cse2 (not .cse24)) (.cse6 (not .cse26)) (.cse4 (not .cse23))) (and (or (and (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_586 Int) (v_ArrVal_585 Int) (v_ArrVal_595 (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_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_ArrVal_586) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))))) .cse2) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_586 Int) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse3 v_ArrVal_586) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select .cse3 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) .cse4 .cse5) (or .cse6 (and (or (and (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_9 Int)) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse2) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse7 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse8 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse7 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse8 |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 .cse8 v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) .cse4) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int) (v_prenex_9 Int)) (let ((.cse9 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse9 v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse9 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse5) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse10 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_prenex_9 Int) (v_arrayElimCell_44 Int)) (let ((.cse11 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse10 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse11 |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 .cse11 v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse11 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (or .cse4 (and (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse13 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (forall ((v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse12 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (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|) (= (select (select .cse12 v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse12 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= v_ArrVal_578 (store (select .cse13 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1))))))) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse15 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (let ((.cse14 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (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_ArrVal_578 (store (select .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse14 v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse6) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse2) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse17 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_578 (store .cse18 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse17 v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse19) (or .cse5 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse20 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse20 v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse20 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (or .cse6 (and .cse21 .cse22) .cse23) (or .cse24 (and .cse21 .cse22 .cse25)) (or .cse26 (and (or (and (or .cse4 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse18 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse18 .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse27 |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 .cse27 v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))))) .cse2) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse29 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse29 |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 .cse29 v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse29 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (or .cse19 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (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_ArrVal_578 (store .cse18 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse30 v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse4 .cse5 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse31 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse31 v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse31 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (and (or .cse32 .cse2) .cse25 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse34 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (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|) (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select .cse34 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) .cse23))) (or (and (or (and (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 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_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))))) .cse2) (or .cse6 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 Int)) (let ((.cse35 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (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|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse35 v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1))))))))) .cse4) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (or (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 Int)) (let ((.cse36 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse36 v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select .cse36 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))) (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1))))))) .cse5))))) is different from false [2024-11-11 19:39:33,017 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-11 19:39:33,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-11 19:39:33,075 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-11 19:39:33,118 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-11 19:39:33,155 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-11 19:39:33,170 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-11 19:39:33,188 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-11 19:39:33,204 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-11 19:39:33,217 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-11 19:39:33,238 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-11 19:39:33,373 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-11 19:39:33,505 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse17 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0)) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (let ((.cse2 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)) (.cse3 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse12 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (.cse11 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse5 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (.cse1 (not (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 0))) (.cse8 (not .cse0)) (.cse9 (not .cse17))) (and (or .cse0 .cse1 (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse2 .cse3 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595) v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse4 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_578 .cse5)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse6 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= (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|) (= (select (select .cse6 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (or .cse1 (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 Int) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse7 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse7 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse7 v_prenex_10) 0) |c_ULTIMATE.start_main_~data_init~0#1|)))) (or (and (or .cse8 (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 Int)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store v_ArrVal_578 4 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595) v_prenex_10) 0) |c_ULTIMATE.start_main_~data_init~0#1|))) (or .cse8 (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 Int)) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store v_ArrVal_578 4 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595) v_prenex_10) 0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select v_ArrVal_595 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))))) .cse9))) (or .cse0 (and (or (and (forall ((v_ArrVal_578 (Array Int Int))) (or (forall ((v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse10 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_595))) (or (= (select (select .cse10 v_prenex_12) 0) |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 (= v_ArrVal_578 (store .cse11 .cse5 (select v_ArrVal_578 .cse5)))))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse11 .cse5 (select v_ArrVal_578 .cse5)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_595) v_prenex_12) 0) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse9)) .cse12) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (forall ((v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= (select (select .cse13 v_prenex_12) 0) |c_ULTIMATE.start_main_~data_init~0#1|) (= (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|) (= (select (select .cse13 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= v_ArrVal_578 (store (select .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_578 .cse5))))))))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse15 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= (select (select .cse15 v_prenex_12) 0) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_578 (store .cse11 .cse5 (select v_ArrVal_578 .cse5)))) (= (select (select .cse15 |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 (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or .cse1 (forall ((v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse16 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store .cse2 4 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse16 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse16 v_prenex_12) 0))))) .cse9) (or .cse17 (and (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_595 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse11 .cse5 (select v_ArrVal_578 .cse5)))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_595) |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|))) .cse12) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse11 .cse5 (select v_ArrVal_578 .cse5)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595) |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 (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse18 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse18 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_578 .cse5)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse19 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse18 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select .cse19 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)) (= (select (select .cse19 |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 .cse17 .cse8 (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse20 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse20 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_578 .cse5)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse21 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse20 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= (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_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store v_ArrVal_578 .cse3 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595) v_arrayElimCell_43) v_arrayElimCell_44))) .cse1))) (or .cse8 (and (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse22 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse22 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_578 .cse5)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_prenex_9 Int) (v_arrayElimCell_44 Int)) (let ((.cse23 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse22 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (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_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse23 v_prenex_9) 0) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int) (v_prenex_9 Int)) (let ((.cse24 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store v_ArrVal_578 .cse3 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse24 v_arrayElimCell_43) v_arrayElimCell_44)) (= (select (select .cse24 v_prenex_9) 0) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse1) (or (and (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_595 (Array Int Int)) (v_prenex_9 Int)) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_595) v_prenex_9) 0) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse12) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse25 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse25 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_578 .cse5)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse26 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse25 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse26 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse26 v_prenex_9) 0) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0))))) .cse9))) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse11 .cse5 (select v_ArrVal_578 .cse5)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse3 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595) |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 (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (or (and (or (forall ((v_ArrVal_579 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (let ((.cse27 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse27 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (not (= v_ArrVal_578 (store (select .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_578 .cse5)))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse27 v_prenex_11) 0)))))) .cse8) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse29 (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse29 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_578 .cse5)))) (forall ((v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse30 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse29 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse30 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) (= (select (select .cse30 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse30 v_prenex_11) 0)))))))) (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)))) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (or (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_595) v_prenex_11) 0) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_578 (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse5 (select v_ArrVal_578 .cse5)))))) .cse12) (forall ((|v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| Int)) (or (not (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23|) 0)) (= |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse31 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_585)) |v_ULTIMATE.start_dll_circular_create_~new_head~0#1.base_23| v_ArrVal_595))) (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|)) (not (= v_ArrVal_578 (store .cse11 .cse5 (select v_ArrVal_578 .cse5)))) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse31 v_prenex_11) 0))))))) (or .cse1 (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse32 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse32 v_arrayElimCell_43) v_arrayElimCell_44)) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse32 v_prenex_11) 0))))))) .cse9) (or .cse1 (and (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_586 Int) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse33 (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse33 v_ArrVal_586) 0) |c_ULTIMATE.start_main_~data_init~0#1|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse33 v_arrayElimCell_43) v_arrayElimCell_44))))) (or (forall ((v_ArrVal_578 (Array Int Int)) (v_ArrVal_586 Int) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (= (select (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store v_ArrVal_578 4 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_595) v_ArrVal_586) 0) |c_ULTIMATE.start_main_~data_init~0#1|)) .cse8)) .cse9)))) is different from false [2024-11-11 19:39:33,868 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-11 19:39:33,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 306 treesize of output 292 [2024-11-11 19:39:33,901 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:33,902 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 188 treesize of output 196 [2024-11-11 19:39:33,913 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 182 treesize of output 176 [2024-11-11 19:39:33,931 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 176 treesize of output 168 [2024-11-11 19:39:33,953 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-11 19:39:34,134 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 22 treesize of output 20 [2024-11-11 19:39:34,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:34,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 92 treesize of output 160 [2024-11-11 19:39:34,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:39:34,927 INFO L349 Elim1Store]: treesize reduction 30, result has 65.1 percent of original size [2024-11-11 19:39:34,928 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 3 new quantified variables, introduced 4 case distinctions, treesize of input 2652 treesize of output 2659 [2024-11-11 19:39:35,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:35,007 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 1560 treesize of output 1552 [2024-11-11 19:39:35,068 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:35,069 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 2707 treesize of output 2651 [2024-11-11 19:39:35,215 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:35,215 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2527 treesize of output 2521 [2024-11-11 19:39:35,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:35,315 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2456 treesize of output 2446 [2024-11-11 19:39:36,423 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-11 19:39:36,851 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-11 19:39:36,939 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:36,939 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 85 treesize of output 89 [2024-11-11 19:39:41,069 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:41,069 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 883 treesize of output 879 [2024-11-11 19:39:42,722 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:39:42,723 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:39:42,750 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-11 19:39:42,750 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 2 case distinctions, treesize of input 15515 treesize of output 15277 [2024-11-11 19:39:42,790 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:39:42,803 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:42,804 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 339 treesize of output 329 [2024-11-11 19:39:42,848 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:42,848 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 358 treesize of output 350 [2024-11-11 19:39:42,866 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 114 treesize of output 98 [2024-11-11 19:39:42,932 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-11 19:39:43,299 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:43,299 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 133 treesize of output 131 [2024-11-11 19:39:43,420 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 19:39:43,427 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:39:43,429 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:39:43,533 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2024-11-11 19:39:43,534 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 2217 treesize of output 2222 [2024-11-11 19:39:43,612 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 1030 treesize of output 966 [2024-11-11 19:39:43,698 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:39:43,742 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:43,743 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 3 case distinctions, treesize of input 1594 treesize of output 1574 [2024-11-11 19:39:43,813 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:43,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2063 treesize of output 2017 [2024-11-11 19:39:52,003 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:39:52,020 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:39:52,021 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:39:52,149 INFO L349 Elim1Store]: treesize reduction 50, result has 51.9 percent of original size [2024-11-11 19:39:52,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 10 case distinctions, treesize of input 47929 treesize of output 47458 [2024-11-11 19:39:52,304 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:39:52,350 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:52,351 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 5 case distinctions, treesize of input 1090 treesize of output 1106 [2024-11-11 19:39:52,464 INFO L349 Elim1Store]: treesize reduction 32, result has 59.5 percent of original size [2024-11-11 19:39:52,465 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 1654 treesize of output 1665 [2024-11-11 19:39:52,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:52,540 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 1230 treesize of output 1206 [2024-11-11 19:39:52,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:52,612 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 1749 treesize of output 1677 [2024-11-11 19:39:53,237 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-11 19:39:53,743 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-11 19:39:54,051 INFO L349 Elim1Store]: treesize reduction 8, result has 72.4 percent of original size [2024-11-11 19:39:54,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 39 treesize of output 51 [2024-11-11 19:39:56,218 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:56,219 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-11 19:39:57,033 INFO L349 Elim1Store]: treesize reduction 32, result has 52.9 percent of original size [2024-11-11 19:39:57,034 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 839 treesize of output 848 [2024-11-11 19:39:57,111 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:57,112 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 36 treesize of output 46 [2024-11-11 19:39:57,404 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:57,404 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 36 treesize of output 46 [2024-11-11 19:39:58,198 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 13 [2024-11-11 19:39:58,231 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-11 19:39:58,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 992 treesize of output 978 [2024-11-11 19:39:58,251 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:58,251 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 134 treesize of output 134 [2024-11-11 19:39:58,261 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 127 treesize of output 121 [2024-11-11 19:39:58,268 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 54 treesize of output 46 [2024-11-11 19:39:58,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-11 19:39:58,542 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:58,543 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-11 19:39:58,597 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:39:58,629 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-11 19:39:58,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 997 treesize of output 983 [2024-11-11 19:39:58,662 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:58,663 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 155 treesize of output 153 [2024-11-11 19:39:58,681 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:58,682 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 137 treesize of output 137 [2024-11-11 19:39:58,694 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 54 treesize of output 46 [2024-11-11 19:39:58,930 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-11 19:39:59,029 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:59,030 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 62 treesize of output 62 [2024-11-11 19:39:59,064 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:39:59,065 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:39:59,070 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-11 19:39:59,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 32 treesize of output 1 [2024-11-11 19:39:59,076 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:39:59,076 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:39:59,112 INFO L349 Elim1Store]: treesize reduction 21, result has 62.5 percent of original size [2024-11-11 19:39:59,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 1700 treesize of output 1690 [2024-11-11 19:39:59,136 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:39:59,150 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:59,150 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 556 treesize of output 558 [2024-11-11 19:39:59,201 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2024-11-11 19:39:59,202 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 577 treesize of output 583 [2024-11-11 19:39:59,228 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 624 treesize of output 608 [2024-11-11 19:39:59,259 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 608 treesize of output 592 [2024-11-11 19:39:59,389 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:59,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 6 [2024-11-11 19:39:59,433 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:59,433 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-11 19:39:59,501 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:59,501 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-11 19:39:59,577 INFO L349 Elim1Store]: treesize reduction 32, result has 52.9 percent of original size [2024-11-11 19:39:59,578 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 2 new quantified variables, introduced 3 case distinctions, treesize of input 104 treesize of output 125 [2024-11-11 19:39:59,671 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:59,671 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 63 treesize of output 73 [2024-11-11 19:39:59,758 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:39:59,758 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 60 treesize of output 70 [2024-11-11 19:39:59,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 451 treesize of output 445 [2024-11-11 19:40:00,188 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 17 treesize of output 13 [2024-11-11 19:40:00,199 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:00,199 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:00,205 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:40:00,205 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 32 treesize of output 32 [2024-11-11 19:40:00,216 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 43 [2024-11-11 19:40:00,227 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:40:00,228 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 43 treesize of output 50 [2024-11-11 19:40:00,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:40:00,239 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 27 treesize of output 31 [2024-11-11 19:40:00,253 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-11 19:40:00,266 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 18 treesize of output 12 [2024-11-11 19:40:00,274 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 17 treesize of output 13 [2024-11-11 19:40:00,286 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:00,287 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:00,331 INFO L349 Elim1Store]: treesize reduction 21, result has 62.5 percent of original size [2024-11-11 19:40:00,332 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 6 case distinctions, treesize of input 6725 treesize of output 6607 [2024-11-11 19:40:00,411 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:40:00,411 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 2 case distinctions, treesize of input 556 treesize of output 558 [2024-11-11 19:40:00,470 INFO L349 Elim1Store]: treesize reduction 16, result has 61.9 percent of original size [2024-11-11 19:40:00,471 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 577 treesize of output 583 [2024-11-11 19:40:00,487 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 624 treesize of output 608 [2024-11-11 19:40:00,503 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 608 treesize of output 592 [2024-11-11 19:40:00,574 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-11 19:40:00,903 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:40:00,903 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-11 19:40:00,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:40:00,932 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 2 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 3 case distinctions, treesize of input 164 treesize of output 191 [2024-11-11 19:40:01,129 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:40:01,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 160 treesize of output 160 [2024-11-11 19:40:01,144 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 21 treesize of output 15 [2024-11-11 19:40:01,168 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 21 treesize of output 15 [2024-11-11 19:40:01,187 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 21 treesize of output 15 [2024-11-11 19:40:01,218 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 468 treesize of output 460 [2024-11-11 19:40:01,339 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 17 treesize of output 13 [2024-11-11 19:40:01,358 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:40:01,359 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:01,382 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-11 19:40:01,383 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 2 case distinctions, treesize of input 553 treesize of output 563 [2024-11-11 19:40:01,420 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:01,431 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:40:01,431 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 497 treesize of output 487 [2024-11-11 19:40:01,452 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:40:01,452 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 632 treesize of output 624 [2024-11-11 19:40:01,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 592 treesize of output 576 [2024-11-11 19:40:01,649 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-11 19:40:01,824 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 30 [2024-11-11 19:40:01,865 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:01,868 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:01,901 INFO L349 Elim1Store]: treesize reduction 13, result has 69.0 percent of original size [2024-11-11 19:40:01,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 113 treesize of output 131 [2024-11-11 19:40:01,917 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:40:01,918 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 146 treesize of output 144 [2024-11-11 19:40:01,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 138 treesize of output 132 [2024-11-11 19:40:02,010 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:02,014 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:02,097 INFO L349 Elim1Store]: treesize reduction 63, result has 51.5 percent of original size [2024-11-11 19:40:02,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 5 new quantified variables, introduced 11 case distinctions, treesize of input 7870 treesize of output 7774 [2024-11-11 19:40:02,227 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:02,262 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:40:02,262 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 2292 treesize of output 2274 [2024-11-11 19:40:02,390 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:40:02,390 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 2820 treesize of output 2760 [2024-11-11 19:40:02,467 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:40:02,467 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 2617 treesize of output 2545 [2024-11-11 19:40:03,622 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-11 19:40:03,815 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-11 19:40:04,083 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-11 19:40:05,355 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:40:05,355 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 148 treesize of output 150 [2024-11-11 19:40:05,693 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-11 19:40:05,971 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 98 treesize of output 94 [2024-11-11 19:40:06,476 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 98 treesize of output 94 [2024-11-11 19:40:36,162 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-11 19:40:36,163 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 148 treesize of output 1 [2024-11-11 19:40:36,563 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-11 19:40:36,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 148 treesize of output 1 [2024-11-11 19:40:37,216 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 258 treesize of output 250 [2024-11-11 19:40:37,681 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-11 19:40:37,681 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:37,706 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2024-11-11 19:40:37,706 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 995 treesize of output 997 [2024-11-11 19:40:37,727 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:37,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:40:37,734 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 453 treesize of output 443 [2024-11-11 19:40:37,750 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:40:37,751 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 472 treesize of output 464 [2024-11-11 19:40:37,762 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 436 treesize of output 420 [2024-11-11 19:40:37,811 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-11 19:40:38,004 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 26 [2024-11-11 19:40:38,025 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:38,025 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:38,027 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-11 19:40:38,033 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:38,034 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:38,089 INFO L349 Elim1Store]: treesize reduction 34, result has 58.5 percent of original size [2024-11-11 19:40:38,090 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 4 new quantified variables, introduced 7 case distinctions, treesize of input 5966 treesize of output 5891 [2024-11-11 19:40:38,231 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:40:38,231 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 3 case distinctions, treesize of input 1530 treesize of output 1510 [2024-11-11 19:40:38,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-11 19:40:38,282 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 1715 treesize of output 1669 [2024-11-11 19:40:38,312 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 1542 treesize of output 1478 [2024-11-11 19:40:40,852 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-11 19:40:40,902 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-11 19:40:40,933 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:40,939 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:40,947 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:40,957 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:40,964 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-11 19:40:42,864 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 4 proven. 7 refuted. 0 times theorem prover too weak. 1 trivial. 12 not checked. [2024-11-11 19:40:42,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1116525711] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-11 19:40:42,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-11 19:40:42,865 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 31 [2024-11-11 19:40:42,865 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1320570926] [2024-11-11 19:40:42,865 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-11 19:40:42,865 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2024-11-11 19:40:42,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-11 19:40:42,866 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2024-11-11 19:40:42,867 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=97, Invalid=612, Unknown=9, NotChecked=212, Total=930 [2024-11-11 19:40:42,867 INFO L87 Difference]: Start difference. First operand 30 states and 33 transitions. Second operand has 31 states, 31 states have (on average 1.935483870967742) internal successors, (60), 31 states have internal predecessors, (60), 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-11 19:40:47,788 WARN L873 $PredicateComparison]: unable to prove that (let ((.cse19 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 4)) (.cse6 (select |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse1 (+ 8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (let ((.cse24 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse23 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset|)) (.cse26 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (.cse32 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (or (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_578 (store .cse6 .cse1 (select v_ArrVal_578 .cse1))))))) (.cse5 (not .cse19))) (let ((.cse21 (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse5)) (.cse22 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse38 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse37 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse37 |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 .cse37 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= v_ArrVal_578 (store (select .cse38 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))))))) (.cse25 (or .cse19 .cse32)) (.cse7 (not .cse26)) (.cse4 (not .cse23)) (.cse2 (not .cse24))) (and (or (and (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_586 Int) (v_ArrVal_585 Int) (v_ArrVal_595 (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_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_ArrVal_586) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))))) .cse2) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_586 Int) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse3 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse3 v_ArrVal_586) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select .cse3 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) .cse4 .cse5) (= (select .cse6 0) 1) (or .cse7 (and (or (and (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_9 Int)) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))) .cse2) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse8 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_9 Int)) (let ((.cse9 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse9 |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 .cse9 v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))))))) .cse4) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int) (v_prenex_9 Int)) (let ((.cse10 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse10 v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse10 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse5) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse11 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_prenex_9 Int) (v_arrayElimCell_44 Int)) (let ((.cse12 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse11 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (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|) (= (select (select .cse12 v_prenex_9) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse12 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) (or .cse4 (and (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse14 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (forall ((v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse13 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (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|) (= (select (select .cse13 v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse13 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|)))) (not (= v_ArrVal_578 (store (select .cse14 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1))))))) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse16 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (let ((.cse15 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse15 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (not (= v_ArrVal_578 (store (select .cse16 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse15 v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))) .cse7) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse17 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse17 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse2) (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse18 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (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_ArrVal_578 (store .cse6 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse18 v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) .cse19) (or .cse5 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_11 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse20 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse20 v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse20 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (or .cse7 (and .cse21 .cse22) .cse23) (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.offset| 0) .cse7 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0) (= 0 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) (or .cse24 (and .cse21 .cse22 .cse25)) (= |c_ULTIMATE.start_main_~data_init~0#1| 1) .cse5 (or .cse26 (and (or (and (or .cse4 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse6 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|)))) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (or (not (= v_ArrVal_578 (store .cse6 .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse27 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse27 |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 .cse27 v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))))) .cse2) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse28 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse29 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse28 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (select (select .cse29 |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 .cse29 v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse29 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))) (or .cse19 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse30 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (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_ArrVal_578 (store .cse6 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse30 v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or .cse4 .cse5 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_prenex_12 Int) (v_ArrVal_595 (Array Int Int)) (v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (let ((.cse31 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))) (= (select (select .cse31 v_prenex_12) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_main_~data_init~0#1|) (= (select (select .cse31 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))) (or (and (or .cse32 .cse2) .cse25 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (let ((.cse33 (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579))) (or (not (= v_ArrVal_578 (store (select .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 (select v_ArrVal_578 .cse1)))) (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int))) (let ((.cse34 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store .cse33 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (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|) (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select .cse34 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))))))) .cse23))) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) 1) (or (and (or (and (or (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 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_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595) v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1)))))) .cse2) (or .cse7 (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int)) (v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 Int)) (let ((.cse35 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= (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|) (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse35 v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1))))))))) .cse4) (forall ((v_ArrVal_579 (Array Int Int)) (v_ArrVal_578 (Array Int Int))) (or (forall ((v_ArrVal_585 Int) (v_ArrVal_595 (Array Int Int)) (v_prenex_10 Int)) (let ((.cse36 (store (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (store (select (store (store |c_#memory_int#1| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_579) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_578) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) .cse0 v_ArrVal_585)) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| v_ArrVal_595))) (or (= |c_ULTIMATE.start_main_~data_init~0#1| (select (select .cse36 v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) (forall ((v_arrayElimCell_43 Int) (v_arrayElimCell_44 Int)) (= (select (select .cse36 v_arrayElimCell_43) v_arrayElimCell_44) |c_ULTIMATE.start_main_~data_init~0#1|))))) (not (= v_ArrVal_578 (store v_ArrVal_579 .cse1 (select v_ArrVal_578 .cse1))))))) .cse5) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) 1) (= (select |c_#valid| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 1) (= |c_ULTIMATE.start_dll_circular_create_~data#1| 1) (exists ((|v_ULTIMATE.start_dll_circular_create_~head~0#1.base_20| Int)) (and (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_20|)) (= (select |c_#valid| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_20|) 1) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |v_ULTIMATE.start_dll_circular_create_~head~0#1.base_20|)))) .cse2)))) is different from true