./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 84cfde4a Calling Ultimate with: /root/.sdkman/candidates/java/current/bin/java -Dosgi.configuration.area=/storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate-clean/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-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate-clean/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-dev-84cfde4 [2024-10-11 18:19:39,100 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-10-11 18:19:39,160 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-10-11 18:19:39,165 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-10-11 18:19:39,166 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-10-11 18:19:39,185 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-10-11 18:19:39,185 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-10-11 18:19:39,186 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-10-11 18:19:39,186 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-10-11 18:19:39,187 INFO L153 SettingsManager]: * Use memory slicer=true [2024-10-11 18:19:39,187 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-10-11 18:19:39,188 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-10-11 18:19:39,188 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-10-11 18:19:39,189 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-10-11 18:19:39,189 INFO L153 SettingsManager]: * Use SBE=true [2024-10-11 18:19:39,189 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-10-11 18:19:39,190 INFO L153 SettingsManager]: * sizeof long=4 [2024-10-11 18:19:39,190 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-10-11 18:19:39,190 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-10-11 18:19:39,191 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-10-11 18:19:39,191 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-10-11 18:19:39,192 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-10-11 18:19:39,192 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-10-11 18:19:39,193 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-10-11 18:19:39,193 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-10-11 18:19:39,193 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-10-11 18:19:39,194 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-10-11 18:19:39,194 INFO L153 SettingsManager]: * sizeof long double=12 [2024-10-11 18:19:39,194 INFO L153 SettingsManager]: * Use constant arrays=true [2024-10-11 18:19:39,195 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2024-10-11 18:19:39,195 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-10-11 18:19:39,195 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-10-11 18:19:39,196 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-10-11 18:19:39,196 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:19:39,196 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-10-11 18:19:39,197 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-10-11 18:19:39,197 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-10-11 18:19:39,198 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-10-11 18:19:39,198 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-10-11 18:19:39,198 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-10-11 18:19:39,199 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-10-11 18:19:39,199 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-10-11 18:19:39,200 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-clean/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-clean/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-11 18:19:39,489 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-10-11 18:19:39,512 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-10-11 18:19:39,516 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-10-11 18:19:39,519 INFO L270 PluginConnector]: Initializing CDTParser... [2024-10-11 18:19:39,519 INFO L274 PluginConnector]: CDTParser initialized [2024-10-11 18:19:39,521 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-11 18:19:41,035 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-10-11 18:19:41,297 INFO L384 CDTParser]: Found 1 translation units. [2024-10-11 18:19:41,298 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2024-10-11 18:19:41,311 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bea832601/0244cfeaa2dc489db5cd8aa08a208628/FLAGa91c9293e [2024-10-11 18:19:41,325 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/data/bea832601/0244cfeaa2dc489db5cd8aa08a208628 [2024-10-11 18:19:41,327 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-10-11 18:19:41,329 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-10-11 18:19:41,330 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-10-11 18:19:41,331 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-10-11 18:19:41,338 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-10-11 18:19:41,339 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:19:41" (1/1) ... [2024-10-11 18:19:41,340 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@29a9f0a4 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:41, skipping insertion in model container [2024-10-11 18:19:41,340 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 11.10 06:19:41" (1/1) ... [2024-10-11 18:19:41,376 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-10-11 18:19:41,739 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:19:41,753 INFO L200 MainTranslator]: Completed pre-run [2024-10-11 18:19:41,811 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-10-11 18:19:41,852 INFO L204 MainTranslator]: Completed translation [2024-10-11 18:19:41,852 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:41 WrapperNode [2024-10-11 18:19:41,853 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-10-11 18:19:41,855 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-10-11 18:19:41,855 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-10-11 18:19:41,858 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-10-11 18:19:41,867 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:41" (1/1) ... [2024-10-11 18:19:41,879 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:41" (1/1) ... [2024-10-11 18:19:41,922 INFO L138 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 133 [2024-10-11 18:19:41,924 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-10-11 18:19:41,928 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-10-11 18:19:41,928 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-10-11 18:19:41,929 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-10-11 18:19:41,940 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:41" (1/1) ... [2024-10-11 18:19:41,940 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:41" (1/1) ... [2024-10-11 18:19:41,943 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:41" (1/1) ... [2024-10-11 18:19:41,996 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-11 18:19:42,000 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:41" (1/1) ... [2024-10-11 18:19:42,000 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:41" (1/1) ... [2024-10-11 18:19:42,014 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:41" (1/1) ... [2024-10-11 18:19:42,018 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:41" (1/1) ... [2024-10-11 18:19:42,020 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:41" (1/1) ... [2024-10-11 18:19:42,021 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:41" (1/1) ... [2024-10-11 18:19:42,025 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-10-11 18:19:42,026 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2024-10-11 18:19:42,027 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2024-10-11 18:19:42,027 INFO L274 PluginConnector]: RCFGBuilder initialized [2024-10-11 18:19:42,028 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:41" (1/1) ... [2024-10-11 18:19:42,034 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-10-11 18:19:42,044 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:19:42,059 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-10-11 18:19:42,061 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-10-11 18:19:42,105 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-10-11 18:19:42,105 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-10-11 18:19:42,105 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-10-11 18:19:42,105 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-10-11 18:19:42,106 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-10-11 18:19:42,106 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-10-11 18:19:42,107 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-10-11 18:19:42,107 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-10-11 18:19:42,212 INFO L238 CfgBuilder]: Building ICFG [2024-10-11 18:19:42,214 INFO L264 CfgBuilder]: Building CFG for each procedure with an implementation [2024-10-11 18:19:42,234 INFO L733 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-10-11 18:19:42,568 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-10-11 18:19:42,568 INFO L287 CfgBuilder]: Performing block encoding [2024-10-11 18:19:42,615 INFO L309 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-10-11 18:19:42,615 INFO L314 CfgBuilder]: Removed 1 assume(true) statements. [2024-10-11 18:19:42,615 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:19:42 BoogieIcfgContainer [2024-10-11 18:19:42,616 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2024-10-11 18:19:42,619 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-10-11 18:19:42,622 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-10-11 18:19:42,625 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-10-11 18:19:42,626 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 11.10 06:19:41" (1/3) ... [2024-10-11 18:19:42,627 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10eeec47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:19:42, skipping insertion in model container [2024-10-11 18:19:42,627 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 11.10 06:19:41" (2/3) ... [2024-10-11 18:19:42,628 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@10eeec47 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 11.10 06:19:42, skipping insertion in model container [2024-10-11 18:19:42,628 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 11.10 06:19:42" (3/3) ... [2024-10-11 18:19:42,630 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-1.i [2024-10-11 18:19:42,649 INFO L209 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-10-11 18:19:42,650 INFO L149 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2024-10-11 18:19:42,710 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-10-11 18:19:42,718 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;@4742cf80, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-10-11 18:19:42,719 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-10-11 18:19:42,725 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-11 18:19:42,734 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 18:19:42,734 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:42,734 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 18:19:42,735 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-11 18:19:42,742 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:42,743 INFO L85 PathProgramCache]: Analyzing trace with hash 218566, now seen corresponding path program 1 times [2024-10-11 18:19:42,751 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:42,751 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1438779710] [2024-10-11 18:19:42,751 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:42,752 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:42,847 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:42,944 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-11 18:19:42,947 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:42,947 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1438779710] [2024-10-11 18:19:42,948 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1438779710] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:42,949 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:42,949 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:19:42,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [522880543] [2024-10-11 18:19:42,952 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:42,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:19:42,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:42,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:19:42,987 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:19:42,989 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-11 18:19:43,108 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:43,108 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2024-10-11 18:19:43,111 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:19:43,112 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-11 18:19:43,112 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:43,122 INFO L225 Difference]: With dead ends: 128 [2024-10-11 18:19:43,124 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 18:19:43,126 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-11 18:19:43,130 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-11 18:19:43,131 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-11 18:19:43,152 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 18:19:43,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-11 18:19:43,178 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-11 18:19:43,180 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2024-10-11 18:19:43,183 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 3 [2024-10-11 18:19:43,183 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:43,184 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2024-10-11 18:19:43,184 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-11 18:19:43,186 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2024-10-11 18:19:43,186 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2024-10-11 18:19:43,186 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:43,186 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1] [2024-10-11 18:19:43,187 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-10-11 18:19:43,187 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-11 18:19:43,188 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:43,189 INFO L85 PathProgramCache]: Analyzing trace with hash 218567, now seen corresponding path program 1 times [2024-10-11 18:19:43,190 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:43,190 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [385591618] [2024-10-11 18:19:43,190 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:43,190 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:43,210 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:43,294 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-11 18:19:43,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:43,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [385591618] [2024-10-11 18:19:43,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [385591618] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:43,296 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:43,296 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2024-10-11 18:19:43,296 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [499366738] [2024-10-11 18:19:43,296 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:43,298 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:19:43,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:43,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:19:43,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:19:43,301 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-11 18:19:43,357 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:43,357 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2024-10-11 18:19:43,361 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:19:43,361 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-11 18:19:43,361 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:43,362 INFO L225 Difference]: With dead ends: 120 [2024-10-11 18:19:43,362 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 18:19:43,363 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-11 18:19:43,364 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-11 18:19:43,366 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-11 18:19:43,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 18:19:43,380 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-11 18:19:43,381 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-11 18:19:43,383 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2024-10-11 18:19:43,385 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 3 [2024-10-11 18:19:43,386 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:43,386 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2024-10-11 18:19:43,386 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-11 18:19:43,386 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2024-10-11 18:19:43,387 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:19:43,387 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:43,387 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:43,388 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-10-11 18:19:43,388 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-11 18:19:43,389 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:43,389 INFO L85 PathProgramCache]: Analyzing trace with hash -8198272, now seen corresponding path program 1 times [2024-10-11 18:19:43,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:43,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [445895143] [2024-10-11 18:19:43,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:43,389 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:43,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:43,494 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-11 18:19:43,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:43,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [445895143] [2024-10-11 18:19:43,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [445895143] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:43,497 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:43,497 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:19:43,497 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1941836609] [2024-10-11 18:19:43,497 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:43,498 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:19:43,498 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:43,498 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:19:43,499 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:19:43,499 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-11 18:19:43,530 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:43,531 INFO L93 Difference]: Finished difference Result 128 states and 133 transitions. [2024-10-11 18:19:43,532 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:19:43,532 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-11 18:19:43,533 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:43,535 INFO L225 Difference]: With dead ends: 128 [2024-10-11 18:19:43,536 INFO L226 Difference]: Without dead ends: 128 [2024-10-11 18:19:43,537 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-11 18:19:43,538 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-11 18:19:43,538 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-11 18:19:43,539 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 128 states. [2024-10-11 18:19:43,548 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 128 to 121. [2024-10-11 18:19:43,550 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-11 18:19:43,551 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2024-10-11 18:19:43,552 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 7 [2024-10-11 18:19:43,552 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:43,553 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2024-10-11 18:19:43,554 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-11 18:19:43,554 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2024-10-11 18:19:43,554 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:19:43,555 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:43,555 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:43,556 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-10-11 18:19:43,556 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-11 18:19:43,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:43,557 INFO L85 PathProgramCache]: Analyzing trace with hash -8196735, now seen corresponding path program 1 times [2024-10-11 18:19:43,557 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:43,557 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1955621035] [2024-10-11 18:19:43,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:43,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:43,579 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:43,676 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-11 18:19:43,677 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:43,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1955621035] [2024-10-11 18:19:43,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1955621035] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:43,677 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:43,677 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:19:43,677 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1343579817] [2024-10-11 18:19:43,677 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:43,678 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:19:43,678 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:43,678 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:19:43,678 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:19:43,678 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-11 18:19:43,757 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:43,757 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2024-10-11 18:19:43,758 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:19:43,758 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-11 18:19:43,758 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:43,759 INFO L225 Difference]: With dead ends: 120 [2024-10-11 18:19:43,759 INFO L226 Difference]: Without dead ends: 120 [2024-10-11 18:19:43,759 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-11 18:19:43,760 INFO L432 NwaCegarLoop]: 114 mSDtfsCounter, 3 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11 18:19:43,761 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-11 18:19:43,763 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2024-10-11 18:19:43,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2024-10-11 18:19:43,769 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-11 18:19:43,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2024-10-11 18:19:43,771 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 7 [2024-10-11 18:19:43,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:43,771 INFO L471 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2024-10-11 18:19:43,771 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-11 18:19:43,771 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2024-10-11 18:19:43,772 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2024-10-11 18:19:43,772 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:43,772 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:43,772 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-10-11 18:19:43,772 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-11 18:19:43,773 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:43,773 INFO L85 PathProgramCache]: Analyzing trace with hash -8196734, now seen corresponding path program 1 times [2024-10-11 18:19:43,773 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:43,774 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [669301623] [2024-10-11 18:19:43,774 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:43,774 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:43,790 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:43,883 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-11 18:19:43,884 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:43,884 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [669301623] [2024-10-11 18:19:43,884 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [669301623] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:43,884 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:43,884 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:19:43,885 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1635754732] [2024-10-11 18:19:43,885 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:43,885 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:19:43,885 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:43,886 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:19:43,886 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:19:43,886 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-11 18:19:43,915 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:43,918 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2024-10-11 18:19:43,919 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:19:43,919 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-11 18:19:43,919 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:43,920 INFO L225 Difference]: With dead ends: 119 [2024-10-11 18:19:43,920 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 18:19:43,920 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-11 18:19:43,921 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-11 18:19:43,921 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-11 18:19:43,924 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 18:19:43,932 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-11 18:19:43,932 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-11 18:19:43,933 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2024-10-11 18:19:43,933 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 7 [2024-10-11 18:19:43,933 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:43,934 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2024-10-11 18:19:43,934 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-11 18:19:43,934 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2024-10-11 18:19:43,934 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:19:43,934 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:43,934 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:43,934 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-10-11 18:19:43,935 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-11 18:19:43,936 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:43,936 INFO L85 PathProgramCache]: Analyzing trace with hash -254098774, now seen corresponding path program 1 times [2024-10-11 18:19:43,936 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:43,937 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [756452237] [2024-10-11 18:19:43,937 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:43,937 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:43,962 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:44,119 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-11 18:19:44,120 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:44,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [756452237] [2024-10-11 18:19:44,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [756452237] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:44,121 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:44,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-10-11 18:19:44,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1864809847] [2024-10-11 18:19:44,122 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:44,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:19:44,123 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:44,123 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:19:44,124 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:19:44,124 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-11 18:19:44,258 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:44,258 INFO L93 Difference]: Finished difference Result 122 states and 128 transitions. [2024-10-11 18:19:44,258 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:19:44,259 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-11 18:19:44,261 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:44,262 INFO L225 Difference]: With dead ends: 122 [2024-10-11 18:19:44,262 INFO L226 Difference]: Without dead ends: 122 [2024-10-11 18:19:44,262 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-11 18:19:44,263 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-11 18:19:44,263 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-11 18:19:44,268 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-11 18:19:44,271 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-11 18:19:44,272 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-11 18:19:44,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 128 transitions. [2024-10-11 18:19:44,273 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 128 transitions. Word has length 8 [2024-10-11 18:19:44,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:44,273 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 128 transitions. [2024-10-11 18:19:44,273 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-11 18:19:44,274 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 128 transitions. [2024-10-11 18:19:44,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2024-10-11 18:19:44,274 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:44,274 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:44,274 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-10-11 18:19:44,275 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-11 18:19:44,275 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:44,275 INFO L85 PathProgramCache]: Analyzing trace with hash -254098773, now seen corresponding path program 1 times [2024-10-11 18:19:44,275 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:44,276 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1140154921] [2024-10-11 18:19:44,276 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:44,276 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:44,288 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:44,437 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-11 18:19:44,437 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:44,437 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1140154921] [2024-10-11 18:19:44,438 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1140154921] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:44,438 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:44,438 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:19:44,438 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1455898844] [2024-10-11 18:19:44,438 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:44,438 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-10-11 18:19:44,438 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:44,439 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-10-11 18:19:44,439 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2024-10-11 18:19:44,439 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-11 18:19:44,578 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:44,579 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2024-10-11 18:19:44,579 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:19:44,580 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-11 18:19:44,580 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:44,580 INFO L225 Difference]: With dead ends: 122 [2024-10-11 18:19:44,580 INFO L226 Difference]: Without dead ends: 122 [2024-10-11 18:19:44,581 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:19:44,582 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-11 18:19:44,582 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-11 18:19:44,583 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2024-10-11 18:19:44,587 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2024-10-11 18:19:44,591 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-11 18:19:44,594 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2024-10-11 18:19:44,595 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 8 [2024-10-11 18:19:44,595 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:44,595 INFO L471 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2024-10-11 18:19:44,595 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-11 18:19:44,595 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2024-10-11 18:19:44,596 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-10-11 18:19:44,596 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:44,596 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:44,596 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-10-11 18:19:44,596 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-11 18:19:44,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:44,597 INFO L85 PathProgramCache]: Analyzing trace with hash -2119614211, now seen corresponding path program 1 times [2024-10-11 18:19:44,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:44,614 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1004881322] [2024-10-11 18:19:44,614 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:44,614 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:44,631 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:44,665 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-11 18:19:44,666 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:44,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1004881322] [2024-10-11 18:19:44,666 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1004881322] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:19:44,666 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [544609042] [2024-10-11 18:19:44,666 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:44,667 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:44,667 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:19:44,669 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:19:44,671 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-10-11 18:19:44,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:44,747 INFO L255 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 3 conjuncts are in the unsatisfiable core [2024-10-11 18:19:44,753 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:19:44,812 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-11 18:19:44,813 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:19:44,840 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-11 18:19:44,841 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [544609042] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:19:44,841 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:19:44,841 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2024-10-11 18:19:44,841 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [286872550] [2024-10-11 18:19:44,842 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:19:44,842 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-10-11 18:19:44,842 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:44,843 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-10-11 18:19:44,843 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2024-10-11 18:19:44,843 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-11 18:19:44,868 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:44,869 INFO L93 Difference]: Finished difference Result 123 states and 128 transitions. [2024-10-11 18:19:44,869 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-10-11 18:19:44,869 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-11 18:19:44,870 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:44,870 INFO L225 Difference]: With dead ends: 123 [2024-10-11 18:19:44,870 INFO L226 Difference]: Without dead ends: 123 [2024-10-11 18:19:44,871 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-11 18:19:44,872 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-11 18:19:44,875 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-11 18:19:44,876 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2024-10-11 18:19:44,884 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2024-10-11 18:19:44,884 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-11 18:19:44,885 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2024-10-11 18:19:44,886 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 11 [2024-10-11 18:19:44,886 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:44,887 INFO L471 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2024-10-11 18:19:44,887 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-11 18:19:44,887 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2024-10-11 18:19:44,887 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 18:19:44,888 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:44,888 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:44,908 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-10-11 18:19:45,092 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:45,093 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-11 18:19:45,094 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:45,094 INFO L85 PathProgramCache]: Analyzing trace with hash -1283483443, now seen corresponding path program 1 times [2024-10-11 18:19:45,094 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:45,094 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1863253032] [2024-10-11 18:19:45,094 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:45,094 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:45,125 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:45,243 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-11 18:19:45,243 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:45,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1863253032] [2024-10-11 18:19:45,243 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1863253032] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:19:45,243 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [215865857] [2024-10-11 18:19:45,243 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:45,244 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:45,244 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:19:45,248 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:19:45,250 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-10-11 18:19:45,329 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:45,331 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-10-11 18:19:45,332 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:19:45,364 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-11 18:19:45,397 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:19:45,397 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-11 18:19:45,412 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-11 18:19:45,412 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:19:45,445 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-11 18:19:45,446 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [215865857] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:19:45,446 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:19:45,446 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-10-11 18:19:45,446 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557855721] [2024-10-11 18:19:45,446 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:19:45,446 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:19:45,446 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:45,447 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:19:45,447 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:19:45,447 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-11 18:19:45,548 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:45,548 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2024-10-11 18:19:45,549 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-10-11 18:19:45,549 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-11 18:19:45,549 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:45,550 INFO L225 Difference]: With dead ends: 121 [2024-10-11 18:19:45,550 INFO L226 Difference]: Without dead ends: 121 [2024-10-11 18:19:45,550 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-11 18:19:45,551 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-11 18:19:45,551 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-11 18:19:45,552 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-10-11 18:19:45,556 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-10-11 18:19:45,556 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-11 18:19:45,557 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2024-10-11 18:19:45,557 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 12 [2024-10-11 18:19:45,557 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:45,557 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2024-10-11 18:19:45,557 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-11 18:19:45,557 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2024-10-11 18:19:45,558 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2024-10-11 18:19:45,558 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:45,558 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:45,584 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-10-11 18:19:45,758 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,3 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:45,759 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-11 18:19:45,759 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:45,759 INFO L85 PathProgramCache]: Analyzing trace with hash -1283483442, now seen corresponding path program 1 times [2024-10-11 18:19:45,759 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:45,760 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [678283308] [2024-10-11 18:19:45,760 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:45,760 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:45,777 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:45,952 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-11 18:19:45,953 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:45,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [678283308] [2024-10-11 18:19:45,953 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [678283308] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:19:45,953 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [634344783] [2024-10-11 18:19:45,953 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:45,953 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:45,954 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:19:45,955 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:19:45,957 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-10-11 18:19:46,025 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:46,027 INFO L255 TraceCheckSpWp]: Trace formula consists of 120 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-10-11 18:19:46,028 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:19:46,064 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-11 18:19:46,105 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:19:46,106 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-11 18:19:46,136 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-11 18:19:46,137 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:19:46,254 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-11 18:19:46,255 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [634344783] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:19:46,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:19:46,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 3, 4] total 8 [2024-10-11 18:19:46,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1742171317] [2024-10-11 18:19:46,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:19:46,256 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2024-10-11 18:19:46,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:46,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2024-10-11 18:19:46,256 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=24, Invalid=48, Unknown=0, NotChecked=0, Total=72 [2024-10-11 18:19:46,257 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-11 18:19:46,312 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:46,312 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2024-10-11 18:19:46,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:19:46,313 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-11 18:19:46,313 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:46,314 INFO L225 Difference]: With dead ends: 119 [2024-10-11 18:19:46,314 INFO L226 Difference]: Without dead ends: 119 [2024-10-11 18:19:46,314 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-11 18:19:46,315 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-11 18:19:46,315 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-11 18:19:46,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-10-11 18:19:46,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2024-10-11 18:19:46,318 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-11 18:19:46,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2024-10-11 18:19:46,319 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 12 [2024-10-11 18:19:46,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:46,319 INFO L471 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2024-10-11 18:19:46,319 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-11 18:19:46,320 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2024-10-11 18:19:46,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:19:46,320 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:46,320 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:46,340 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-10-11 18:19:46,524 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:46,525 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-11 18:19:46,525 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:46,526 INFO L85 PathProgramCache]: Analyzing trace with hash 1303772338, now seen corresponding path program 1 times [2024-10-11 18:19:46,526 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:46,526 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378188047] [2024-10-11 18:19:46,526 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:46,526 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:46,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:46,581 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-11 18:19:46,581 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:46,581 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378188047] [2024-10-11 18:19:46,582 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378188047] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:46,582 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:46,582 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-10-11 18:19:46,582 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1355161097] [2024-10-11 18:19:46,582 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:46,583 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-10-11 18:19:46,583 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:46,583 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-10-11 18:19:46,584 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-10-11 18:19:46,584 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-11 18:19:46,651 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:46,651 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2024-10-11 18:19:46,652 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-10-11 18:19:46,652 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-11 18:19:46,652 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:46,653 INFO L225 Difference]: With dead ends: 116 [2024-10-11 18:19:46,653 INFO L226 Difference]: Without dead ends: 116 [2024-10-11 18:19:46,653 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-11 18:19:46,654 INFO L432 NwaCegarLoop]: 101 mSDtfsCounter, 19 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 62 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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.1s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:46,654 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.1s Time] [2024-10-11 18:19:46,655 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2024-10-11 18:19:46,656 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2024-10-11 18:19:46,657 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-11 18:19:46,657 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2024-10-11 18:19:46,658 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 16 [2024-10-11 18:19:46,658 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:46,658 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2024-10-11 18:19:46,658 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-11 18:19:46,658 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2024-10-11 18:19:46,659 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-10-11 18:19:46,659 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:46,659 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:46,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-10-11 18:19:46,659 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-11 18:19:46,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:46,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1303772339, now seen corresponding path program 1 times [2024-10-11 18:19:46,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:46,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1749250546] [2024-10-11 18:19:46,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:46,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:46,677 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:46,804 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-11 18:19:46,804 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:46,804 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1749250546] [2024-10-11 18:19:46,805 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1749250546] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:46,805 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:46,805 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:19:46,805 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [942087398] [2024-10-11 18:19:46,805 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:46,806 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:19:46,806 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:46,806 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:19:46,806 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:19:46,806 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-11 18:19:46,902 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:46,902 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2024-10-11 18:19:46,903 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:19:46,903 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-11 18:19:46,903 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:46,904 INFO L225 Difference]: With dead ends: 109 [2024-10-11 18:19:46,904 INFO L226 Difference]: Without dead ends: 109 [2024-10-11 18:19:46,904 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-11 18:19:46,904 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-11 18:19:46,905 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-11 18:19:46,905 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-10-11 18:19:46,908 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-10-11 18:19:46,909 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-11 18:19:46,909 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2024-10-11 18:19:46,910 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 16 [2024-10-11 18:19:46,910 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:46,910 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2024-10-11 18:19:46,910 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-11 18:19:46,910 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2024-10-11 18:19:46,911 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:19:46,911 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:46,911 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:46,911 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-10-11 18:19:46,911 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-11 18:19:46,912 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:46,912 INFO L85 PathProgramCache]: Analyzing trace with hash 1546954811, now seen corresponding path program 1 times [2024-10-11 18:19:46,912 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:46,912 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [134470225] [2024-10-11 18:19:46,912 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:46,913 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:46,939 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:47,024 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-11 18:19:47,025 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:47,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [134470225] [2024-10-11 18:19:47,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [134470225] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:47,025 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:47,025 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-10-11 18:19:47,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1664270141] [2024-10-11 18:19:47,026 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:47,026 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-10-11 18:19:47,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:47,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-10-11 18:19:47,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2024-10-11 18:19:47,027 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-11 18:19:47,163 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:47,164 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2024-10-11 18:19:47,164 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2024-10-11 18:19:47,164 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-11 18:19:47,165 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:47,165 INFO L225 Difference]: With dead ends: 104 [2024-10-11 18:19:47,165 INFO L226 Difference]: Without dead ends: 104 [2024-10-11 18:19:47,165 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-11 18:19:47,167 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-11 18:19:47,169 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-11 18:19:47,170 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-10-11 18:19:47,171 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2024-10-11 18:19:47,172 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-11 18:19:47,172 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2024-10-11 18:19:47,172 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 20 [2024-10-11 18:19:47,174 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:47,174 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2024-10-11 18:19:47,174 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-11 18:19:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2024-10-11 18:19:47,175 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:19:47,175 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:47,175 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:47,175 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2024-10-11 18:19:47,176 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-11 18:19:47,176 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:47,176 INFO L85 PathProgramCache]: Analyzing trace with hash 1546993793, now seen corresponding path program 1 times [2024-10-11 18:19:47,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:47,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1158676418] [2024-10-11 18:19:47,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:47,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:47,213 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:47,429 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-11 18:19:47,429 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:47,429 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1158676418] [2024-10-11 18:19:47,429 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1158676418] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:47,429 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:47,429 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:19:47,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1756331185] [2024-10-11 18:19:47,429 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:47,430 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:19:47,430 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:47,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:19:47,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:19:47,431 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-11 18:19:47,529 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:47,530 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2024-10-11 18:19:47,530 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:19:47,530 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-11 18:19:47,531 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:47,532 INFO L225 Difference]: With dead ends: 99 [2024-10-11 18:19:47,532 INFO L226 Difference]: Without dead ends: 99 [2024-10-11 18:19:47,532 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-11 18:19:47,533 INFO L432 NwaCegarLoop]: 78 mSDtfsCounter, 60 mSDsluCounter, 240 mSDsCounter, 0 mSdLazyCounter, 105 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s 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-11 18:19:47,533 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-11 18:19:47,534 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2024-10-11 18:19:47,535 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2024-10-11 18:19:47,535 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-11 18:19:47,536 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2024-10-11 18:19:47,536 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 20 [2024-10-11 18:19:47,536 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:47,536 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2024-10-11 18:19:47,537 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-11 18:19:47,537 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2024-10-11 18:19:47,537 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2024-10-11 18:19:47,537 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:47,537 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:47,538 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-10-11 18:19:47,538 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-11 18:19:47,539 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:47,539 INFO L85 PathProgramCache]: Analyzing trace with hash 1546992577, now seen corresponding path program 1 times [2024-10-11 18:19:47,539 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:47,539 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1906540859] [2024-10-11 18:19:47,539 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:47,540 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:47,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:47,994 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-11 18:19:47,995 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:47,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1906540859] [2024-10-11 18:19:47,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1906540859] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:19:47,995 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [816253813] [2024-10-11 18:19:47,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:47,995 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:47,996 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:19:47,997 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:19:47,999 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-10-11 18:19:48,097 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:48,100 INFO L255 TraceCheckSpWp]: Trace formula consists of 190 conjuncts, 38 conjuncts are in the unsatisfiable core [2024-10-11 18:19:48,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:19:48,113 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-11 18:19:48,169 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-11 18:19:48,170 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-11 18:19:48,207 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-11 18:19:48,256 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-11 18:19:48,277 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-11 18:19:48,292 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-11 18:19:48,302 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-11 18:19:48,327 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-11 18:19:48,338 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-11 18:19:48,339 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:19:48,439 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:48,439 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-11 18:19:48,447 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-11 18:19:48,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-11 18:19:48,464 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-10-11 18:19:48,653 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:19:48,654 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-11 18:19:48,664 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-11 18:19:48,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [816253813] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:19:48,664 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:19:48,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 10] total 18 [2024-10-11 18:19:48,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [767274138] [2024-10-11 18:19:48,664 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:19:48,665 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2024-10-11 18:19:48,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:48,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2024-10-11 18:19:48,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=281, Unknown=14, NotChecked=0, Total=342 [2024-10-11 18:19:48,666 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-11 18:19:49,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:49,169 INFO L93 Difference]: Finished difference Result 97 states and 102 transitions. [2024-10-11 18:19:49,170 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-10-11 18:19:49,170 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-11 18:19:49,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:49,171 INFO L225 Difference]: With dead ends: 97 [2024-10-11 18:19:49,171 INFO L226 Difference]: Without dead ends: 97 [2024-10-11 18:19:49,171 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=100, Invalid=486, Unknown=14, NotChecked=0, Total=600 [2024-10-11 18:19:49,173 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 69 mSDsluCounter, 706 mSDsCounter, 0 mSdLazyCounter, 415 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:49,174 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.3s Time] [2024-10-11 18:19:49,174 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2024-10-11 18:19:49,176 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 94. [2024-10-11 18:19:49,176 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-11 18:19:49,177 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2024-10-11 18:19:49,177 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 20 [2024-10-11 18:19:49,177 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:49,177 INFO L471 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2024-10-11 18:19:49,177 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-11 18:19:49,178 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2024-10-11 18:19:49,178 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:19:49,178 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:49,178 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:49,195 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2024-10-11 18:19:49,382 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable14 [2024-10-11 18:19:49,383 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-11 18:19:49,383 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:49,383 INFO L85 PathProgramCache]: Analyzing trace with hash 712167507, now seen corresponding path program 1 times [2024-10-11 18:19:49,383 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:49,383 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1590312413] [2024-10-11 18:19:49,383 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:49,384 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:49,408 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:49,634 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-11 18:19:49,634 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:49,634 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1590312413] [2024-10-11 18:19:49,634 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1590312413] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:49,634 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:49,635 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-10-11 18:19:49,635 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [390774342] [2024-10-11 18:19:49,635 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:49,635 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-10-11 18:19:49,635 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:49,636 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-10-11 18:19:49,636 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-10-11 18:19:49,636 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-11 18:19:49,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:49,856 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2024-10-11 18:19:49,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:19:49,857 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-11 18:19:49,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:49,858 INFO L225 Difference]: With dead ends: 89 [2024-10-11 18:19:49,858 INFO L226 Difference]: Without dead ends: 89 [2024-10-11 18:19:49,858 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-11 18:19:49,859 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 63 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 240 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s 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.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:49,859 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.2s Time] [2024-10-11 18:19:49,860 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2024-10-11 18:19:49,862 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2024-10-11 18:19:49,862 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-11 18:19:49,863 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2024-10-11 18:19:49,863 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 21 [2024-10-11 18:19:49,863 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:49,863 INFO L471 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2024-10-11 18:19:49,863 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-11 18:19:49,863 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2024-10-11 18:19:49,864 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2024-10-11 18:19:49,865 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:49,865 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-10-11 18:19:49,865 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2024-10-11 18:19:49,865 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-11 18:19:49,866 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:49,866 INFO L85 PathProgramCache]: Analyzing trace with hash 712129773, now seen corresponding path program 1 times [2024-10-11 18:19:49,866 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:49,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948244601] [2024-10-11 18:19:49,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:49,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:49,894 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:50,274 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-11 18:19:50,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:50,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948244601] [2024-10-11 18:19:50,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948244601] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:19:50,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [811679662] [2024-10-11 18:19:50,275 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:50,275 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:50,275 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:19:50,277 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:19:50,279 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-10-11 18:19:50,379 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:50,387 INFO L255 TraceCheckSpWp]: Trace formula consists of 192 conjuncts, 30 conjuncts are in the unsatisfiable core [2024-10-11 18:19:50,389 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:19:50,396 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-11 18:19:50,429 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:19:50,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 12 treesize of output 14 [2024-10-11 18:19:50,484 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-11 18:19:50,485 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-11 18:19:50,509 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-11 18:19:50,560 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-11 18:19:50,653 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-11 18:19:50,693 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-11 18:19:50,767 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:50,768 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-11 18:19:50,780 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-11 18:19:50,781 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:19:54,866 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-11 18:19:54,884 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:54,884 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-11 18:19:54,888 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-11 18:19:54,894 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-11 18:19:54,921 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-11 18:19:55,119 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-11 18:19:55,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [811679662] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:19:55,119 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:19:55,119 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 8, 9] total 22 [2024-10-11 18:19:55,119 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [168146226] [2024-10-11 18:19:55,119 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:19:55,120 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 18:19:55,120 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:55,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 18:19:55,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=394, Unknown=7, NotChecked=40, Total=506 [2024-10-11 18:19:55,121 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-11 18:19:55,791 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:55,792 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2024-10-11 18:19:55,792 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2024-10-11 18:19:55,792 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-11 18:19:55,793 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:55,793 INFO L225 Difference]: With dead ends: 87 [2024-10-11 18:19:55,793 INFO L226 Difference]: Without dead ends: 87 [2024-10-11 18:19:55,794 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 28 SyntacticMatches, 2 SemanticMatches, 29 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 154 ImplicationChecksByTransitivity, 4.6s TimeCoverageRelationStatistics Valid=154, Invalid=713, Unknown=7, NotChecked=56, Total=930 [2024-10-11 18:19:55,794 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 68 mSDsluCounter, 354 mSDsCounter, 0 mSdLazyCounter, 597 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s 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.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:55,795 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.4s Time] [2024-10-11 18:19:55,795 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2024-10-11 18:19:55,796 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2024-10-11 18:19:55,797 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-11 18:19:55,797 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2024-10-11 18:19:55,797 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 21 [2024-10-11 18:19:55,798 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:55,798 INFO L471 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2024-10-11 18:19:55,798 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-11 18:19:55,798 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2024-10-11 18:19:55,799 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:19:55,799 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:55,799 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-11 18:19:55,820 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Forceful destruction successful, exit code 0 [2024-10-11 18:19:55,999 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable16 [2024-10-11 18:19:56,000 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-11 18:19:56,001 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:56,001 INFO L85 PathProgramCache]: Analyzing trace with hash 602356419, now seen corresponding path program 1 times [2024-10-11 18:19:56,001 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:56,001 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1947020718] [2024-10-11 18:19:56,001 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:56,001 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:56,032 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:56,257 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-11 18:19:56,257 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:56,257 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1947020718] [2024-10-11 18:19:56,257 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1947020718] provided 1 perfect and 0 imperfect interpolant sequences [2024-10-11 18:19:56,257 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-10-11 18:19:56,258 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-10-11 18:19:56,258 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1156194060] [2024-10-11 18:19:56,258 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-10-11 18:19:56,258 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-10-11 18:19:56,258 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:56,259 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-10-11 18:19:56,259 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2024-10-11 18:19:56,259 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-11 18:19:56,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:56,390 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2024-10-11 18:19:56,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-10-11 18:19:56,390 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-11 18:19:56,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:56,391 INFO L225 Difference]: With dead ends: 83 [2024-10-11 18:19:56,391 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 18:19:56,391 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-11 18:19:56,392 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-11 18:19:56,392 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-11 18:19:56,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 18:19:56,394 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2024-10-11 18:19:56,395 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-11 18:19:56,395 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2024-10-11 18:19:56,395 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 22 [2024-10-11 18:19:56,396 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:56,396 INFO L471 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2024-10-11 18:19:56,396 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-11 18:19:56,396 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2024-10-11 18:19:56,397 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2024-10-11 18:19:56,398 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:56,398 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-11 18:19:56,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2024-10-11 18:19:56,398 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-11 18:19:56,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:56,400 INFO L85 PathProgramCache]: Analyzing trace with hash 601186627, now seen corresponding path program 1 times [2024-10-11 18:19:56,400 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:56,400 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [549155965] [2024-10-11 18:19:56,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:56,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:56,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:56,733 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-11 18:19:56,734 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:56,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [549155965] [2024-10-11 18:19:56,734 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [549155965] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:19:56,734 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1174659889] [2024-10-11 18:19:56,734 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:56,734 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:56,734 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:19:56,736 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:19:56,738 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-10-11 18:19:56,850 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:56,852 INFO L255 TraceCheckSpWp]: Trace formula consists of 194 conjuncts, 33 conjuncts are in the unsatisfiable core [2024-10-11 18:19:56,855 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:19:56,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-11 18:19:56,892 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:19:56,893 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-11 18:19:56,935 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-11 18:19:56,935 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-11 18:19:56,968 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-11 18:19:57,010 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:19:57,010 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-11 18:19:57,051 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-11 18:19:57,068 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-11 18:19:57,112 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:57,112 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-11 18:19:57,125 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-11 18:19:57,127 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:19:57,189 INFO L349 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2024-10-11 18:19:57,190 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-11 18:19:57,196 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_706 (Array Int Int)) (v_ArrVal_705 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_705) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_706) |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-11 18:19:57,206 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:57,207 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-11 18:19:57,213 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-11 18:19:57,219 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-11 18:19:57,227 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-11 18:19:57,329 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-11 18:19:57,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1174659889] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:19:57,329 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:19:57,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 9] total 21 [2024-10-11 18:19:57,330 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1018737659] [2024-10-11 18:19:57,330 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:19:57,330 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2024-10-11 18:19:57,330 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:57,331 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2024-10-11 18:19:57,331 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=62, Invalid=357, Unknown=5, NotChecked=38, Total=462 [2024-10-11 18:19:57,332 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-11 18:19:57,798 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:57,799 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2024-10-11 18:19:57,799 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:19:57,799 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-11 18:19:57,800 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:57,801 INFO L225 Difference]: With dead ends: 82 [2024-10-11 18:19:57,801 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 18:19:57,801 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 32 SyntacticMatches, 0 SemanticMatches, 27 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 128 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=146, Invalid=609, Unknown=5, NotChecked=52, Total=812 [2024-10-11 18:19:57,802 INFO L432 NwaCegarLoop]: 65 mSDtfsCounter, 40 mSDsluCounter, 720 mSDsCounter, 0 mSdLazyCounter, 532 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 785 SdHoareTripleChecker+Invalid, 569 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 532 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 28 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:57,802 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 785 Invalid, 569 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 532 Invalid, 0 Unknown, 28 Unchecked, 0.3s Time] [2024-10-11 18:19:57,803 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 18:19:57,804 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2024-10-11 18:19:57,805 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-11 18:19:57,805 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2024-10-11 18:19:57,807 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 22 [2024-10-11 18:19:57,807 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:57,807 INFO L471 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2024-10-11 18:19:57,807 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-11 18:19:57,807 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2024-10-11 18:19:57,808 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:19:57,808 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:57,808 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-11 18:19:57,826 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Forceful destruction successful, exit code 0 [2024-10-11 18:19:58,008 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,7 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:58,009 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-11 18:19:58,009 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:58,009 INFO L85 PathProgramCache]: Analyzing trace with hash 1023811472, now seen corresponding path program 1 times [2024-10-11 18:19:58,009 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:58,010 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2143820176] [2024-10-11 18:19:58,010 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:58,010 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:58,037 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:58,462 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-11 18:19:58,462 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:58,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2143820176] [2024-10-11 18:19:58,462 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2143820176] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:19:58,462 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1676988608] [2024-10-11 18:19:58,462 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:58,462 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:58,463 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:19:58,464 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:19:58,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-10-11 18:19:58,572 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:58,574 INFO L255 TraceCheckSpWp]: Trace formula consists of 201 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 18:19:58,576 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:19:58,579 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-11 18:19:58,603 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:19:58,603 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-11 18:19:58,627 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:19:58,627 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-11 18:19:58,689 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-11 18:19:58,712 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:19:58,713 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-11 18:19:58,829 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:19:58,830 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-11 18:19:58,836 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-11 18:19:58,836 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:19:58,925 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-11 18:19:58,927 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-11 18:19:58,936 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-10-11 18:19:59,002 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-11 18:19:59,003 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1676988608] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:19:59,003 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:19:59,003 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 9] total 19 [2024-10-11 18:19:59,004 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [550696021] [2024-10-11 18:19:59,004 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:19:59,004 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2024-10-11 18:19:59,004 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:19:59,005 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2024-10-11 18:19:59,006 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=346, Unknown=0, NotChecked=0, Total=420 [2024-10-11 18:19:59,007 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-11 18:19:59,389 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:19:59,389 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2024-10-11 18:19:59,390 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2024-10-11 18:19:59,390 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-11 18:19:59,390 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:19:59,390 INFO L225 Difference]: With dead ends: 81 [2024-10-11 18:19:59,390 INFO L226 Difference]: Without dead ends: 81 [2024-10-11 18:19:59,391 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 34 SyntacticMatches, 5 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=122, Invalid=528, Unknown=0, NotChecked=0, Total=650 [2024-10-11 18:19:59,391 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 56 mSDsluCounter, 377 mSDsCounter, 0 mSdLazyCounter, 477 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 436 SdHoareTripleChecker+Invalid, 479 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 477 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:19:59,392 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 436 Invalid, 479 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 477 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-10-11 18:19:59,392 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2024-10-11 18:19:59,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2024-10-11 18:19:59,394 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-11 18:19:59,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2024-10-11 18:19:59,394 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 25 [2024-10-11 18:19:59,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:19:59,394 INFO L471 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2024-10-11 18:19:59,394 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-11 18:19:59,395 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2024-10-11 18:19:59,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-10-11 18:19:59,395 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:19:59,395 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-11 18:19:59,413 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Forceful destruction successful, exit code 0 [2024-10-11 18:19:59,595 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:59,596 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-11 18:19:59,597 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:19:59,597 INFO L85 PathProgramCache]: Analyzing trace with hash 1023380496, now seen corresponding path program 1 times [2024-10-11 18:19:59,597 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:19:59,597 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [948057770] [2024-10-11 18:19:59,597 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:59,597 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:19:59,620 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:19:59,972 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-11 18:19:59,972 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:19:59,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [948057770] [2024-10-11 18:19:59,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [948057770] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:19:59,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [320185233] [2024-10-11 18:19:59,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:19:59,972 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:19:59,973 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:19:59,975 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:19:59,976 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-10-11 18:20:00,085 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:00,087 INFO L255 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 35 conjuncts are in the unsatisfiable core [2024-10-11 18:20:00,091 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:20:00,099 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-11 18:20:00,127 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-11 18:20:00,128 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-11 18:20:00,152 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-11 18:20:00,174 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:20:00,174 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-11 18:20:00,212 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-11 18:20:00,228 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-11 18:20:00,279 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:00,279 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-11 18:20:00,360 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-11 18:20:00,367 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-11 18:20:00,367 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:20:00,474 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-11 18:20:00,499 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:00,500 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-11 18:20:00,525 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_872 (Array Int Int)) (v_ArrVal_871 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_871) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_872) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_2) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_1) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))))) is different from false [2024-10-11 18:20:00,532 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:00,533 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-11 18:20:00,536 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-11 18:20:00,541 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-11 18:20:00,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:00,552 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-11 18:20:00,559 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-11 18:20:00,599 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:00,599 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-11 18:20:00,603 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:00,606 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-11 18:20:00,616 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:20:00,617 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-11 18:20:00,626 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:00,751 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:20:00,752 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-11 18:20:00,761 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2024-10-11 18:20:00,762 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [320185233] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:20:00,762 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:20:00,762 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 12] total 22 [2024-10-11 18:20:00,762 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [892034404] [2024-10-11 18:20:00,762 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:20:00,763 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 18:20:00,763 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:00,763 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 18:20:00,764 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=57, Invalid=369, Unknown=2, NotChecked=78, Total=506 [2024-10-11 18:20:00,764 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-11 18:20:01,404 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:01,404 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2024-10-11 18:20:01,405 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:20:01,405 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-11 18:20:01,405 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:01,405 INFO L225 Difference]: With dead ends: 83 [2024-10-11 18:20:01,406 INFO L226 Difference]: Without dead ends: 83 [2024-10-11 18:20:01,406 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 33 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 161 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=178, Invalid=884, Unknown=2, NotChecked=126, Total=1190 [2024-10-11 18:20:01,407 INFO L432 NwaCegarLoop]: 61 mSDtfsCounter, 55 mSDsluCounter, 580 mSDsCounter, 0 mSdLazyCounter, 572 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 641 SdHoareTripleChecker+Invalid, 692 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 572 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 98 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:01,407 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 641 Invalid, 692 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 572 Invalid, 0 Unknown, 98 Unchecked, 0.3s Time] [2024-10-11 18:20:01,408 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2024-10-11 18:20:01,409 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 80. [2024-10-11 18:20:01,409 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-11 18:20:01,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2024-10-11 18:20:01,409 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 25 [2024-10-11 18:20:01,410 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:01,410 INFO L471 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2024-10-11 18:20:01,410 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-11 18:20:01,410 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2024-10-11 18:20:01,410 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:20:01,410 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:01,410 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-11 18:20:01,429 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2024-10-11 18:20:01,611 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-10-11 18:20:01,611 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-11 18:20:01,612 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:01,612 INFO L85 PathProgramCache]: Analyzing trace with hash 349414151, now seen corresponding path program 1 times [2024-10-11 18:20:01,612 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:01,612 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1098418329] [2024-10-11 18:20:01,612 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:01,612 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:01,638 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:02,218 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-11 18:20:02,218 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:02,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1098418329] [2024-10-11 18:20:02,219 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1098418329] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:20:02,219 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [188593906] [2024-10-11 18:20:02,219 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:02,219 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:02,219 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:20:02,222 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:20:02,227 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-10-11 18:20:02,352 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:02,358 INFO L255 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 42 conjuncts are in the unsatisfiable core [2024-10-11 18:20:02,360 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:20:02,365 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-11 18:20:02,416 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:20:02,417 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-11 18:20:02,489 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-11 18:20:02,489 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-11 18:20:02,519 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-11 18:20:02,560 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:20:02,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2024-10-11 18:20:02,599 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-11 18:20:02,615 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-11 18:20:02,688 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:02,689 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-11 18:20:02,709 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-11 18:20:02,716 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-11 18:20:02,716 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:20:02,835 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-11 18:20:02,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:02,852 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-11 18:20:02,875 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-11 18:20:02,885 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:02,885 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-11 18:20:02,888 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-11 18:20:02,895 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-11 18:20:02,902 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2024-10-11 18:20:02,908 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:02,909 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-11 18:20:02,911 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:02,911 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:02,913 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-11 18:20:03,180 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-11 18:20:03,180 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [188593906] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:20:03,180 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:20:03,180 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 32 [2024-10-11 18:20:03,181 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [7975799] [2024-10-11 18:20:03,181 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:20:03,181 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2024-10-11 18:20:03,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:03,182 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2024-10-11 18:20:03,182 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=875, Unknown=2, NotChecked=122, Total=1122 [2024-10-11 18:20:03,183 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-11 18:20:03,968 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:03,968 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2024-10-11 18:20:03,970 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 18:20:03,971 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-11 18:20:03,971 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:03,971 INFO L225 Difference]: With dead ends: 82 [2024-10-11 18:20:03,972 INFO L226 Difference]: Without dead ends: 82 [2024-10-11 18:20:03,972 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 75 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 512 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=246, Invalid=1482, Unknown=2, NotChecked=162, Total=1892 [2024-10-11 18:20:03,973 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 91 mSDsluCounter, 668 mSDsCounter, 0 mSdLazyCounter, 698 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 91 SdHoareTripleChecker+Valid, 724 SdHoareTripleChecker+Invalid, 816 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 698 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 100 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:03,973 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [91 Valid, 724 Invalid, 816 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 698 Invalid, 0 Unknown, 100 Unchecked, 0.4s Time] [2024-10-11 18:20:03,973 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2024-10-11 18:20:03,978 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2024-10-11 18:20:03,979 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-11 18:20:03,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2024-10-11 18:20:03,979 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2024-10-11 18:20:03,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:03,980 INFO L471 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2024-10-11 18:20:03,980 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-11 18:20:03,980 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2024-10-11 18:20:03,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:20:03,980 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:03,980 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-11 18:20:03,999 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Forceful destruction successful, exit code 0 [2024-10-11 18:20:04,181 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:04,181 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-11 18:20:04,181 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:04,182 INFO L85 PathProgramCache]: Analyzing trace with hash 348983175, now seen corresponding path program 1 times [2024-10-11 18:20:04,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:04,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [45242630] [2024-10-11 18:20:04,182 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:04,182 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:04,201 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:04,542 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-11 18:20:04,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:04,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [45242630] [2024-10-11 18:20:04,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [45242630] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:20:04,543 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [473264740] [2024-10-11 18:20:04,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:04,543 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:04,543 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:20:04,545 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:20:04,546 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-10-11 18:20:04,660 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:04,662 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 26 conjuncts are in the unsatisfiable core [2024-10-11 18:20:04,664 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:20:04,667 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-11 18:20:04,700 INFO L349 Elim1Store]: treesize reduction 20, result has 33.3 percent of original size [2024-10-11 18:20:04,701 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-11 18:20:04,716 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-10-11 18:20:04,717 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-11 18:20:04,762 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-11 18:20:04,781 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:04,782 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-11 18:20:04,867 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:20:04,867 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-11 18:20:04,897 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-11 18:20:04,897 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:20:04,993 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-11 18:20:04,997 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-11 18:20:04,998 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-11 18:20:05,066 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-11 18:20:05,066 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [473264740] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:20:05,066 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:20:05,066 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 8, 8] total 21 [2024-10-11 18:20:05,067 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1472756126] [2024-10-11 18:20:05,067 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:20:05,067 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2024-10-11 18:20:05,067 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:05,068 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2024-10-11 18:20:05,068 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=422, Unknown=0, NotChecked=0, Total=506 [2024-10-11 18:20:05,068 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-11 18:20:05,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:05,361 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-10-11 18:20:05,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-10-11 18:20:05,362 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-11 18:20:05,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:05,362 INFO L225 Difference]: With dead ends: 78 [2024-10-11 18:20:05,363 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 18:20:05,363 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 38 SyntacticMatches, 1 SemanticMatches, 28 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 220 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=152, Invalid=718, Unknown=0, NotChecked=0, Total=870 [2024-10-11 18:20:05,364 INFO L432 NwaCegarLoop]: 47 mSDtfsCounter, 82 mSDsluCounter, 245 mSDsCounter, 0 mSdLazyCounter, 306 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 292 SdHoareTripleChecker+Invalid, 316 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 306 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:05,364 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 292 Invalid, 316 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 306 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-10-11 18:20:05,364 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 18:20:05,370 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2024-10-11 18:20:05,370 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-11 18:20:05,370 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2024-10-11 18:20:05,370 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 26 [2024-10-11 18:20:05,371 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:05,371 INFO L471 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2024-10-11 18:20:05,371 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-11 18:20:05,371 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2024-10-11 18:20:05,371 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:20:05,371 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:05,371 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-11 18:20:05,392 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-10-11 18:20:05,572 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-10-11 18:20:05,572 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-11 18:20:05,572 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:05,573 INFO L85 PathProgramCache]: Analyzing trace with hash -1942441977, now seen corresponding path program 1 times [2024-10-11 18:20:05,573 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:05,573 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1134357898] [2024-10-11 18:20:05,573 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:05,573 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:05,604 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:06,099 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-11 18:20:06,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:06,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1134357898] [2024-10-11 18:20:06,100 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1134357898] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:20:06,100 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [957682793] [2024-10-11 18:20:06,100 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:06,100 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:06,100 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:20:06,102 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:20:06,103 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-10-11 18:20:06,215 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:06,218 INFO L255 TraceCheckSpWp]: Trace formula consists of 205 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-11 18:20:06,220 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:20:06,223 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-11 18:20:06,269 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:20:06,270 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-11 18:20:06,340 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-11 18:20:06,341 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-11 18:20:06,374 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-11 18:20:06,414 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:20:06,415 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2024-10-11 18:20:06,450 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-11 18:20:06,582 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-11 18:20:06,659 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:06,660 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-11 18:20:06,678 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-11 18:20:06,684 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-11 18:20:06,684 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:20:06,800 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-11 18:20:06,804 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-11 18:20:06,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:06,873 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-11 18:20:06,879 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-11 18:20:06,886 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-11 18:20:06,892 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-11 18:20:06,896 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-11 18:20:07,121 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-11 18:20:07,121 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [957682793] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:20:07,121 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:20:07,121 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 12, 12] total 33 [2024-10-11 18:20:07,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [162926484] [2024-10-11 18:20:07,121 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:20:07,122 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 18:20:07,122 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:07,122 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 18:20:07,123 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=136, Invalid=979, Unknown=11, NotChecked=64, Total=1190 [2024-10-11 18:20:07,123 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-11 18:20:07,781 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:07,781 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2024-10-11 18:20:07,781 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-10-11 18:20:07,781 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-11 18:20:07,782 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:07,782 INFO L225 Difference]: With dead ends: 80 [2024-10-11 18:20:07,782 INFO L226 Difference]: Without dead ends: 80 [2024-10-11 18:20:07,783 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 74 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 42 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 526 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=257, Invalid=1542, Unknown=11, NotChecked=82, Total=1892 [2024-10-11 18:20:07,783 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 75 mSDsluCounter, 503 mSDsCounter, 0 mSdLazyCounter, 592 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 75 SdHoareTripleChecker+Valid, 557 SdHoareTripleChecker+Invalid, 653 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 592 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 40 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:07,783 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [75 Valid, 557 Invalid, 653 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 592 Invalid, 0 Unknown, 40 Unchecked, 0.4s Time] [2024-10-11 18:20:07,784 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2024-10-11 18:20:07,786 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 77. [2024-10-11 18:20:07,786 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-11 18:20:07,786 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 82 transitions. [2024-10-11 18:20:07,786 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 82 transitions. Word has length 26 [2024-10-11 18:20:07,787 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:07,787 INFO L471 AbstractCegarLoop]: Abstraction has 77 states and 82 transitions. [2024-10-11 18:20:07,787 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-11 18:20:07,787 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 82 transitions. [2024-10-11 18:20:07,788 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2024-10-11 18:20:07,788 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:07,788 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-11 18:20:07,803 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2024-10-11 18:20:07,988 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-10-11 18:20:07,989 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-11 18:20:07,989 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:07,989 INFO L85 PathProgramCache]: Analyzing trace with hash -1942872953, now seen corresponding path program 1 times [2024-10-11 18:20:07,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:07,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [739393785] [2024-10-11 18:20:07,990 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:07,990 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:08,014 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:08,352 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-11 18:20:08,352 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:08,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [739393785] [2024-10-11 18:20:08,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [739393785] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:20:08,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1155151853] [2024-10-11 18:20:08,353 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:08,353 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:08,353 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:20:08,355 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:20:08,356 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-10-11 18:20:08,479 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:08,481 INFO L255 TraceCheckSpWp]: Trace formula consists of 204 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-10-11 18:20:08,483 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:20:08,489 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-11 18:20:08,515 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-10-11 18:20:08,516 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-11 18:20:08,577 INFO L349 Elim1Store]: treesize reduction 48, result has 28.4 percent of original size [2024-10-11 18:20:08,577 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-11 18:20:08,620 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-11 18:20:08,667 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:20:08,668 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-11 18:20:08,714 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-11 18:20:08,730 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:08,733 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-11 18:20:08,800 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:08,811 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:08,812 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-11 18:20:09,064 INFO L349 Elim1Store]: treesize reduction 46, result has 53.1 percent of original size [2024-10-11 18:20:09,065 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-11 18:20:09,295 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-11 18:20:09,295 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:20:09,568 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:09,568 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-11 18:20:09,572 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-11 18:20:09,578 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-11 18:20:09,592 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:09,592 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-11 18:20:09,603 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-11 18:20:10,598 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-11 18:20:10,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1155151853] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:20:10,599 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:20:10,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10, 12] total 31 [2024-10-11 18:20:10,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1826991510] [2024-10-11 18:20:10,599 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:20:10,599 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-10-11 18:20:10,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:10,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-10-11 18:20:10,601 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=112, Invalid=878, Unknown=2, NotChecked=0, Total=992 [2024-10-11 18:20:10,601 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-11 18:20:11,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:11,364 INFO L93 Difference]: Finished difference Result 76 states and 81 transitions. [2024-10-11 18:20:11,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-10-11 18:20:11,364 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-11 18:20:11,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:11,365 INFO L225 Difference]: With dead ends: 76 [2024-10-11 18:20:11,365 INFO L226 Difference]: Without dead ends: 76 [2024-10-11 18:20:11,365 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 72 GetRequests, 31 SyntacticMatches, 0 SemanticMatches, 41 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 399 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=247, Invalid=1557, Unknown=2, NotChecked=0, Total=1806 [2024-10-11 18:20:11,366 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 81 mSDsluCounter, 536 mSDsCounter, 0 mSdLazyCounter, 766 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 81 SdHoareTripleChecker+Valid, 581 SdHoareTripleChecker+Invalid, 786 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 766 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:11,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [81 Valid, 581 Invalid, 786 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 766 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2024-10-11 18:20:11,366 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 76 states. [2024-10-11 18:20:11,367 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 76 to 76. [2024-10-11 18:20:11,368 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-11 18:20:11,368 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 76 states to 76 states and 81 transitions. [2024-10-11 18:20:11,368 INFO L78 Accepts]: Start accepts. Automaton has 76 states and 81 transitions. Word has length 26 [2024-10-11 18:20:11,368 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:11,368 INFO L471 AbstractCegarLoop]: Abstraction has 76 states and 81 transitions. [2024-10-11 18:20:11,368 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-11 18:20:11,368 INFO L276 IsEmpty]: Start isEmpty. Operand 76 states and 81 transitions. [2024-10-11 18:20:11,369 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:20:11,369 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:11,369 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-11 18:20:11,384 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Forceful destruction successful, exit code 0 [2024-10-11 18:20:11,569 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-10-11 18:20:11,570 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-11 18:20:11,570 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:11,570 INFO L85 PathProgramCache]: Analyzing trace with hash 1804920626, now seen corresponding path program 1 times [2024-10-11 18:20:11,570 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:11,570 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1405731858] [2024-10-11 18:20:11,570 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:11,571 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:11,589 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:12,136 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-11 18:20:12,137 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:12,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1405731858] [2024-10-11 18:20:12,137 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1405731858] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:20:12,137 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [927788138] [2024-10-11 18:20:12,137 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:12,137 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:12,137 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:20:12,139 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:20:12,140 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-10-11 18:20:12,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:12,275 INFO L255 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-11 18:20:12,278 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:20:12,284 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-10-11 18:20:12,333 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:20:12,333 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-11 18:20:12,408 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-11 18:20:12,408 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-11 18:20:12,443 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-11 18:20:12,485 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:20:12,485 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-11 18:20:12,536 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-11 18:20:12,554 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-11 18:20:12,623 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:12,634 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:12,634 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-11 18:20:12,846 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-11 18:20:12,862 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-11 18:20:12,866 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-11 18:20:12,866 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:20:13,083 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-11 18:20:13,120 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:13,121 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-11 18:20:13,168 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-11 18:20:13,180 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:13,181 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-11 18:20:13,184 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-11 18:20:13,194 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:13,194 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-11 18:20:13,205 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-11 18:20:13,214 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-11 18:20:13,261 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:13,262 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-11 18:20:13,269 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:13,272 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-11 18:20:13,278 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-11 18:20:13,288 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:13,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:13,294 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-11 18:20:13,335 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-10-11 18:20:13,335 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-11 18:20:13,542 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-11 18:20:13,543 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [927788138] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:20:13,543 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:20:13,543 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 37 [2024-10-11 18:20:13,543 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1167926052] [2024-10-11 18:20:13,543 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:20:13,544 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-10-11 18:20:13,544 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:13,545 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-10-11 18:20:13,545 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=146, Invalid=1192, Unknown=2, NotChecked=142, Total=1482 [2024-10-11 18:20:13,545 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-11 18:20:14,363 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:14,364 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2024-10-11 18:20:14,364 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 18:20:14,364 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-11 18:20:14,364 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:14,365 INFO L225 Difference]: With dead ends: 78 [2024-10-11 18:20:14,365 INFO L226 Difference]: Without dead ends: 78 [2024-10-11 18:20:14,366 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 31 SyntacticMatches, 3 SemanticMatches, 49 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 741 ImplicationChecksByTransitivity, 1.1s TimeCoverageRelationStatistics Valid=293, Invalid=2065, Unknown=2, NotChecked=190, Total=2550 [2024-10-11 18:20:14,366 INFO L432 NwaCegarLoop]: 45 mSDtfsCounter, 114 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 897 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 114 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 1035 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 897 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 114 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:14,366 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [114 Valid, 643 Invalid, 1035 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 897 Invalid, 0 Unknown, 114 Unchecked, 0.4s Time] [2024-10-11 18:20:14,367 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2024-10-11 18:20:14,368 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2024-10-11 18:20:14,368 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-11 18:20:14,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2024-10-11 18:20:14,369 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 28 [2024-10-11 18:20:14,369 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:14,369 INFO L471 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2024-10-11 18:20:14,369 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-11 18:20:14,369 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2024-10-11 18:20:14,370 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2024-10-11 18:20:14,370 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:14,370 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-11 18:20:14,386 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-10-11 18:20:14,573 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25,14 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:14,574 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-11 18:20:14,574 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:14,574 INFO L85 PathProgramCache]: Analyzing trace with hash 1850602596, now seen corresponding path program 1 times [2024-10-11 18:20:14,574 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:14,574 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [295695246] [2024-10-11 18:20:14,574 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:14,574 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:14,605 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:15,273 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-11 18:20:15,273 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:15,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [295695246] [2024-10-11 18:20:15,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [295695246] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:20:15,274 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [486376187] [2024-10-11 18:20:15,274 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:15,274 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:15,274 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:20:15,276 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:20:15,278 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-10-11 18:20:15,404 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:15,412 INFO L255 TraceCheckSpWp]: Trace formula consists of 207 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-10-11 18:20:15,415 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:20:15,418 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-11 18:20:15,464 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:20:15,464 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-11 18:20:15,586 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-10-11 18:20:15,586 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-11 18:20:15,640 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-11 18:20:15,697 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:20:15,698 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-11 18:20:15,749 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-11 18:20:15,767 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-11 18:20:15,866 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:15,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:15,885 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-11 18:20:16,215 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-11 18:20:16,275 INFO L349 Elim1Store]: treesize reduction 28, result has 26.3 percent of original size [2024-10-11 18:20:16,275 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-11 18:20:16,306 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-11 18:20:16,306 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:20:16,539 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:16,539 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-11 18:20:16,543 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-11 18:20:16,549 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-11 18:20:16,561 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:16,561 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-11 18:20:17,020 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-11 18:20:18,797 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-11 18:20:18,797 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [486376187] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:20:18,797 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:20:18,797 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 13] total 40 [2024-10-11 18:20:18,797 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [45332332] [2024-10-11 18:20:18,797 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:20:18,798 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 42 states [2024-10-11 18:20:18,798 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:18,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 42 interpolants. [2024-10-11 18:20:18,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=191, Invalid=1530, Unknown=1, NotChecked=0, Total=1722 [2024-10-11 18:20:18,799 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-11 18:20:20,088 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:20,088 INFO L93 Difference]: Finished difference Result 77 states and 82 transitions. [2024-10-11 18:20:20,089 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-10-11 18:20:20,089 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-11 18:20:20,089 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:20,090 INFO L225 Difference]: With dead ends: 77 [2024-10-11 18:20:20,090 INFO L226 Difference]: Without dead ends: 77 [2024-10-11 18:20:20,091 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 915 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=341, Invalid=2414, Unknown=1, NotChecked=0, Total=2756 [2024-10-11 18:20:20,091 INFO L432 NwaCegarLoop]: 44 mSDtfsCounter, 120 mSDsluCounter, 460 mSDsCounter, 0 mSdLazyCounter, 878 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 120 SdHoareTripleChecker+Valid, 504 SdHoareTripleChecker+Invalid, 896 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 878 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:20,092 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [120 Valid, 504 Invalid, 896 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 878 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2024-10-11 18:20:20,092 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 77 states. [2024-10-11 18:20:20,094 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 77 to 74. [2024-10-11 18:20:20,094 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-11 18:20:20,094 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2024-10-11 18:20:20,094 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 28 [2024-10-11 18:20:20,095 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:20,095 INFO L471 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2024-10-11 18:20:20,095 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-11 18:20:20,095 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2024-10-11 18:20:20,095 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:20:20,095 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:20,096 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-11 18:20:20,116 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Ended with exit code 0 [2024-10-11 18:20:20,299 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2024-10-11 18:20:20,300 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-11 18:20:20,300 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:20,300 INFO L85 PathProgramCache]: Analyzing trace with hash -1603547446, now seen corresponding path program 1 times [2024-10-11 18:20:20,300 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:20,300 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [983422817] [2024-10-11 18:20:20,301 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:20,301 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:20,322 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:20,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-11 18:20:20,807 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:20,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [983422817] [2024-10-11 18:20:20,807 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [983422817] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:20:20,807 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [827144988] [2024-10-11 18:20:20,807 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:20,807 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:20,808 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:20:20,809 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:20:20,810 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-10-11 18:20:20,934 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:20,936 INFO L255 TraceCheckSpWp]: Trace formula consists of 213 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-10-11 18:20:20,940 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:20:20,957 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-11 18:20:21,012 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-10-11 18:20:21,012 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-11 18:20:21,041 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-11 18:20:21,079 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:20:21,079 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-11 18:20:21,111 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-11 18:20:21,123 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-11 18:20:21,178 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:21,189 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:21,190 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-11 18:20:21,328 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:20:21,329 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-11 18:20:21,446 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-10-11 18:20:21,447 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-11 18:20:21,483 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-11 18:20:21,484 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:20:21,620 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-11 18:20:21,708 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-11 18:20:21,714 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:21,714 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-11 18:20:21,717 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-11 18:20:21,721 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-11 18:20:21,727 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:21,728 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-11 18:20:21,732 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-11 18:20:21,764 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:21,764 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-11 18:20:21,766 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:21,768 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-11 18:20:21,770 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:21,772 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-11 18:20:21,775 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:21,780 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:21,780 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-11 18:20:21,847 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:20:21,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 24 [2024-10-11 18:20:21,851 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-11 18:20:21,851 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [827144988] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:20:21,851 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:20:21,851 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 14] total 34 [2024-10-11 18:20:21,851 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1682377722] [2024-10-11 18:20:21,852 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:20:21,852 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2024-10-11 18:20:21,852 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:21,853 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2024-10-11 18:20:21,853 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=139, Invalid=982, Unknown=5, NotChecked=64, Total=1190 [2024-10-11 18:20:21,854 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-11 18:20:22,406 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:22,406 INFO L93 Difference]: Finished difference Result 72 states and 77 transitions. [2024-10-11 18:20:22,406 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 18:20:22,407 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-11 18:20:22,407 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:22,407 INFO L225 Difference]: With dead ends: 72 [2024-10-11 18:20:22,407 INFO L226 Difference]: Without dead ends: 72 [2024-10-11 18:20:22,408 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 83 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 580 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=301, Invalid=1860, Unknown=5, NotChecked=90, Total=2256 [2024-10-11 18:20:22,408 INFO L432 NwaCegarLoop]: 37 mSDtfsCounter, 133 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 558 mSolverCounterSat, 30 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 133 SdHoareTripleChecker+Valid, 443 SdHoareTripleChecker+Invalid, 638 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 30 IncrementalHoareTripleChecker+Valid, 558 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 50 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:22,408 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [133 Valid, 443 Invalid, 638 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [30 Valid, 558 Invalid, 0 Unknown, 50 Unchecked, 0.3s Time] [2024-10-11 18:20:22,409 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 72 states. [2024-10-11 18:20:22,410 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 72 to 72. [2024-10-11 18:20:22,410 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-11 18:20:22,410 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2024-10-11 18:20:22,411 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 29 [2024-10-11 18:20:22,411 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:22,411 INFO L471 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2024-10-11 18:20:22,411 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-11 18:20:22,411 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2024-10-11 18:20:22,411 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:20:22,411 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:22,411 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-11 18:20:22,429 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-10-11 18:20:22,615 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-10-11 18:20:22,616 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-11 18:20:22,616 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:22,616 INFO L85 PathProgramCache]: Analyzing trace with hash -1557865476, now seen corresponding path program 1 times [2024-10-11 18:20:22,616 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:22,616 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1950279089] [2024-10-11 18:20:22,616 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:22,616 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:22,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:23,129 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-11 18:20:23,129 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:23,129 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1950279089] [2024-10-11 18:20:23,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1950279089] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:20:23,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2063638728] [2024-10-11 18:20:23,130 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:23,130 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:23,130 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:20:23,131 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:20:23,132 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-10-11 18:20:23,253 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:23,254 INFO L255 TraceCheckSpWp]: Trace formula consists of 212 conjuncts, 45 conjuncts are in the unsatisfiable core [2024-10-11 18:20:23,256 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:20:23,258 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-11 18:20:23,294 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:20:23,294 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-11 18:20:23,353 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-11 18:20:23,354 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-11 18:20:23,389 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-11 18:20:23,420 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:20:23,420 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-11 18:20:23,456 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-11 18:20:23,471 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-11 18:20:23,526 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:23,537 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:23,538 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-11 18:20:23,819 INFO L349 Elim1Store]: treesize reduction 36, result has 59.1 percent of original size [2024-10-11 18:20:23,820 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-11 18:20:24,053 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-11 18:20:24,058 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-11 18:20:24,059 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:20:24,259 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-11 18:20:24,272 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:24,273 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-11 18:20:24,298 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-11 18:20:24,306 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:24,307 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-11 18:20:24,311 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-11 18:20:24,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 94 treesize of output 90 [2024-10-11 18:20:24,324 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-11 18:20:24,336 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:24,337 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-11 18:20:24,421 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:24,422 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-11 18:20:24,428 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-11 18:20:24,434 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-11 18:20:24,446 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:20:24,446 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-11 18:20:24,459 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:24,475 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:24,476 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-11 18:20:24,478 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:24,479 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:24,481 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-11 18:20:24,487 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:24,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:24,493 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-11 18:20:24,694 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-11 18:20:24,694 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2063638728] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:20:24,694 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:20:24,694 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 38 [2024-10-11 18:20:24,694 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [210302515] [2024-10-11 18:20:24,694 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:20:24,695 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-11 18:20:24,695 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:24,695 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-11 18:20:24,696 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=152, Invalid=1260, Unknown=2, NotChecked=146, Total=1560 [2024-10-11 18:20:24,696 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-11 18:20:25,453 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:25,453 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2024-10-11 18:20:25,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-10-11 18:20:25,454 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-11 18:20:25,454 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:25,454 INFO L225 Difference]: With dead ends: 74 [2024-10-11 18:20:25,454 INFO L226 Difference]: Without dead ends: 74 [2024-10-11 18:20:25,455 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 33 SyntacticMatches, 2 SemanticMatches, 50 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 750 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=305, Invalid=2151, Unknown=2, NotChecked=194, Total=2652 [2024-10-11 18:20:25,456 INFO L432 NwaCegarLoop]: 42 mSDtfsCounter, 109 mSDsluCounter, 450 mSDsCounter, 0 mSdLazyCounter, 670 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 109 SdHoareTripleChecker+Valid, 492 SdHoareTripleChecker+Invalid, 797 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 670 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 110 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:25,456 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [109 Valid, 492 Invalid, 797 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 670 Invalid, 0 Unknown, 110 Unchecked, 0.4s Time] [2024-10-11 18:20:25,456 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2024-10-11 18:20:25,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 71. [2024-10-11 18:20:25,457 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-11 18:20:25,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 71 states to 71 states and 76 transitions. [2024-10-11 18:20:25,458 INFO L78 Accepts]: Start accepts. Automaton has 71 states and 76 transitions. Word has length 29 [2024-10-11 18:20:25,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:25,458 INFO L471 AbstractCegarLoop]: Abstraction has 71 states and 76 transitions. [2024-10-11 18:20:25,458 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-11 18:20:25,458 INFO L276 IsEmpty]: Start isEmpty. Operand 71 states and 76 transitions. [2024-10-11 18:20:25,458 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2024-10-11 18:20:25,458 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:25,458 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-11 18:20:25,478 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-10-11 18:20:25,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-10-11 18:20:25,659 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-11 18:20:25,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:25,660 INFO L85 PathProgramCache]: Analyzing trace with hash -1148707946, now seen corresponding path program 1 times [2024-10-11 18:20:25,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:25,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [531590321] [2024-10-11 18:20:25,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:25,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:25,694 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:26,264 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-11 18:20:26,264 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:26,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [531590321] [2024-10-11 18:20:26,264 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [531590321] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:20:26,264 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2018518803] [2024-10-11 18:20:26,264 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:26,264 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:26,264 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:20:26,265 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:20:26,266 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-10-11 18:20:26,401 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:26,403 INFO L255 TraceCheckSpWp]: Trace formula consists of 211 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-10-11 18:20:26,406 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:20:26,409 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-11 18:20:26,444 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-10-11 18:20:26,445 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-11 18:20:26,502 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-10-11 18:20:26,503 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-11 18:20:26,529 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-11 18:20:26,566 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:20:26,566 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-11 18:20:26,598 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-11 18:20:26,627 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-11 18:20:26,682 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:26,700 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:26,701 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-11 18:20:26,976 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-10-11 18:20:26,977 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-11 18:20:27,191 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:20:27,192 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-11 18:20:27,197 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-11 18:20:27,197 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:20:27,370 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:27,371 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-11 18:20:27,462 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_1669 (Array Int Int)) (v_ArrVal_1670 (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_1669) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1670) |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_~last~0#1.base|)) (forall ((v_ArrVal_1669 (Array Int Int)) (v_ArrVal_1670 (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_1669) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1670) |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_1669 (Array Int Int)) (v_ArrVal_1670 (Array Int Int))) (not (let ((.cse1 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1669) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1670) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 4) (select .cse1 0))))))) is different from false [2024-10-11 18:20:27,473 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:27,473 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-11 18:20:27,476 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-11 18:20:27,484 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:27,485 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-11 18:20:27,490 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-11 18:20:27,515 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-11 18:20:27,528 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:27,528 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-11 18:20:27,533 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-11 18:20:27,544 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-10-11 18:20:27,545 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-11 18:20:27,553 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:27,556 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:27,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:27,571 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:27,571 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-11 18:20:27,574 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:27,577 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-11 18:20:27,580 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:27,583 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-11 18:20:27,586 INFO L173 IndexEqualityManager]: detected equality via solver [2024-10-11 18:20:27,598 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-10-11 18:20:27,598 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-11 18:20:27,848 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-11 18:20:27,849 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2018518803] provided 0 perfect and 2 imperfect interpolant sequences [2024-10-11 18:20:27,849 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-10-11 18:20:27,849 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 38 [2024-10-11 18:20:27,849 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603137158] [2024-10-11 18:20:27,849 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-10-11 18:20:27,849 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 40 states [2024-10-11 18:20:27,849 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-10-11 18:20:27,850 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 40 interpolants. [2024-10-11 18:20:27,850 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=189, Invalid=1296, Unknown=1, NotChecked=74, Total=1560 [2024-10-11 18:20:27,850 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-11 18:20:28,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-10-11 18:20:28,688 INFO L93 Difference]: Finished difference Result 73 states and 78 transitions. [2024-10-11 18:20:28,688 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2024-10-11 18:20:28,689 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-11 18:20:28,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-10-11 18:20:28,689 INFO L225 Difference]: With dead ends: 73 [2024-10-11 18:20:28,689 INFO L226 Difference]: Without dead ends: 73 [2024-10-11 18:20:28,690 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 81 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 47 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 767 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=319, Invalid=1940, Unknown=1, NotChecked=92, Total=2352 [2024-10-11 18:20:28,690 INFO L432 NwaCegarLoop]: 41 mSDtfsCounter, 107 mSDsluCounter, 512 mSDsCounter, 0 mSdLazyCounter, 743 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 817 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 743 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 51 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-10-11 18:20:28,691 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 553 Invalid, 817 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 743 Invalid, 0 Unknown, 51 Unchecked, 0.5s Time] [2024-10-11 18:20:28,691 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 73 states. [2024-10-11 18:20:28,692 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 73 to 70. [2024-10-11 18:20:28,693 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-11 18:20:28,693 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2024-10-11 18:20:28,693 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 29 [2024-10-11 18:20:28,693 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-10-11 18:20:28,694 INFO L471 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2024-10-11 18:20:28,694 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-11 18:20:28,694 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2024-10-11 18:20:28,694 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2024-10-11 18:20:28,694 INFO L207 NwaCegarLoop]: Found error trace [2024-10-11 18:20:28,695 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-11 18:20:28,720 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-10-11 18:20:28,895 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:28,896 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-11 18:20:28,896 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-10-11 18:20:28,896 INFO L85 PathProgramCache]: Analyzing trace with hash -638059179, now seen corresponding path program 1 times [2024-10-11 18:20:28,897 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-10-11 18:20:28,897 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1075562617] [2024-10-11 18:20:28,897 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:28,897 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-10-11 18:20:28,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:29,567 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-11 18:20:29,567 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-10-11 18:20:29,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1075562617] [2024-10-11 18:20:29,568 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1075562617] provided 0 perfect and 1 imperfect interpolant sequences [2024-10-11 18:20:29,568 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [266750309] [2024-10-11 18:20:29,568 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-10-11 18:20:29,568 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-10-11 18:20:29,568 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 [2024-10-11 18:20:29,569 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-10-11 18:20:29,570 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate-clean/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-10-11 18:20:29,698 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-10-11 18:20:29,699 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 54 conjuncts are in the unsatisfiable core [2024-10-11 18:20:29,701 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-10-11 18:20:29,874 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-11 18:20:29,924 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-10-11 18:20:29,924 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-11 18:20:29,985 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-10-11 18:20:29,986 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-11 18:20:30,007 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-11 18:20:30,105 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-10-11 18:20:30,117 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:30,118 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-11 18:20:30,654 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-11 18:20:30,662 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-11 18:20:30,662 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-10-11 18:20:30,891 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-11 18:20:30,899 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-11 18:20:30,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:30,907 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-11 18:20:30,912 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-11 18:20:30,924 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-11 18:20:30,963 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-10-11 18:20:30,964 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-11 18:20:30,976 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-11 18:20:41,039 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