./Ultimate.py --spec /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/properties/valid-memsafety.prp --file /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version a046e57d Calling Ultimate with: /root/.sdkman/candidates/java/current/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/AutomizerMemDerefMemtrack.xml -i /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.dk.eval-mul-div-a046e57-m [2024-10-13 11:02:53,282 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-13 11:02:53,345 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-13 11:02:53,349 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-13 11:02:53,350 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-13 11:02:53,370 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-13 11:02:53,371 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-13 11:02:53,371 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-13 11:02:53,372 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-13 11:02:53,373 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-13 11:02:53,373 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-13 11:02:53,374 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-13 11:02:53,374 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-13 11:02:53,374 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-13 11:02:53,374 INFO L153 SettingsManager]: * Use SBE=true [2024-10-13 11:02:53,376 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-13 11:02:53,376 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-13 11:02:53,376 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-13 11:02:53,376 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-13 11:02:53,376 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-13 11:02:53,377 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-13 11:02:53,377 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-13 11:02:53,377 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-13 11:02:53,377 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-13 11:02:53,378 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-13 11:02:53,378 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-13 11:02:53,378 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-13 11:02:53,378 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-13 11:02:53,378 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-13 11:02:53,379 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-13 11:02:53,379 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-13 11:02:53,379 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-13 11:02:53,379 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-13 11:02:53,379 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:02:53,379 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-13 11:02:53,380 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-13 11:02:53,380 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-13 11:02:53,380 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-13 11:02:53,380 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-13 11:02:53,380 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-13 11:02:53,380 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-13 11:02:53,380 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-13 11:02:53,380 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 valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 [2024-10-13 11:02:53,567 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-13 11:02:53,585 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-13 11:02:53,587 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-13 11:02:53,588 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-13 11:02:53,588 INFO L274 PluginConnector]: CDTParser initialized [2024-10-13 11:02:53,589 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2024-10-13 11:02:54,821 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-13 11:02:54,999 INFO L384 CDTParser]: Found 1 translation units. [2024-10-13 11:02:55,000 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2024-10-13 11:02:55,011 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976b4b18c/4241d0726ae64b4784fe671d0646aba6/FLAG526e3ba59 [2024-10-13 11:02:55,385 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/976b4b18c/4241d0726ae64b4784fe671d0646aba6 [2024-10-13 11:02:55,387 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-13 11:02:55,388 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-13 11:02:55,389 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-13 11:02:55,389 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-13 11:02:55,396 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-13 11:02:55,397 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:02:55" (1/1) ... [2024-10-13 11:02:55,397 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@687bca81 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:55, skipping insertion in model container [2024-10-13 11:02:55,397 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 13.10 11:02:55" (1/1) ... [2024-10-13 11:02:55,428 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-13 11:02:55,665 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:02:55,671 INFO L200 MainTranslator]: Completed pre-run [2024-10-13 11:02:55,703 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-13 11:02:55,728 INFO L204 MainTranslator]: Completed translation [2024-10-13 11:02:55,729 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:55 WrapperNode [2024-10-13 11:02:55,729 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-13 11:02:55,729 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-13 11:02:55,730 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-13 11:02:55,730 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-13 11:02:55,736 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:55" (1/1) ... [2024-10-13 11:02:55,746 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:55" (1/1) ... [2024-10-13 11:02:55,763 INFO L138 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 133 [2024-10-13 11:02:55,763 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-13 11:02:55,764 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-13 11:02:55,764 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-13 11:02:55,764 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-13 11:02:55,772 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:55" (1/1) ... [2024-10-13 11:02:55,772 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:55" (1/1) ... [2024-10-13 11:02:55,775 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:55" (1/1) ... [2024-10-13 11:02:55,787 INFO L175 MemorySlicer]: Split 8 memory accesses to 1 slices as follows [8]. 100 percent of accesses are in the largest equivalence class. The 0 initializations are split as follows [0]. The 6 writes are split as follows [6]. [2024-10-13 11:02:55,791 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:55" (1/1) ... [2024-10-13 11:02:55,791 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:55" (1/1) ... [2024-10-13 11:02:55,799 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:55" (1/1) ... [2024-10-13 11:02:55,801 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:55" (1/1) ... [2024-10-13 11:02:55,802 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:55" (1/1) ... [2024-10-13 11:02:55,803 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:55" (1/1) ... [2024-10-13 11:02:55,805 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-13 11:02:55,805 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-13 11:02:55,805 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-13 11:02:55,806 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-13 11:02:55,810 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:55" (1/1) ... [2024-10-13 11:02:55,814 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-13 11:02:55,822 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:55,838 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-10-13 11:02:55,840 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-10-13 11:02:55,876 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-13 11:02:55,876 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-13 11:02:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-13 11:02:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-13 11:02:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-13 11:02:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-13 11:02:55,877 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-13 11:02:55,877 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-13 11:02:55,959 INFO L238 CfgBuilder]: Building ICFG [2024-10-13 11:02:55,961 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-13 11:02:55,977 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-13 11:02:56,233 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-10-13 11:02:56,233 INFO L287 CfgBuilder]: Performing block encoding [2024-10-13 11:02:56,272 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-13 11:02:56,273 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-13 11:02:56,273 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:02:56 BoogieIcfgContainer [2024-10-13 11:02:56,273 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-13 11:02:56,278 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-13 11:02:56,278 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-13 11:02:56,280 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-13 11:02:56,281 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 13.10 11:02:55" (1/3) ... [2024-10-13 11:02:56,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52257bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:02:56, skipping insertion in model container [2024-10-13 11:02:56,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 13.10 11:02:55" (2/3) ... [2024-10-13 11:02:56,282 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@52257bf and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 13.10 11:02:56, skipping insertion in model container [2024-10-13 11:02:56,282 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 13.10 11:02:56" (3/3) ... [2024-10-13 11:02:56,283 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-1.i [2024-10-13 11:02:56,296 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-13 11:02:56,296 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2024-10-13 11:02:56,331 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-13 11:02:56,336 INFO L333 AbstractCegarLoop]: Settings: SEPARATE_VIOLATION_CHECK=true, mInterprocedural=true, mMaxIterations=1000000, mWatchIteration=1000000, mArtifact=RCFG, mInterpolation=FPandBP, mInterpolantAutomaton=STRAIGHT_LINE, mDumpAutomata=false, mAutomataFormat=ATS_NUMERATE, mDumpPath=., mDeterminiation=PREDICATE_ABSTRACTION, mMinimize=MINIMIZE_SEVPA, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=None, mDumpOnlyReuseAutomata=false, mLimitTraceHistogram=0, mErrorLocTimeLimit=0, mLimitPathProgramCount=0, mCollectInterpolantStatistics=true, mHeuristicEmptinessCheck=false, mHeuristicEmptinessCheckAStarHeuristic=ZERO, mHeuristicEmptinessCheckAStarHeuristicRandomSeed=1337, mHeuristicEmptinessCheckSmtFeatureScoringMethod=DAGSIZE, mSMTFeatureExtraction=false, mSMTFeatureExtractionDumpPath=., mOverrideInterpolantAutomaton=false, mMcrInterpolantMethod=WP, mPorIndependenceSettings=[Lde.uni_freiburg.informatik.ultimate.lib.tracecheckerutils.partialorder.independence.IndependenceSettings;@4666f73f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-13 11:02:56,336 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-10-13 11:02:56,341 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 129 states have internal predecessors, (137), 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-10-13 11:02:56,346 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 11:02:56,347 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:56,347 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 11:02:56,348 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:02:56,351 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:56,352 INFO L85 PathProgramCache]: Analyzing trace with hash 218566, now seen corresponding path program 1 times [2024-10-13 11:02:56,358 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:56,359 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1767366914] [2024-10-13 11:02:56,359 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:56,361 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:56,441 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:56,523 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:56,523 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:56,523 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1767366914] [2024-10-13 11:02:56,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1767366914] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:56,524 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:56,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:02:56,526 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [573043677] [2024-10-13 11:02:56,526 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:56,530 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:02:56,531 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:56,556 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:02:56,557 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:02:56,586 INFO L87 Difference]: Start difference. First operand has 131 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 129 states have internal predecessors, (137), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:56,713 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:56,713 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2024-10-13 11:02:56,714 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:02:56,715 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-13 11:02:56,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:56,721 INFO L225 Difference]: With dead ends: 128 [2024-10-13 11:02:56,721 INFO L226 Difference]: Without dead ends: 123 [2024-10-13 11:02:56,722 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:02:56,725 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 15 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 61 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 61 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:56,725 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 191 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 61 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:56,738 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-13 11:02:56,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-13 11:02:56,750 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 64 states have (on average 2.0) internal successors, (128), 122 states have internal predecessors, (128), 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-10-13 11:02:56,751 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2024-10-13 11:02:56,753 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 3 [2024-10-13 11:02:56,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:56,753 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2024-10-13 11:02:56,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:56,755 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2024-10-13 11:02:56,755 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-13 11:02:56,755 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:56,755 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-13 11:02:56,755 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-13 11:02:56,755 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:02:56,756 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:56,757 INFO L85 PathProgramCache]: Analyzing trace with hash 218567, now seen corresponding path program 1 times [2024-10-13 11:02:56,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:56,757 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1655920034] [2024-10-13 11:02:56,757 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:56,757 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:56,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:56,866 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:56,866 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:56,867 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1655920034] [2024-10-13 11:02:56,867 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1655920034] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:56,867 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:56,868 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-13 11:02:56,868 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1971126220] [2024-10-13 11:02:56,868 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:56,869 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:02:56,869 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:56,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:02:56,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:02:56,871 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:56,911 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:56,912 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2024-10-13 11:02:56,912 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:02:56,912 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2024-10-13 11:02:56,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:56,913 INFO L225 Difference]: With dead ends: 120 [2024-10-13 11:02:56,913 INFO L226 Difference]: Without dead ends: 120 [2024-10-13 11:02:56,914 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:02:56,914 INFO L432 NwaCegarLoop]: 111 mSDtfsCounter, 13 mSDsluCounter, 104 mSDsCounter, 0 mSdLazyCounter, 19 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 13 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 22 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 19 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:56,915 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [13 Valid, 215 Invalid, 22 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 19 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:02:56,915 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-13 11:02:56,919 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-13 11:02:56,919 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 64 states have (on average 1.953125) internal successors, (125), 119 states have internal predecessors, (125), 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-10-13 11:02:56,920 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2024-10-13 11:02:56,920 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 3 [2024-10-13 11:02:56,920 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:56,920 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2024-10-13 11:02:56,920 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:56,921 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2024-10-13 11:02:56,921 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 11:02:56,921 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:56,921 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:56,921 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-13 11:02:56,921 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:02:56,922 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:56,922 INFO L85 PathProgramCache]: Analyzing trace with hash -8198272, now seen corresponding path program 1 times [2024-10-13 11:02:56,922 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:56,922 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [210155246] [2024-10-13 11:02:56,922 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:56,922 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:56,932 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:56,964 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:56,964 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:56,964 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [210155246] [2024-10-13 11:02:56,965 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [210155246] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:56,965 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:56,965 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:02:56,965 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2001802520] [2024-10-13 11:02:56,965 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:56,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:02:56,966 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:56,966 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:02:56,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:02:56,966 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-10-13 11:02:56,990 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:56,994 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2024-10-13 11:02:56,994 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:02:56,995 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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 7 [2024-10-13 11:02:56,995 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:56,995 INFO L225 Difference]: With dead ends: 128 [2024-10-13 11:02:56,996 INFO L226 Difference]: Without dead ends: 128 [2024-10-13 11:02:57,000 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:02:57,001 INFO L432 NwaCegarLoop]: 118 mSDtfsCounter, 7 mSDsluCounter, 115 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 233 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:57,001 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 233 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:02:57,002 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-13 11:02:57,008 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2024-10-13 11:02:57,008 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 65 states have (on average 1.9384615384615385) internal successors, (126), 120 states have internal predecessors, (126), 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-10-13 11:02:57,009 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2024-10-13 11:02:57,010 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 7 [2024-10-13 11:02:57,010 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:57,010 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2024-10-13 11:02:57,010 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 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-10-13 11:02:57,011 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2024-10-13 11:02:57,011 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 11:02:57,011 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:57,011 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:57,011 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-13 11:02:57,011 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:02:57,012 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:57,014 INFO L85 PathProgramCache]: Analyzing trace with hash -8196735, now seen corresponding path program 1 times [2024-10-13 11:02:57,014 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:57,014 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1634322710] [2024-10-13 11:02:57,014 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:57,014 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:57,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:57,061 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:57,062 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:57,062 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1634322710] [2024-10-13 11:02:57,062 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1634322710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:57,062 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:57,062 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:02:57,063 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1038141056] [2024-10-13 11:02:57,063 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:57,063 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:02:57,063 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:57,063 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:02:57,064 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:02:57,064 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-13 11:02:57,126 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:57,127 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2024-10-13 11:02:57,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:02:57,127 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-10-13 11:02:57,127 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:57,128 INFO L225 Difference]: With dead ends: 120 [2024-10-13 11:02:57,129 INFO L226 Difference]: Without dead ends: 120 [2024-10-13 11:02:57,129 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:02:57,130 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 3 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 53 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:57,131 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 190 Invalid, 53 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:57,131 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-13 11:02:57,134 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-13 11:02:57,134 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 65 states have (on average 1.9230769230769231) internal successors, (125), 119 states have internal predecessors, (125), 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-10-13 11:02:57,136 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2024-10-13 11:02:57,136 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 7 [2024-10-13 11:02:57,136 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:57,136 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2024-10-13 11:02:57,136 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-13 11:02:57,136 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2024-10-13 11:02:57,137 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-13 11:02:57,137 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:57,137 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:57,137 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-13 11:02:57,137 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:02:57,138 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:57,138 INFO L85 PathProgramCache]: Analyzing trace with hash -8196734, now seen corresponding path program 1 times [2024-10-13 11:02:57,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:57,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318150441] [2024-10-13 11:02:57,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:57,138 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:57,156 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:57,226 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:57,227 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:57,227 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318150441] [2024-10-13 11:02:57,228 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318150441] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:57,228 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:57,228 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:02:57,228 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1578130430] [2024-10-13 11:02:57,228 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:57,228 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:02:57,228 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:57,229 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:02:57,229 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:02:57,229 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-13 11:02:57,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:57,251 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2024-10-13 11:02:57,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:02:57,253 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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 7 [2024-10-13 11:02:57,253 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:57,253 INFO L225 Difference]: With dead ends: 119 [2024-10-13 11:02:57,253 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 11:02:57,253 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:02:57,254 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 3 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 20 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 20 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 20 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:57,254 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 221 Invalid, 20 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 20 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:02:57,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 11:02:57,260 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-13 11:02:57,263 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 65 states have (on average 1.9076923076923078) internal successors, (124), 118 states have internal predecessors, (124), 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-10-13 11:02:57,263 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2024-10-13 11:02:57,264 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 7 [2024-10-13 11:02:57,265 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:57,265 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2024-10-13 11:02:57,265 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 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-10-13 11:02:57,267 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2024-10-13 11:02:57,267 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 11:02:57,267 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:57,267 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:57,267 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-13 11:02:57,267 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:02:57,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:57,268 INFO L85 PathProgramCache]: Analyzing trace with hash -254098774, now seen corresponding path program 1 times [2024-10-13 11:02:57,268 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:57,268 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1588264833] [2024-10-13 11:02:57,268 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:57,268 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:57,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:57,365 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:57,365 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:57,365 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1588264833] [2024-10-13 11:02:57,365 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1588264833] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:57,366 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:57,366 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-13 11:02:57,366 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1309182100] [2024-10-13 11:02:57,366 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:57,367 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:02:57,367 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:57,368 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:02:57,368 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:02:57,368 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-10-13 11:02:57,473 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:57,473 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2024-10-13 11:02:57,473 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:02:57,474 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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 8 [2024-10-13 11:02:57,474 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:57,474 INFO L225 Difference]: With dead ends: 122 [2024-10-13 11:02:57,474 INFO L226 Difference]: Without dead ends: 122 [2024-10-13 11:02:57,475 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:02:57,475 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 15 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 15 SdHoareTripleChecker+Valid, 331 SdHoareTripleChecker+Invalid, 148 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:57,476 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [15 Valid, 331 Invalid, 148 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:57,476 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-13 11:02:57,479 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-13 11:02:57,479 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 68 states have (on average 1.8823529411764706) internal successors, (128), 121 states have internal predecessors, (128), 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-10-13 11:02:57,479 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2024-10-13 11:02:57,479 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 8 [2024-10-13 11:02:57,480 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:57,480 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2024-10-13 11:02:57,480 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 4 states have internal predecessors, (8), 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-10-13 11:02:57,480 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2024-10-13 11:02:57,480 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-13 11:02:57,480 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:57,480 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:57,481 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-13 11:02:57,481 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:02:57,481 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:57,481 INFO L85 PathProgramCache]: Analyzing trace with hash -254098773, now seen corresponding path program 1 times [2024-10-13 11:02:57,481 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:57,482 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [86176343] [2024-10-13 11:02:57,482 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:57,482 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:57,491 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:57,600 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:57,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:57,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [86176343] [2024-10-13 11:02:57,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [86176343] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:57,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:57,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:02:57,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [313608072] [2024-10-13 11:02:57,602 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:57,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-13 11:02:57,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:57,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-13 11:02:57,602 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:02:57,603 INFO L87 Difference]: Start difference. First operand 122 states and 128 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-10-13 11:02:57,692 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:57,692 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2024-10-13 11:02:57,692 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:02:57,692 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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 8 [2024-10-13 11:02:57,693 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:57,693 INFO L225 Difference]: With dead ends: 122 [2024-10-13 11:02:57,693 INFO L226 Difference]: Without dead ends: 122 [2024-10-13 11:02:57,693 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:02:57,694 INFO L432 NwaCegarLoop]: 108 mSDtfsCounter, 16 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 123 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 462 SdHoareTripleChecker+Invalid, 127 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 123 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:57,694 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 462 Invalid, 127 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 123 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:57,695 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-13 11:02:57,697 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-13 11:02:57,697 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 68 states have (on average 1.8676470588235294) internal successors, (127), 121 states have internal predecessors, (127), 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-10-13 11:02:57,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2024-10-13 11:02:57,698 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 8 [2024-10-13 11:02:57,698 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:57,698 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2024-10-13 11:02:57,698 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 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-10-13 11:02:57,698 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2024-10-13 11:02:57,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-13 11:02:57,698 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:57,698 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:57,699 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-13 11:02:57,699 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:02:57,699 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:57,699 INFO L85 PathProgramCache]: Analyzing trace with hash -2119614211, now seen corresponding path program 1 times [2024-10-13 11:02:57,699 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:57,699 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1780259631] [2024-10-13 11:02:57,699 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:57,700 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:57,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:57,732 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:57,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:57,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1780259631] [2024-10-13 11:02:57,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1780259631] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:57,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1531215573] [2024-10-13 11:02:57,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:57,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:57,733 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:57,734 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-10-13 11:02:57,735 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-10-13 11:02:57,793 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:57,795 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-13 11:02:57,797 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:57,841 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:57,842 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:57,863 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:57,864 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1531215573] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:57,864 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:57,864 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-10-13 11:02:57,864 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1704702502] [2024-10-13 11:02:57,864 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:57,864 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-13 11:02:57,865 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:57,865 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-13 11:02:57,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:02:57,865 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:57,881 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:57,881 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2024-10-13 11:02:57,881 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-13 11:02:57,881 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-10-13 11:02:57,882 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:57,882 INFO L225 Difference]: With dead ends: 123 [2024-10-13 11:02:57,882 INFO L226 Difference]: Without dead ends: 123 [2024-10-13 11:02:57,882 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-13 11:02:57,883 INFO L432 NwaCegarLoop]: 116 mSDtfsCounter, 5 mSDsluCounter, 222 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 338 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:57,883 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 338 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:02:57,883 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-13 11:02:57,889 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-13 11:02:57,890 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 69 states have (on average 1.855072463768116) internal successors, (128), 122 states have internal predecessors, (128), 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-10-13 11:02:57,890 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2024-10-13 11:02:57,890 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 11 [2024-10-13 11:02:57,890 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:57,890 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2024-10-13 11:02:57,890 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:57,890 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2024-10-13 11:02:57,890 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 11:02:57,890 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:57,891 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:57,903 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Ended with exit code 0 [2024-10-13 11:02:58,091 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:58,091 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:02:58,092 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:58,092 INFO L85 PathProgramCache]: Analyzing trace with hash -1283483443, now seen corresponding path program 1 times [2024-10-13 11:02:58,092 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:58,092 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [390524140] [2024-10-13 11:02:58,092 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:58,092 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:58,105 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:58,172 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:58,172 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:58,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [390524140] [2024-10-13 11:02:58,172 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [390524140] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:58,172 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1746031319] [2024-10-13 11:02:58,173 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:58,173 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:58,176 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:58,177 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-10-13 11:02:58,178 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-10-13 11:02:58,238 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:58,239 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-13 11:02:58,240 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:58,265 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-10-13 11:02:58,288 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 11:02:58,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-13 11:02:58,304 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:58,305 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:58,330 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:58,331 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1746031319] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:58,331 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:58,331 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-10-13 11:02:58,331 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1481437428] [2024-10-13 11:02:58,332 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:58,332 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:02:58,332 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:58,332 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:02:58,332 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:02:58,332 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:58,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:58,420 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2024-10-13 11:02:58,420 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-13 11:02:58,421 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 11:02:58,421 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:58,421 INFO L225 Difference]: With dead ends: 121 [2024-10-13 11:02:58,421 INFO L226 Difference]: Without dead ends: 121 [2024-10-13 11:02:58,422 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 22 SyntacticMatches, 2 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:02:58,422 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 5 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 94 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 97 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 94 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:58,422 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 258 Invalid, 97 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 94 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:58,423 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-13 11:02:58,425 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-13 11:02:58,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 69 states have (on average 1.826086956521739) internal successors, (126), 120 states have internal predecessors, (126), 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-10-13 11:02:58,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2024-10-13 11:02:58,426 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 12 [2024-10-13 11:02:58,426 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:58,426 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2024-10-13 11:02:58,426 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:58,426 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2024-10-13 11:02:58,426 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-13 11:02:58,427 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:58,427 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:58,441 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-13 11:02:58,627 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,SelfDestructingSolverStorable8 [2024-10-13 11:02:58,628 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:02:58,628 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:58,628 INFO L85 PathProgramCache]: Analyzing trace with hash -1283483442, now seen corresponding path program 1 times [2024-10-13 11:02:58,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:58,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [267729858] [2024-10-13 11:02:58,629 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:58,629 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:58,646 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:58,748 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:58,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:58,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [267729858] [2024-10-13 11:02:58,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [267729858] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:02:58,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [560482264] [2024-10-13 11:02:58,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:58,749 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:58,749 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:02:58,751 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-10-13 11:02:58,752 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-10-13 11:02:58,810 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:58,811 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-13 11:02:58,812 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:02:58,816 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-10-13 11:02:58,854 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 11:02:58,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-13 11:02:58,870 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:58,871 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:02:58,953 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:02:58,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [560482264] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:02:58,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:02:58,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 8 [2024-10-13 11:02:58,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1207121704] [2024-10-13 11:02:58,954 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:02:58,954 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-13 11:02:58,954 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:58,954 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-13 11:02:58,954 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:02:58,955 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:58,998 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:58,998 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2024-10-13 11:02:58,998 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:02:58,999 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2024-10-13 11:02:58,999 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:58,999 INFO L225 Difference]: With dead ends: 119 [2024-10-13 11:02:58,999 INFO L226 Difference]: Without dead ends: 119 [2024-10-13 11:02:58,999 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 28 GetRequests, 19 SyntacticMatches, 1 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 11 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=33, Invalid=57, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:02:59,000 INFO L432 NwaCegarLoop]: 109 mSDtfsCounter, 11 mSDsluCounter, 211 mSDsCounter, 0 mSdLazyCounter, 36 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 11 SdHoareTripleChecker+Valid, 320 SdHoareTripleChecker+Invalid, 40 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 36 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:59,000 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [11 Valid, 320 Invalid, 40 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 36 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:02:59,000 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-13 11:02:59,001 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-13 11:02:59,001 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 118 states have internal predecessors, (124), 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-10-13 11:02:59,001 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2024-10-13 11:02:59,002 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 12 [2024-10-13 11:02:59,002 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:59,002 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2024-10-13 11:02:59,002 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:59,002 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2024-10-13 11:02:59,002 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 11:02:59,002 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:59,002 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:59,016 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-13 11:02:59,203 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:02:59,203 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:02:59,204 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:59,204 INFO L85 PathProgramCache]: Analyzing trace with hash 1303772338, now seen corresponding path program 1 times [2024-10-13 11:02:59,204 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:59,204 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1514388583] [2024-10-13 11:02:59,204 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:59,204 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:59,220 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:59,250 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2024-10-13 11:02:59,250 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:59,250 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1514388583] [2024-10-13 11:02:59,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1514388583] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:59,251 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:59,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-13 11:02:59,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [796461418] [2024-10-13 11:02:59,251 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:59,251 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-13 11:02:59,251 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:59,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-13 11:02:59,252 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:02:59,252 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:59,301 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:59,301 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2024-10-13 11:02:59,301 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-13 11:02:59,301 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-13 11:02:59,301 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:59,302 INFO L225 Difference]: With dead ends: 116 [2024-10-13 11:02:59,302 INFO L226 Difference]: Without dead ends: 116 [2024-10-13 11:02:59,302 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 2 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-13 11:02:59,302 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 19 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 64 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 62 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:59,303 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 150 Invalid, 64 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 62 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-10-13 11:02:59,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-13 11:02:59,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-13 11:02:59,304 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 115 states have internal predecessors, (121), 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-10-13 11:02:59,304 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2024-10-13 11:02:59,304 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 16 [2024-10-13 11:02:59,304 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:59,304 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2024-10-13 11:02:59,304 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:59,304 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2024-10-13 11:02:59,305 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-13 11:02:59,305 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:59,305 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:59,305 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-13 11:02:59,305 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:02:59,306 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:59,306 INFO L85 PathProgramCache]: Analyzing trace with hash 1303772339, now seen corresponding path program 1 times [2024-10-13 11:02:59,306 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:59,306 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1257548980] [2024-10-13 11:02:59,306 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:59,307 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:59,317 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:59,395 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:02:59,395 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:59,395 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1257548980] [2024-10-13 11:02:59,395 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1257548980] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:59,395 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:59,396 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:02:59,396 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [727604485] [2024-10-13 11:02:59,396 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:59,396 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:02:59,396 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:59,396 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:02:59,396 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:02:59,397 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-10-13 11:02:59,465 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:59,465 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2024-10-13 11:02:59,465 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:02:59,466 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-10-13 11:02:59,466 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:59,466 INFO L225 Difference]: With dead ends: 109 [2024-10-13 11:02:59,466 INFO L226 Difference]: Without dead ends: 109 [2024-10-13 11:02:59,466 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:02:59,467 INFO L432 NwaCegarLoop]: 95 mSDtfsCounter, 36 mSDsluCounter, 226 mSDsCounter, 0 mSdLazyCounter, 83 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 36 SdHoareTripleChecker+Valid, 321 SdHoareTripleChecker+Invalid, 90 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 83 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:59,467 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [36 Valid, 321 Invalid, 90 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 83 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:59,467 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-13 11:02:59,468 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-13 11:02:59,468 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 69 states have (on average 1.6521739130434783) internal successors, (114), 108 states have internal predecessors, (114), 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-10-13 11:02:59,469 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2024-10-13 11:02:59,469 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 16 [2024-10-13 11:02:59,469 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:59,469 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2024-10-13 11:02:59,469 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 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-10-13 11:02:59,469 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2024-10-13 11:02:59,469 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 11:02:59,469 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:59,470 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:59,470 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-13 11:02:59,470 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:02:59,470 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:59,470 INFO L85 PathProgramCache]: Analyzing trace with hash 1546954811, now seen corresponding path program 1 times [2024-10-13 11:02:59,470 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:59,470 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512061840] [2024-10-13 11:02:59,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:59,470 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:59,496 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:59,552 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:02:59,552 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:59,552 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512061840] [2024-10-13 11:02:59,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512061840] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:59,552 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:59,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-13 11:02:59,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2069851534] [2024-10-13 11:02:59,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:59,554 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-13 11:02:59,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:59,554 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-13 11:02:59,554 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-13 11:02:59,555 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-10-13 11:02:59,645 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:59,645 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2024-10-13 11:02:59,645 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-13 11:02:59,646 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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 20 [2024-10-13 11:02:59,646 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:59,646 INFO L225 Difference]: With dead ends: 104 [2024-10-13 11:02:59,646 INFO L226 Difference]: Without dead ends: 104 [2024-10-13 11:02:59,646 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-13 11:02:59,647 INFO L432 NwaCegarLoop]: 73 mSDtfsCounter, 43 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 152 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 156 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 152 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:59,647 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 222 Invalid, 156 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 152 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:59,647 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-13 11:02:59,648 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-13 11:02:59,648 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.5797101449275361) internal successors, (109), 103 states have internal predecessors, (109), 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-10-13 11:02:59,648 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2024-10-13 11:02:59,648 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 20 [2024-10-13 11:02:59,648 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:59,649 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2024-10-13 11:02:59,649 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 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-10-13 11:02:59,649 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2024-10-13 11:02:59,649 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 11:02:59,649 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:59,649 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:59,649 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-13 11:02:59,649 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:02:59,650 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:59,650 INFO L85 PathProgramCache]: Analyzing trace with hash 1546993793, now seen corresponding path program 1 times [2024-10-13 11:02:59,650 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:59,650 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [802982150] [2024-10-13 11:02:59,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:59,650 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:59,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:02:59,811 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:02:59,811 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:02:59,811 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [802982150] [2024-10-13 11:02:59,811 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [802982150] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:02:59,811 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:02:59,812 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 11:02:59,812 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [434223537] [2024-10-13 11:02:59,812 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:02:59,812 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:02:59,812 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:02:59,813 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:02:59,813 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:02:59,813 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-10-13 11:02:59,894 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:02:59,894 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2024-10-13 11:02:59,895 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 11:02:59,895 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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 20 [2024-10-13 11:02:59,895 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:02:59,895 INFO L225 Difference]: With dead ends: 99 [2024-10-13 11:02:59,895 INFO L226 Difference]: Without dead ends: 99 [2024-10-13 11:02:59,895 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:02:59,896 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 60 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 318 SdHoareTripleChecker+Invalid, 110 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 105 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:02:59,896 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 318 Invalid, 110 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 105 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:02:59,896 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-13 11:02:59,897 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-13 11:02:59,897 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 98 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:02:59,898 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2024-10-13 11:02:59,898 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 20 [2024-10-13 11:02:59,898 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:02:59,898 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2024-10-13 11:02:59,898 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 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-10-13 11:02:59,898 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2024-10-13 11:02:59,898 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-13 11:02:59,898 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:02:59,898 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:02:59,898 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-13 11:02:59,898 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:02:59,899 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:02:59,899 INFO L85 PathProgramCache]: Analyzing trace with hash 1546992577, now seen corresponding path program 1 times [2024-10-13 11:02:59,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:02:59,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1225738741] [2024-10-13 11:02:59,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:02:59,900 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:02:59,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:00,166 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:00,167 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:00,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1225738741] [2024-10-13 11:03:00,167 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1225738741] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:00,167 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1120350164] [2024-10-13 11:03:00,167 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:00,167 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:00,167 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:00,169 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:00,169 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-13 11:03:00,243 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:00,244 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-13 11:03:00,246 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:00,252 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-10-13 11:03:00,284 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-13 11:03:00,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-10-13 11:03:00,307 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:03:00,331 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 11:03:00,344 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-10-13 11:03:00,352 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-10-13 11:03:00,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2024-10-13 11:03:00,373 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 10 treesize of output 4 [2024-10-13 11:03:00,380 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:00,380 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:00,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:00,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-10-13 11:03:00,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2024-10-13 11:03:00,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 21 [2024-10-13 11:03:00,468 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-10-13 11:03:00,574 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 11:03:00,575 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 25 treesize of output 24 [2024-10-13 11:03:00,582 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:00,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1120350164] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:00,582 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:00,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 18 [2024-10-13 11:03:00,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [354512125] [2024-10-13 11:03:00,583 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:00,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-13 11:03:00,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:00,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-13 11:03:00,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=281, Unknown=14, NotChecked=0, Total=342 [2024-10-13 11:03:00,584 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:00,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:00,945 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2024-10-13 11:03:00,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-13 11:03:00,945 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2024-10-13 11:03:00,945 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:00,946 INFO L225 Difference]: With dead ends: 97 [2024-10-13 11:03:00,946 INFO L226 Difference]: Without dead ends: 97 [2024-10-13 11:03:00,946 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=100, Invalid=486, Unknown=14, NotChecked=0, Total=600 [2024-10-13 11:03:00,947 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 69 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 69 SdHoareTripleChecker+Valid, 781 SdHoareTripleChecker+Invalid, 428 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 415 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:00,947 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [69 Valid, 781 Invalid, 428 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 415 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:03:00,947 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-13 11:03:00,948 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2024-10-13 11:03:00,948 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 69 states have (on average 1.434782608695652) internal successors, (99), 93 states have internal predecessors, (99), 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-10-13 11:03:00,948 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2024-10-13 11:03:00,948 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 20 [2024-10-13 11:03:00,949 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:00,949 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2024-10-13 11:03:00,949 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 18 states have (on average 2.1666666666666665) internal successors, (39), 19 states have internal predecessors, (39), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:00,949 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2024-10-13 11:03:00,949 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 11:03:00,949 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:00,949 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:00,963 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-10-13 11:03:01,153 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-13 11:03:01,154 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:03:01,154 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:01,154 INFO L85 PathProgramCache]: Analyzing trace with hash 712167507, now seen corresponding path program 1 times [2024-10-13 11:03:01,154 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:01,154 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [340916784] [2024-10-13 11:03:01,154 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:01,154 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:01,170 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:03:01,324 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:01,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [340916784] [2024-10-13 11:03:01,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [340916784] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:03:01,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:03:01,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-13 11:03:01,325 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [411663296] [2024-10-13 11:03:01,325 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:03:01,325 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-13 11:03:01,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:01,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-13 11:03:01,326 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-13 11:03:01,326 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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-10-13 11:03:01,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:01,454 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-10-13 11:03:01,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 11:03:01,455 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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) Word has length 21 [2024-10-13 11:03:01,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:01,455 INFO L225 Difference]: With dead ends: 89 [2024-10-13 11:03:01,455 INFO L226 Difference]: Without dead ends: 89 [2024-10-13 11:03:01,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2024-10-13 11:03:01,456 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 63 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 208 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 240 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:01,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 208 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 240 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:03:01,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-13 11:03:01,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-13 11:03:01,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 88 states have internal predecessors, (94), 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-10-13 11:03:01,457 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2024-10-13 11:03:01,457 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 21 [2024-10-13 11:03:01,457 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:01,457 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2024-10-13 11:03:01,457 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 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-10-13 11:03:01,458 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2024-10-13 11:03:01,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-13 11:03:01,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:01,458 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:01,458 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-13 11:03:01,458 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:03:01,458 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:01,459 INFO L85 PathProgramCache]: Analyzing trace with hash 712129773, now seen corresponding path program 1 times [2024-10-13 11:03:01,459 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:01,459 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1422283828] [2024-10-13 11:03:01,459 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:01,459 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:01,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:01,722 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:01,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1422283828] [2024-10-13 11:03:01,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1422283828] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:01,722 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [6770224] [2024-10-13 11:03:01,723 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:01,723 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:01,723 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:01,724 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:01,725 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-13 11:03:01,796 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:01,797 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-13 11:03:01,799 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:01,802 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-10-13 11:03:01,825 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 11:03:01,826 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-13 11:03:01,872 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-13 11:03:01,873 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-10-13 11:03:01,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 11:03:01,917 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-10-13 11:03:01,970 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 44 treesize of output 35 [2024-10-13 11:03:01,993 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 51 treesize of output 31 [2024-10-13 11:03:02,040 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:02,041 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 51 treesize of output 31 [2024-10-13 11:03:02,048 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:02,049 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:06,120 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_584 (Array Int Int)) (v_ArrVal_585 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_584) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_585) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2024-10-13 11:03:06,136 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:06,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-10-13 11:03:06,138 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 121 treesize of output 109 [2024-10-13 11:03:06,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 25 [2024-10-13 11:03:06,176 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 20 [2024-10-13 11:03:06,309 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-13 11:03:06,309 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [6770224] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:06,309 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:06,309 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 22 [2024-10-13 11:03:06,310 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [623211580] [2024-10-13 11:03:06,310 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:06,310 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 11:03:06,310 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:06,310 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 11:03:06,310 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=394, Unknown=7, NotChecked=40, Total=506 [2024-10-13 11:03:06,311 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 23 states, 22 states have (on average 2.272727272727273) 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-10-13 11:03:06,734 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:06,734 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-10-13 11:03:06,734 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-13 11:03:06,735 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.272727272727273) 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 21 [2024-10-13 11:03:06,735 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:06,735 INFO L225 Difference]: With dead ends: 87 [2024-10-13 11:03:06,735 INFO L226 Difference]: Without dead ends: 87 [2024-10-13 11:03:06,735 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 4.4s TimeCoverageRelationStatistics Valid=154, Invalid=713, Unknown=7, NotChecked=56, Total=930 [2024-10-13 11:03:06,736 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 68 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 68 SdHoareTripleChecker+Valid, 401 SdHoareTripleChecker+Invalid, 682 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 597 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 76 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:06,736 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [68 Valid, 401 Invalid, 682 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 597 Invalid, 0 Unknown, 76 Unchecked, 0.3s Time] [2024-10-13 11:03:06,736 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-13 11:03:06,737 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-10-13 11:03:06,737 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.289855072463768) internal successors, (89), 83 states have internal predecessors, (89), 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-10-13 11:03:06,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-10-13 11:03:06,737 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 21 [2024-10-13 11:03:06,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:06,737 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-10-13 11:03:06,738 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.272727272727273) 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-10-13 11:03:06,738 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-10-13 11:03:06,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 11:03:06,738 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:06,738 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:06,751 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-13 11:03:06,942 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-13 11:03:06,943 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:03:06,943 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:06,943 INFO L85 PathProgramCache]: Analyzing trace with hash 602356419, now seen corresponding path program 1 times [2024-10-13 11:03:06,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:06,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2047898892] [2024-10-13 11:03:06,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:06,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:06,964 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:07,090 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:03:07,091 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:07,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2047898892] [2024-10-13 11:03:07,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2047898892] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-13 11:03:07,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-13 11:03:07,091 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-13 11:03:07,091 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2142670201] [2024-10-13 11:03:07,091 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-13 11:03:07,092 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-13 11:03:07,092 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:07,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-13 11:03:07,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-13 11:03:07,093 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-10-13 11:03:07,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:07,206 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2024-10-13 11:03:07,206 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-13 11:03:07,207 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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) Word has length 22 [2024-10-13 11:03:07,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:07,207 INFO L225 Difference]: With dead ends: 83 [2024-10-13 11:03:07,207 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 11:03:07,208 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2024-10-13 11:03:07,208 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 24 mSDsluCounter, 243 mSDsCounter, 0 mSdLazyCounter, 145 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 308 SdHoareTripleChecker+Invalid, 149 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 145 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:07,208 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 308 Invalid, 149 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 145 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-10-13 11:03:07,209 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 11:03:07,211 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-13 11:03:07,212 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 82 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:07,212 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2024-10-13 11:03:07,212 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 22 [2024-10-13 11:03:07,212 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:07,212 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2024-10-13 11:03:07,212 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 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-10-13 11:03:07,212 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2024-10-13 11:03:07,213 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-13 11:03:07,213 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:07,213 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:07,213 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-13 11:03:07,213 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:03:07,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:07,213 INFO L85 PathProgramCache]: Analyzing trace with hash 601186627, now seen corresponding path program 1 times [2024-10-13 11:03:07,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:07,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [940227170] [2024-10-13 11:03:07,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:07,214 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:07,228 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:07,414 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:07,414 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:07,414 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [940227170] [2024-10-13 11:03:07,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [940227170] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:07,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [312677882] [2024-10-13 11:03:07,415 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:07,415 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:07,415 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:07,416 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:07,417 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-13 11:03:07,497 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:07,498 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-13 11:03:07,501 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:07,503 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-10-13 11:03:07,525 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 11:03:07,525 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-13 11:03:07,563 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-13 11:03:07,563 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-10-13 11:03:07,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:03:07,618 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:03:07,618 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-13 11:03:07,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-10-13 11:03:07,653 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 37 treesize of output 17 [2024-10-13 11:03:07,683 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:07,684 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 35 treesize of output 17 [2024-10-13 11:03:07,691 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:07,691 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:07,708 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_706 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_706) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1)) is different from false [2024-10-13 11:03:07,718 INFO L349 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2024-10-13 11:03:07,719 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 22 treesize of output 21 [2024-10-13 11:03:11,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:11,754 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-10-13 11:03:11,756 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2024-10-13 11:03:11,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 24 treesize of output 20 [2024-10-13 11:03:11,764 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-10-13 11:03:11,831 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-13 11:03:11,831 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [312677882] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:11,831 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:11,831 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 21 [2024-10-13 11:03:11,831 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1363086047] [2024-10-13 11:03:11,831 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:11,831 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-13 11:03:11,831 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:11,832 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-13 11:03:11,832 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=352, Unknown=10, NotChecked=38, Total=462 [2024-10-13 11:03:11,832 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 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-10-13 11:03:12,158 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:12,158 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2024-10-13 11:03:12,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 11:03:12,158 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 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-10-13 11:03:12,159 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:12,159 INFO L225 Difference]: With dead ends: 82 [2024-10-13 11:03:12,159 INFO L226 Difference]: Without dead ends: 82 [2024-10-13 11:03:12,159 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 125 ImplicationChecksByTransitivity, 4.3s TimeCoverageRelationStatistics Valid=145, Invalid=605, Unknown=10, NotChecked=52, Total=812 [2024-10-13 11:03:12,160 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 40 mSDsluCounter, 721 mSDsCounter, 0 mSdLazyCounter, 511 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 786 SdHoareTripleChecker+Invalid, 572 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 511 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 52 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:12,160 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 786 Invalid, 572 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 511 Invalid, 0 Unknown, 52 Unchecked, 0.2s Time] [2024-10-13 11:03:12,160 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-13 11:03:12,164 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-13 11:03:12,164 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:12,164 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2024-10-13 11:03:12,165 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 22 [2024-10-13 11:03:12,165 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:12,165 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2024-10-13 11:03:12,165 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.4761904761904763) internal successors, (52), 22 states have internal predecessors, (52), 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-10-13 11:03:12,165 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2024-10-13 11:03:12,165 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 11:03:12,165 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:12,165 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:12,180 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-13 11:03:12,365 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:12,366 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:03:12,366 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:12,366 INFO L85 PathProgramCache]: Analyzing trace with hash 1023811472, now seen corresponding path program 1 times [2024-10-13 11:03:12,367 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:12,367 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [226890129] [2024-10-13 11:03:12,367 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:12,367 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:12,390 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:12,607 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:12,607 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:12,607 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [226890129] [2024-10-13 11:03:12,608 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [226890129] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:12,608 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1522614447] [2024-10-13 11:03:12,608 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:12,608 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:12,608 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:12,609 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:12,610 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-13 11:03:12,690 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:12,691 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 11:03:12,693 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:12,695 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-10-13 11:03:12,711 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 11:03:12,712 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-13 11:03:12,731 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:03:12,731 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-10-13 11:03:12,779 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 11:03:12,819 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:12,819 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 27 treesize of output 21 [2024-10-13 11:03:12,900 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-13 11:03:12,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 13 [2024-10-13 11:03:12,904 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:03:12,904 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:12,966 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 13 treesize of output 11 [2024-10-13 11:03:12,970 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-10-13 11:03:12,975 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-10-13 11:03:13,025 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:03:13,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1522614447] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:13,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:13,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-10-13 11:03:13,025 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1016937352] [2024-10-13 11:03:13,025 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:13,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-13 11:03:13,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:13,026 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-13 11:03:13,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-10-13 11:03:13,026 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 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-10-13 11:03:13,321 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:13,321 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2024-10-13 11:03:13,321 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-13 11:03:13,322 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 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 25 [2024-10-13 11:03:13,322 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:13,322 INFO L225 Difference]: With dead ends: 81 [2024-10-13 11:03:13,322 INFO L226 Difference]: Without dead ends: 81 [2024-10-13 11:03:13,323 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2024-10-13 11:03:13,323 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 50 mSDsluCounter, 474 mSDsCounter, 0 mSdLazyCounter, 517 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 50 SdHoareTripleChecker+Valid, 533 SdHoareTripleChecker+Invalid, 520 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 517 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:13,323 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [50 Valid, 533 Invalid, 520 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 517 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:03:13,324 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-13 11:03:13,324 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-13 11:03:13,325 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 80 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:13,325 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2024-10-13 11:03:13,325 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 25 [2024-10-13 11:03:13,325 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:13,325 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2024-10-13 11:03:13,325 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.85) internal successors, (57), 20 states have internal predecessors, (57), 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-10-13 11:03:13,325 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2024-10-13 11:03:13,326 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-13 11:03:13,326 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:13,326 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:13,339 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-10-13 11:03:13,529 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:13,530 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:03:13,530 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:13,530 INFO L85 PathProgramCache]: Analyzing trace with hash 1023380496, now seen corresponding path program 1 times [2024-10-13 11:03:13,530 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:13,530 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [106684308] [2024-10-13 11:03:13,530 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:13,530 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:13,552 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:13,823 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:13,824 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:13,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [106684308] [2024-10-13 11:03:13,824 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [106684308] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:13,824 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [602409126] [2024-10-13 11:03:13,824 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:13,824 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:13,824 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:13,826 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:13,827 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-13 11:03:13,912 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:13,918 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-13 11:03:13,920 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:13,925 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-10-13 11:03:13,946 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-13 11:03:13,946 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-10-13 11:03:13,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:03:13,970 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:03:13,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-13 11:03:13,997 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-10-13 11:03:14,010 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 33 treesize of output 17 [2024-10-13 11:03:14,042 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:14,042 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 33 treesize of output 33 [2024-10-13 11:03:14,117 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:03:14,121 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:14,121 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:14,205 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_872 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_872) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_872 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_872) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) 1)))) is different from false [2024-10-13 11:03:14,219 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:14,219 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 47 treesize of output 51 [2024-10-13 11:03:14,270 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:14,271 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 27 treesize of output 28 [2024-10-13 11:03:14,273 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 85 treesize of output 81 [2024-10-13 11:03:14,276 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 100 treesize of output 96 [2024-10-13 11:03:14,283 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:14,283 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 94 treesize of output 98 [2024-10-13 11:03:14,288 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 85 treesize of output 83 [2024-10-13 11:03:14,314 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:14,314 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 26 treesize of output 27 [2024-10-13 11:03:14,317 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:03:14,318 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 40 treesize of output 36 [2024-10-13 11:03:14,327 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 11:03:14,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-13 11:03:14,335 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:14,417 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 11:03:14,417 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 25 treesize of output 24 [2024-10-13 11:03:14,424 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-10-13 11:03:14,424 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [602409126] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:14,424 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:14,424 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 22 [2024-10-13 11:03:14,424 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870499870] [2024-10-13 11:03:14,424 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:14,424 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 11:03:14,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:14,425 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 11:03:14,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=58, Invalid=402, Unknown=6, NotChecked=40, Total=506 [2024-10-13 11:03:14,425 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 23 states have internal predecessors, (51), 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-10-13 11:03:14,875 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:14,876 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2024-10-13 11:03:14,876 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 11:03:14,876 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 23 states have internal predecessors, (51), 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 25 [2024-10-13 11:03:14,876 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:14,877 INFO L225 Difference]: With dead ends: 83 [2024-10-13 11:03:14,877 INFO L226 Difference]: Without dead ends: 83 [2024-10-13 11:03:14,878 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 172 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=182, Invalid=938, Unknown=6, NotChecked=64, Total=1190 [2024-10-13 11:03:14,878 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 67 mSDsluCounter, 591 mSDsCounter, 0 mSdLazyCounter, 525 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 652 SdHoareTripleChecker+Invalid, 602 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 525 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 59 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:14,878 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 652 Invalid, 602 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 525 Invalid, 0 Unknown, 59 Unchecked, 0.2s Time] [2024-10-13 11:03:14,879 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-13 11:03:14,879 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2024-10-13 11:03:14,880 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 79 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:14,880 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2024-10-13 11:03:14,880 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 25 [2024-10-13 11:03:14,880 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:14,883 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2024-10-13 11:03:14,883 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.3181818181818183) internal successors, (51), 23 states have internal predecessors, (51), 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-10-13 11:03:14,883 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2024-10-13 11:03:14,884 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 11:03:14,884 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:14,884 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:14,896 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-10-13 11:03:15,084 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-13 11:03:15,085 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:03:15,085 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:15,085 INFO L85 PathProgramCache]: Analyzing trace with hash 349414151, now seen corresponding path program 1 times [2024-10-13 11:03:15,085 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:15,085 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [811943265] [2024-10-13 11:03:15,085 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:15,085 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:15,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:15,456 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:15,456 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:15,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [811943265] [2024-10-13 11:03:15,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [811943265] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:15,456 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1771341629] [2024-10-13 11:03:15,457 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:15,457 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:15,457 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:15,458 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:15,459 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-13 11:03:15,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:15,545 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-13 11:03:15,547 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:15,549 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-10-13 11:03:15,585 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-13 11:03:15,586 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-10-13 11:03:15,641 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-13 11:03:15,642 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-13 11:03:15,663 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:03:15,692 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:03:15,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2024-10-13 11:03:15,720 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 34 treesize of output 25 [2024-10-13 11:03:15,731 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 51 treesize of output 27 [2024-10-13 11:03:15,787 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:15,787 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 24 [2024-10-13 11:03:15,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:03:15,807 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:15,807 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:15,896 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_959 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_959) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_959 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_959) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)) 1))) is different from false [2024-10-13 11:03:15,912 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:15,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 41 [2024-10-13 11:03:15,923 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_prenex_3 (Array Int Int)) (v_prenex_4 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_3) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_959 (Array Int Int)) (v_ArrVal_958 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_958) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_959) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|)))) is different from false [2024-10-13 11:03:15,927 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:15,928 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-10-13 11:03:15,930 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2024-10-13 11:03:15,933 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 15 treesize of output 13 [2024-10-13 11:03:15,937 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-10-13 11:03:15,941 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:15,941 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 22 treesize of output 23 [2024-10-13 11:03:15,943 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:03:15,943 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:03:15,944 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 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 17 treesize of output 9 [2024-10-13 11:03:16,145 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-13 11:03:16,145 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1771341629] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:16,145 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:16,145 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 32 [2024-10-13 11:03:16,146 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [254226748] [2024-10-13 11:03:16,146 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:16,146 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-13 11:03:16,146 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:16,146 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-13 11:03:16,147 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=875, Unknown=2, NotChecked=122, Total=1122 [2024-10-13 11:03:16,147 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 34 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 33 states have internal predecessors, (59), 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-10-13 11:03:16,632 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:16,634 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2024-10-13 11:03:16,634 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 11:03:16,634 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 33 states have internal predecessors, (59), 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 26 [2024-10-13 11:03:16,634 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:16,635 INFO L225 Difference]: With dead ends: 82 [2024-10-13 11:03:16,635 INFO L226 Difference]: Without dead ends: 82 [2024-10-13 11:03:16,635 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=246, Invalid=1482, Unknown=2, NotChecked=162, Total=1892 [2024-10-13 11:03:16,635 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 100 mSDsluCounter, 557 mSDsCounter, 0 mSdLazyCounter, 565 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 100 SdHoareTripleChecker+Valid, 613 SdHoareTripleChecker+Invalid, 684 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 565 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:16,636 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [100 Valid, 613 Invalid, 684 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 565 Invalid, 0 Unknown, 100 Unchecked, 0.3s Time] [2024-10-13 11:03:16,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-13 11:03:16,637 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-10-13 11:03:16,637 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:16,637 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2024-10-13 11:03:16,637 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2024-10-13 11:03:16,640 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:16,640 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2024-10-13 11:03:16,640 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.7878787878787878) internal successors, (59), 33 states have internal predecessors, (59), 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-10-13 11:03:16,640 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2024-10-13 11:03:16,641 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 11:03:16,641 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:16,641 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:16,655 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-10-13 11:03:16,845 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:16,846 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:03:16,846 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:16,846 INFO L85 PathProgramCache]: Analyzing trace with hash 348983175, now seen corresponding path program 1 times [2024-10-13 11:03:16,846 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:16,846 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846304613] [2024-10-13 11:03:16,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:16,846 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:16,862 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:17,117 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:17,117 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:17,117 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846304613] [2024-10-13 11:03:17,118 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846304613] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:17,118 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [59472836] [2024-10-13 11:03:17,118 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:17,119 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:17,119 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:17,120 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:17,123 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-13 11:03:17,216 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:17,217 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-13 11:03:17,219 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:17,221 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-10-13 11:03:17,247 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-13 11:03:17,248 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-10-13 11:03:17,259 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-13 11:03:17,259 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-10-13 11:03:17,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2024-10-13 11:03:17,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:17,312 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 18 treesize of output 16 [2024-10-13 11:03:17,383 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-13 11:03:17,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-13 11:03:17,411 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:03:17,411 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:17,483 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 32 treesize of output 28 [2024-10-13 11:03:17,487 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 13 treesize of output 11 [2024-10-13 11:03:17,488 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 18 [2024-10-13 11:03:17,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2024-10-13 11:03:17,539 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [59472836] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:17,539 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:17,539 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2024-10-13 11:03:17,539 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [386240692] [2024-10-13 11:03:17,539 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:17,539 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-13 11:03:17,539 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:17,540 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-13 11:03:17,540 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2024-10-13 11:03:17,540 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:17,846 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:17,846 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-10-13 11:03:17,847 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-13 11:03:17,847 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2024-10-13 11:03:17,847 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:17,847 INFO L225 Difference]: With dead ends: 78 [2024-10-13 11:03:17,847 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 11:03:17,848 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2024-10-13 11:03:17,848 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 72 mSDsluCounter, 420 mSDsCounter, 0 mSdLazyCounter, 510 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 72 SdHoareTripleChecker+Valid, 467 SdHoareTripleChecker+Invalid, 519 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 510 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:17,848 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [72 Valid, 467 Invalid, 519 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 510 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-13 11:03:17,848 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 11:03:17,849 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-13 11:03:17,849 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 77 states have internal predecessors, (83), 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-10-13 11:03:17,849 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-10-13 11:03:17,849 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 26 [2024-10-13 11:03:17,849 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:17,850 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-10-13 11:03:17,850 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:17,850 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-10-13 11:03:17,850 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 11:03:17,850 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:17,850 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:17,862 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-13 11:03:18,054 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-13 11:03:18,055 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:03:18,055 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:18,055 INFO L85 PathProgramCache]: Analyzing trace with hash -1942441977, now seen corresponding path program 1 times [2024-10-13 11:03:18,055 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:18,055 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [889213312] [2024-10-13 11:03:18,055 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:18,055 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:18,079 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:18,412 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:18,412 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:18,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [889213312] [2024-10-13 11:03:18,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [889213312] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:18,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2057218961] [2024-10-13 11:03:18,413 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:18,413 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:18,413 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:18,414 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:18,415 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-13 11:03:18,495 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:18,496 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-13 11:03:18,497 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:18,499 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-10-13 11:03:18,528 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-13 11:03:18,528 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-10-13 11:03:18,574 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-13 11:03:18,574 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-13 11:03:18,603 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:03:18,626 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:03:18,626 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-10-13 11:03:18,650 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 25 treesize of output 18 [2024-10-13 11:03:18,680 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 42 treesize of output 22 [2024-10-13 11:03:18,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:18,731 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 60 treesize of output 24 [2024-10-13 11:03:18,746 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:03:18,750 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:18,750 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:18,840 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-10-13 11:03:18,844 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1129) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) is different from false [2024-10-13 11:03:18,850 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1128 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1128) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1129) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) is different from false [2024-10-13 11:03:18,860 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:18,860 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 22 treesize of output 23 [2024-10-13 11:03:18,862 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 65 treesize of output 57 [2024-10-13 11:03:18,867 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-10-13 11:03:18,871 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-10-13 11:03:18,873 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-10-13 11:03:19,044 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-13 11:03:19,044 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2057218961] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:19,044 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:19,044 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 33 [2024-10-13 11:03:19,044 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [959421092] [2024-10-13 11:03:19,044 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:19,045 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-13 11:03:19,045 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:19,045 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-13 11:03:19,045 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=928, Unknown=2, NotChecked=126, Total=1190 [2024-10-13 11:03:19,045 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 35 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 34 states have internal predecessors, (59), 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-10-13 11:03:19,513 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:19,513 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2024-10-13 11:03:19,513 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-13 11:03:19,514 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 34 states have internal predecessors, (59), 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 26 [2024-10-13 11:03:19,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:19,514 INFO L225 Difference]: With dead ends: 80 [2024-10-13 11:03:19,514 INFO L226 Difference]: Without dead ends: 80 [2024-10-13 11:03:19,514 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 508 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=253, Invalid=1475, Unknown=2, NotChecked=162, Total=1892 [2024-10-13 11:03:19,515 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 634 mSDsCounter, 0 mSdLazyCounter, 681 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 688 SdHoareTripleChecker+Invalid, 784 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 681 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 81 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:19,515 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 688 Invalid, 784 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 681 Invalid, 0 Unknown, 81 Unchecked, 0.3s Time] [2024-10-13 11:03:19,515 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-13 11:03:19,516 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2024-10-13 11:03:19,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 69 states have (on average 1.1884057971014492) internal successors, (82), 76 states have internal predecessors, (82), 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-10-13 11:03:19,516 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2024-10-13 11:03:19,516 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2024-10-13 11:03:19,517 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:19,517 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2024-10-13 11:03:19,517 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7352941176470589) internal successors, (59), 34 states have internal predecessors, (59), 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-10-13 11:03:19,517 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2024-10-13 11:03:19,517 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-13 11:03:19,517 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:19,517 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:19,530 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-10-13 11:03:19,718 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-13 11:03:19,718 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:03:19,718 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:19,718 INFO L85 PathProgramCache]: Analyzing trace with hash -1942872953, now seen corresponding path program 1 times [2024-10-13 11:03:19,718 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:19,718 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [838970404] [2024-10-13 11:03:19,718 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:19,718 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:19,734 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:19,953 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:19,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:19,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [838970404] [2024-10-13 11:03:19,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [838970404] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:19,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1871717691] [2024-10-13 11:03:19,954 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:19,955 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:19,955 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:19,956 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:19,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-13 11:03:20,038 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:20,039 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-13 11:03:20,043 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:20,049 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-10-13 11:03:20,068 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-13 11:03:20,068 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-10-13 11:03:20,107 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2024-10-13 11:03:20,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 24 treesize of output 28 [2024-10-13 11:03:20,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:03:20,163 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:03:20,164 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-10-13 11:03:20,196 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-10-13 11:03:20,209 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:20,210 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 37 treesize of output 17 [2024-10-13 11:03:20,254 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:20,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:20,261 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 46 treesize of output 40 [2024-10-13 11:03:20,416 INFO L349 Elim1Store]: treesize reduction 46, result has 53.1 percent of original size [2024-10-13 11:03:20,416 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 4 select indices, 4 select index equivalence classes, 1 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 8 case distinctions, treesize of input 42 treesize of output 84 [2024-10-13 11:03:20,558 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 2 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:20,558 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:20,738 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:20,738 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 31 treesize of output 32 [2024-10-13 11:03:20,740 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 100 treesize of output 96 [2024-10-13 11:03:20,744 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 124 treesize of output 120 [2024-10-13 11:03:20,753 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:20,753 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 84 treesize of output 88 [2024-10-13 11:03:20,760 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 76 treesize of output 74 [2024-10-13 11:03:21,388 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:21,388 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1871717691] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:21,388 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:21,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 31 [2024-10-13 11:03:21,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788146506] [2024-10-13 11:03:21,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:21,389 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-13 11:03:21,389 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:21,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-13 11:03:21,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=878, Unknown=2, NotChecked=0, Total=992 [2024-10-13 11:03:21,389 INFO L87 Difference]: Start difference. First operand 77 states and 82 transitions. Second operand has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 32 states have internal predecessors, (76), 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-10-13 11:03:22,064 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:22,064 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2024-10-13 11:03:22,064 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-13 11:03:22,064 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 32 states have internal predecessors, (76), 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 26 [2024-10-13 11:03:22,065 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:22,065 INFO L225 Difference]: With dead ends: 76 [2024-10-13 11:03:22,065 INFO L226 Difference]: Without dead ends: 76 [2024-10-13 11:03:22,065 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=247, Invalid=1557, Unknown=2, NotChecked=0, Total=1806 [2024-10-13 11:03:22,066 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 92 mSDsluCounter, 511 mSDsCounter, 0 mSdLazyCounter, 745 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 556 SdHoareTripleChecker+Invalid, 762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 745 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:22,066 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 556 Invalid, 762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 745 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-10-13 11:03:22,066 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-13 11:03:22,067 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-13 11:03:22,067 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 76 states, 69 states have (on average 1.173913043478261) internal successors, (81), 75 states have internal predecessors, (81), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:22,067 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2024-10-13 11:03:22,067 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 26 [2024-10-13 11:03:22,067 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:22,067 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2024-10-13 11:03:22,067 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4516129032258065) internal successors, (76), 32 states have internal predecessors, (76), 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-10-13 11:03:22,067 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2024-10-13 11:03:22,068 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 11:03:22,068 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:22,068 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:22,081 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-10-13 11:03:22,268 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-13 11:03:22,268 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:03:22,268 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:22,269 INFO L85 PathProgramCache]: Analyzing trace with hash 1804920626, now seen corresponding path program 1 times [2024-10-13 11:03:22,269 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:22,269 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [105357774] [2024-10-13 11:03:22,269 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:22,269 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:22,282 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:22,637 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:22,638 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:22,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [105357774] [2024-10-13 11:03:22,638 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [105357774] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:22,638 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1211206388] [2024-10-13 11:03:22,638 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:22,638 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:22,638 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:22,640 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:22,641 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-13 11:03:22,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:22,729 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-13 11:03:22,730 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:22,733 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-10-13 11:03:22,762 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-13 11:03:22,763 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-10-13 11:03:22,819 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-13 11:03:22,819 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-13 11:03:22,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:03:22,870 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:03:22,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2024-10-13 11:03:22,901 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 34 treesize of output 25 [2024-10-13 11:03:22,913 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 45 treesize of output 25 [2024-10-13 11:03:22,962 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:22,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:22,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 54 treesize of output 48 [2024-10-13 11:03:23,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:03:23,124 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:03:23,126 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:23,126 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:23,257 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1307 (Array Int Int))) (not (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 4) (select .cse0 0))))) (forall ((v_ArrVal_1307 (Array Int Int))) (= (select |c_#valid| (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) 1)) (forall ((v_ArrVal_1307 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))))) is different from false [2024-10-13 11:03:23,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:23,272 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 81 treesize of output 85 [2024-10-13 11:03:23,293 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (not (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 0) (select .cse0 4))))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1307 (Array Int Int)) (v_ArrVal_1306 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1306) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1307) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)))) is different from false [2024-10-13 11:03:23,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:23,298 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 27 treesize of output 28 [2024-10-13 11:03:23,303 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 171 treesize of output 165 [2024-10-13 11:03:23,309 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:23,309 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 94 treesize of output 98 [2024-10-13 11:03:23,313 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 85 treesize of output 83 [2024-10-13 11:03:23,316 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 96 treesize of output 92 [2024-10-13 11:03:23,340 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:23,340 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 50 treesize of output 43 [2024-10-13 11:03:23,342 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:03:23,344 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 59 treesize of output 53 [2024-10-13 11:03:23,348 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 85 treesize of output 77 [2024-10-13 11:03:23,354 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:03:23,358 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:23,358 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 106 treesize of output 104 [2024-10-13 11:03:23,379 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-13 11:03:23,380 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 21 treesize of output 1 [2024-10-13 11:03:23,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-13 11:03:23,546 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1211206388] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:23,546 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:23,546 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 37 [2024-10-13 11:03:23,546 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [457505399] [2024-10-13 11:03:23,546 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:23,546 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-13 11:03:23,546 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:23,547 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-13 11:03:23,547 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1192, Unknown=2, NotChecked=142, Total=1482 [2024-10-13 11:03:23,547 INFO L87 Difference]: Start difference. First operand 76 states and 81 transitions. Second operand has 39 states, 38 states have (on average 1.763157894736842) internal successors, (67), 38 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:24,120 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:24,120 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-10-13 11:03:24,120 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 11:03:24,120 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.763157894736842) internal successors, (67), 38 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-13 11:03:24,120 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:24,121 INFO L225 Difference]: With dead ends: 78 [2024-10-13 11:03:24,121 INFO L226 Difference]: Without dead ends: 78 [2024-10-13 11:03:24,121 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=293, Invalid=2065, Unknown=2, NotChecked=190, Total=2550 [2024-10-13 11:03:24,122 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 143 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 700 mSolverCounterSat, 25 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 143 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 839 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 700 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:24,122 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [143 Valid, 557 Invalid, 839 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 700 Invalid, 0 Unknown, 114 Unchecked, 0.3s Time] [2024-10-13 11:03:24,122 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-13 11:03:24,123 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2024-10-13 11:03:24,123 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 74 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:24,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2024-10-13 11:03:24,123 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 28 [2024-10-13 11:03:24,123 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:24,123 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2024-10-13 11:03:24,123 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.763157894736842) internal successors, (67), 38 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:24,123 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2024-10-13 11:03:24,123 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-13 11:03:24,123 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:24,123 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:24,138 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-13 11:03:24,324 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-10-13 11:03:24,324 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr24ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:03:24,324 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:24,324 INFO L85 PathProgramCache]: Analyzing trace with hash 1850602596, now seen corresponding path program 1 times [2024-10-13 11:03:24,324 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:24,324 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [510282045] [2024-10-13 11:03:24,325 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:24,325 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:24,340 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:24,766 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:24,766 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:24,766 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [510282045] [2024-10-13 11:03:24,767 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [510282045] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:24,767 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [489079382] [2024-10-13 11:03:24,767 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:24,767 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:24,767 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:24,768 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:24,768 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-13 11:03:24,858 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:24,859 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-13 11:03:24,861 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:24,863 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-10-13 11:03:24,897 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-13 11:03:24,897 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-10-13 11:03:24,985 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-10-13 11:03:24,985 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 24 treesize of output 28 [2024-10-13 11:03:25,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:03:25,072 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:03:25,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2024-10-13 11:03:25,113 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 34 treesize of output 25 [2024-10-13 11:03:25,125 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 45 treesize of output 25 [2024-10-13 11:03:25,192 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:25,202 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:25,203 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 63 treesize of output 53 [2024-10-13 11:03:25,445 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 3 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 25 [2024-10-13 11:03:25,491 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2024-10-13 11:03:25,491 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 3 case distinctions, treesize of input 24 treesize of output 24 [2024-10-13 11:03:25,515 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:25,515 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:25,716 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:25,716 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 57 treesize of output 50 [2024-10-13 11:03:25,723 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 286 treesize of output 276 [2024-10-13 11:03:25,727 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 111 treesize of output 103 [2024-10-13 11:03:25,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:25,735 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 150 treesize of output 156 [2024-10-13 11:03:26,081 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 152 treesize of output 136 [2024-10-13 11:03:27,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:27,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [489079382] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:27,376 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:27,376 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 40 [2024-10-13 11:03:27,376 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1158145044] [2024-10-13 11:03:27,376 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:27,377 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-13 11:03:27,377 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:27,378 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-13 11:03:27,379 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1530, Unknown=1, NotChecked=0, Total=1722 [2024-10-13 11:03:27,379 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 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-10-13 11:03:28,396 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:28,396 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2024-10-13 11:03:28,396 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-13 11:03:28,396 INFO L78 Accepts]: Start accepts. Automaton has has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2024-10-13 11:03:28,396 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:28,397 INFO L225 Difference]: With dead ends: 77 [2024-10-13 11:03:28,397 INFO L226 Difference]: Without dead ends: 77 [2024-10-13 11:03:28,397 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 1.5s TimeCoverageRelationStatistics Valid=341, Invalid=2414, Unknown=1, NotChecked=0, Total=2756 [2024-10-13 11:03:28,397 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 128 mSDsluCounter, 523 mSDsCounter, 0 mSdLazyCounter, 983 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 128 SdHoareTripleChecker+Valid, 567 SdHoareTripleChecker+Invalid, 1000 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 983 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:28,398 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [128 Valid, 567 Invalid, 1000 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 983 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-10-13 11:03:28,398 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-13 11:03:28,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2024-10-13 11:03:28,399 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.144927536231884) internal successors, (79), 73 states have internal predecessors, (79), 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-10-13 11:03:28,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2024-10-13 11:03:28,399 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 28 [2024-10-13 11:03:28,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:28,399 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2024-10-13 11:03:28,399 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 42 states, 41 states have (on average 1.8780487804878048) internal successors, (77), 41 states have internal predecessors, (77), 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-10-13 11:03:28,399 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2024-10-13 11:03:28,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 11:03:28,399 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:28,399 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:28,412 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-10-13 11:03:28,602 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:28,602 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:03:28,603 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:28,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1603547446, now seen corresponding path program 1 times [2024-10-13 11:03:28,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:28,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1236045017] [2024-10-13 11:03:28,603 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:28,603 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:28,624 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:28,978 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:28,978 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:28,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1236045017] [2024-10-13 11:03:28,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1236045017] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:28,978 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [84458133] [2024-10-13 11:03:28,979 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:28,979 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:28,979 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:28,980 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:28,981 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-13 11:03:29,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:29,084 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-13 11:03:29,086 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:29,097 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-10-13 11:03:29,130 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-13 11:03:29,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 16 treesize of output 18 [2024-10-13 11:03:29,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:03:29,168 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:03:29,168 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-10-13 11:03:29,191 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 17 treesize of output 12 [2024-10-13 11:03:29,199 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 24 treesize of output 12 [2024-10-13 11:03:29,240 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:29,252 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:29,252 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 33 treesize of output 39 [2024-10-13 11:03:29,356 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-13 11:03:29,356 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 13 [2024-10-13 11:03:29,429 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-13 11:03:29,429 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 38 treesize of output 37 [2024-10-13 11:03:29,447 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:29,448 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:29,531 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 160 treesize of output 154 [2024-10-13 11:03:29,601 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1488) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1490) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))) (forall ((v_ArrVal_1488 (Array Int Int)) (v_ArrVal_1490 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1488) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1490) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2024-10-13 11:03:29,604 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:29,604 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 27 treesize of output 28 [2024-10-13 11:03:29,606 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 85 treesize of output 81 [2024-10-13 11:03:29,608 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 92 treesize of output 88 [2024-10-13 11:03:29,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:29,614 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 86 treesize of output 90 [2024-10-13 11:03:29,617 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 75 treesize of output 73 [2024-10-13 11:03:29,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:29,642 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 27 treesize of output 28 [2024-10-13 11:03:29,643 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:03:29,645 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 43 treesize of output 39 [2024-10-13 11:03:29,646 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:03:29,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 27 treesize of output 25 [2024-10-13 11:03:29,650 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:03:29,654 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:29,655 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 27 treesize of output 31 [2024-10-13 11:03:29,707 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 11:03:29,707 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 25 treesize of output 24 [2024-10-13 11:03:29,709 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-10-13 11:03:29,710 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [84458133] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:29,710 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:29,710 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 34 [2024-10-13 11:03:29,710 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1123478755] [2024-10-13 11:03:29,710 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:29,710 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-13 11:03:29,710 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:29,710 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-13 11:03:29,711 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=982, Unknown=5, NotChecked=64, Total=1190 [2024-10-13 11:03:29,711 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 35 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:30,182 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:30,182 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2024-10-13 11:03:30,182 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 11:03:30,183 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 35 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2024-10-13 11:03:30,183 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:30,183 INFO L225 Difference]: With dead ends: 72 [2024-10-13 11:03:30,183 INFO L226 Difference]: Without dead ends: 72 [2024-10-13 11:03:30,184 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 577 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=301, Invalid=1860, Unknown=5, NotChecked=90, Total=2256 [2024-10-13 11:03:30,184 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 107 mSDsluCounter, 476 mSDsCounter, 0 mSdLazyCounter, 659 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 513 SdHoareTripleChecker+Invalid, 738 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 659 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:30,184 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 513 Invalid, 738 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 659 Invalid, 0 Unknown, 50 Unchecked, 0.2s Time] [2024-10-13 11:03:30,184 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-13 11:03:30,185 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-13 11:03:30,185 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 71 states have internal predecessors, (77), 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-10-13 11:03:30,185 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-10-13 11:03:30,185 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 29 [2024-10-13 11:03:30,186 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:30,186 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-10-13 11:03:30,186 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 2.2941176470588234) internal successors, (78), 35 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-10-13 11:03:30,186 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-10-13 11:03:30,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 11:03:30,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:30,186 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:30,199 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-13 11:03:30,387 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-13 11:03:30,387 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr54ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:03:30,388 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:30,388 INFO L85 PathProgramCache]: Analyzing trace with hash -1557865476, now seen corresponding path program 1 times [2024-10-13 11:03:30,388 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:30,388 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1291219088] [2024-10-13 11:03:30,388 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:30,388 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:30,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:30,790 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:30,791 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:30,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1291219088] [2024-10-13 11:03:30,791 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1291219088] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:30,791 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [35865007] [2024-10-13 11:03:30,791 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:30,791 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:30,791 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:30,792 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:30,793 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-13 11:03:30,891 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:30,892 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-13 11:03:30,893 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:30,895 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-10-13 11:03:30,922 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-13 11:03:30,923 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-10-13 11:03:30,967 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-13 11:03:30,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-13 11:03:30,989 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:03:31,012 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:03:31,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2024-10-13 11:03:31,040 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 34 treesize of output 25 [2024-10-13 11:03:31,050 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 45 treesize of output 25 [2024-10-13 11:03:31,101 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:31,110 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:31,110 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 54 treesize of output 48 [2024-10-13 11:03:31,350 INFO L349 Elim1Store]: treesize reduction 36, result has 59.1 percent of original size [2024-10-13 11:03:31,350 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 6 case distinctions, treesize of input 76 treesize of output 113 [2024-10-13 11:03:31,540 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 14 treesize of output 9 [2024-10-13 11:03:31,553 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:31,553 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:31,724 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1580 (Array Int Int))) (not (= (select (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1580) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|))) (forall ((v_ArrVal_1582 Int) (v_ArrVal_1580 (Array Int Int))) (= (let ((.cse1 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1580) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (select (store |c_#valid| (select .cse1 4) v_ArrVal_1582) (select .cse1 0))) 1)))) is different from false [2024-10-13 11:03:31,735 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:31,735 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 120 treesize of output 124 [2024-10-13 11:03:31,751 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int))) (not (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse0 0) (select .cse0 4))))) (forall ((v_prenex_10 (Array Int Int)) (v_prenex_11 (Array Int Int))) (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_10) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_11) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|)) (forall ((v_ArrVal_1579 (Array Int Int)) (v_ArrVal_1580 (Array Int Int))) (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1579) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1580) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|))))) is different from false [2024-10-13 11:03:31,755 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:31,756 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 26 treesize of output 27 [2024-10-13 11:03:31,757 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 80 treesize of output 76 [2024-10-13 11:03:31,759 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 94 treesize of output 90 [2024-10-13 11:03:31,763 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 56 treesize of output 54 [2024-10-13 11:03:31,770 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:31,770 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 64 treesize of output 68 [2024-10-13 11:03:31,817 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:31,817 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 27 treesize of output 28 [2024-10-13 11:03:31,827 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 171 treesize of output 165 [2024-10-13 11:03:31,831 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 87 treesize of output 85 [2024-10-13 11:03:31,839 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 11:03:31,839 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 92 treesize of output 91 [2024-10-13 11:03:31,843 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:31,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:31,852 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 50 treesize of output 43 [2024-10-13 11:03:31,855 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:03:31,855 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:03:31,857 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 31 treesize of output 25 [2024-10-13 11:03:31,860 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:03:31,863 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:31,863 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 1 case distinctions, treesize of input 60 treesize of output 58 [2024-10-13 11:03:32,045 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-13 11:03:32,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [35865007] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:32,045 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:32,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 38 [2024-10-13 11:03:32,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [745026016] [2024-10-13 11:03:32,045 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:32,046 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-13 11:03:32,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:32,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-13 11:03:32,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1260, Unknown=2, NotChecked=146, Total=1560 [2024-10-13 11:03:32,046 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 39 states have internal predecessors, (76), 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-10-13 11:03:32,762 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:32,762 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2024-10-13 11:03:32,762 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-13 11:03:32,762 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 39 states have internal predecessors, (76), 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 29 [2024-10-13 11:03:32,762 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:32,763 INFO L225 Difference]: With dead ends: 74 [2024-10-13 11:03:32,763 INFO L226 Difference]: Without dead ends: 74 [2024-10-13 11:03:32,763 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=305, Invalid=2151, Unknown=2, NotChecked=194, Total=2652 [2024-10-13 11:03:32,764 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 99 mSDsluCounter, 587 mSDsCounter, 0 mSdLazyCounter, 907 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 629 SdHoareTripleChecker+Invalid, 1037 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 907 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:32,764 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 629 Invalid, 1037 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 907 Invalid, 0 Unknown, 110 Unchecked, 0.4s Time] [2024-10-13 11:03:32,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-13 11:03:32,765 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2024-10-13 11:03:32,765 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 71 states, 69 states have (on average 1.1014492753623188) internal successors, (76), 70 states have internal predecessors, (76), 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-10-13 11:03:32,765 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2024-10-13 11:03:32,765 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 29 [2024-10-13 11:03:32,766 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:32,766 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2024-10-13 11:03:32,766 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 39 states have internal predecessors, (76), 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-10-13 11:03:32,766 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2024-10-13 11:03:32,766 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-13 11:03:32,766 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:32,766 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:32,778 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Ended with exit code 0 [2024-10-13 11:03:32,967 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-13 11:03:32,967 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr39ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:03:32,968 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:32,968 INFO L85 PathProgramCache]: Analyzing trace with hash -1148707946, now seen corresponding path program 1 times [2024-10-13 11:03:32,968 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:32,968 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [653560974] [2024-10-13 11:03:32,968 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:32,968 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:32,984 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:33,369 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:33,369 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:33,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [653560974] [2024-10-13 11:03:33,369 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [653560974] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:33,369 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2041466548] [2024-10-13 11:03:33,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:33,369 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:33,369 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:33,370 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:33,371 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-13 11:03:33,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:33,472 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-13 11:03:33,476 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:33,478 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-10-13 11:03:33,505 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-13 11:03:33,505 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-10-13 11:03:33,550 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-13 11:03:33,550 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-10-13 11:03:33,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:03:33,597 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:03:33,597 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-10-13 11:03:33,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 18 [2024-10-13 11:03:33,643 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 36 treesize of output 20 [2024-10-13 11:03:33,693 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:33,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:33,703 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 54 treesize of output 48 [2024-10-13 11:03:33,889 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-10-13 11:03:33,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 68 treesize of output 88 [2024-10-13 11:03:34,039 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-13 11:03:34,040 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 18 treesize of output 13 [2024-10-13 11:03:34,043 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:34,043 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:34,177 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:34,177 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 116 treesize of output 120 [2024-10-13 11:03:34,292 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:34,292 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 26 treesize of output 27 [2024-10-13 11:03:34,294 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 162 treesize of output 156 [2024-10-13 11:03:34,298 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:34,298 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 46 treesize of output 50 [2024-10-13 11:03:34,300 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 36 treesize of output 34 [2024-10-13 11:03:34,314 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 38 treesize of output 34 [2024-10-13 11:03:34,323 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:34,323 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 27 treesize of output 28 [2024-10-13 11:03:34,326 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 171 treesize of output 165 [2024-10-13 11:03:34,334 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-13 11:03:34,334 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 90 treesize of output 89 [2024-10-13 11:03:34,340 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:34,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:34,345 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:34,351 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:34,351 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 50 treesize of output 43 [2024-10-13 11:03:34,353 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:03:34,354 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 59 treesize of output 53 [2024-10-13 11:03:34,356 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:03:34,357 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 52 treesize of output 46 [2024-10-13 11:03:34,359 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-13 11:03:34,366 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-10-13 11:03:34,367 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 59 treesize of output 55 [2024-10-13 11:03:34,518 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:34,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2041466548] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-13 11:03:34,518 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-13 11:03:34,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 38 [2024-10-13 11:03:34,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1819251764] [2024-10-13 11:03:34,518 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-13 11:03:34,518 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-13 11:03:34,518 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-13 11:03:34,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-13 11:03:34,519 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1368, Unknown=1, NotChecked=0, Total=1560 [2024-10-13 11:03:34,519 INFO L87 Difference]: Start difference. First operand 71 states and 76 transitions. Second operand has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 39 states have internal predecessors, (76), 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-10-13 11:03:35,083 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-13 11:03:35,083 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2024-10-13 11:03:35,083 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-13 11:03:35,083 INFO L78 Accepts]: Start accepts. Automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 39 states have internal predecessors, (76), 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 29 [2024-10-13 11:03:35,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-13 11:03:35,083 INFO L225 Difference]: With dead ends: 73 [2024-10-13 11:03:35,084 INFO L226 Difference]: Without dead ends: 73 [2024-10-13 11:03:35,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 808 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=323, Invalid=2028, Unknown=1, NotChecked=0, Total=2352 [2024-10-13 11:03:35,084 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 89 mSDsluCounter, 483 mSDsCounter, 0 mSdLazyCounter, 733 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 524 SdHoareTripleChecker+Invalid, 751 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 733 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-13 11:03:35,086 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 524 Invalid, 751 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 733 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-13 11:03:35,086 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-13 11:03:35,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2024-10-13 11:03:35,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 69 states have internal predecessors, (75), 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-10-13 11:03:35,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2024-10-13 11:03:35,087 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 29 [2024-10-13 11:03:35,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-13 11:03:35,087 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2024-10-13 11:03:35,087 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 40 states, 39 states have (on average 1.9487179487179487) internal successors, (76), 39 states have internal predecessors, (76), 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-10-13 11:03:35,087 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2024-10-13 11:03:35,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-13 11:03:35,088 INFO L207 NwaCegarLoop]: Found error trace [2024-10-13 11:03:35,088 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-13 11:03:35,100 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Forceful destruction successful, exit code 0 [2024-10-13 11:03:35,288 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:35,288 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2024-10-13 11:03:35,288 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-13 11:03:35,288 INFO L85 PathProgramCache]: Analyzing trace with hash -638059179, now seen corresponding path program 1 times [2024-10-13 11:03:35,289 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-13 11:03:35,289 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2042101017] [2024-10-13 11:03:35,289 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:35,289 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-13 11:03:35,303 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:35,775 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:35,775 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-13 11:03:35,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2042101017] [2024-10-13 11:03:35,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2042101017] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-13 11:03:35,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [725453725] [2024-10-13 11:03:35,776 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-13 11:03:35,776 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-13 11:03:35,776 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-10-13 11:03:35,777 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-13 11:03:35,778 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-13 11:03:35,879 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-13 11:03:35,881 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-13 11:03:35,882 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-13 11:03:36,024 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-10-13 11:03:36,066 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-13 11:03:36,066 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2024-10-13 11:03:36,115 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-13 11:03:36,115 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 54 treesize of output 45 [2024-10-13 11:03:36,123 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 73 treesize of output 53 [2024-10-13 11:03:36,228 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-13 11:03:36,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:36,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 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 6 case distinctions, treesize of input 83 treesize of output 69 [2024-10-13 11:03:36,716 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_61| Int) (|v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_61| Int) (|v_ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base_56| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_61| 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base_56| 0) |v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_61| 0) |v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_61| 0)) (= (select .cse0 |v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_61|) 0) (= (select (store .cse0 |v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_61| 1) |v_ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base_56|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_61|) 0)))) is different from true [2024-10-13 11:03:36,722 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-10-13 11:03:36,722 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-13 11:03:36,917 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1764 (Array Int Int))) (= (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1764) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) (select .cse0 4) 0) (select .cse0 0) 0)) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-10-13 11:03:36,923 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1764 (Array Int Int)) (v_ArrVal_1763 (Array Int Int))) (= (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1763) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1764) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (store (store (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0) (select .cse0 4) 0) (select .cse0 0) 0)) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2024-10-13 11:03:36,931 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:36,931 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 62 treesize of output 55 [2024-10-13 11:03:36,933 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 326 treesize of output 316 [2024-10-13 11:03:36,938 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 148 treesize of output 140 [2024-10-13 11:03:36,962 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-13 11:03:36,962 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 197 treesize of output 203 [2024-10-13 11:03:36,969 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 220 treesize of output 204 [2024-10-13 11:03:45,225 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse1 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse46 (store .cse1 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse6 (store .cse1 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (let ((.cse11 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse94 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse539 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse539 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse539 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse539 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (.cse15 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse10 (= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) 0))) (let ((.cse109 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))) (.cse110 (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (.cse0 (not .cse10)) (.cse153 (not .cse15)) (.cse113 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse538 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse538 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse538 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (.cse99 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse537 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse537 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse537 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse537 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse537 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse537 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (.cse100 (or .cse11 .cse94)) (.cse102 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse536 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse536 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse536 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse536 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse536 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse536 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (.cse58 (store .cse6 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse2 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0))) (let ((.cse12 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse534 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse535 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse534 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse534 (select (store .cse535 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse534 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse534 (select (store .cse535 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (.cse64 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse533 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse533 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse533 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse533 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse533 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse533 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (.cse42 (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse532 (store .cse1 v_arrayElimCell_288 0)) (.cse531 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse531 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse531 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse531 (select (store .cse532 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse531 (select (store .cse532 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse531 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse2)) (.cse43 (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse530 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse530 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse530 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse530 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse530 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse2)) (.cse73 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse529 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse529 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse529 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse529 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))))) (.cse79 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse58 v_antiDerIndex_entry0_1)))) (.cse81 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int)) (let ((.cse528 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse528 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse528 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))))) (.cse92 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse526 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse527 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse526 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse526 (select (store .cse527 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse526 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse526 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse526 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse526 (select (store .cse527 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (.cse87 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse524 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse525 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse524 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse524 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse524 (select (store .cse525 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse524 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse524 (select (store .cse525 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (.cse88 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse521 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse523 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse522 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse521 (select (store .cse522 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse521 (select (store .cse522 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse521 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse521 (select (store .cse523 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse521 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse521 (select (store .cse523 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (.cse48 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse518 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse520 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse519 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse518 (select (store .cse519 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse518 (select (store .cse519 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse518 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse518 (select (store .cse520 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse518 (select (store .cse520 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (.cse51 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse516 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse517 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse516 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse516 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse516 (select (store .cse517 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse516 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse516 (select (store .cse517 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (.cse53 (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse514 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse515 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse514 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse514 (select (store .cse515 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse514 (select (store .cse515 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse11)) (.cse14 (store .cse46 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) (.cse91 (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse511 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse512 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse511 (select (store .cse512 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse511 (select (store .cse512 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse511 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse511 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse511 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse513 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse513 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse513 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse513 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse513 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse99 .cse100 .cse102)) (.cse236 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_288 Int)) (let ((.cse509 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse510 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse509 (select (store .cse510 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse509 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse509 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse509 (select (store .cse510 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (.cse213 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse507 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse508 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse507 (select (store .cse508 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse507 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse507 (select (store .cse508 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (.cse218 (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse503 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse504 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse503 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse503 (select (store .cse504 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse503 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse503 (select (store .cse504 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse505 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse506 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse505 (select (store .cse506 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse505 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse505 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse505 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse505 (select (store .cse506 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (.cse231 (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse499 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse500 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse499 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse499 (select (store .cse500 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse499 (select (store .cse500 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse501 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse502 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse501 (select (store .cse502 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse501 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse501 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse501 (select (store .cse502 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (.cse108 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse497 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse498 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse497 (select (store .cse498 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse497 (select (store .cse498 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (.cse237 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_288 Int)) (let ((.cse495 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse496 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse495 (select (store .cse496 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse495 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse495 (select (store .cse496 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (.cse223 (or .cse153 (and (or .cse11 .cse113) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse490 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse490 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse490 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse490 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse491 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse492 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse491 (select (store .cse492 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse491 (select (store .cse492 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse491 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse491 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse493 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse493 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse493 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse493 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse493 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse494 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse494 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse494 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse494 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse494 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))) (.cse228 (or (and (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse486 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse487 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse486 (select (store .cse487 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse486 (select (store .cse487 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse486 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse488 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse488 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse488 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse489 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse489 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse489 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse489 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse11 .cse110)) .cse0 .cse153)) (.cse184 (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse481 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse481 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_288 Int)) (= .cse481 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse481 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse482 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse483 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse482 (select (store .cse483 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse482 (select (store .cse483 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse482 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or .cse11 .cse109) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse484 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse484 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse484 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse485 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse485 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse485 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse485 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) .cse153)) (.cse56 (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse479 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse480 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse479 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse479 (select (store .cse480 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse479 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse479 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse479 (select (store .cse480 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse2)) (.cse89 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse477 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse478 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse477 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse477 (select (store .cse478 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse477 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse477 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse477 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse477 (select (store .cse478 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (.cse74 (or .cse2 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse475 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse476 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse475 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse475 (select (store .cse476 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse475 (select (store .cse476 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (.cse75 (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse474 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse474 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse474 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse474 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))))) .cse2)) (.cse375 (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_288 Int)) (let ((.cse473 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse473 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse473 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse0)) (.cse78 (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse472 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse472 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse472 (select .cse58 v_antiDerIndex_entry0_1)))))) (.cse7 (not .cse2)) (.cse77 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse471 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse471 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse471 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse471 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse44 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse469 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse470 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse469 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse469 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse469 (select (store .cse470 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse469 (select (store .cse470 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (.cse47 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse467 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse468 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse467 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse467 (select (store .cse468 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse467 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse467 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse467 (select (store .cse468 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (.cse374 (or .cse0 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_288 Int)) (let ((.cse465 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse466 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse465 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse465 (select (store .cse466 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse465 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse465 (select (store .cse466 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))) (and (or (and (or .cse0 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_288 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (or .cse2 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse3 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse4 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse3 (select (store .cse4 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse3 (select (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_288 Int)) (let ((.cse5 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse5 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse5 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse7 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse8 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse8 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse8 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse9 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse9 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse9 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))))) (or .cse7 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) .cse2)) .cse10)) (not .cse11)) (or .cse11 .cse12) (or (and (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_288 Int)) (let ((.cse13 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse13 (select .cse14 v_antiDerIndex_entry0_1)) (= .cse13 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse15) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse17 (store .cse1 v_arrayElimCell_288 0)) (.cse16 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse16 (select .cse14 v_antiDerIndex_entry0_1)) (= .cse16 (select (store .cse17 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse16 (select (store .cse17 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (or (forall ((v_arrayElimCell_283 Int)) (let ((.cse18 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse16 (select (store .cse18 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse16 (select (store .cse18 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse16 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse19 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse19 (select .cse14 v_antiDerIndex_entry0_1)) (= .cse19 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse19 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse20 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse19 (select (store .cse20 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse19 (select (store .cse20 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))) (or .cse11 (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse21 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse21 (select .cse14 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (= .cse21 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse22 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse22 (select .cse14 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (or (forall ((v_arrayElimCell_283 Int)) (let ((.cse23 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse22 (select (store .cse23 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse22 (select (store .cse23 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse22 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (or .cse15 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse14 v_antiDerIndex_entry0_1)))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse24 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse24 (select .cse14 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse25 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse24 (select (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse24 (select (store .cse25 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_288 Int)) (let ((.cse26 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse26 (select .cse14 v_antiDerIndex_entry0_1)) (= .cse26 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (or (forall ((v_arrayElimCell_283 Int)) (let ((.cse27 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse26 (select (store .cse27 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse26 (select (store .cse27 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse26 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (or .cse15 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse28 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse29 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse28 (select .cse14 v_antiDerIndex_entry0_1)) (= .cse28 (select (store .cse29 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse28 (select (store .cse29 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse31 (store .cse1 v_arrayElimCell_288 0)) (.cse30 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse30 (select .cse14 v_antiDerIndex_entry0_1)) (= .cse30 (select (store .cse31 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse30 (select (store .cse31 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse32 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse30 (select (store .cse32 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse30 (select (store .cse32 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse33 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse33 (select .cse14 v_antiDerIndex_entry0_1)) (= .cse33 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse33 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (= .cse33 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse34 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse34 (select .cse14 v_antiDerIndex_entry0_1)) (= .cse34 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse34 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (or (forall ((v_arrayElimCell_283 Int)) (let ((.cse35 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse34 (select (store .cse35 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse34 (select (store .cse35 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse34 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_288 Int)) (let ((.cse36 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse36 (select .cse14 v_antiDerIndex_entry0_1)) (= .cse36 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (= .cse36 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse38 (store .cse1 v_arrayElimCell_288 0)) (.cse37 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse37 (select .cse14 v_antiDerIndex_entry0_1)) (= .cse37 (select (store .cse38 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse37 (select (store .cse38 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (= .cse37 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_288 Int)) (let ((.cse39 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse39 (select .cse14 v_antiDerIndex_entry0_1)) (= .cse39 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse40 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse39 (select (store .cse40 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse39 (select (store .cse40 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))) (or .cse15 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse41 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse41 (select .cse14 v_antiDerIndex_entry0_1)) (= .cse41 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse41 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse0) (or (and .cse42 .cse43 (or .cse2 (and .cse44 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse45 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse45 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse45 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse45 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse47 .cse48 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse49 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse49 (select .cse46 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse49 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse49 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse49 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse50 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse50 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse50 (select .cse46 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse50 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse50 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse51 (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse52 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse52 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse52 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse11) .cse53 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse54 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse55 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse54 (select (store .cse55 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse54 (select (store .cse55 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse54 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse54 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) .cse56 (or .cse7 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int)) (let ((.cse57 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse57 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse57 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse57 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse57 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (or .cse7 (and (forall ((v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse59 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse59 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse59 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse59 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse60 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse60 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse60 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse60 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse60 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))))))) (or .cse11 (forall ((v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse61 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse61 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse61 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse62 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse63 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse62 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse62 (select (store .cse63 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse62 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse62 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse62 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse62 (select (store .cse63 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse64 (or .cse7 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse65 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse66 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse65 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse65 (select (store .cse66 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse65 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse65 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse65 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse65 (select (store .cse66 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (or .cse7 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse67 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse67 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse67 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse67 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse67 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse67 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (or .cse7 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse68 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse68 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse68 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse68 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse68 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse68 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (or .cse11 (and (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse69 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse70 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse69 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse69 (select (store .cse70 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse69 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse69 (select (store .cse70 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse7) .cse12)) (or .cse7 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse71 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse72 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse71 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse71 (select (store .cse72 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse71 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse71 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse71 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse71 (select (store .cse72 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (or .cse15 (and (or .cse7 .cse73) .cse74 .cse75 (or .cse7 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse76 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse76 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse76 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse76 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse77 (or .cse11 (and .cse78 (or .cse79 .cse7))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse80 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse80 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse80 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse80 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))))) (or .cse81 .cse7) (or .cse2 (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse82 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse82 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse82 (select .cse46 v_antiDerIndex_entry0_1))))) (or .cse11 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse46 v_antiDerIndex_entry0_1)))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse83 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse83 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse83 (select .cse46 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse83 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse84 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse85 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse84 (select (store .cse85 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse84 (select (store .cse85 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse84 (select .cse46 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse86 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse86 (select .cse46 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse86 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse86 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))))))))))) (or (and .cse87 .cse88 .cse89) .cse2) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse90 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse90 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse90 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse90 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse90 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse90 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or .cse91 .cse2) .cse92 (or .cse11 (and (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse93 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse93 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse93 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse93 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse7) .cse94)) (or .cse7 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int)) (let ((.cse95 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse96 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse95 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse95 (select (store .cse96 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse95 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse95 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse95 (select (store .cse96 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) .cse10) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse97 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse98 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse97 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse97 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse97 (select (store .cse98 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse97 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse97 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse97 (select (store .cse98 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or (and (or .cse64 .cse7) .cse42 .cse43 .cse99 .cse100 (or .cse7 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int)) (let ((.cse101 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse101 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse101 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse101 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse101 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) .cse102) .cse10) (or (and (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse103 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse103 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse103 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse104 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse103 (select (store .cse104 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse103 (select (store .cse104 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse105 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse105 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse105 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse105 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse10)) .cse2) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse106 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse106 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse106 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (or (forall ((v_arrayElimCell_283 Int)) (let ((.cse107 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse106 (select (store .cse107 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse106 (select (store .cse107 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse106 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (or .cse11 (and (or (and .cse108 (or .cse109 .cse10)) .cse2) (or .cse110 .cse0) (forall ((v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse111 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_283 Int)) (let ((.cse112 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse111 (select (store .cse112 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse111 (select (store .cse112 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse111 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or .cse7 (forall ((v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))) (or .cse113 .cse10))) (or .cse2 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse115 (store .cse1 v_arrayElimCell_288 0)) (.cse114 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse114 (select (store .cse115 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse114 (select (store .cse115 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse116 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse114 (select (store .cse116 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse114 (select (store .cse116 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse118 (store .cse1 v_arrayElimCell_288 0)) (.cse117 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse117 (select (store .cse118 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse117 (select (store .cse118 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (or (forall ((v_arrayElimCell_283 Int)) (let ((.cse119 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse117 (select (store .cse119 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse117 (select (store .cse119 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse117 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (or .cse10 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse121 (store .cse1 v_arrayElimCell_288 0)) (.cse120 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse120 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse120 (select (store .cse121 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse120 (select (store .cse121 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse120 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (or .cse0 (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse122 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse123 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse122 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse122 (select (store .cse123 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse122 (select (store .cse123 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse125 (store .cse1 v_arrayElimCell_288 0)) (.cse124 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse124 (select (store .cse125 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse124 (select (store .cse125 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse124 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse10))) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse126 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse126 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse126 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (or (forall ((v_arrayElimCell_283 Int)) (let ((.cse127 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse126 (select (store .cse127 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse126 (select (store .cse127 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse126 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse128 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse128 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse128 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (= .cse128 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse129 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse129 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse129 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse130 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse129 (select (store .cse130 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse129 (select (store .cse130 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))))) .cse2) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int)) (let ((.cse131 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse131 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse131 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int)) (let ((.cse132 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse132 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (or (= .cse132 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse132 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int)) (let ((.cse133 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse133 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (or (forall ((v_arrayElimCell_283 Int)) (let ((.cse134 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse133 (select (store .cse134 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse133 (select (store .cse134 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse133 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))) .cse7) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse135 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse135 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse135 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (or (= .cse135 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse135 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (or .cse2 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse136 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse136 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse137 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse136 (select (store .cse137 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse136 (select (store .cse137 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse138 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse138 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (or (= .cse138 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse138 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse139 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse139 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (or (forall ((v_arrayElimCell_283 Int)) (let ((.cse140 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse139 (select (store .cse140 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse139 (select (store .cse140 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse139 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse141 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse141 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (= .cse141 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))) (or .cse7 (forall ((v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse142 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse142 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse142 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse142 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))))))) .cse10) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_288 Int)) (let ((.cse143 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse143 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (or (forall ((v_arrayElimCell_283 Int)) (let ((.cse144 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse143 (select (store .cse144 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse143 (select (store .cse144 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse143 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_288 Int)) (let ((.cse145 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse145 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse146 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse145 (select (store .cse146 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse145 (select (store .cse146 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_288 Int)) (let ((.cse147 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse147 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (= .cse147 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse0) (or (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse148 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse148 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse148 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse148 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse0) (or (forall ((v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse149 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse149 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse149 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse149 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse7) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse150 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse150 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse150 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse150 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse150 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse10) (or .cse7 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse151 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse151 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse151 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse151 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse152 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse152 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse152 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (or (= .cse152 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse152 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))))) .cse153) (or (and (or .cse0 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse154 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse154 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse154 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (= .cse154 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse156 (store .cse1 v_arrayElimCell_288 0)) (.cse155 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse155 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse155 (select (store .cse156 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse155 (select (store .cse156 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (= .cse155 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse157 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse157 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse157 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse158 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse157 (select (store .cse158 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse157 (select (store .cse158 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse160 (store .cse1 v_arrayElimCell_288 0)) (.cse159 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse159 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse159 (select (store .cse160 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse159 (select (store .cse160 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (or (forall ((v_arrayElimCell_283 Int)) (let ((.cse161 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse159 (select (store .cse161 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse159 (select (store .cse161 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse159 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse162 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse162 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse162 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse162 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse163 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse162 (select (store .cse163 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse162 (select (store .cse163 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse164 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse164 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse164 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (or (forall ((v_arrayElimCell_283 Int)) (let ((.cse165 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse164 (select (store .cse165 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse164 (select (store .cse165 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse164 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (or .cse15 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse166 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse167 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse166 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse166 (select (store .cse167 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse166 (select (store .cse167 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse168 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse168 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse168 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse168 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (or (forall ((v_arrayElimCell_283 Int)) (let ((.cse169 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse168 (select (store .cse169 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse168 (select (store .cse169 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse168 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse170 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse170 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse170 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse170 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (= .cse170 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse172 (store .cse1 v_arrayElimCell_288 0)) (.cse171 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse171 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse171 (select (store .cse172 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse171 (select (store .cse172 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse173 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse171 (select (store .cse173 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse171 (select (store .cse173 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))) (or .cse11 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse174 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse174 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int)) (= .cse174 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse175 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse175 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (or (forall ((v_arrayElimCell_283 Int)) (let ((.cse176 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse175 (select (store .cse176 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse175 (select (store .cse176 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse175 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse15) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse177 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse177 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse178 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse177 (select (store .cse178 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse177 (select (store .cse178 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))))) (or .cse15 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse179 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse179 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse179 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse15 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse180 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse180 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse180 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse180 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (or .cse2 (and (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse181 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse182 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse181 (select (store .cse182 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse181 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse181 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse181 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse181 (select (store .cse182 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse10) (or .cse10 (and (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse183 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse183 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse183 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse11) .cse184 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse185 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse185 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse185 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse185 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse185 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse186 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse186 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse186 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse186 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse187 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse187 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_288 Int)) (= .cse187 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse187 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse187 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse188 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse189 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse188 (select (store .cse189 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse188 (select (store .cse189 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse188 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse188 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (or .cse153 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse192 (store .cse1 v_arrayElimCell_288 0)) (.cse190 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse191 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse190 (select (store .cse191 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse190 (select (store .cse192 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse190 (select (store .cse192 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse190 (select (store .cse191 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (or .cse15 (and (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse193 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse193 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse193 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse193 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse194 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse195 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse194 (select (store .cse195 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse194 (select (store .cse195 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse194 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse196 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse196 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_288 Int)) (= .cse196 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse196 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (or .cse11 (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse197 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse197 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse197 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)))))) .cse10) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse200 (store .cse1 v_arrayElimCell_288 0)) (.cse198 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse199 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse198 (select (store .cse199 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse198 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse198 (select (store .cse200 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse198 (select (store .cse200 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse198 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse198 (select (store .cse199 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse10) (or .cse153 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse201 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse202 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse201 (select (store .cse202 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse201 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse201 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse201 (select (store .cse202 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (or .cse11 (and (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse203 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse204 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse203 (select (store .cse204 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse203 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse203 (select (store .cse204 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse10) (or .cse108 .cse153))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse207 (store .cse1 v_arrayElimCell_288 0)) (.cse205 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse206 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse205 (select (store .cse206 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse205 (select (store .cse207 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse205 (select (store .cse207 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse205 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse205 (select (store .cse206 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse10) (or .cse153 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse210 (store .cse1 v_arrayElimCell_288 0)) (.cse208 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse209 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse208 (select (store .cse209 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse208 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse208 (select (store .cse210 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse208 (select (store .cse210 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse208 (select (store .cse209 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse211 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse212 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse211 (select (store .cse212 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse211 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse211 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse211 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse211 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse211 (select (store .cse212 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse10) (or (and (or .cse213 .cse153) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse214 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse215 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse214 (select (store .cse215 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse214 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse214 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse214 (select (store .cse215 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse10)) .cse11) (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse216 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse217 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse216 (select (store .cse217 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse216 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse216 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse216 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse216 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse216 (select (store .cse217 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or .cse218 .cse153) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse219 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse220 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse219 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse219 (select (store .cse220 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse219 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse219 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse219 (select (store .cse220 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) .cse10) (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse221 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse222 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse221 (select (store .cse222 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse221 (select (store .cse222 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse221 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse221 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse221 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse223 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse224 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse224 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse224 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse224 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse224 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse224 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse225 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse225 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse225 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse225 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse225 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse225 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or .cse11 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse226 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse226 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse226 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse226 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse227 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse227 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse227 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse227 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse227 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) .cse10) .cse228 (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse229 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse230 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse229 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse229 (select (store .cse230 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse229 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse229 (select (store .cse230 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or .cse231 .cse153) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse232 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse233 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse232 (select (store .cse233 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse232 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse232 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse232 (select (store (store .cse1 v_arrayElimCell_286 0) v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse232 (select (store .cse233 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) .cse10) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse234 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse235 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse234 (select (store .cse235 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse234 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse234 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse234 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse234 (select (store .cse235 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse153) (or .cse236 .cse0 .cse153) (or .cse237 .cse0 .cse153))) (or (and (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse238 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse238 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse238 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse238 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse238 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse238 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse239 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse239 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse239 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse239 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse239 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse239 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse240 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse240 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse240 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse240 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse240 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse242 (store .cse1 v_arrayElimCell_286 0)) (.cse241 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse241 (select (store .cse242 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse241 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse241 (select (store .cse242 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse241 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse241 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse241 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse244 (store .cse1 v_arrayElimCell_286 0)) (.cse243 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse243 (select (store .cse244 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse245 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse243 (select (store .cse245 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse243 (select (store .cse245 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse243 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse243 (select (store .cse244 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse243 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or .cse11 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse246 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse246 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse246 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse246 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse248 (store .cse1 v_arrayElimCell_286 0)) (.cse247 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse247 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse247 (select (store .cse248 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse247 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse247 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse247 (select (store .cse248 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse247 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or .cse11 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse250 (store .cse1 v_arrayElimCell_286 0)) (.cse249 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse249 (select (store .cse250 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse249 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse249 (select (store .cse250 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse249 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse252 (store .cse1 v_arrayElimCell_286 0)) (.cse251 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse251 (select (store .cse252 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse251 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse251 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse251 (select (store .cse252 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse251 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse253 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse254 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse253 (select (store .cse254 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse253 (select (store .cse254 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse253 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse253 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse253 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) .cse10) (or (and (or .cse11 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse255 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse255 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse255 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse256 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse256 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse256 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse256 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse256 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse258 (store .cse1 v_arrayElimCell_286 0)) (.cse257 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse257 (select (store .cse258 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse257 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse257 (select (store .cse258 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse257 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse260 (store .cse1 v_arrayElimCell_286 0)) (.cse259 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse259 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse259 (select (store .cse260 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse259 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse259 (select (store .cse260 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse259 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse262 (store .cse1 v_arrayElimCell_286 0)) (.cse261 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse261 (select (store .cse262 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse263 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse261 (select (store .cse263 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse261 (select (store .cse263 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse261 (select (store .cse262 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse261 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse264 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse264 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse264 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse264 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse265 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse265 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_288 Int)) (= .cse265 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse265 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse265 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse267 (store .cse1 v_arrayElimCell_286 0)) (.cse266 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse266 (select (store .cse267 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse266 (select (store .cse267 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse266 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse266 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse266 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse268 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse269 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse268 (select (store .cse269 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse268 (select (store .cse269 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse268 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse268 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or .cse11 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse271 (store .cse1 v_arrayElimCell_286 0)) (.cse270 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse270 (select (store .cse271 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse270 (select (store .cse271 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse270 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) .cse10) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse272 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse274 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_286 Int)) (let ((.cse273 (store .cse1 v_arrayElimCell_286 0))) (or (= .cse272 (select (store .cse273 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse272 (select (store .cse273 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse272 (select (store .cse274 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse272 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse272 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse272 (select (store .cse274 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse275 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse276 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse275 (select (store .cse276 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse275 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse275 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse275 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse275 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse275 (select (store .cse276 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse10) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse278 (store .cse1 v_arrayElimCell_286 0)) (.cse277 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse279 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse277 (select (store .cse278 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse277 (select (store .cse279 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse277 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse277 (select (store .cse278 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse277 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse277 (select (store .cse279 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse0) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse280 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_286 Int)) (let ((.cse281 (store .cse1 v_arrayElimCell_286 0))) (or (= .cse280 (select (store .cse281 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse280 (select (store .cse281 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse280 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse280 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse11 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse282 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse283 (store .cse1 v_arrayElimCell_286 0))) (or (= .cse282 (select (store .cse283 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse282 (select (store .cse283 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse10))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse284 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse286 (store .cse1 v_arrayElimCell_288 0))) (or (forall ((v_arrayElimCell_286 Int)) (let ((.cse285 (store .cse1 v_arrayElimCell_286 0))) (or (= .cse284 (select (store .cse285 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse284 (select (store .cse285 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse284 (select (store .cse286 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse284 (select (store .cse286 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse287 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse287 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse287 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse289 (store .cse1 v_arrayElimCell_286 0)) (.cse288 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse288 (select (store .cse289 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse288 (select (store .cse289 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse288 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse288 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse290 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse290 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse290 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse290 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse291 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse292 (store .cse1 v_arrayElimCell_286 0))) (or (= .cse291 (select (store .cse292 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse291 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse291 (select (store .cse292 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse10) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse293 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse293 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse293 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse293 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse10) (or .cse0 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse295 (store .cse1 v_arrayElimCell_286 0)) (.cse294 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse294 (select (store .cse295 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse294 (select (store .cse295 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse294 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse296 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse297 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse296 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse296 (select (store .cse297 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse296 (select (store .cse297 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse10)) .cse15) (or (and (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse298 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse299 (store .cse1 v_arrayElimCell_286 0))) (or (= .cse298 (select (store .cse299 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse300 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse298 (select (store .cse300 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse298 (select (store .cse300 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse298 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse298 (select (store .cse299 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse301 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse302 (store .cse1 v_arrayElimCell_286 0))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse301 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse301 (select (store .cse302 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse301 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse301 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse301 (select (store .cse302 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse303 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse304 (store .cse1 v_arrayElimCell_286 0))) (or (= .cse303 (select (store .cse304 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse303 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse303 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse303 (select (store .cse304 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse11 (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse305 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse306 (store .cse1 v_arrayElimCell_286 0))) (or (= .cse305 (select (store .cse306 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse305 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse305 (select (store .cse306 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse0) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse310 (store .cse1 v_arrayElimCell_288 0)) (.cse307 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse309 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_286 Int)) (let ((.cse308 (store .cse1 v_arrayElimCell_286 0))) (or (= .cse307 (select (store .cse308 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse307 (select (store .cse308 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse307 (select (store .cse309 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse307 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse307 (select (store .cse310 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse307 (select (store .cse310 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse307 (select (store .cse309 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or .cse0 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse312 (store .cse1 v_arrayElimCell_286 0)) (.cse311 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse313 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse311 (select (store .cse312 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse311 (select (store .cse313 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse311 (select (store .cse312 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse311 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse311 (select (store .cse313 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse314 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse316 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_286 Int)) (let ((.cse315 (store .cse1 v_arrayElimCell_286 0))) (or (= .cse314 (select (store .cse315 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse314 (select (store .cse315 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse314 (select (store .cse316 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse314 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse314 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse314 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse314 (select (store .cse316 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse317 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse318 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse317 (select (store .cse318 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse317 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse317 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse317 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse317 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse317 (select (store .cse318 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse320 (store .cse1 v_arrayElimCell_286 0)) (.cse319 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse321 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse319 (select (store .cse320 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse319 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse319 (select (store .cse321 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse319 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse319 (select (store .cse320 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse319 (select (store .cse321 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse323 (store .cse1 v_arrayElimCell_286 0)) (.cse322 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse324 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse322 (select (store .cse323 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse322 (select (store .cse324 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse322 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse322 (select (store .cse323 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse322 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse322 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse322 (select (store .cse324 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse325 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse326 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse325 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse325 (select (store .cse326 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse325 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse325 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse325 (select (store .cse326 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) .cse10) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse330 (store .cse1 v_arrayElimCell_288 0)) (.cse327 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse329 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_286 Int)) (let ((.cse328 (store .cse1 v_arrayElimCell_286 0))) (or (= .cse327 (select (store .cse328 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse327 (select (store .cse328 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse327 (select (store .cse329 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse327 (select (store .cse330 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse327 (select (store .cse330 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse327 (select (store .cse329 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse331 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse332 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse331 (select (store .cse332 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse331 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse331 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse331 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse331 (select (store .cse332 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse10) (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse333 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse335 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_286 Int)) (let ((.cse334 (store .cse1 v_arrayElimCell_286 0))) (or (= .cse333 (select (store .cse334 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse333 (select (store .cse334 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse333 (select (store .cse335 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse333 (select (store .cse335 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse336 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse337 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse336 (select (store .cse337 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse336 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse336 (select (store .cse337 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse10)) .cse11) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse340 (store .cse1 v_arrayElimCell_288 0)) (.cse338 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse339 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse338 (select (store .cse339 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse338 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse338 (select (store .cse340 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse338 (select (store .cse340 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse338 (select (store .cse339 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse10) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_286 Int) (v_arrayElimCell_288 Int)) (let ((.cse343 (store .cse1 v_arrayElimCell_288 0)) (.cse341 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse342 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse341 (select (store .cse342 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse341 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse341 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse341 (select (store .cse343 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse341 (select (store .cse343 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse341 (select (store .cse342 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse10) (or .cse11 (and (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse344 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse345 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse344 (select (store .cse345 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse344 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse344 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse344 (select (store .cse345 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse10) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse346 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse348 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_286 Int)) (let ((.cse347 (store .cse1 v_arrayElimCell_286 0))) (or (= .cse346 (select (store .cse347 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse346 (select (store .cse347 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse346 (select (store .cse348 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse346 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse346 (select (store .cse348 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse349 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse350 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse349 (select (store .cse350 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse349 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse349 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse349 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse349 (select (store .cse350 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse352 (store .cse1 v_arrayElimCell_286 0)) (.cse351 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse353 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse351 (select (store .cse352 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse351 (select (store .cse353 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse351 (select (store .cse352 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse351 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse351 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse351 (select (store .cse353 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse354 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse355 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse354 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse354 (select (store .cse355 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse354 (select (store (store .cse1 v_arrayElimCell_286 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse354 (select (store .cse355 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_286 Int)) (let ((.cse357 (store .cse1 v_arrayElimCell_286 0)) (.cse356 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse358 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse356 (select (store .cse357 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse356 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse356 (select (store .cse358 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse356 (select (store .cse357 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse356 (select (store .cse358 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) .cse10)) .cse2)) (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int)) (let ((.cse359 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse359 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse359 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse359 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int)) (let ((.cse360 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse360 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse360 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (or (forall ((v_arrayElimCell_283 Int)) (let ((.cse361 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse360 (select (store .cse361 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse360 (select (store .cse361 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse360 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse362 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse362 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse362 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse362 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (or (= .cse362 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse362 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse363 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse363 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse363 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse363 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse363 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (or .cse15 .cse73) (or .cse11 (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse364 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse364 (select .cse58 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (= .cse364 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (or .cse79 .cse15) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse365 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse365 (select .cse58 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (or (forall ((v_arrayElimCell_283 Int)) (let ((.cse366 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse365 (select (store .cse366 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse365 (select (store .cse366 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse365 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse367 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse367 (select .cse58 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (or (= .cse367 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse367 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))))) (or .cse81 .cse15) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse368 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse368 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse368 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse368 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_282 Int)) (or (forall ((v_arrayElimCell_283 Int)) (let ((.cse369 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse368 (select (store .cse369 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse368 (select (store .cse369 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (= .cse368 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int)) (let ((.cse370 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse370 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse370 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (or (= .cse370 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse370 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))) .cse7) (or .cse7 (and (forall ((v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse371 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse371 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse371 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse371 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse372 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse372 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse372 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse372 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse372 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))))))) (or .cse11 (forall ((v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse373 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse373 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse373 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))) (or .cse7 .cse92) (or (and (or (and .cse87 .cse89) .cse10) .cse88 .cse48 .cse374 (or .cse15 (and .cse375 (or (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse376 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse376 (select .cse14 v_antiDerIndex_entry0_1)) (= .cse376 (select .cse46 v_antiDerIndex_entry0_1))))) .cse11) (or (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse377 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse377 (select .cse14 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse377 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse377 (select .cse46 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse378 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse378 (select .cse14 v_antiDerIndex_entry0_1)) (= .cse378 (select .cse46 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse378 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse378 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))))))) .cse10) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse379 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse379 (select .cse14 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse380 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse379 (select (store .cse380 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse379 (select (store .cse380 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse379 (select .cse46 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse381 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse381 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse381 (select .cse14 v_antiDerIndex_entry0_1)) (= .cse381 (select .cse46 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse381 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) .cse51 (or (and .cse44 .cse47) .cse10) .cse53 (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse382 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse382 (select .cse14 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse383 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse382 (select (store .cse383 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse382 (select (store .cse383 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse382 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse382 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse384 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse384 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse384 (select .cse14 v_antiDerIndex_entry0_1)) (= .cse384 (select .cse46 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse384 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse384 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse385 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse385 (select .cse14 v_antiDerIndex_entry0_1)) (= .cse385 (select .cse46 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse385 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse385 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse385 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or .cse11 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse386 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse386 (select .cse14 v_antiDerIndex_entry0_1)) (= .cse386 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse386 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse387 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse387 (select .cse14 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse387 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse387 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse387 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) .cse10) (or .cse91 .cse10)) .cse2) (or (and (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse388 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse390 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse389 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse388 (select (store .cse389 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse388 (select (store .cse389 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse388 (select (store .cse390 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse388 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse388 (select (store .cse390 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or .cse236 .cse0) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse391 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse392 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse391 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse391 (select (store .cse392 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse391 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse391 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse391 (select (store .cse392 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or .cse213 .cse11) (or .cse218 .cse10)) .cse153) (or .cse153 (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse393 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse394 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse393 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse393 (select (store .cse394 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse393 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse393 (select (store .cse394 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or .cse231 .cse10) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse395 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse397 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse396 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse395 (select (store .cse396 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse395 (select (store .cse396 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse395 (select (store .cse397 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse395 (select (store .cse397 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or .cse108 .cse11) (or .cse237 .cse0))) (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse398 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse400 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse399 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse398 (select (store .cse399 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse398 (select (store .cse399 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse398 (select (store .cse400 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse398 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse398 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse398 (select (store .cse400 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse401 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse402 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse401 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse401 (select (store .cse402 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse401 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse401 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse401 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse401 (select (store .cse402 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or .cse11 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse403 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse404 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse403 (select (store .cse404 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse403 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse403 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse403 (select (store .cse404 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse405 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse406 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse405 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse405 (select (store .cse406 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse405 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse405 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse405 (select (store .cse406 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse407 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse408 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse407 (select (store .cse408 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse407 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse407 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse407 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse407 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse407 (select (store .cse408 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) .cse10) (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse409 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse411 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse410 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse409 (select (store .cse410 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse409 (select (store .cse410 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse409 (select (store .cse411 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse409 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse409 (select (store .cse411 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse412 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse413 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse412 (select (store .cse413 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse412 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse412 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse412 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse412 (select (store .cse413 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse414 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse415 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse414 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse414 (select (store .cse415 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse414 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse414 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse414 (select (store .cse415 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or .cse11 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse416 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse417 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse416 (select (store .cse417 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse416 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse416 (select (store .cse417 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse418 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse419 (store .cse1 v_arrayElimCell_283 0))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse418 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse418 (select (store .cse419 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse418 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse418 (select (store .cse419 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) .cse10) (or (and (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse420 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse420 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse420 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse421 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse421 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_288 Int)) (= .cse421 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse421 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse422 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse423 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse422 (select (store .cse423 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse422 (select (store .cse423 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse422 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse424 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse424 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse424 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse424 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))))))) (or .cse11 (forall ((v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1))))) .cse15 .cse10) (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse425 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse425 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse425 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse425 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse425 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse425 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse223 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse426 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse426 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse426 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse426 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse426 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or .cse11 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse427 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse427 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse427 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse427 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse428 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse429 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse428 (select (store .cse429 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse428 (select (store .cse429 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse428 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse428 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse428 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse430 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse430 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse430 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse430 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse430 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse430 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) .cse10) .cse228 (or (and (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse431 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse431 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_288 Int)) (= .cse431 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse431 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse431 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse184 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse432 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse433 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse432 (select (store .cse433 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse432 (select (store .cse433 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse432 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse432 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse434 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse434 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse434 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse11) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse435 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse435 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse435 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (= .cse435 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_arrayElimCell_285 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse436 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse436 (select (store .cse46 v_arrayElimCell_285 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse436 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse436 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse436 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) .cse10)) .cse2) (or (and .cse56 (or .cse7 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int)) (let ((.cse437 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse438 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse437 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse437 (select (store .cse438 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse437 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse437 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse437 (select (store .cse438 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) .cse89) .cse10) (or (and .cse74 (or (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse439 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse439 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse439 (select .cse58 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse439 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse439 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))))))) .cse75 (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int)) (let ((.cse440 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse440 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse440 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))))) .cse7)) .cse10) .cse375 (or .cse78 .cse11) (or .cse7 .cse77) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse441 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse441 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse441 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse441 (select .cse58 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse441 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse15) (or (and (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse442 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse443 (store .cse1 v_arrayElimCell_288 0))) (or (= .cse442 (select (store .cse443 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse442 (select (store .cse443 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse442 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse442 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse11 (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse444 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse444 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse444 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse445 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int)) (= .cse445 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse445 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse445 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse445 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_283 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse446 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse446 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse446 (select (store (store .cse1 v_arrayElimCell_283 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_288 Int)) (= .cse446 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse0) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse449 (store .cse1 v_arrayElimCell_288 0)) (.cse447 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse448 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse447 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse447 (select (store .cse448 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse447 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse447 (select (store .cse449 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse447 (select (store .cse449 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse447 (select (store .cse448 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse2) (or .cse2 (and (or (and .cse44 .cse47 (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse450 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse450 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse450 (select .cse58 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (or (= .cse450 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse450 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)))) (= .cse450 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse451 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (= .cse451 (select (store (store .cse1 v_arrayElimCell_288 0) v_arrayElimCell_287 0) v_antiDerIndex_entry0_1))) (= .cse451 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse451 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse451 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))) .cse10) .cse374 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse453 (store .cse1 v_arrayElimCell_288 0)) (.cse452 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse452 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse452 (select (store .cse453 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse452 (select (store .cse453 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse454 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse452 (select (store .cse454 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse452 (select (store .cse454 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse455 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse455 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse455 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse455 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse455 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse10) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse457 (store .cse1 v_arrayElimCell_288 0)) (.cse456 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse456 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse456 (select (store .cse457 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse456 (select (store .cse457 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse456 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse10) (or .cse11 (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse458 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse458 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse458 (select .cse58 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse459 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse458 (select (store .cse459 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse458 (select (store .cse459 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse460 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse460 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse460 (select .cse58 v_antiDerIndex_entry0_1)) (= .cse460 (select (store (store .cse1 v_arrayElimCell_283 0) v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse10))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_287 Int) (v_arrayElimCell_288 Int)) (let ((.cse461 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse461 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse461 (select (store .cse6 v_arrayElimCell_287 0) v_antiDerIndex_entry0_1)) (= .cse461 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int)) (let ((.cse462 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse461 (select (store .cse462 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse461 (select (store .cse462 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)))))))))) (or (forall ((v_arrayElimCell_283 Int) (v_arrayElimCell_282 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_288 Int)) (let ((.cse463 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse464 (store .cse1 v_arrayElimCell_283 0))) (or (= .cse463 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse463 (select (store .cse464 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse463 (select (store .cse6 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1)) (= .cse463 (select (store (store .cse1 v_arrayElimCell_288 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse463 (select (store .cse464 v_arrayElimCell_282 0) v_antiDerIndex_entry0_1))))) .cse0))))))) is different from false