./Ultimate.py --spec ../sv-benchmarks/c/properties/valid-memsafety.prp --file ../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 023d838f Calling Ultimate with: /root/.sdkman/candidates/java/11.0.12-open/bin/java -Dosgi.configuration.area=/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/config -Xmx15G -Xms4m -jar /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data -tc /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/AutomizerMemDerefMemtrack.xml -i ../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i -s /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 --- Real Ultimate output --- This is Ultimate 0.2.5-tmp.fs.icfgbuilder-eval-023d838-m [2024-11-10 15:30:57,805 INFO L188 SettingsManager]: Resetting all preferences to default values... [2024-11-10 15:30:57,871 INFO L114 SettingsManager]: Loading settings from /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2024-11-10 15:30:57,875 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2024-11-10 15:30:57,877 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2024-11-10 15:30:57,904 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2024-11-10 15:30:57,905 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2024-11-10 15:30:57,905 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2024-11-10 15:30:57,906 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2024-11-10 15:30:57,907 INFO L153 SettingsManager]: * Use memory slicer=true [2024-11-10 15:30:57,908 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2024-11-10 15:30:57,908 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2024-11-10 15:30:57,909 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2024-11-10 15:30:57,909 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2024-11-10 15:30:57,910 INFO L153 SettingsManager]: * Use SBE=true [2024-11-10 15:30:57,910 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2024-11-10 15:30:57,911 INFO L153 SettingsManager]: * sizeof long=4 [2024-11-10 15:30:57,911 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2024-11-10 15:30:57,911 INFO L153 SettingsManager]: * sizeof POINTER=4 [2024-11-10 15:30:57,912 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2024-11-10 15:30:57,912 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2024-11-10 15:30:57,913 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2024-11-10 15:30:57,913 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2024-11-10 15:30:57,913 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2024-11-10 15:30:57,913 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2024-11-10 15:30:57,914 INFO L153 SettingsManager]: * Allow undefined functions=false [2024-11-10 15:30:57,914 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2024-11-10 15:30:57,914 INFO L153 SettingsManager]: * sizeof long double=12 [2024-11-10 15:30:57,914 INFO L153 SettingsManager]: * Use constant arrays=true [2024-11-10 15:30:57,915 INFO L151 SettingsManager]: Preferences of IcfgBuilder differ from their defaults: [2024-11-10 15:30:57,915 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2024-11-10 15:30:57,915 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2024-11-10 15:30:57,915 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2024-11-10 15:30:57,916 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:30:57,916 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2024-11-10 15:30:57,916 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2024-11-10 15:30:57,917 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2024-11-10 15:30:57,917 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2024-11-10 15:30:57,917 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2024-11-10 15:30:57,917 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2024-11-10 15:30:57,918 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2024-11-10 15:30:57,920 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2024-11-10 15:30:57,920 INFO L153 SettingsManager]: * Looper check in Petri net analysis=SEMANTIC WARNING: An illegal reflective access operation has occurred WARNING: Illegal reflective access by com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 (file:/storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> f6eaec015dd6fdb220ef146938a83a65106037c982563310cbbb34d0417543f1 [2024-11-10 15:30:58,184 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2024-11-10 15:30:58,210 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2024-11-10 15:30:58,214 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2024-11-10 15:30:58,215 INFO L270 PluginConnector]: Initializing CDTParser... [2024-11-10 15:30:58,215 INFO L274 PluginConnector]: CDTParser initialized [2024-11-10 15:30:58,216 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2024-11-10 15:30:59,618 INFO L533 CDTParser]: Created temporary CDT project at NULL [2024-11-10 15:30:59,853 INFO L384 CDTParser]: Found 1 translation units. [2024-11-10 15:30:59,853 INFO L180 CDTParser]: Scanning /storage/repos/ultimate/releaseScripts/default/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2024-11-10 15:30:59,867 INFO L427 CDTParser]: About to delete temporary CDT project at /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/291d503b9/3f042a4f3aa6413588c1206a2cb541e4/FLAG3f33c65a3 [2024-11-10 15:31:00,184 INFO L435 CDTParser]: Successfully deleted /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/data/291d503b9/3f042a4f3aa6413588c1206a2cb541e4 [2024-11-10 15:31:00,186 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2024-11-10 15:31:00,188 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2024-11-10 15:31:00,189 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2024-11-10 15:31:00,189 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2024-11-10 15:31:00,197 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2024-11-10 15:31:00,197 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:31:00" (1/1) ... [2024-11-10 15:31:00,198 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@52be2926 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:00, skipping insertion in model container [2024-11-10 15:31:00,199 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 10.11 03:31:00" (1/1) ... [2024-11-10 15:31:00,240 INFO L175 MainTranslator]: Built tables and reachable declarations [2024-11-10 15:31:00,557 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:31:00,567 INFO L200 MainTranslator]: Completed pre-run [2024-11-10 15:31:00,625 INFO L210 PostProcessor]: Analyzing one entry point: main [2024-11-10 15:31:00,651 INFO L204 MainTranslator]: Completed translation [2024-11-10 15:31:00,652 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:00 WrapperNode [2024-11-10 15:31:00,652 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2024-11-10 15:31:00,653 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2024-11-10 15:31:00,653 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2024-11-10 15:31:00,653 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2024-11-10 15:31:00,659 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:00" (1/1) ... [2024-11-10 15:31:00,671 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:00" (1/1) ... [2024-11-10 15:31:00,697 INFO L138 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 132 [2024-11-10 15:31:00,697 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2024-11-10 15:31:00,698 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2024-11-10 15:31:00,699 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2024-11-10 15:31:00,700 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2024-11-10 15:31:00,714 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:00" (1/1) ... [2024-11-10 15:31:00,715 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:00" (1/1) ... [2024-11-10 15:31:00,718 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:00" (1/1) ... [2024-11-10 15:31:00,736 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-11-10 15:31:00,736 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:00" (1/1) ... [2024-11-10 15:31:00,736 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:00" (1/1) ... [2024-11-10 15:31:00,745 INFO L184 PluginConnector]: Executing the observer ReplaceArrayAssignments from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:00" (1/1) ... [2024-11-10 15:31:00,746 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:00" (1/1) ... [2024-11-10 15:31:00,747 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:00" (1/1) ... [2024-11-10 15:31:00,748 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:00" (1/1) ... [2024-11-10 15:31:00,751 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2024-11-10 15:31:00,752 INFO L112 PluginConnector]: ------------------------IcfgBuilder---------------------------- [2024-11-10 15:31:00,752 INFO L270 PluginConnector]: Initializing IcfgBuilder... [2024-11-10 15:31:00,752 INFO L274 PluginConnector]: IcfgBuilder initialized [2024-11-10 15:31:00,756 INFO L184 PluginConnector]: Executing the observer IcfgBuilderObserver from plugin IcfgBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:00" (1/1) ... [2024-11-10 15:31:00,763 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2024-11-10 15:31:00,778 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:00,796 INFO L229 MonitoredProcess]: Starting monitored process 1 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2024-11-10 15:31:00,803 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2024-11-10 15:31:00,850 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2024-11-10 15:31:00,850 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2024-11-10 15:31:00,850 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2024-11-10 15:31:00,850 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2024-11-10 15:31:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2024-11-10 15:31:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2024-11-10 15:31:00,851 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2024-11-10 15:31:00,851 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2024-11-10 15:31:00,983 INFO L256 CfgBuilder]: Building ICFG [2024-11-10 15:31:00,986 INFO L286 CfgBuilder]: Building CFG for each procedure with an implementation [2024-11-10 15:31:01,015 INFO L1247 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2024-11-10 15:31:01,375 INFO L? ?]: Removed 121 outVars from TransFormulas that were not future-live. [2024-11-10 15:31:01,375 INFO L307 CfgBuilder]: Performing block encoding [2024-11-10 15:31:01,391 INFO L331 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2024-11-10 15:31:01,391 INFO L336 CfgBuilder]: Removed 0 assume(true) statements. [2024-11-10 15:31:01,392 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:31:01 BoogieIcfgContainer [2024-11-10 15:31:01,392 INFO L131 PluginConnector]: ------------------------ END IcfgBuilder---------------------------- [2024-11-10 15:31:01,394 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2024-11-10 15:31:01,394 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2024-11-10 15:31:01,400 INFO L274 PluginConnector]: TraceAbstraction initialized [2024-11-10 15:31:01,400 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 10.11 03:31:00" (1/3) ... [2024-11-10 15:31:01,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ae1387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:31:01, skipping insertion in model container [2024-11-10 15:31:01,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 10.11 03:31:00" (2/3) ... [2024-11-10 15:31:01,403 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@43ae1387 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 10.11 03:31:01, skipping insertion in model container [2024-11-10 15:31:01,403 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.icfgbuilder CFG 10.11 03:31:01" (3/3) ... [2024-11-10 15:31:01,405 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-1.i [2024-11-10 15:31:01,421 INFO L214 ceAbstractionStarter]: Automizer settings: Hoare:None NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2024-11-10 15:31:01,422 INFO L154 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2024-11-10 15:31:01,511 INFO L332 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2024-11-10 15:31:01,521 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;@47c419c1, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2024-11-10 15:31:01,522 INFO L334 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2024-11-10 15:31:01,541 INFO L276 IsEmpty]: Start isEmpty. Operand has 157 states, 92 states have (on average 1.7717391304347827) internal successors, (163), 155 states have internal predecessors, (163), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:01,548 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 15:31:01,549 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:01,550 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 15:31:01,550 INFO L396 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr60REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:01,557 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:01,558 INFO L85 PathProgramCache]: Analyzing trace with hash 6124988, now seen corresponding path program 1 times [2024-11-10 15:31:01,565 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:01,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1781094876] [2024-11-10 15:31:01,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:01,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:01,648 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:01,767 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:01,768 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:01,768 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1781094876] [2024-11-10 15:31:01,768 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1781094876] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:31:01,769 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:31:01,769 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:31:01,770 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428714063] [2024-11-10 15:31:01,771 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:31:01,776 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:31:01,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:01,803 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:31:01,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:31:01,806 INFO L87 Difference]: Start difference. First operand has 157 states, 92 states have (on average 1.7717391304347827) internal successors, (163), 155 states have internal predecessors, (163), 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 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:01,980 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:01,980 INFO L93 Difference]: Finished difference Result 154 states and 161 transitions. [2024-11-10 15:31:01,981 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:31:01,982 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-10 15:31:01,982 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:01,988 INFO L225 Difference]: With dead ends: 154 [2024-11-10 15:31:01,988 INFO L226 Difference]: Without dead ends: 147 [2024-11-10 15:31:01,990 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-11-10 15:31:01,993 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 18 mSDsluCounter, 80 mSDsCounter, 0 mSdLazyCounter, 76 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 225 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 76 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:01,993 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 225 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 76 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:31:02,013 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-10 15:31:02,027 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-10 15:31:02,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 88 states have (on average 1.7272727272727273) internal successors, (152), 146 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:02,031 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 152 transitions. [2024-11-10 15:31:02,032 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 152 transitions. Word has length 4 [2024-11-10 15:31:02,032 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:02,032 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 152 transitions. [2024-11-10 15:31:02,032 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:02,032 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 152 transitions. [2024-11-10 15:31:02,032 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 5 [2024-11-10 15:31:02,032 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:02,032 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1] [2024-11-10 15:31:02,033 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2024-11-10 15:31:02,033 INFO L396 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr61REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:02,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:02,034 INFO L85 PathProgramCache]: Analyzing trace with hash 6124989, now seen corresponding path program 1 times [2024-11-10 15:31:02,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:02,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1554540420] [2024-11-10 15:31:02,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:02,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:02,047 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:02,129 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:02,130 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:02,130 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1554540420] [2024-11-10 15:31:02,130 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1554540420] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:31:02,130 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:31:02,130 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:31:02,131 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [603432633] [2024-11-10 15:31:02,131 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:31:02,132 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:31:02,132 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:02,132 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:31:02,133 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:31:02,133 INFO L87 Difference]: Start difference. First operand 147 states and 152 transitions. Second operand has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:02,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:02,186 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2024-11-10 15:31:02,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:31:02,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 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 4 [2024-11-10 15:31:02,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:02,189 INFO L225 Difference]: With dead ends: 144 [2024-11-10 15:31:02,189 INFO L226 Difference]: Without dead ends: 144 [2024-11-10 15:31:02,190 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-11-10 15:31:02,192 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 16 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:02,193 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 261 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:31:02,194 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-10 15:31:02,205 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-10 15:31:02,208 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 88 states have (on average 1.6931818181818181) internal successors, (149), 143 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:02,209 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 149 transitions. [2024-11-10 15:31:02,210 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 149 transitions. Word has length 4 [2024-11-10 15:31:02,211 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:02,211 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 149 transitions. [2024-11-10 15:31:02,211 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 2.0) internal successors, (4), 3 states have internal predecessors, (4), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:02,211 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 149 transitions. [2024-11-10 15:31:02,212 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:31:02,212 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:02,212 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:02,212 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2024-11-10 15:31:02,212 INFO L396 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:02,213 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:02,213 INFO L85 PathProgramCache]: Analyzing trace with hash 2083341173, now seen corresponding path program 1 times [2024-11-10 15:31:02,213 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:02,213 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [490131709] [2024-11-10 15:31:02,213 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:02,213 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:02,233 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:02,313 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:02,314 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:02,315 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [490131709] [2024-11-10 15:31:02,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [490131709] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:31:02,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:31:02,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:31:02,316 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1377196378] [2024-11-10 15:31:02,317 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:31:02,317 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:31:02,317 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:02,318 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:31:02,318 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:31:02,318 INFO L87 Difference]: Start difference. First operand 144 states and 149 transitions. Second operand has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:02,339 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:02,341 INFO L93 Difference]: Finished difference Result 154 states and 159 transitions. [2024-11-10 15:31:02,341 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:31:02,342 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-10 15:31:02,342 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:02,343 INFO L225 Difference]: With dead ends: 154 [2024-11-10 15:31:02,343 INFO L226 Difference]: Without dead ends: 154 [2024-11-10 15:31:02,343 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 3 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:31:02,347 INFO L432 NwaCegarLoop]: 147 mSDtfsCounter, 8 mSDsluCounter, 140 mSDsCounter, 0 mSdLazyCounter, 6 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 8 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 6 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 6 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:02,347 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [8 Valid, 287 Invalid, 6 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 6 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:31:02,348 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 154 states. [2024-11-10 15:31:02,360 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 154 to 146. [2024-11-10 15:31:02,361 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 90 states have (on average 1.6777777777777778) internal successors, (151), 145 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:02,362 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 151 transitions. [2024-11-10 15:31:02,362 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 151 transitions. Word has length 10 [2024-11-10 15:31:02,362 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:02,363 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 151 transitions. [2024-11-10 15:31:02,363 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.3333333333333335) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:02,363 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 151 transitions. [2024-11-10 15:31:02,367 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:31:02,367 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:02,368 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:02,368 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2024-11-10 15:31:02,368 INFO L396 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr56REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:02,368 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:02,368 INFO L85 PathProgramCache]: Analyzing trace with hash 2083343477, now seen corresponding path program 1 times [2024-11-10 15:31:02,368 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:02,369 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1540043653] [2024-11-10 15:31:02,369 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:02,369 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:02,384 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:02,449 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:02,450 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:02,450 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1540043653] [2024-11-10 15:31:02,450 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1540043653] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:31:02,453 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:31:02,453 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:31:02,453 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [353147722] [2024-11-10 15:31:02,454 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:31:02,454 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:31:02,454 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:02,455 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:31:02,456 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:31:02,456 INFO L87 Difference]: Start difference. First operand 146 states and 151 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:02,560 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:02,560 INFO L93 Difference]: Finished difference Result 145 states and 150 transitions. [2024-11-10 15:31:02,560 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:31:02,560 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-10 15:31:02,561 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:02,561 INFO L225 Difference]: With dead ends: 145 [2024-11-10 15:31:02,562 INFO L226 Difference]: Without dead ends: 145 [2024-11-10 15:31:02,562 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-11-10 15:31:02,563 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 4 mSDsluCounter, 82 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 66 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:02,563 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 224 Invalid, 66 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:31:02,566 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2024-11-10 15:31:02,575 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2024-11-10 15:31:02,578 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 90 states have (on average 1.6666666666666667) internal successors, (150), 144 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:02,580 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 150 transitions. [2024-11-10 15:31:02,580 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 150 transitions. Word has length 10 [2024-11-10 15:31:02,580 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:02,580 INFO L471 AbstractCegarLoop]: Abstraction has 145 states and 150 transitions. [2024-11-10 15:31:02,581 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:02,581 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 150 transitions. [2024-11-10 15:31:02,581 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 11 [2024-11-10 15:31:02,585 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:02,585 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:02,585 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2024-11-10 15:31:02,586 INFO L396 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr57REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:02,586 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:02,586 INFO L85 PathProgramCache]: Analyzing trace with hash 2083343478, now seen corresponding path program 1 times [2024-11-10 15:31:02,586 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:02,587 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1242747129] [2024-11-10 15:31:02,587 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:02,587 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:02,603 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:02,693 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:02,696 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:02,698 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1242747129] [2024-11-10 15:31:02,699 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1242747129] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:31:02,700 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:31:02,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2024-11-10 15:31:02,701 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [375628652] [2024-11-10 15:31:02,701 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:31:02,701 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2024-11-10 15:31:02,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:02,702 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2024-11-10 15:31:02,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2024-11-10 15:31:02,702 INFO L87 Difference]: Start difference. First operand 145 states and 150 transitions. Second operand has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:02,733 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:02,736 INFO L93 Difference]: Finished difference Result 144 states and 149 transitions. [2024-11-10 15:31:02,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2024-11-10 15:31:02,737 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 10 [2024-11-10 15:31:02,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:02,737 INFO L225 Difference]: With dead ends: 144 [2024-11-10 15:31:02,739 INFO L226 Difference]: Without dead ends: 144 [2024-11-10 15:31:02,739 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-11-10 15:31:02,740 INFO L432 NwaCegarLoop]: 142 mSDtfsCounter, 4 mSDsluCounter, 129 mSDsCounter, 0 mSdLazyCounter, 17 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 271 SdHoareTripleChecker+Invalid, 17 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 17 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:02,743 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 271 Invalid, 17 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 17 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:31:02,744 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 144 states. [2024-11-10 15:31:02,748 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 144 to 144. [2024-11-10 15:31:02,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 144 states, 90 states have (on average 1.6555555555555554) internal successors, (149), 143 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:02,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 144 states to 144 states and 149 transitions. [2024-11-10 15:31:02,753 INFO L78 Accepts]: Start accepts. Automaton has 144 states and 149 transitions. Word has length 10 [2024-11-10 15:31:02,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:02,753 INFO L471 AbstractCegarLoop]: Abstraction has 144 states and 149 transitions. [2024-11-10 15:31:02,754 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 5.0) internal successors, (10), 3 states have internal predecessors, (10), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:02,754 INFO L276 IsEmpty]: Start isEmpty. Operand 144 states and 149 transitions. [2024-11-10 15:31:02,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:31:02,754 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:02,754 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:02,756 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2024-11-10 15:31:02,757 INFO L396 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:02,757 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:02,757 INFO L85 PathProgramCache]: Analyzing trace with hash 159138460, now seen corresponding path program 1 times [2024-11-10 15:31:02,757 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:02,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [93308762] [2024-11-10 15:31:02,758 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:02,758 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:02,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:02,953 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:02,954 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:02,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [93308762] [2024-11-10 15:31:02,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [93308762] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:31:02,954 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:31:02,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2024-11-10 15:31:02,955 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [169052497] [2024-11-10 15:31:02,955 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:31:02,956 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:31:02,956 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:02,957 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:31:02,957 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:31:02,958 INFO L87 Difference]: Start difference. First operand 144 states and 149 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:03,137 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:03,137 INFO L93 Difference]: Finished difference Result 147 states and 153 transitions. [2024-11-10 15:31:03,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:31:03,138 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-10 15:31:03,138 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:03,139 INFO L225 Difference]: With dead ends: 147 [2024-11-10 15:31:03,139 INFO L226 Difference]: Without dead ends: 147 [2024-11-10 15:31:03,139 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:31:03,140 INFO L432 NwaCegarLoop]: 134 mSDtfsCounter, 18 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 200 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 367 SdHoareTripleChecker+Invalid, 204 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 200 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:03,140 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 367 Invalid, 204 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 200 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:31:03,141 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-10 15:31:03,148 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-10 15:31:03,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 93 states have (on average 1.6451612903225807) internal successors, (153), 146 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:03,153 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 153 transitions. [2024-11-10 15:31:03,154 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 153 transitions. Word has length 11 [2024-11-10 15:31:03,154 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:03,154 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 153 transitions. [2024-11-10 15:31:03,154 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:03,154 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 153 transitions. [2024-11-10 15:31:03,155 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2024-11-10 15:31:03,155 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:03,155 INFO L215 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:03,155 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2024-11-10 15:31:03,155 INFO L396 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:03,156 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:03,156 INFO L85 PathProgramCache]: Analyzing trace with hash 159138461, now seen corresponding path program 1 times [2024-11-10 15:31:03,156 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:03,156 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [242381742] [2024-11-10 15:31:03,156 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:03,157 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:03,182 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:03,327 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:03,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:03,328 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [242381742] [2024-11-10 15:31:03,328 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [242381742] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:31:03,328 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:31:03,328 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2024-11-10 15:31:03,328 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1847043357] [2024-11-10 15:31:03,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:31:03,329 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2024-11-10 15:31:03,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:03,329 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2024-11-10 15:31:03,329 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2024-11-10 15:31:03,330 INFO L87 Difference]: Start difference. First operand 147 states and 153 transitions. Second operand has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:03,383 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:03,384 INFO L93 Difference]: Finished difference Result 147 states and 152 transitions. [2024-11-10 15:31:03,384 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:31:03,384 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2024-11-10 15:31:03,384 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:03,385 INFO L225 Difference]: With dead ends: 147 [2024-11-10 15:31:03,385 INFO L226 Difference]: Without dead ends: 147 [2024-11-10 15:31:03,385 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:31:03,386 INFO L432 NwaCegarLoop]: 136 mSDtfsCounter, 16 mSDsluCounter, 250 mSDsCounter, 0 mSdLazyCounter, 37 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 386 SdHoareTripleChecker+Invalid, 39 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 37 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:03,386 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 386 Invalid, 39 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 37 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:31:03,387 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 147 states. [2024-11-10 15:31:03,393 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 147 to 147. [2024-11-10 15:31:03,393 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 147 states, 93 states have (on average 1.6344086021505377) internal successors, (152), 146 states have internal predecessors, (152), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:03,394 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 147 states to 147 states and 152 transitions. [2024-11-10 15:31:03,394 INFO L78 Accepts]: Start accepts. Automaton has 147 states and 152 transitions. Word has length 11 [2024-11-10 15:31:03,394 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:03,394 INFO L471 AbstractCegarLoop]: Abstraction has 147 states and 152 transitions. [2024-11-10 15:31:03,394 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 4 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:03,395 INFO L276 IsEmpty]: Start isEmpty. Operand 147 states and 152 transitions. [2024-11-10 15:31:03,395 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2024-11-10 15:31:03,395 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:03,398 INFO L215 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:03,398 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2024-11-10 15:31:03,399 INFO L396 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr50REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:03,399 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:03,399 INFO L85 PathProgramCache]: Analyzing trace with hash 880175470, now seen corresponding path program 1 times [2024-11-10 15:31:03,399 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:03,399 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1125550056] [2024-11-10 15:31:03,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:03,399 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:03,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:03,470 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:03,470 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:03,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1125550056] [2024-11-10 15:31:03,470 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1125550056] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:03,470 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1665723458] [2024-11-10 15:31:03,470 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:03,470 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:03,471 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:03,475 INFO L229 MonitoredProcess]: Starting monitored process 2 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:31:03,476 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2024-11-10 15:31:03,554 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:03,556 INFO L255 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjuncts are in the unsatisfiable core [2024-11-10 15:31:03,561 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:31:03,623 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:03,627 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:31:03,682 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:03,683 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1665723458] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:31:03,684 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:31:03,684 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4, 4] total 5 [2024-11-10 15:31:03,684 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [788412444] [2024-11-10 15:31:03,684 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:31:03,685 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:31:03,685 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:03,686 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:31:03,686 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:31:03,686 INFO L87 Difference]: Start difference. First operand 147 states and 152 transitions. Second operand has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:03,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:03,700 INFO L93 Difference]: Finished difference Result 150 states and 155 transitions. [2024-11-10 15:31:03,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2024-11-10 15:31:03,701 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2024-11-10 15:31:03,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:03,702 INFO L225 Difference]: With dead ends: 150 [2024-11-10 15:31:03,702 INFO L226 Difference]: Without dead ends: 150 [2024-11-10 15:31:03,702 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 29 SyntacticMatches, 2 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=10, Invalid=10, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:31:03,703 INFO L432 NwaCegarLoop]: 145 mSDtfsCounter, 6 mSDsluCounter, 139 mSDsCounter, 0 mSdLazyCounter, 7 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 284 SdHoareTripleChecker+Invalid, 8 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 7 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:03,704 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 284 Invalid, 8 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 7 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:31:03,705 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2024-11-10 15:31:03,709 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 150. [2024-11-10 15:31:03,713 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 150 states, 96 states have (on average 1.6145833333333333) internal successors, (155), 149 states have internal predecessors, (155), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:03,714 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 150 states to 150 states and 155 transitions. [2024-11-10 15:31:03,714 INFO L78 Accepts]: Start accepts. Automaton has 150 states and 155 transitions. Word has length 16 [2024-11-10 15:31:03,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:03,714 INFO L471 AbstractCegarLoop]: Abstraction has 150 states and 155 transitions. [2024-11-10 15:31:03,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.4) internal successors, (27), 5 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:03,715 INFO L276 IsEmpty]: Start isEmpty. Operand 150 states and 155 transitions. [2024-11-10 15:31:03,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 15:31:03,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:03,715 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:03,732 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2024-11-10 15:31:03,916 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7,2 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:03,916 INFO L396 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:03,917 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:03,917 INFO L85 PathProgramCache]: Analyzing trace with hash 1515707331, now seen corresponding path program 1 times [2024-11-10 15:31:03,917 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:03,917 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1061482484] [2024-11-10 15:31:03,917 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:03,917 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:03,937 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:04,022 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 4 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:04,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:04,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1061482484] [2024-11-10 15:31:04,023 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1061482484] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:04,023 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [555858374] [2024-11-10 15:31:04,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:04,024 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:04,024 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:04,026 INFO L229 MonitoredProcess]: Starting monitored process 3 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:31:04,031 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2024-11-10 15:31:04,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:04,151 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 9 conjuncts are in the unsatisfiable core [2024-11-10 15:31:04,153 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:31:04,226 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:31:04,269 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:31:04,270 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-10 15:31:04,288 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:04,288 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:31:04,312 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:04,313 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [555858374] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:31:04,313 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:31:04,313 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 3, 3] total 4 [2024-11-10 15:31:04,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1896570899] [2024-11-10 15:31:04,314 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:31:04,314 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2024-11-10 15:31:04,314 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:04,315 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2024-11-10 15:31:04,315 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2024-11-10 15:31:04,315 INFO L87 Difference]: Start difference. First operand 150 states and 155 transitions. Second operand has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:04,447 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:04,447 INFO L93 Difference]: Finished difference Result 148 states and 153 transitions. [2024-11-10 15:31:04,448 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:31:04,448 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-10 15:31:04,448 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:04,449 INFO L225 Difference]: With dead ends: 148 [2024-11-10 15:31:04,449 INFO L226 Difference]: Without dead ends: 148 [2024-11-10 15:31:04,449 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 39 GetRequests, 33 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-11-10 15:31:04,449 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 7 mSDsluCounter, 159 mSDsCounter, 0 mSdLazyCounter, 137 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 296 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 137 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:04,450 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 296 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 137 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:31:04,450 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 148 states. [2024-11-10 15:31:04,453 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 148 to 148. [2024-11-10 15:31:04,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 148 states, 96 states have (on average 1.59375) internal successors, (153), 147 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:04,454 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 148 states to 148 states and 153 transitions. [2024-11-10 15:31:04,454 INFO L78 Accepts]: Start accepts. Automaton has 148 states and 153 transitions. Word has length 17 [2024-11-10 15:31:04,454 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:04,454 INFO L471 AbstractCegarLoop]: Abstraction has 148 states and 153 transitions. [2024-11-10 15:31:04,454 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.75) internal successors, (23), 5 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:04,454 INFO L276 IsEmpty]: Start isEmpty. Operand 148 states and 153 transitions. [2024-11-10 15:31:04,455 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2024-11-10 15:31:04,456 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:04,456 INFO L215 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:04,472 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2024-11-10 15:31:04,659 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable8 [2024-11-10 15:31:04,660 INFO L396 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:04,660 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:04,660 INFO L85 PathProgramCache]: Analyzing trace with hash 1515707332, now seen corresponding path program 1 times [2024-11-10 15:31:04,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:04,660 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1072979260] [2024-11-10 15:31:04,660 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:04,660 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:04,675 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:04,808 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:04,808 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:04,808 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1072979260] [2024-11-10 15:31:04,809 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1072979260] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:04,809 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1962486381] [2024-11-10 15:31:04,809 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:04,809 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:04,809 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:04,811 INFO L229 MonitoredProcess]: Starting monitored process 4 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:31:04,813 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2024-11-10 15:31:04,889 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:04,890 INFO L255 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 13 conjuncts are in the unsatisfiable core [2024-11-10 15:31:04,892 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:31:04,900 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:31:04,960 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:31:04,960 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-10 15:31:04,985 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:04,985 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:31:05,108 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:05,109 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1962486381] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:31:05,109 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:31:05,109 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 4] total 7 [2024-11-10 15:31:05,109 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582951126] [2024-11-10 15:31:05,109 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:31:05,110 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2024-11-10 15:31:05,110 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:05,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2024-11-10 15:31:05,111 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:31:05,111 INFO L87 Difference]: Start difference. First operand 148 states and 153 transitions. Second operand has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:05,175 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:05,175 INFO L93 Difference]: Finished difference Result 146 states and 151 transitions. [2024-11-10 15:31:05,175 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2024-11-10 15:31:05,175 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2024-11-10 15:31:05,176 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:05,176 INFO L225 Difference]: With dead ends: 146 [2024-11-10 15:31:05,176 INFO L226 Difference]: Without dead ends: 146 [2024-11-10 15:31:05,176 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 37 GetRequests, 29 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=28, Invalid=44, Unknown=0, NotChecked=0, Total=72 [2024-11-10 15:31:05,177 INFO L432 NwaCegarLoop]: 137 mSDtfsCounter, 9 mSDsluCounter, 378 mSDsCounter, 0 mSdLazyCounter, 53 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 515 SdHoareTripleChecker+Invalid, 54 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 53 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:05,177 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 515 Invalid, 54 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 53 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2024-11-10 15:31:05,178 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 146 states. [2024-11-10 15:31:05,181 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 146 to 146. [2024-11-10 15:31:05,181 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 146 states, 96 states have (on average 1.5729166666666667) internal successors, (151), 145 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:05,182 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 146 states to 146 states and 151 transitions. [2024-11-10 15:31:05,182 INFO L78 Accepts]: Start accepts. Automaton has 146 states and 151 transitions. Word has length 17 [2024-11-10 15:31:05,182 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:05,182 INFO L471 AbstractCegarLoop]: Abstraction has 146 states and 151 transitions. [2024-11-10 15:31:05,182 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 4.714285714285714) internal successors, (33), 8 states have internal predecessors, (33), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:05,183 INFO L276 IsEmpty]: Start isEmpty. Operand 146 states and 151 transitions. [2024-11-10 15:31:05,183 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:31:05,183 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:05,183 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:05,200 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2024-11-10 15:31:05,384 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,4 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:05,384 INFO L396 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:05,385 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:05,385 INFO L85 PathProgramCache]: Analyzing trace with hash -497544961, now seen corresponding path program 1 times [2024-11-10 15:31:05,385 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:05,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1265240620] [2024-11-10 15:31:05,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:05,385 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:05,406 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:05,503 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 6 proven. 0 refuted. 0 times theorem prover too weak. 4 trivial. 0 not checked. [2024-11-10 15:31:05,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:05,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1265240620] [2024-11-10 15:31:05,504 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1265240620] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:31:05,504 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:31:05,504 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:31:05,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [191793412] [2024-11-10 15:31:05,504 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:31:05,504 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:31:05,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:05,505 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:31:05,505 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:31:05,505 INFO L87 Difference]: Start difference. First operand 146 states and 151 transitions. Second operand has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:05,705 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:05,706 INFO L93 Difference]: Finished difference Result 143 states and 148 transitions. [2024-11-10 15:31:05,706 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:31:05,706 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 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 25 [2024-11-10 15:31:05,707 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:05,707 INFO L225 Difference]: With dead ends: 143 [2024-11-10 15:31:05,708 INFO L226 Difference]: Without dead ends: 143 [2024-11-10 15:31:05,708 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:31:05,709 INFO L432 NwaCegarLoop]: 119 mSDtfsCounter, 27 mSDsluCounter, 280 mSDsCounter, 0 mSdLazyCounter, 284 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 27 SdHoareTripleChecker+Valid, 399 SdHoareTripleChecker+Invalid, 288 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 284 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:05,709 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [27 Valid, 399 Invalid, 288 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 284 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:31:05,710 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2024-11-10 15:31:05,711 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 143. [2024-11-10 15:31:05,712 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 96 states have (on average 1.5416666666666667) internal successors, (148), 142 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:05,712 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 148 transitions. [2024-11-10 15:31:05,712 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 148 transitions. Word has length 25 [2024-11-10 15:31:05,714 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:05,714 INFO L471 AbstractCegarLoop]: Abstraction has 143 states and 148 transitions. [2024-11-10 15:31:05,714 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 4.4) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:05,714 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 148 transitions. [2024-11-10 15:31:05,715 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2024-11-10 15:31:05,715 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:05,715 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:05,715 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2024-11-10 15:31:05,715 INFO L396 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:05,716 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:05,716 INFO L85 PathProgramCache]: Analyzing trace with hash -497544960, now seen corresponding path program 1 times [2024-11-10 15:31:05,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:05,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [74429097] [2024-11-10 15:31:05,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:05,716 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:05,738 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:05,874 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:31:05,875 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:05,875 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [74429097] [2024-11-10 15:31:05,875 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [74429097] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:31:05,875 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:31:05,875 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2024-11-10 15:31:05,875 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1602382674] [2024-11-10 15:31:05,875 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:31:05,876 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2024-11-10 15:31:05,876 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:05,876 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2024-11-10 15:31:05,876 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:31:05,877 INFO L87 Difference]: Start difference. First operand 143 states and 148 transitions. Second operand has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:05,987 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:05,987 INFO L93 Difference]: Finished difference Result 136 states and 141 transitions. [2024-11-10 15:31:05,988 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2024-11-10 15:31:05,988 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 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-11-10 15:31:05,988 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:05,989 INFO L225 Difference]: With dead ends: 136 [2024-11-10 15:31:05,989 INFO L226 Difference]: Without dead ends: 136 [2024-11-10 15:31:05,989 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 7 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 6 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2024-11-10 15:31:05,989 INFO L432 NwaCegarLoop]: 120 mSDtfsCounter, 43 mSDsluCounter, 401 mSDsCounter, 0 mSdLazyCounter, 118 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 43 SdHoareTripleChecker+Valid, 521 SdHoareTripleChecker+Invalid, 124 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 118 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:05,990 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [43 Valid, 521 Invalid, 124 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 118 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:31:05,990 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2024-11-10 15:31:05,992 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 136. [2024-11-10 15:31:05,992 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 96 states have (on average 1.46875) internal successors, (141), 135 states have internal predecessors, (141), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:05,993 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 141 transitions. [2024-11-10 15:31:05,993 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 141 transitions. Word has length 25 [2024-11-10 15:31:05,993 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:05,993 INFO L471 AbstractCegarLoop]: Abstraction has 136 states and 141 transitions. [2024-11-10 15:31:05,993 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 4.0) internal successors, (24), 7 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:05,993 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 141 transitions. [2024-11-10 15:31:05,994 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 15:31:05,994 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:05,994 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:05,994 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2024-11-10 15:31:05,995 INFO L396 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:05,995 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:05,995 INFO L85 PathProgramCache]: Analyzing trace with hash -2084158823, now seen corresponding path program 1 times [2024-11-10 15:31:05,995 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:05,995 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2010473696] [2024-11-10 15:31:05,995 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:05,996 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:06,027 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:06,500 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:06,503 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:06,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2010473696] [2024-11-10 15:31:06,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2010473696] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:06,503 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1135948293] [2024-11-10 15:31:06,504 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:06,504 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:06,504 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:06,506 INFO L229 MonitoredProcess]: Starting monitored process 5 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:31:06,508 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2024-11-10 15:31:06,610 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:06,612 INFO L255 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-10 15:31:06,615 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:31:06,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:31:06,660 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:31:06,661 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-10 15:31:06,723 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-10 15:31:06,723 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-11-10 15:31:06,764 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-11-10 15:31:06,796 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-11-10 15:31:06,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 11 [2024-11-10 15:31:06,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2024-11-10 15:31:06,868 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:06,868 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:31:06,891 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_388 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) 0)) is different from false [2024-11-10 15:31:06,908 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_388 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_388) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|) 0)) is different from false [2024-11-10 15:31:06,952 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:06,952 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-10 15:31:06,960 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 60 treesize of output 52 [2024-11-10 15:31:06,964 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 48 treesize of output 44 [2024-11-10 15:31:06,968 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-10 15:31:07,199 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-10 15:31:07,200 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1135948293] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:31:07,200 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:31:07,200 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 13, 13] total 25 [2024-11-10 15:31:07,200 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1894933732] [2024-11-10 15:31:07,200 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:31:07,201 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2024-11-10 15:31:07,201 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:07,202 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2024-11-10 15:31:07,202 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=70, Invalid=477, Unknown=13, NotChecked=90, Total=650 [2024-11-10 15:31:07,202 INFO L87 Difference]: Start difference. First operand 136 states and 141 transitions. Second operand has 26 states, 25 states have (on average 2.6) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:07,821 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:07,821 INFO L93 Difference]: Finished difference Result 134 states and 139 transitions. [2024-11-10 15:31:07,821 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 15:31:07,821 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.6) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 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 31 [2024-11-10 15:31:07,822 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:07,822 INFO L225 Difference]: With dead ends: 134 [2024-11-10 15:31:07,822 INFO L226 Difference]: Without dead ends: 134 [2024-11-10 15:31:07,823 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 34 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 145 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=172, Invalid=944, Unknown=14, NotChecked=130, Total=1260 [2024-11-10 15:31:07,824 INFO L432 NwaCegarLoop]: 104 mSDtfsCounter, 84 mSDsluCounter, 1308 mSDsCounter, 0 mSdLazyCounter, 632 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 84 SdHoareTripleChecker+Valid, 1412 SdHoareTripleChecker+Invalid, 819 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 632 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 177 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:07,824 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [84 Valid, 1412 Invalid, 819 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 632 Invalid, 0 Unknown, 177 Unchecked, 0.4s Time] [2024-11-10 15:31:07,825 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2024-11-10 15:31:07,826 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 131. [2024-11-10 15:31:07,826 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 131 states, 96 states have (on average 1.4166666666666667) internal successors, (136), 130 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:07,827 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 131 states to 131 states and 136 transitions. [2024-11-10 15:31:07,827 INFO L78 Accepts]: Start accepts. Automaton has 131 states and 136 transitions. Word has length 31 [2024-11-10 15:31:07,827 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:07,827 INFO L471 AbstractCegarLoop]: Abstraction has 131 states and 136 transitions. [2024-11-10 15:31:07,827 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.6) internal successors, (65), 26 states have internal predecessors, (65), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:07,827 INFO L276 IsEmpty]: Start isEmpty. Operand 131 states and 136 transitions. [2024-11-10 15:31:07,831 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 15:31:07,831 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:07,831 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:07,849 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2024-11-10 15:31:08,032 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12,5 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:08,032 INFO L396 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr45ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:08,033 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:08,033 INFO L85 PathProgramCache]: Analyzing trace with hash -2084157607, now seen corresponding path program 1 times [2024-11-10 15:31:08,033 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:08,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156644518] [2024-11-10 15:31:08,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:08,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:08,062 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:08,343 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:31:08,343 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:08,343 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156644518] [2024-11-10 15:31:08,344 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156644518] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:31:08,344 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:31:08,344 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:31:08,344 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1775521548] [2024-11-10 15:31:08,344 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:31:08,344 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:31:08,344 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:08,345 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:31:08,345 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:31:08,345 INFO L87 Difference]: Start difference. First operand 131 states and 136 transitions. Second operand has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:08,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:08,487 INFO L93 Difference]: Finished difference Result 126 states and 131 transitions. [2024-11-10 15:31:08,487 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:31:08,487 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 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 31 [2024-11-10 15:31:08,489 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:08,489 INFO L225 Difference]: With dead ends: 126 [2024-11-10 15:31:08,489 INFO L226 Difference]: Without dead ends: 126 [2024-11-10 15:31:08,490 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:31:08,490 INFO L432 NwaCegarLoop]: 98 mSDtfsCounter, 82 mSDsluCounter, 513 mSDsCounter, 0 mSdLazyCounter, 196 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 82 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 201 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 196 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:08,490 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [82 Valid, 611 Invalid, 201 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 196 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:31:08,491 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2024-11-10 15:31:08,492 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 126. [2024-11-10 15:31:08,492 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 126 states, 96 states have (on average 1.3645833333333333) internal successors, (131), 125 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:08,493 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 126 states to 126 states and 131 transitions. [2024-11-10 15:31:08,493 INFO L78 Accepts]: Start accepts. Automaton has 126 states and 131 transitions. Word has length 31 [2024-11-10 15:31:08,493 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:08,493 INFO L471 AbstractCegarLoop]: Abstraction has 126 states and 131 transitions. [2024-11-10 15:31:08,493 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.0) internal successors, (30), 11 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:08,493 INFO L276 IsEmpty]: Start isEmpty. Operand 126 states and 131 transitions. [2024-11-10 15:31:08,495 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2024-11-10 15:31:08,495 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:08,495 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:08,495 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2024-11-10 15:31:08,495 INFO L396 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr14ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:08,495 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:08,495 INFO L85 PathProgramCache]: Analyzing trace with hash -2084234100, now seen corresponding path program 1 times [2024-11-10 15:31:08,496 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:08,496 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1229424921] [2024-11-10 15:31:08,496 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:08,496 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:08,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:08,594 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:31:08,594 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:08,594 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1229424921] [2024-11-10 15:31:08,594 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1229424921] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:31:08,594 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:31:08,595 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2024-11-10 15:31:08,595 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [649417065] [2024-11-10 15:31:08,595 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:31:08,595 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2024-11-10 15:31:08,595 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:08,595 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2024-11-10 15:31:08,596 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=21, Unknown=0, NotChecked=0, Total=30 [2024-11-10 15:31:08,596 INFO L87 Difference]: Start difference. First operand 126 states and 131 transitions. Second operand has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:08,739 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:08,739 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2024-11-10 15:31:08,739 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2024-11-10 15:31:08,739 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 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 31 [2024-11-10 15:31:08,740 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:08,741 INFO L225 Difference]: With dead ends: 121 [2024-11-10 15:31:08,741 INFO L226 Difference]: Without dead ends: 121 [2024-11-10 15:31:08,741 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2024-11-10 15:31:08,742 INFO L432 NwaCegarLoop]: 82 mSDtfsCounter, 48 mSDsluCounter, 233 mSDsCounter, 0 mSdLazyCounter, 231 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 315 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 231 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:08,742 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 315 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 231 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2024-11-10 15:31:08,742 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2024-11-10 15:31:08,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2024-11-10 15:31:08,748 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 96 states have (on average 1.3125) 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-11-10 15:31:08,748 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2024-11-10 15:31:08,748 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 31 [2024-11-10 15:31:08,748 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:08,748 INFO L471 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2024-11-10 15:31:08,749 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 6.0) internal successors, (30), 6 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:08,749 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2024-11-10 15:31:08,749 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:31:08,749 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:08,749 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:08,749 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2024-11-10 15:31:08,749 INFO L396 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr29ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:08,750 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:08,750 INFO L85 PathProgramCache]: Analyzing trace with hash -184414022, now seen corresponding path program 1 times [2024-11-10 15:31:08,750 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:08,750 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [499650223] [2024-11-10 15:31:08,750 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:08,750 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:08,775 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:09,265 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:09,266 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:09,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [499650223] [2024-11-10 15:31:09,266 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [499650223] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:09,266 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [702715411] [2024-11-10 15:31:09,266 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:09,266 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:09,266 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:09,268 INFO L229 MonitoredProcess]: Starting monitored process 6 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:31:09,269 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2024-11-10 15:31:09,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:09,377 INFO L255 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 40 conjuncts are in the unsatisfiable core [2024-11-10 15:31:09,379 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:31:09,383 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:31:09,419 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:31:09,419 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-10 15:31:09,512 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-10 15:31:09,513 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-11-10 15:31:09,550 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-11-10 15:31:09,600 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:31:09,600 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-11-10 15:31:09,687 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-11-10 15:31:09,728 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-11-10 15:31:09,813 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 25 treesize of output 13 [2024-11-10 15:31:09,822 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:09,822 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:31:09,899 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_546) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|) |c_#StackHeapBarrier|)) is different from false [2024-11-10 15:31:09,911 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int))) (< (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_546) |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-11-10 15:31:09,918 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_546 (Array Int Int)) (v_ArrVal_545 (Array Int Int))) (< (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_545) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_546) |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-11-10 15:31:09,925 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:09,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-10 15:31:09,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 122 treesize of output 110 [2024-11-10 15:31:09,935 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-11-10 15:31:09,948 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-11-10 15:31:10,110 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-10 15:31:10,110 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [702715411] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:31:10,110 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:31:10,110 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 13] total 31 [2024-11-10 15:31:10,110 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1468024311] [2024-11-10 15:31:10,110 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:31:10,111 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 32 states [2024-11-10 15:31:10,111 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:10,111 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 32 interpolants. [2024-11-10 15:31:10,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=90, Invalid=731, Unknown=3, NotChecked=168, Total=992 [2024-11-10 15:31:10,112 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 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-11-10 15:31:11,082 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:11,082 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2024-11-10 15:31:11,082 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 15:31:11,083 INFO L78 Accepts]: Start accepts. Automaton has has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 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) Word has length 32 [2024-11-10 15:31:11,083 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:11,083 INFO L225 Difference]: With dead ends: 119 [2024-11-10 15:31:11,083 INFO L226 Difference]: Without dead ends: 119 [2024-11-10 15:31:11,084 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 46 SyntacticMatches, 5 SemanticMatches, 40 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 354 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=209, Invalid=1282, Unknown=3, NotChecked=228, Total=1722 [2024-11-10 15:31:11,085 INFO L432 NwaCegarLoop]: 66 mSDtfsCounter, 125 mSDsluCounter, 912 mSDsCounter, 0 mSdLazyCounter, 1363 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 125 SdHoareTripleChecker+Valid, 978 SdHoareTripleChecker+Invalid, 1681 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 1363 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 305 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:11,085 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [125 Valid, 978 Invalid, 1681 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 1363 Invalid, 0 Unknown, 305 Unchecked, 0.7s Time] [2024-11-10 15:31:11,085 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2024-11-10 15:31:11,087 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 116. [2024-11-10 15:31:11,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 96 states have (on average 1.2604166666666667) 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-11-10 15:31:11,087 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2024-11-10 15:31:11,087 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 32 [2024-11-10 15:31:11,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:11,088 INFO L471 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2024-11-10 15:31:11,088 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 32 states, 31 states have (on average 2.4193548387096775) internal successors, (75), 32 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-11-10 15:31:11,088 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2024-11-10 15:31:11,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2024-11-10 15:31:11,088 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:11,088 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:11,104 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2024-11-10 15:31:11,292 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable15 [2024-11-10 15:31:11,293 INFO L396 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr44ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:11,293 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:11,293 INFO L85 PathProgramCache]: Analyzing trace with hash -184376288, now seen corresponding path program 1 times [2024-11-10 15:31:11,293 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:11,293 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [349449225] [2024-11-10 15:31:11,293 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:11,294 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:11,320 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:11,600 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:31:11,601 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:11,601 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [349449225] [2024-11-10 15:31:11,601 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [349449225] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:31:11,601 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:31:11,601 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [10] imperfect sequences [] total 10 [2024-11-10 15:31:11,601 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2032746668] [2024-11-10 15:31:11,601 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:31:11,602 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2024-11-10 15:31:11,602 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:11,602 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2024-11-10 15:31:11,603 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=88, Unknown=0, NotChecked=0, Total=110 [2024-11-10 15:31:11,603 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:11,888 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:11,889 INFO L93 Difference]: Finished difference Result 111 states and 116 transitions. [2024-11-10 15:31:11,889 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2024-11-10 15:31:11,889 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2024-11-10 15:31:11,889 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:11,890 INFO L225 Difference]: With dead ends: 111 [2024-11-10 15:31:11,890 INFO L226 Difference]: Without dead ends: 111 [2024-11-10 15:31:11,890 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 12 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 19 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=146, Unknown=0, NotChecked=0, Total=182 [2024-11-10 15:31:11,891 INFO L432 NwaCegarLoop]: 62 mSDtfsCounter, 79 mSDsluCounter, 361 mSDsCounter, 0 mSdLazyCounter, 436 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 79 SdHoareTripleChecker+Valid, 423 SdHoareTripleChecker+Invalid, 441 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 436 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:11,891 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [79 Valid, 423 Invalid, 441 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 436 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2024-11-10 15:31:11,892 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2024-11-10 15:31:11,893 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2024-11-10 15:31:11,893 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 96 states have (on average 1.2083333333333333) internal successors, (116), 110 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:11,893 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 116 transitions. [2024-11-10 15:31:11,894 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 116 transitions. Word has length 32 [2024-11-10 15:31:11,894 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:11,894 INFO L471 AbstractCegarLoop]: Abstraction has 111 states and 116 transitions. [2024-11-10 15:31:11,894 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 3.1) internal successors, (31), 11 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:11,894 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 116 transitions. [2024-11-10 15:31:11,894 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 15:31:11,894 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:11,894 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 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-11-10 15:31:11,894 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2024-11-10 15:31:11,895 INFO L396 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr28ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:11,895 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:11,895 INFO L85 PathProgramCache]: Analyzing trace with hash -1421867337, now seen corresponding path program 1 times [2024-11-10 15:31:11,895 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:11,895 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [477448587] [2024-11-10 15:31:11,895 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:11,895 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:11,920 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:12,295 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:12,295 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:12,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [477448587] [2024-11-10 15:31:12,295 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [477448587] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:12,295 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [133637673] [2024-11-10 15:31:12,295 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:12,295 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:12,295 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:12,297 INFO L229 MonitoredProcess]: Starting monitored process 7 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:31:12,298 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2024-11-10 15:31:12,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:12,408 INFO L255 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 44 conjuncts are in the unsatisfiable core [2024-11-10 15:31:12,412 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:31:12,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-11-10 15:31:12,500 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-10 15:31:12,501 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-11-10 15:31:12,532 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-11-10 15:31:12,569 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:31:12,569 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 34 treesize of output 33 [2024-11-10 15:31:12,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 26 treesize of output 19 [2024-11-10 15:31:12,681 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 37 treesize of output 17 [2024-11-10 15:31:12,747 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 25 treesize of output 13 [2024-11-10 15:31:12,756 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:12,756 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:31:12,783 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_666 (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_666) |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-11-10 15:31:12,795 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_666 (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_666) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1)) is different from false [2024-11-10 15:31:12,806 INFO L349 Elim1Store]: treesize reduction 5, result has 72.2 percent of original size [2024-11-10 15:31:12,807 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-11-10 15:31:20,873 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:20,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 21 treesize of output 22 [2024-11-10 15:31:20,876 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 60 treesize of output 52 [2024-11-10 15:31:20,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 22 [2024-11-10 15:31:20,893 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-11-10 15:31:20,971 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-10 15:31:20,972 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-11-10 15:31:20,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2024-11-10 15:31:20,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [133637673] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:31:20,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:31:20,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 14, 14] total 29 [2024-11-10 15:31:20,978 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1329207892] [2024-11-10 15:31:20,978 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:31:20,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 15:31:20,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:20,979 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 15:31:20,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=84, Invalid=667, Unknown=13, NotChecked=106, Total=870 [2024-11-10 15:31:20,980 INFO L87 Difference]: Start difference. First operand 111 states and 116 transitions. Second operand has 30 states, 29 states have (on average 2.310344827586207) internal successors, (67), 30 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-11-10 15:31:21,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:21,604 INFO L93 Difference]: Finished difference Result 110 states and 115 transitions. [2024-11-10 15:31:21,605 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:31:21,605 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 2.310344827586207) internal successors, (67), 30 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 33 [2024-11-10 15:31:21,605 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:21,606 INFO L225 Difference]: With dead ends: 110 [2024-11-10 15:31:21,606 INFO L226 Difference]: Without dead ends: 110 [2024-11-10 15:31:21,606 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 54 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 254 ImplicationChecksByTransitivity, 8.5s TimeCoverageRelationStatistics Valid=181, Invalid=1146, Unknown=13, NotChecked=142, Total=1482 [2024-11-10 15:31:21,607 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 40 mSDsluCounter, 984 mSDsCounter, 0 mSdLazyCounter, 1006 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 40 SdHoareTripleChecker+Valid, 1067 SdHoareTripleChecker+Invalid, 1177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1006 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 155 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:21,607 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [40 Valid, 1067 Invalid, 1177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1006 Invalid, 0 Unknown, 155 Unchecked, 0.5s Time] [2024-11-10 15:31:21,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 110 states. [2024-11-10 15:31:21,609 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 110 to 110. [2024-11-10 15:31:21,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 110 states, 96 states have (on average 1.1979166666666667) internal successors, (115), 109 states have internal predecessors, (115), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:21,610 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 110 states to 110 states and 115 transitions. [2024-11-10 15:31:21,610 INFO L78 Accepts]: Start accepts. Automaton has 110 states and 115 transitions. Word has length 33 [2024-11-10 15:31:21,610 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:21,610 INFO L471 AbstractCegarLoop]: Abstraction has 110 states and 115 transitions. [2024-11-10 15:31:21,610 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 2.310344827586207) internal successors, (67), 30 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-11-10 15:31:21,610 INFO L276 IsEmpty]: Start isEmpty. Operand 110 states and 115 transitions. [2024-11-10 15:31:21,611 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2024-11-10 15:31:21,611 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:21,611 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 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-11-10 15:31:21,628 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2024-11-10 15:31:21,811 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable17 [2024-11-10 15:31:21,812 INFO L396 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr43ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:21,812 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:21,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1420697545, now seen corresponding path program 1 times [2024-11-10 15:31:21,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:21,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1929706361] [2024-11-10 15:31:21,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:21,813 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:21,835 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:22,103 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 8 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2024-11-10 15:31:22,103 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:22,103 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1929706361] [2024-11-10 15:31:22,103 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1929706361] provided 1 perfect and 0 imperfect interpolant sequences [2024-11-10 15:31:22,104 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2024-11-10 15:31:22,104 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [11] imperfect sequences [] total 11 [2024-11-10 15:31:22,104 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [890637416] [2024-11-10 15:31:22,104 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2024-11-10 15:31:22,105 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2024-11-10 15:31:22,105 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:22,106 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2024-11-10 15:31:22,106 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=106, Unknown=0, NotChecked=0, Total=132 [2024-11-10 15:31:22,106 INFO L87 Difference]: Start difference. First operand 110 states and 115 transitions. Second operand has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:22,425 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:22,425 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2024-11-10 15:31:22,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2024-11-10 15:31:22,426 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 33 [2024-11-10 15:31:22,426 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:22,426 INFO L225 Difference]: With dead ends: 109 [2024-11-10 15:31:22,426 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 15:31:22,427 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 13 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=40, Invalid=170, Unknown=0, NotChecked=0, Total=210 [2024-11-10 15:31:22,427 INFO L432 NwaCegarLoop]: 83 mSDtfsCounter, 32 mSDsluCounter, 486 mSDsCounter, 0 mSdLazyCounter, 524 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 32 SdHoareTripleChecker+Valid, 569 SdHoareTripleChecker+Invalid, 525 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 524 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:22,428 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [32 Valid, 569 Invalid, 525 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 524 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:31:22,429 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 15:31:22,430 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2024-11-10 15:31:22,430 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 96 states have (on average 1.1875) 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-11-10 15:31:22,431 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2024-11-10 15:31:22,432 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 33 [2024-11-10 15:31:22,432 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:22,432 INFO L471 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2024-11-10 15:31:22,433 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.909090909090909) internal successors, (32), 12 states have internal predecessors, (32), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:22,433 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2024-11-10 15:31:22,433 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 15:31:22,433 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:22,433 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 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, 1, 1] [2024-11-10 15:31:22,433 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2024-11-10 15:31:22,433 INFO L396 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:22,434 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:22,434 INFO L85 PathProgramCache]: Analyzing trace with hash 197062567, now seen corresponding path program 1 times [2024-11-10 15:31:22,434 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:22,434 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1199865100] [2024-11-10 15:31:22,434 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:22,434 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:22,456 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:22,933 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 3 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:22,933 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:22,933 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1199865100] [2024-11-10 15:31:22,933 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1199865100] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:22,934 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [459948274] [2024-11-10 15:31:22,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:22,934 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:22,934 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:22,936 INFO L229 MonitoredProcess]: Starting monitored process 8 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:31:22,937 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2024-11-10 15:31:23,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:23,054 INFO L255 TraceCheckSpWp]: Trace formula consists of 228 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-10 15:31:23,057 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:31:23,097 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:31:23,097 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:31:23,168 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-11-10 15:31:23,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:23,233 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-11-10 15:31:23,414 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-10 15:31:23,414 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-11-10 15:31:23,419 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:23,419 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:31:23,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 13 treesize of output 11 [2024-11-10 15:31:23,538 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-11-10 15:31:23,554 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-10 15:31:23,613 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-10 15:31:23,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 12 [2024-11-10 15:31:23,619 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:23,619 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [459948274] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:31:23,619 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:31:23,619 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 14, 14] total 28 [2024-11-10 15:31:23,619 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2027337765] [2024-11-10 15:31:23,619 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:31:23,620 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 29 states [2024-11-10 15:31:23,620 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:23,620 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 29 interpolants. [2024-11-10 15:31:23,620 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=96, Invalid=716, Unknown=0, NotChecked=0, Total=812 [2024-11-10 15:31:23,621 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand has 29 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 29 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-11-10 15:31:24,002 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:24,003 INFO L93 Difference]: Finished difference Result 108 states and 113 transitions. [2024-11-10 15:31:24,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2024-11-10 15:31:24,003 INFO L78 Accepts]: Start accepts. Automaton has has 29 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 29 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 37 [2024-11-10 15:31:24,003 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:24,004 INFO L225 Difference]: With dead ends: 108 [2024-11-10 15:31:24,004 INFO L226 Difference]: Without dead ends: 108 [2024-11-10 15:31:24,004 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 91 GetRequests, 55 SyntacticMatches, 3 SemanticMatches, 33 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 310 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=153, Invalid=1037, Unknown=0, NotChecked=0, Total=1190 [2024-11-10 15:31:24,005 INFO L432 NwaCegarLoop]: 75 mSDtfsCounter, 90 mSDsluCounter, 546 mSDsCounter, 0 mSdLazyCounter, 693 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 621 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 693 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:24,005 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 621 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 693 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2024-11-10 15:31:24,005 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 108 states. [2024-11-10 15:31:24,006 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 108 to 108. [2024-11-10 15:31:24,007 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 108 states, 96 states have (on average 1.1770833333333333) internal successors, (113), 107 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:24,007 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 108 states to 108 states and 113 transitions. [2024-11-10 15:31:24,007 INFO L78 Accepts]: Start accepts. Automaton has 108 states and 113 transitions. Word has length 37 [2024-11-10 15:31:24,007 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:24,007 INFO L471 AbstractCegarLoop]: Abstraction has 108 states and 113 transitions. [2024-11-10 15:31:24,007 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 29 states, 28 states have (on average 2.7142857142857144) internal successors, (76), 29 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-11-10 15:31:24,008 INFO L276 IsEmpty]: Start isEmpty. Operand 108 states and 113 transitions. [2024-11-10 15:31:24,008 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 38 [2024-11-10 15:31:24,008 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:24,008 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 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, 1, 1] [2024-11-10 15:31:24,026 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2024-11-10 15:31:24,208 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,8 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:24,209 INFO L396 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr4ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:24,209 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:24,209 INFO L85 PathProgramCache]: Analyzing trace with hash 196600807, now seen corresponding path program 1 times [2024-11-10 15:31:24,209 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:24,209 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [638070535] [2024-11-10 15:31:24,209 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:24,210 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:24,225 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:24,650 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:24,650 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:24,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [638070535] [2024-11-10 15:31:24,650 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [638070535] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:24,650 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [358107837] [2024-11-10 15:31:24,650 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:24,651 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:24,651 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:24,652 INFO L229 MonitoredProcess]: Starting monitored process 9 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:31:24,653 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2024-11-10 15:31:24,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:24,780 INFO L255 TraceCheckSpWp]: Trace formula consists of 227 conjuncts, 47 conjuncts are in the unsatisfiable core [2024-11-10 15:31:24,782 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:31:24,788 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:31:24,874 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-10 15:31:24,875 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-11-10 15:31:24,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:31:24,906 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:31:24,907 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-11-10 15:31:24,959 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-11-10 15:31:24,973 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-11-10 15:31:25,126 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:25,126 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-11-10 15:31:25,309 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-11-10 15:31:25,314 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:25,314 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:31:25,691 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_870 (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_870) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)) 1)) (forall ((v_ArrVal_870 (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_870) |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-11-10 15:31:25,703 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:25,704 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-11-10 15:31:25,726 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_1 (Array Int Int)) (v_prenex_2 (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_1) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_2) |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_~head~0#1.base|)) (forall ((v_ArrVal_869 (Array Int Int)) (v_ArrVal_870 (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_869) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_870) |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-11-10 15:31:25,734 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:25,734 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-11-10 15:31:25,736 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-11-10 15:31:25,741 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 46 treesize of output 44 [2024-11-10 15:31:25,749 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 104 treesize of output 100 [2024-11-10 15:31:25,760 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:25,760 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-11-10 15:31:25,843 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:25,843 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-11-10 15:31:25,849 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-11-10 15:31:25,861 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-10 15:31:25,861 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 93 [2024-11-10 15:31:25,869 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:31:25,871 WARN L214 Elim1Store]: Array PQE input equivalent to true [2024-11-10 15:31:25,878 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:31:25,996 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-10 15:31:25,997 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-11-10 15:31:26,000 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 2 not checked. [2024-11-10 15:31:26,000 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [358107837] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:31:26,000 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:31:26,000 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 17, 18] total 38 [2024-11-10 15:31:26,000 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [679346259] [2024-11-10 15:31:26,000 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:31:26,000 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-10 15:31:26,001 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:26,001 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-10 15:31:26,002 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=111, Invalid=1218, Unknown=11, NotChecked=142, Total=1482 [2024-11-10 15:31:26,002 INFO L87 Difference]: Start difference. First operand 108 states and 113 transitions. Second operand has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 39 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-11-10 15:31:27,044 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:27,044 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2024-11-10 15:31:27,044 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2024-11-10 15:31:27,045 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 39 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) Word has length 37 [2024-11-10 15:31:27,045 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:27,045 INFO L225 Difference]: With dead ends: 107 [2024-11-10 15:31:27,045 INFO L226 Difference]: Without dead ends: 107 [2024-11-10 15:31:27,046 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 482 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=253, Invalid=2294, Unknown=11, NotChecked=198, Total=2756 [2024-11-10 15:31:27,046 INFO L432 NwaCegarLoop]: 74 mSDtfsCounter, 85 mSDsluCounter, 914 mSDsCounter, 0 mSdLazyCounter, 1286 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 85 SdHoareTripleChecker+Valid, 988 SdHoareTripleChecker+Invalid, 1431 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 1286 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 130 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:27,047 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [85 Valid, 988 Invalid, 1431 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 1286 Invalid, 0 Unknown, 130 Unchecked, 0.6s Time] [2024-11-10 15:31:27,047 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-10 15:31:27,049 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2024-11-10 15:31:27,049 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 96 states have (on average 1.1666666666666667) internal successors, (112), 106 states have internal predecessors, (112), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:27,050 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 112 transitions. [2024-11-10 15:31:27,050 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 112 transitions. Word has length 37 [2024-11-10 15:31:27,050 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:27,050 INFO L471 AbstractCegarLoop]: Abstraction has 107 states and 112 transitions. [2024-11-10 15:31:27,051 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.1315789473684212) internal successors, (81), 39 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-11-10 15:31:27,051 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 112 transitions. [2024-11-10 15:31:27,051 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:31:27,051 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:27,051 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1] [2024-11-10 15:31:27,068 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Forceful destruction successful, exit code 0 [2024-11-10 15:31:27,255 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable20 [2024-11-10 15:31:27,256 INFO L396 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr25ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:27,256 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:27,256 INFO L85 PathProgramCache]: Analyzing trace with hash -724236395, now seen corresponding path program 1 times [2024-11-10 15:31:27,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:27,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1127485196] [2024-11-10 15:31:27,256 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:27,256 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:27,284 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:27,946 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:27,946 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:27,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1127485196] [2024-11-10 15:31:27,946 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1127485196] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:27,946 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1761134882] [2024-11-10 15:31:27,946 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:27,946 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:27,947 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:27,948 INFO L229 MonitoredProcess]: Starting monitored process 10 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:31:27,948 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2024-11-10 15:31:28,051 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:28,052 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 59 conjuncts are in the unsatisfiable core [2024-11-10 15:31:28,054 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:31:28,057 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:31:28,126 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:31:28,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:31:28,237 INFO L349 Elim1Store]: treesize reduction 40, result has 32.2 percent of original size [2024-11-10 15:31:28,238 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-11-10 15:31:28,277 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-11-10 15:31:28,326 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:31:28,326 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-11-10 15:31:28,430 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-11-10 15:31:28,447 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-11-10 15:31:28,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:28,715 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 69 treesize of output 29 [2024-11-10 15:31:28,874 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 24 treesize of output 20 [2024-11-10 15:31:28,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:28,927 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:31:29,327 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:29,327 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-11-10 15:31:29,330 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-11-10 15:31:29,336 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-10 15:31:29,339 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-10 15:31:29,346 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-10 15:31:29,991 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:29,991 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1761134882] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:31:29,991 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:31:29,991 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 18, 19] total 52 [2024-11-10 15:31:29,991 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1557812475] [2024-11-10 15:31:29,991 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:31:29,992 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2024-11-10 15:31:29,992 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:29,992 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2024-11-10 15:31:29,993 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=197, Invalid=2556, Unknown=3, NotChecked=0, Total=2756 [2024-11-10 15:31:29,994 INFO L87 Difference]: Start difference. First operand 107 states and 112 transitions. Second operand has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:31,700 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:31,700 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2024-11-10 15:31:31,701 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 15:31:31,701 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 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 38 [2024-11-10 15:31:31,701 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:31,702 INFO L225 Difference]: With dead ends: 109 [2024-11-10 15:31:31,702 INFO L226 Difference]: Without dead ends: 109 [2024-11-10 15:31:31,703 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 114 GetRequests, 42 SyntacticMatches, 2 SemanticMatches, 70 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1199 ImplicationChecksByTransitivity, 2.2s TimeCoverageRelationStatistics Valid=464, Invalid=4645, Unknown=3, NotChecked=0, Total=5112 [2024-11-10 15:31:31,703 INFO L432 NwaCegarLoop]: 72 mSDtfsCounter, 112 mSDsluCounter, 1169 mSDsCounter, 0 mSdLazyCounter, 2019 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 112 SdHoareTripleChecker+Valid, 1241 SdHoareTripleChecker+Invalid, 2040 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 2019 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:31,703 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [112 Valid, 1241 Invalid, 2040 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 2019 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2024-11-10 15:31:31,704 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2024-11-10 15:31:31,705 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 106. [2024-11-10 15:31:31,705 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 106 states, 96 states have (on average 1.15625) internal successors, (111), 105 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:31,706 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 106 states to 106 states and 111 transitions. [2024-11-10 15:31:31,706 INFO L78 Accepts]: Start accepts. Automaton has 106 states and 111 transitions. Word has length 38 [2024-11-10 15:31:31,706 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:31,706 INFO L471 AbstractCegarLoop]: Abstraction has 106 states and 111 transitions. [2024-11-10 15:31:31,706 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.9423076923076923) internal successors, (101), 53 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:31,706 INFO L276 IsEmpty]: Start isEmpty. Operand 106 states and 111 transitions. [2024-11-10 15:31:31,707 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:31:31,707 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:31,707 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1] [2024-11-10 15:31:31,726 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2024-11-10 15:31:31,907 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable21,10 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:31,907 INFO L396 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr19ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:31,908 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:31,908 INFO L85 PathProgramCache]: Analyzing trace with hash -724698155, now seen corresponding path program 1 times [2024-11-10 15:31:31,908 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:31,908 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1802760623] [2024-11-10 15:31:31,908 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:31,908 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:31,926 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:32,353 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:32,353 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:32,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1802760623] [2024-11-10 15:31:32,353 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1802760623] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:32,353 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [318022181] [2024-11-10 15:31:32,354 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:32,354 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:32,354 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:32,355 INFO L229 MonitoredProcess]: Starting monitored process 11 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:31:32,357 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2024-11-10 15:31:32,484 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:32,490 INFO L255 TraceCheckSpWp]: Trace formula consists of 231 conjuncts, 39 conjuncts are in the unsatisfiable core [2024-11-10 15:31:32,493 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:31:32,495 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:31:32,526 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2024-11-10 15:31:32,526 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 14 [2024-11-10 15:31:32,557 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-10 15:31:32,558 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-11-10 15:31:32,589 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-11-10 15:31:32,630 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:31:32,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 25 treesize of output 26 [2024-11-10 15:31:32,686 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-11-10 15:31:32,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:31:32,710 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 28 treesize of output 12 [2024-11-10 15:31:32,786 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:32,786 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 16 treesize of output 16 [2024-11-10 15:31:32,907 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:31:32,907 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-11-10 15:31:32,941 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:32,941 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:31:33,077 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-10 15:31:33,227 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1046 Int) (v_ArrVal_1044 (Array Int Int)) (v_ArrVal_1043 (Array Int Int)) (|v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_49| Int)) (or (not (= (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1043) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1044) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) (+ |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_49| 4) v_ArrVal_1046) 0) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (< |v_ULTIMATE.start_dll_circular_create_~head~0#1.offset_49| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|))) is different from false [2024-11-10 15:31:33,234 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:33,234 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-11-10 15:31:33,238 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-11-10 15:31:33,242 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 87 treesize of output 85 [2024-11-10 15:31:33,247 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 111 treesize of output 107 [2024-11-10 15:31:33,257 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:33,257 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 127 treesize of output 131 [2024-11-10 15:31:33,428 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-10 15:31:33,428 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [318022181] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:31:33,428 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:31:33,428 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [15, 17, 17] total 38 [2024-11-10 15:31:33,429 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [361024015] [2024-11-10 15:31:33,429 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:31:33,429 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2024-11-10 15:31:33,429 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:33,430 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2024-11-10 15:31:33,430 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=128, Invalid=1251, Unknown=31, NotChecked=72, Total=1482 [2024-11-10 15:31:33,430 INFO L87 Difference]: Start difference. First operand 106 states and 111 transitions. Second operand has 39 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 39 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:34,350 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:34,350 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2024-11-10 15:31:34,350 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 19 states. [2024-11-10 15:31:34,350 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 39 states have internal predecessors, (101), 0 states have call successors, (0), 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 38 [2024-11-10 15:31:34,350 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:34,351 INFO L225 Difference]: With dead ends: 105 [2024-11-10 15:31:34,351 INFO L226 Difference]: Without dead ends: 105 [2024-11-10 15:31:34,352 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 104 GetRequests, 52 SyntacticMatches, 1 SemanticMatches, 51 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 1.0s TimeCoverageRelationStatistics Valid=297, Invalid=2326, Unknown=33, NotChecked=100, Total=2756 [2024-11-10 15:31:34,352 INFO L432 NwaCegarLoop]: 60 mSDtfsCounter, 90 mSDsluCounter, 1037 mSDsCounter, 0 mSdLazyCounter, 1442 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 1097 SdHoareTripleChecker+Invalid, 1531 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1442 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 71 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:34,352 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 1097 Invalid, 1531 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1442 Invalid, 0 Unknown, 71 Unchecked, 0.6s Time] [2024-11-10 15:31:34,353 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-10 15:31:34,354 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 105. [2024-11-10 15:31:34,354 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 105 states, 96 states have (on average 1.1458333333333333) internal successors, (110), 104 states have internal predecessors, (110), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:34,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 105 states to 105 states and 110 transitions. [2024-11-10 15:31:34,355 INFO L78 Accepts]: Start accepts. Automaton has 105 states and 110 transitions. Word has length 38 [2024-11-10 15:31:34,355 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:34,355 INFO L471 AbstractCegarLoop]: Abstraction has 105 states and 110 transitions. [2024-11-10 15:31:34,355 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 2.6578947368421053) internal successors, (101), 39 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:34,355 INFO L276 IsEmpty]: Start isEmpty. Operand 105 states and 110 transitions. [2024-11-10 15:31:34,356 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:31:34,356 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:34,356 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1] [2024-11-10 15:31:34,370 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Forceful destruction successful, exit code 0 [2024-11-10 15:31:34,560 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2024-11-10 15:31:34,560 INFO L396 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr40ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:34,560 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:34,560 INFO L85 PathProgramCache]: Analyzing trace with hash 1603826875, now seen corresponding path program 1 times [2024-11-10 15:31:34,561 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:34,561 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [905226551] [2024-11-10 15:31:34,561 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:34,561 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:34,582 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:35,146 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:35,146 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:35,146 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [905226551] [2024-11-10 15:31:35,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [905226551] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:35,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [397975530] [2024-11-10 15:31:35,147 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:35,147 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:35,147 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:35,148 INFO L229 MonitoredProcess]: Starting monitored process 12 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:31:35,149 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2024-11-10 15:31:35,262 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:35,264 INFO L255 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 52 conjuncts are in the unsatisfiable core [2024-11-10 15:31:35,266 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:31:35,269 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:31:35,299 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:31:35,299 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:31:35,376 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-10 15:31:35,377 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-10 15:31:35,410 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-11-10 15:31:35,448 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:31:35,449 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-11-10 15:31:35,513 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-11-10 15:31:35,522 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-11-10 15:31:35,697 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:35,697 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-11-10 15:31:35,722 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-11-10 15:31:35,726 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:35,726 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:31:35,927 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1130 (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_1130) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|)))) (forall ((v_ArrVal_1130 (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_1130) |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-11-10 15:31:35,941 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1130 (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_1130) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)) 1)) (forall ((v_ArrVal_1130 (Array Int Int))) (not (= (select (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1130) |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-11-10 15:31:35,954 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:35,954 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-11-10 15:31:35,975 WARN L851 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1129 (Array Int Int)) (v_ArrVal_1130 (Array Int Int))) (not (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1129) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1130) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset|)))) (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_3) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_4) |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|))) is different from false [2024-11-10 15:31:35,982 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:35,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 22 [2024-11-10 15:31:35,984 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 60 treesize of output 52 [2024-11-10 15:31:35,987 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 40 treesize of output 36 [2024-11-10 15:31:35,991 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 22 treesize of output 20 [2024-11-10 15:31:36,006 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:36,007 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-11-10 15:31:36,008 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:31:36,009 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:31:36,011 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-11-10 15:31:36,207 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 6 not checked. [2024-11-10 15:31:36,207 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [397975530] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:31:36,207 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:31:36,207 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 16, 17] total 45 [2024-11-10 15:31:36,207 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [130745739] [2024-11-10 15:31:36,207 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:31:36,207 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 46 states [2024-11-10 15:31:36,208 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:36,208 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 46 interpolants. [2024-11-10 15:31:36,209 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=149, Invalid=1666, Unknown=3, NotChecked=252, Total=2070 [2024-11-10 15:31:36,209 INFO L87 Difference]: Start difference. First operand 105 states and 110 transitions. Second operand has 46 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 46 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-11-10 15:31:37,359 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:37,359 INFO L93 Difference]: Finished difference Result 107 states and 112 transitions. [2024-11-10 15:31:37,360 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 15:31:37,360 INFO L78 Accepts]: Start accepts. Automaton has has 46 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 46 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) Word has length 38 [2024-11-10 15:31:37,360 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:37,360 INFO L225 Difference]: With dead ends: 107 [2024-11-10 15:31:37,360 INFO L226 Difference]: Without dead ends: 107 [2024-11-10 15:31:37,361 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 111 GetRequests, 50 SyntacticMatches, 2 SemanticMatches, 59 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 857 ImplicationChecksByTransitivity, 1.2s TimeCoverageRelationStatistics Valid=330, Invalid=2985, Unknown=3, NotChecked=342, Total=3660 [2024-11-10 15:31:37,361 INFO L432 NwaCegarLoop]: 70 mSDtfsCounter, 96 mSDsluCounter, 985 mSDsCounter, 0 mSdLazyCounter, 1502 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 1055 SdHoareTripleChecker+Invalid, 1743 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 1502 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 223 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:37,362 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 1055 Invalid, 1743 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 1502 Invalid, 0 Unknown, 223 Unchecked, 0.6s Time] [2024-11-10 15:31:37,362 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2024-11-10 15:31:37,363 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 104. [2024-11-10 15:31:37,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 96 states have (on average 1.1354166666666667) 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-11-10 15:31:37,364 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2024-11-10 15:31:37,364 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 38 [2024-11-10 15:31:37,364 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:37,364 INFO L471 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2024-11-10 15:31:37,364 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 46 states, 45 states have (on average 1.9777777777777779) internal successors, (89), 46 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-11-10 15:31:37,364 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2024-11-10 15:31:37,364 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2024-11-10 15:31:37,364 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:37,364 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1] [2024-11-10 15:31:37,379 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Forceful destruction successful, exit code 0 [2024-11-10 15:31:37,565 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2024-11-10 15:31:37,566 INFO L396 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr34ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:37,566 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:37,566 INFO L85 PathProgramCache]: Analyzing trace with hash 1603365115, now seen corresponding path program 1 times [2024-11-10 15:31:37,566 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:37,566 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [823987614] [2024-11-10 15:31:37,566 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:37,566 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:37,584 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:37,987 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:37,988 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:37,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [823987614] [2024-11-10 15:31:37,988 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [823987614] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:37,988 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [111882530] [2024-11-10 15:31:37,988 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:37,988 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:37,988 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:37,990 INFO L229 MonitoredProcess]: Starting monitored process 13 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:31:37,991 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2024-11-10 15:31:38,113 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:38,114 INFO L255 TraceCheckSpWp]: Trace formula consists of 232 conjuncts, 36 conjuncts are in the unsatisfiable core [2024-11-10 15:31:38,116 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:31:38,163 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2024-11-10 15:31:38,163 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 11 treesize of output 11 [2024-11-10 15:31:38,205 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-11-10 15:31:38,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:38,245 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-11-10 15:31:38,357 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:31:38,357 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-11-10 15:31:38,384 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:38,384 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:31:38,501 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-11-10 15:31:38,506 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-11-10 15:31:38,508 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-11-10 15:31:38,547 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-10 15:31:38,547 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 13 treesize of output 12 [2024-11-10 15:31:38,551 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:38,552 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [111882530] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:31:38,552 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:31:38,552 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 13, 13] total 29 [2024-11-10 15:31:38,552 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1908389857] [2024-11-10 15:31:38,552 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:31:38,552 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 30 states [2024-11-10 15:31:38,552 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:38,553 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 30 interpolants. [2024-11-10 15:31:38,553 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=107, Invalid=763, Unknown=0, NotChecked=0, Total=870 [2024-11-10 15:31:38,553 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 30 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 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-11-10 15:31:39,052 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:39,052 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2024-11-10 15:31:39,052 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2024-11-10 15:31:39,053 INFO L78 Accepts]: Start accepts. Automaton has has 30 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 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) Word has length 38 [2024-11-10 15:31:39,053 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:39,053 INFO L225 Difference]: With dead ends: 103 [2024-11-10 15:31:39,053 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 15:31:39,054 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 96 GetRequests, 59 SyntacticMatches, 0 SemanticMatches, 37 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 321 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=197, Invalid=1285, Unknown=0, NotChecked=0, Total=1482 [2024-11-10 15:31:39,054 INFO L432 NwaCegarLoop]: 59 mSDtfsCounter, 124 mSDsluCounter, 682 mSDsCounter, 0 mSdLazyCounter, 916 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 124 SdHoareTripleChecker+Valid, 741 SdHoareTripleChecker+Invalid, 929 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 916 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:39,054 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [124 Valid, 741 Invalid, 929 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 916 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2024-11-10 15:31:39,055 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 15:31:39,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 103. [2024-11-10 15:31:39,056 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 103 states, 96 states have (on average 1.125) internal successors, (108), 102 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:39,056 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 103 states to 103 states and 108 transitions. [2024-11-10 15:31:39,056 INFO L78 Accepts]: Start accepts. Automaton has 103 states and 108 transitions. Word has length 38 [2024-11-10 15:31:39,056 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:39,056 INFO L471 AbstractCegarLoop]: Abstraction has 103 states and 108 transitions. [2024-11-10 15:31:39,057 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 30 states, 29 states have (on average 3.0689655172413794) internal successors, (89), 30 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-11-10 15:31:39,057 INFO L276 IsEmpty]: Start isEmpty. Operand 103 states and 108 transitions. [2024-11-10 15:31:39,057 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 15:31:39,057 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:39,057 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:39,075 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2024-11-10 15:31:39,257 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2024-11-10 15:31:39,258 INFO L396 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr7ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:39,258 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:39,258 INFO L85 PathProgramCache]: Analyzing trace with hash 769764515, now seen corresponding path program 1 times [2024-11-10 15:31:39,258 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:39,258 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [560604999] [2024-11-10 15:31:39,258 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:39,259 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:39,280 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:39,951 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:39,951 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:39,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [560604999] [2024-11-10 15:31:39,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [560604999] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:39,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1353868274] [2024-11-10 15:31:39,951 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:39,951 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:39,952 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:39,953 INFO L229 MonitoredProcess]: Starting monitored process 14 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:31:39,953 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2024-11-10 15:31:40,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:40,079 INFO L255 TraceCheckSpWp]: Trace formula consists of 235 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-10 15:31:40,081 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:31:40,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:31:40,134 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:31:40,134 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:31:40,227 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-10 15:31:40,228 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-10 15:31:40,257 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-11-10 15:31:40,292 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:31:40,293 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-11-10 15:31:40,366 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-11-10 15:31:40,378 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-11-10 15:31:40,544 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:31:40,555 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:40,555 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-11-10 15:31:40,842 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-11-10 15:31:40,854 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-11-10 15:31:40,857 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:40,857 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:31:41,363 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:41,363 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-11-10 15:31:41,482 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:41,483 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-11-10 15:31:41,486 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-11-10 15:31:41,492 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:41,492 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-11-10 15:31:41,495 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-11-10 15:31:41,502 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-11-10 15:31:41,538 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:41,538 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-11-10 15:31:41,540 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:31:41,542 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-11-10 15:31:41,550 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-10 15:31:41,551 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-11-10 15:31:41,560 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:31:41,567 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:41,567 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-11-10 15:31:41,569 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:31:41,569 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:31:41,571 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-11-10 15:31:41,577 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:31:41,581 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:41,581 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 64 treesize of output 62 [2024-11-10 15:31:41,964 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:41,964 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1353868274] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:31:41,964 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:31:41,964 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 20, 21] total 56 [2024-11-10 15:31:41,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1548052481] [2024-11-10 15:31:41,965 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:31:41,965 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-10 15:31:41,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:41,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-10 15:31:41,966 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=218, Invalid=2949, Unknown=25, NotChecked=0, Total=3192 [2024-11-10 15:31:41,966 INFO L87 Difference]: Start difference. First operand 103 states and 108 transitions. Second operand has 57 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 57 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:43,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:43,290 INFO L93 Difference]: Finished difference Result 105 states and 110 transitions. [2024-11-10 15:31:43,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-10 15:31:43,291 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 57 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 15:31:43,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:43,291 INFO L225 Difference]: With dead ends: 105 [2024-11-10 15:31:43,291 INFO L226 Difference]: Without dead ends: 105 [2024-11-10 15:31:43,292 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 120 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 72 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1568 ImplicationChecksByTransitivity, 2.0s TimeCoverageRelationStatistics Valid=448, Invalid=4929, Unknown=25, NotChecked=0, Total=5402 [2024-11-10 15:31:43,293 INFO L432 NwaCegarLoop]: 58 mSDtfsCounter, 167 mSDsluCounter, 791 mSDsCounter, 0 mSdLazyCounter, 1627 mSolverCounterSat, 23 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 167 SdHoareTripleChecker+Valid, 849 SdHoareTripleChecker+Invalid, 1650 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 23 IncrementalHoareTripleChecker+Valid, 1627 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:43,293 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [167 Valid, 849 Invalid, 1650 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [23 Valid, 1627 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2024-11-10 15:31:43,293 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 105 states. [2024-11-10 15:31:43,294 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 105 to 102. [2024-11-10 15:31:43,294 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 96 states have (on average 1.1145833333333333) internal successors, (107), 101 states have internal predecessors, (107), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:43,295 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 107 transitions. [2024-11-10 15:31:43,295 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 107 transitions. Word has length 41 [2024-11-10 15:31:43,295 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:43,295 INFO L471 AbstractCegarLoop]: Abstraction has 102 states and 107 transitions. [2024-11-10 15:31:43,295 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.8035714285714286) internal successors, (101), 57 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:43,295 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 107 transitions. [2024-11-10 15:31:43,295 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 42 [2024-11-10 15:31:43,296 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:43,296 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:43,308 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Forceful destruction successful, exit code 0 [2024-11-10 15:31:43,496 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2024-11-10 15:31:43,496 INFO L396 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:43,497 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:43,497 INFO L85 PathProgramCache]: Analyzing trace with hash -473991901, now seen corresponding path program 1 times [2024-11-10 15:31:43,497 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:43,497 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1777628232] [2024-11-10 15:31:43,497 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:43,497 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:43,516 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:44,591 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:44,591 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:44,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1777628232] [2024-11-10 15:31:44,591 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1777628232] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:44,591 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1994509680] [2024-11-10 15:31:44,592 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:44,592 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:44,592 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:44,593 INFO L229 MonitoredProcess]: Starting monitored process 15 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:31:44,594 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2024-11-10 15:31:44,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:44,716 INFO L255 TraceCheckSpWp]: Trace formula consists of 234 conjuncts, 53 conjuncts are in the unsatisfiable core [2024-11-10 15:31:44,718 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:31:44,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:31:44,772 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:31:44,773 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:31:44,869 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-10 15:31:44,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-10 15:31:44,910 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-11-10 15:31:44,948 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:31:44,948 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-11-10 15:31:45,036 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-11-10 15:31:45,078 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-11-10 15:31:45,271 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:31:45,281 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:45,282 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-11-10 15:31:45,518 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-11-10 15:31:45,548 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-10 15:31:45,548 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-11-10 15:31:45,551 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:45,551 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:31:45,992 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:45,992 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-11-10 15:31:46,217 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_1390 (Array Int Int)) (v_ArrVal_1391 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~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_1390) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1391) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 (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_1390) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1391) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 0) (select .cse1 4))))) (forall ((v_ArrVal_1390 (Array Int Int)) (v_ArrVal_1391 (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_1390) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1391) |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|))))) is different from false [2024-11-10 15:31:46,223 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:46,224 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-11-10 15:31:46,226 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-11-10 15:31:46,231 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 83 treesize of output 81 [2024-11-10 15:31:46,234 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 88 treesize of output 84 [2024-11-10 15:31:46,239 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:46,239 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 82 treesize of output 86 [2024-11-10 15:31:46,260 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:46,260 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-11-10 15:31:46,262 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:31:46,264 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-11-10 15:31:46,276 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:46,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 26 treesize of output 30 [2024-11-10 15:31:46,289 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:31:46,294 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:46,294 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-11-10 15:31:46,297 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:31:46,298 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-11-10 15:31:46,301 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:31:46,303 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-11-10 15:31:46,306 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:31:46,323 INFO L349 Elim1Store]: treesize reduction 13, result has 23.5 percent of original size [2024-11-10 15:31:46,323 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-11-10 15:31:46,638 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-10 15:31:46,639 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1994509680] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:31:46,639 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:31:46,639 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 21, 19] total 57 [2024-11-10 15:31:46,639 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523979672] [2024-11-10 15:31:46,639 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:31:46,640 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-10 15:31:46,640 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:46,640 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-10 15:31:46,641 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=206, Invalid=2989, Unknown=1, NotChecked=110, Total=3306 [2024-11-10 15:31:46,641 INFO L87 Difference]: Start difference. First operand 102 states and 107 transitions. Second operand has 58 states, 57 states have (on average 1.894736842105263) internal successors, (108), 58 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:48,596 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:48,596 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2024-11-10 15:31:48,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 15:31:48,596 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.894736842105263) internal successors, (108), 58 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 41 [2024-11-10 15:31:48,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:48,597 INFO L225 Difference]: With dead ends: 104 [2024-11-10 15:31:48,597 INFO L226 Difference]: Without dead ends: 104 [2024-11-10 15:31:48,598 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 122 GetRequests, 46 SyntacticMatches, 2 SemanticMatches, 74 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1412 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=447, Invalid=5106, Unknown=1, NotChecked=146, Total=5700 [2024-11-10 15:31:48,598 INFO L432 NwaCegarLoop]: 57 mSDtfsCounter, 169 mSDsluCounter, 1102 mSDsCounter, 0 mSdLazyCounter, 2326 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 169 SdHoareTripleChecker+Valid, 1159 SdHoareTripleChecker+Invalid, 2415 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 2326 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:48,599 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [169 Valid, 1159 Invalid, 2415 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 2326 Invalid, 0 Unknown, 69 Unchecked, 1.1s Time] [2024-11-10 15:31:48,599 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2024-11-10 15:31:48,600 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 101. [2024-11-10 15:31:48,601 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 101 states, 96 states have (on average 1.1041666666666667) internal successors, (106), 100 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:48,601 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 101 states to 101 states and 106 transitions. [2024-11-10 15:31:48,601 INFO L78 Accepts]: Start accepts. Automaton has 101 states and 106 transitions. Word has length 41 [2024-11-10 15:31:48,601 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:48,601 INFO L471 AbstractCegarLoop]: Abstraction has 101 states and 106 transitions. [2024-11-10 15:31:48,602 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.894736842105263) internal successors, (108), 58 states have internal predecessors, (108), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:48,602 INFO L276 IsEmpty]: Start isEmpty. Operand 101 states and 106 transitions. [2024-11-10 15:31:48,602 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:31:48,602 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:48,602 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:48,619 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Forceful destruction successful, exit code 0 [2024-11-10 15:31:48,803 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable26,15 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:48,803 INFO L396 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr22ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:48,804 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:48,804 INFO L85 PathProgramCache]: Analyzing trace with hash -851445999, now seen corresponding path program 1 times [2024-11-10 15:31:48,804 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:48,804 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2111901330] [2024-11-10 15:31:48,804 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:48,804 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:48,823 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:49,517 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:49,517 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:49,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2111901330] [2024-11-10 15:31:49,518 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2111901330] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:49,518 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1600952954] [2024-11-10 15:31:49,518 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:49,518 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:49,518 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:49,520 INFO L229 MonitoredProcess]: Starting monitored process 16 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:31:49,521 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Waiting until timeout for monitored process [2024-11-10 15:31:49,668 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:49,671 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-10 15:31:49,673 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:31:49,693 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:31:49,756 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-10 15:31:49,757 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-11-10 15:31:49,781 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-11-10 15:31:49,824 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:31:49,824 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-11-10 15:31:49,881 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-11-10 15:31:49,893 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-11-10 15:31:50,065 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:31:50,080 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:50,081 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-11-10 15:31:50,284 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:31:50,284 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-11-10 15:31:50,407 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:31:50,407 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 34 treesize of output 33 [2024-11-10 15:31:50,451 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:50,451 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:31:50,653 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 74 treesize of output 70 [2024-11-10 15:31:50,701 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1480 (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_1480) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)))) (forall ((v_ArrVal_1480 (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_1480) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))))) is different from false [2024-11-10 15:31:50,838 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:50,839 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-11-10 15:31:50,841 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-11-10 15:31:50,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:50,846 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-11-10 15:31:50,849 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 94 [2024-11-10 15:31:50,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 85 treesize of output 83 [2024-11-10 15:31:50,877 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:50,877 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-11-10 15:31:50,879 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:31:50,880 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-11-10 15:31:50,883 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:31:50,886 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 48 treesize of output 44 [2024-11-10 15:31:50,891 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:31:50,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-11-10 15:31:50,992 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-10 15:31:50,992 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-11-10 15:31:50,995 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-10 15:31:50,995 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1600952954] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:31:50,996 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:31:50,996 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 50 [2024-11-10 15:31:50,996 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1580132701] [2024-11-10 15:31:50,996 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:31:50,996 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-10 15:31:50,996 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:50,997 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-10 15:31:50,997 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2217, Unknown=20, NotChecked=96, Total=2550 [2024-11-10 15:31:50,997 INFO L87 Difference]: Start difference. First operand 101 states and 106 transitions. Second operand has 51 states, 50 states have (on average 2.22) internal successors, (111), 51 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:52,026 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:52,026 INFO L93 Difference]: Finished difference Result 103 states and 108 transitions. [2024-11-10 15:31:52,026 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 15:31:52,026 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.22) internal successors, (111), 51 states have internal predecessors, (111), 0 states have call successors, (0), 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 42 [2024-11-10 15:31:52,026 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:52,027 INFO L225 Difference]: With dead ends: 103 [2024-11-10 15:31:52,027 INFO L226 Difference]: Without dead ends: 103 [2024-11-10 15:31:52,027 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 62 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1106 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=406, Invalid=3484, Unknown=20, NotChecked=122, Total=4032 [2024-11-10 15:31:52,028 INFO L432 NwaCegarLoop]: 52 mSDtfsCounter, 158 mSDsluCounter, 945 mSDsCounter, 0 mSdLazyCounter, 1580 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 158 SdHoareTripleChecker+Valid, 997 SdHoareTripleChecker+Invalid, 1670 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1580 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 73 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:52,028 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [158 Valid, 997 Invalid, 1670 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1580 Invalid, 0 Unknown, 73 Unchecked, 0.7s Time] [2024-11-10 15:31:52,028 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 103 states. [2024-11-10 15:31:52,029 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 103 to 100. [2024-11-10 15:31:52,029 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 96 states have (on average 1.09375) internal successors, (105), 99 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:52,030 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 105 transitions. [2024-11-10 15:31:52,030 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 105 transitions. Word has length 42 [2024-11-10 15:31:52,030 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:52,030 INFO L471 AbstractCegarLoop]: Abstraction has 100 states and 105 transitions. [2024-11-10 15:31:52,030 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.22) internal successors, (111), 51 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:52,030 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 105 transitions. [2024-11-10 15:31:52,031 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:31:52,031 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:52,031 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:52,046 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (16)] Forceful destruction successful, exit code 0 [2024-11-10 15:31:52,235 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable27 [2024-11-10 15:31:52,235 INFO L396 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr16ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:52,236 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:52,236 INFO L85 PathProgramCache]: Analyzing trace with hash -2095202415, now seen corresponding path program 1 times [2024-11-10 15:31:52,236 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:52,236 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [430041757] [2024-11-10 15:31:52,236 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:52,236 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:52,257 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:52,901 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:52,901 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:52,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [430041757] [2024-11-10 15:31:52,901 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [430041757] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:52,901 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [996949815] [2024-11-10 15:31:52,901 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:52,902 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:52,902 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:52,903 INFO L229 MonitoredProcess]: Starting monitored process 17 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:31:52,904 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Waiting until timeout for monitored process [2024-11-10 15:31:53,039 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:53,040 INFO L255 TraceCheckSpWp]: Trace formula consists of 238 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-10 15:31:53,042 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:31:53,044 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:31:53,086 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:31:53,086 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:31:53,179 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-10 15:31:53,179 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-10 15:31:53,209 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-11-10 15:31:53,243 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:31:53,243 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-11-10 15:31:53,305 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-11-10 15:31:53,337 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-11-10 15:31:53,482 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:31:53,493 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:53,493 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-11-10 15:31:53,800 INFO L349 Elim1Store]: treesize reduction 32, result has 52.2 percent of original size [2024-11-10 15:31:53,801 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-11-10 15:31:54,016 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-10 15:31:54,016 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-11-10 15:31:54,024 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:54,024 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:31:54,399 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:54,399 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-11-10 15:31:54,574 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_1569 (Array Int Int)) (v_ArrVal_1570 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~last~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_1569) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1570) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4))) (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1570 (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_1569) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1570) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)))) (forall ((v_ArrVal_1569 (Array Int Int)) (v_ArrVal_1570 (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_1569) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1570) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 0) (select .cse1 4))))))) is different from false [2024-11-10 15:31:54,579 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:54,580 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 50 treesize of output 43 [2024-11-10 15:31:54,581 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 115 treesize of output 109 [2024-11-10 15:31:54,585 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 180 treesize of output 164 [2024-11-10 15:31:54,590 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 173 treesize of output 165 [2024-11-10 15:31:54,602 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:54,602 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 202 treesize of output 208 [2024-11-10 15:31:54,978 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2024-11-10 15:31:54,978 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [996949815] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:31:54,978 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:31:54,978 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 21, 21] total 57 [2024-11-10 15:31:54,979 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2068588105] [2024-11-10 15:31:54,979 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:31:54,979 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 58 states [2024-11-10 15:31:54,979 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:54,980 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 58 interpolants. [2024-11-10 15:31:54,980 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=277, Invalid=2918, Unknown=1, NotChecked=110, Total=3306 [2024-11-10 15:31:54,980 INFO L87 Difference]: Start difference. First operand 100 states and 105 transitions. Second operand has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 58 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:56,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:56,077 INFO L93 Difference]: Finished difference Result 102 states and 107 transitions. [2024-11-10 15:31:56,077 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2024-11-10 15:31:56,077 INFO L78 Accepts]: Start accepts. Automaton has has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 58 states have internal predecessors, (111), 0 states have call successors, (0), 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 42 [2024-11-10 15:31:56,077 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:56,078 INFO L225 Difference]: With dead ends: 102 [2024-11-10 15:31:56,078 INFO L226 Difference]: Without dead ends: 102 [2024-11-10 15:31:56,078 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 117 GetRequests, 47 SyntacticMatches, 2 SemanticMatches, 68 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1608 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=476, Invalid=4219, Unknown=1, NotChecked=134, Total=4830 [2024-11-10 15:31:56,079 INFO L432 NwaCegarLoop]: 56 mSDtfsCounter, 172 mSDsluCounter, 727 mSDsCounter, 0 mSdLazyCounter, 1275 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 783 SdHoareTripleChecker+Invalid, 1366 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1275 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 69 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:56,079 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 783 Invalid, 1366 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1275 Invalid, 0 Unknown, 69 Unchecked, 0.6s Time] [2024-11-10 15:31:56,079 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2024-11-10 15:31:56,080 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 99. [2024-11-10 15:31:56,080 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 96 states have (on average 1.0833333333333333) 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-11-10 15:31:56,081 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2024-11-10 15:31:56,081 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 42 [2024-11-10 15:31:56,081 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:56,081 INFO L471 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2024-11-10 15:31:56,081 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 58 states, 57 states have (on average 1.9473684210526316) internal successors, (111), 58 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:56,081 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2024-11-10 15:31:56,082 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:31:56,082 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:56,082 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:56,095 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (17)] Forceful destruction successful, exit code 0 [2024-11-10 15:31:56,282 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2024-11-10 15:31:56,283 INFO L396 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr37ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:56,283 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:56,283 INFO L85 PathProgramCache]: Analyzing trace with hash 1085160119, now seen corresponding path program 1 times [2024-11-10 15:31:56,283 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:56,283 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [672869490] [2024-11-10 15:31:56,283 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:56,283 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:56,302 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:56,931 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:56,932 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:31:56,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [672869490] [2024-11-10 15:31:56,932 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [672869490] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:31:56,932 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1500568479] [2024-11-10 15:31:56,932 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:56,932 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:56,932 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:31:56,934 INFO L229 MonitoredProcess]: Starting monitored process 18 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:31:56,936 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Waiting until timeout for monitored process [2024-11-10 15:31:57,098 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:31:57,101 INFO L255 TraceCheckSpWp]: Trace formula consists of 240 conjuncts, 50 conjuncts are in the unsatisfiable core [2024-11-10 15:31:57,103 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:31:57,126 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:31:57,208 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2024-11-10 15:31:57,209 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-11-10 15:31:57,233 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-11-10 15:31:57,271 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:31:57,271 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-11-10 15:31:57,320 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-11-10 15:31:57,326 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-11-10 15:31:57,446 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:31:57,460 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:57,460 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-11-10 15:31:57,648 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:31:57,648 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-11-10 15:31:57,759 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2024-11-10 15:31:57,760 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-11-10 15:31:57,799 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:31:57,799 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:31:58,029 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 160 treesize of output 154 [2024-11-10 15:31:58,094 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse0 (+ 4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.offset|))) (and (forall ((v_ArrVal_1659 (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_1659) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0)))) (forall ((v_ArrVal_1659 (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_1659) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 4)))))) is different from false [2024-11-10 15:31:58,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:58,229 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-11-10 15:31:58,235 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-11-10 15:31:58,239 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-11-10 15:31:58,245 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:58,246 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 96 [2024-11-10 15:31:58,249 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-11-10 15:31:58,275 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:31:58,275 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 27 treesize of output 28 [2024-11-10 15:31:58,277 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:31:58,278 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 43 treesize of output 39 [2024-11-10 15:31:58,282 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:31:58,283 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 48 treesize of output 44 [2024-11-10 15:31:58,285 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:31:58,286 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2024-11-10 15:31:58,384 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2024-11-10 15:31:58,384 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-11-10 15:31:58,387 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2024-11-10 15:31:58,387 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1500568479] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:31:58,387 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:31:58,388 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 20] total 50 [2024-11-10 15:31:58,388 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1873452543] [2024-11-10 15:31:58,388 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:31:58,388 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2024-11-10 15:31:58,388 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:31:58,389 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2024-11-10 15:31:58,389 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=209, Invalid=2231, Unknown=14, NotChecked=96, Total=2550 [2024-11-10 15:31:58,389 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 51 states, 50 states have (on average 2.22) internal successors, (111), 51 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:59,509 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:31:59,509 INFO L93 Difference]: Finished difference Result 101 states and 106 transitions. [2024-11-10 15:31:59,510 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 25 states. [2024-11-10 15:31:59,510 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 2.22) internal successors, (111), 51 states have internal predecessors, (111), 0 states have call successors, (0), 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 42 [2024-11-10 15:31:59,510 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:31:59,510 INFO L225 Difference]: With dead ends: 101 [2024-11-10 15:31:59,511 INFO L226 Difference]: Without dead ends: 101 [2024-11-10 15:31:59,511 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 119 GetRequests, 55 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 1185 ImplicationChecksByTransitivity, 1.4s TimeCoverageRelationStatistics Valid=415, Invalid=3735, Unknown=14, NotChecked=126, Total=4290 [2024-11-10 15:31:59,512 INFO L432 NwaCegarLoop]: 49 mSDtfsCounter, 138 mSDsluCounter, 973 mSDsCounter, 0 mSdLazyCounter, 1668 mSolverCounterSat, 22 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 138 SdHoareTripleChecker+Valid, 1022 SdHoareTripleChecker+Invalid, 1762 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 22 IncrementalHoareTripleChecker+Valid, 1668 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 72 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2024-11-10 15:31:59,512 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [138 Valid, 1022 Invalid, 1762 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [22 Valid, 1668 Invalid, 0 Unknown, 72 Unchecked, 0.7s Time] [2024-11-10 15:31:59,512 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2024-11-10 15:31:59,514 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 98. [2024-11-10 15:31:59,514 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 96 states have (on average 1.0729166666666667) internal successors, (103), 97 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:59,514 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 103 transitions. [2024-11-10 15:31:59,514 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 103 transitions. Word has length 42 [2024-11-10 15:31:59,515 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:31:59,515 INFO L471 AbstractCegarLoop]: Abstraction has 98 states and 103 transitions. [2024-11-10 15:31:59,515 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 2.22) internal successors, (111), 51 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:31:59,515 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 103 transitions. [2024-11-10 15:31:59,515 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 43 [2024-11-10 15:31:59,515 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:31:59,516 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:31:59,533 INFO L552 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (18)] Ended with exit code 0 [2024-11-10 15:31:59,719 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29,18 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:31:59,720 INFO L396 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:31:59,720 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:31:59,720 INFO L85 PathProgramCache]: Analyzing trace with hash -158596297, now seen corresponding path program 1 times [2024-11-10 15:31:59,720 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:31:59,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1040917309] [2024-11-10 15:31:59,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:31:59,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:31:59,754 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:32:00,463 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:32:00,463 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:32:00,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1040917309] [2024-11-10 15:32:00,463 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1040917309] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:32:00,463 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1158398646] [2024-11-10 15:32:00,464 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:32:00,464 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:32:00,464 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:32:00,465 INFO L229 MonitoredProcess]: Starting monitored process 19 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:32:00,466 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Waiting until timeout for monitored process [2024-11-10 15:32:00,602 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:32:00,603 INFO L255 TraceCheckSpWp]: Trace formula consists of 239 conjuncts, 55 conjuncts are in the unsatisfiable core [2024-11-10 15:32:00,605 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:32:00,607 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2024-11-10 15:32:00,657 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2024-11-10 15:32:00,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 17 treesize of output 21 [2024-11-10 15:32:00,759 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2024-11-10 15:32:00,759 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 16 treesize of output 18 [2024-11-10 15:32:00,792 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-11-10 15:32:00,833 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:32:00,833 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-11-10 15:32:00,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 34 treesize of output 25 [2024-11-10 15:32:00,924 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-11-10 15:32:01,138 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:32:01,152 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:32:01,153 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-11-10 15:32:01,553 INFO L349 Elim1Store]: treesize reduction 36, result has 59.1 percent of original size [2024-11-10 15:32:01,554 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-11-10 15:32:02,065 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-11-10 15:32:02,069 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:32:02,069 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:32:02,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:32:02,733 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-11-10 15:32:02,871 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:32:02,871 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-11-10 15:32:02,873 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-11-10 15:32:02,876 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-11-10 15:32:02,882 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:32:02,883 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 96 [2024-11-10 15:32:02,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 96 treesize of output 92 [2024-11-10 15:32:02,906 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:32:02,906 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-11-10 15:32:02,908 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:32:02,909 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-11-10 15:32:02,913 INFO L173 IndexEqualityManager]: detected equality via solver [2024-11-10 15:32:02,916 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:32:02,917 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 92 treesize of output 90 [2024-11-10 15:32:02,922 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 99 treesize of output 91 [2024-11-10 15:32:02,939 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2024-11-10 15:32:02,940 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-11-10 15:32:03,260 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 2 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:32:03,260 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1158398646] provided 0 perfect and 2 imperfect interpolant sequences [2024-11-10 15:32:03,260 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2024-11-10 15:32:03,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [22, 20, 21] total 56 [2024-11-10 15:32:03,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [500730883] [2024-11-10 15:32:03,260 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2024-11-10 15:32:03,261 INFO L548 AbstractCegarLoop]: INTERPOLANT automaton has 57 states [2024-11-10 15:32:03,261 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2024-11-10 15:32:03,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 57 interpolants. [2024-11-10 15:32:03,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=204, Invalid=2950, Unknown=38, NotChecked=0, Total=3192 [2024-11-10 15:32:03,262 INFO L87 Difference]: Start difference. First operand 98 states and 103 transitions. Second operand has 57 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 57 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:32:04,992 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2024-11-10 15:32:04,992 INFO L93 Difference]: Finished difference Result 100 states and 105 transitions. [2024-11-10 15:32:04,992 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2024-11-10 15:32:04,992 INFO L78 Accepts]: Start accepts. Automaton has has 57 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 57 states have internal predecessors, (111), 0 states have call successors, (0), 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 42 [2024-11-10 15:32:04,992 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2024-11-10 15:32:04,993 INFO L225 Difference]: With dead ends: 100 [2024-11-10 15:32:04,993 INFO L226 Difference]: Without dead ends: 100 [2024-11-10 15:32:04,993 INFO L431 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 49 SyntacticMatches, 1 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1247 ImplicationChecksByTransitivity, 2.5s TimeCoverageRelationStatistics Valid=488, Invalid=5479, Unknown=39, NotChecked=0, Total=6006 [2024-11-10 15:32:04,994 INFO L432 NwaCegarLoop]: 54 mSDtfsCounter, 156 mSDsluCounter, 1054 mSDsCounter, 0 mSdLazyCounter, 2096 mSolverCounterSat, 24 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 1108 SdHoareTripleChecker+Invalid, 2120 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 24 IncrementalHoareTripleChecker+Valid, 2096 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2024-11-10 15:32:04,994 INFO L433 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 1108 Invalid, 2120 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [24 Valid, 2096 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2024-11-10 15:32:04,994 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2024-11-10 15:32:04,995 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 97. [2024-11-10 15:32:04,995 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 96 states have (on average 1.0625) internal successors, (102), 96 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:32:04,996 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 102 transitions. [2024-11-10 15:32:04,996 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 102 transitions. Word has length 42 [2024-11-10 15:32:04,996 INFO L84 Accepts]: Finished accepts. word is rejected. [2024-11-10 15:32:04,996 INFO L471 AbstractCegarLoop]: Abstraction has 97 states and 102 transitions. [2024-11-10 15:32:04,996 INFO L472 AbstractCegarLoop]: INTERPOLANT automaton has has 57 states, 56 states have (on average 1.9821428571428572) internal successors, (111), 57 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2024-11-10 15:32:04,996 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 102 transitions. [2024-11-10 15:32:04,996 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 46 [2024-11-10 15:32:04,996 INFO L207 NwaCegarLoop]: Found error trace [2024-11-10 15:32:04,996 INFO L215 NwaCegarLoop]: trace histogram [3, 2, 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, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2024-11-10 15:32:05,009 INFO L540 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (19)] Forceful destruction successful, exit code 0 [2024-11-10 15:32:05,197 WARN L453 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30,19 /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:32:05,197 INFO L396 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0ASSERT_VIOLATIONMEMORY_LEAK, ULTIMATE.startErr1ASSERT_VIOLATIONMEMORY_FREE, ULTIMATE.startErr2ASSERT_VIOLATIONMEMORY_FREE (and 59 more)] === [2024-11-10 15:32:05,197 INFO L157 PredicateUnifier]: Initialized classic predicate unifier [2024-11-10 15:32:05,197 INFO L85 PathProgramCache]: Analyzing trace with hash -702411887, now seen corresponding path program 1 times [2024-11-10 15:32:05,198 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2024-11-10 15:32:05,198 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1480545453] [2024-11-10 15:32:05,198 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:32:05,198 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2024-11-10 15:32:05,224 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:32:06,079 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:32:06,080 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2024-11-10 15:32:06,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1480545453] [2024-11-10 15:32:06,080 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1480545453] provided 0 perfect and 1 imperfect interpolant sequences [2024-11-10 15:32:06,080 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1111373752] [2024-11-10 15:32:06,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2024-11-10 15:32:06,080 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2024-11-10 15:32:06,080 INFO L189 MonitoredProcess]: No working directory specified, using /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 [2024-11-10 15:32:06,081 INFO L229 MonitoredProcess]: Starting monitored process 20 with /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2024-11-10 15:32:06,082 INFO L327 MonitoredProcess]: [MP /storage/repos/ultimate/releaseScripts/default/UAutomizer-linux/z3 -smt2 -in SMTLIB2_COMPLIANT=true (20)] Waiting until timeout for monitored process [2024-11-10 15:32:06,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2024-11-10 15:32:06,228 INFO L255 TraceCheckSpWp]: Trace formula consists of 245 conjuncts, 64 conjuncts are in the unsatisfiable core [2024-11-10 15:32:06,230 INFO L278 TraceCheckSpWp]: Computing forward predicates... [2024-11-10 15:32:06,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 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2024-11-10 15:32:06,529 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2024-11-10 15:32:06,529 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-11-10 15:32:06,670 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2024-11-10 15:32:06,670 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-11-10 15:32:06,685 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 73 treesize of output 53 [2024-11-10 15:32:06,988 INFO L190 IndexEqualityManager]: detected not equals via solver [2024-11-10 15:32:06,999 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:32:07,000 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-11-10 15:32:07,990 WARN L873 $PredicateComparison]: unable to prove that (exists ((|v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_65| Int) (|v_ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base_56| Int) (|v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_65| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |v_ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base_65| 1))) (and (= (select .cse0 |v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_65|) 0) (= |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_65| 0) |v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_65| 0)) (= (select (store .cse0 |v_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base_65| 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_65|) 0)))) is different from true [2024-11-10 15:32:08,005 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2024-11-10 15:32:08,005 INFO L311 TraceCheckSpWp]: Computing backward predicates... [2024-11-10 15:32:08,545 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1842 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (store (select (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |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)))) is different from false [2024-11-10 15:32:08,555 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1842 (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_1842) |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-11-10 15:32:08,560 WARN L851 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1842 (Array Int Int)) (v_ArrVal_1841 (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_1841) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1842) |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-11-10 15:32:08,565 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:32:08,565 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-11-10 15:32:08,567 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-11-10 15:32:08,575 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-11-10 15:32:08,594 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2024-11-10 15:32:08,594 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-11-10 15:32:08,602 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-11-10 15:32:17,397 WARN L851 $PredicateComparison]: unable to prove that (let ((.cse4 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse9 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0)) (.cse12 (= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) 0))) (let ((.cse6 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse42 (not .cse12)) (.cse427 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse512 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse512 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse512 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse512 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (let ((.cse104 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse0 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse389 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse511 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse511 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse511 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse511 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse511 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse386 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse509 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse509 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse509 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse510 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse509 (select (store .cse510 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse509 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse509 (select (store .cse510 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) (.cse390 (or .cse42 .cse427)) (.cse24 (store .cse9 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse388 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse508 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse508 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse508 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse508 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse29 (not .cse6)) (.cse5 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))) (let ((.cse229 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse507 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse507 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse507 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse507 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse382 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse506 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse506 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse506 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse506 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse506 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse383 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse505 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse505 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse505 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse505 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse505 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse505 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse393 (or .cse388 .cse29)) (.cse398 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse504 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse504 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse504 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse504 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse504 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse387 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse503 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse503 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse503 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse503 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse397 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse502 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse502 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse502 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse502 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse502 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse502 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse396 (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse501 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse501 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse501 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse501 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse501 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse29)) (.cse391 (or .cse29 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse499 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse500 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse499 (select (store .cse500 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse499 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse499 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse499 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse499 (select (store .cse500 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (.cse392 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse497 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse498 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse497 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse497 (select (store .cse498 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse497 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse497 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse497 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse497 (select (store .cse498 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse385 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse496 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse496 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse496 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse496 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse496 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse105 (or (and (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse493 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse493 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse493 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse493 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse389) .cse12) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse494 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse495 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse494 (select (store .cse495 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse494 (select (store .cse495 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse494 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse494 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse386 .cse390) .cse29)) (.cse26 (not .cse0)) (.cse395 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse492 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse492 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse492 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse492 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse384 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse490 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse491 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse490 (select (store .cse491 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse490 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse490 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse490 (select (store .cse491 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse84 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4)) (.cse201 (not .cse104)) (.cse88 (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (and (or (let ((.cse49 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (let ((.cse73 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse102 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse103 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse102 (select (store .cse103 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse102 (select (store .cse103 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse85 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int)) (let ((.cse100 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse101 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse100 (select (store .cse101 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse100 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse100 (select (store .cse101 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse34 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse99 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse99 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse99 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))))) (.cse28 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (.cse86 (or .cse49 .cse42))) (let ((.cse1 (or (and .cse73 .cse85 (or (and .cse34 .cse28) .cse12) .cse86) .cse29)) (.cse64 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse98 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse98 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse98 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse36 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_299 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))))) (and (or .cse0 (and .cse1 (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int)) (let ((.cse2 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse3 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse2 (select (store .cse3 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse2 (select (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse2 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1))) .cse6) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int)) (let ((.cse7 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse7 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse8 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse7 (select (store .cse8 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse7 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse7 (select (store .cse8 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int)) (let ((.cse10 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse10 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse10 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse10 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int)) (let ((.cse11 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse11 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse11 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)))))) .cse12))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse13 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse14 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse13 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse13 (select (store .cse14 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse13 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse13 (select (store .cse14 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse0) (or .cse0 (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse15 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse15 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse16 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse15 (select (store .cse16 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse15 (select (store .cse16 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse17 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse17 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse17 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse17 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse18 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse18 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse19 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse18 (select (store .cse19 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse18 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse18 (select (store .cse19 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (or (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse5 v_antiDerIndex_entry0_1))) .cse6) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse20 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse20 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse20 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))))))) .cse12) (or (and (or (and (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_303 Int)) (let ((.cse21 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse22 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse21 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse21 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse21 (select (store .cse22 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse21 (select (store .cse22 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse0) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_303 Int)) (let ((.cse23 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse25 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse23 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse23 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse23 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse23 (select (store .cse25 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse23 (select (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse26 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse27 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse27 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse27 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse27 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))))) (or .cse0 (and (or .cse28 .cse29) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse30 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse30 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (let ((.cse31 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse30 (select (store .cse31 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 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_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse32 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse32 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (= .cse32 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_303 Int)) (let ((.cse33 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse33 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse33 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse33 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse33 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse34 .cse29) (or .cse26 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_299 Int)) (let ((.cse35 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse35 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse35 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))))) (or .cse36 .cse29))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_303 Int)) (let ((.cse37 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse37 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse37 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse37 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse37 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse26) (or .cse0 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_303 Int)) (let ((.cse38 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse38 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse38 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse38 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse12) (or (and (or .cse26 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_303 Int)) (let ((.cse39 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse39 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse39 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse0 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_303 Int)) (let ((.cse40 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse41 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse40 (select (store .cse41 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse40 (select (store .cse41 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_303 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse42) (or (and (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_303 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse0) (or (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse24 v_antiDerIndex_entry0_1))) .cse26) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_303 Int)) (let ((.cse43 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse43 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse43 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse12) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_303 Int)) (let ((.cse44 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse45 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse44 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse44 (select (store .cse45 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse44 (select (store .cse45 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse6) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int)) (let ((.cse46 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_303 Int)) (let ((.cse47 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse46 (select (store .cse47 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse46 (select (store .cse47 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse46 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int)) (let ((.cse48 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse48 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (= .cse48 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse49 .cse29)) .cse42) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_303 Int)) (let ((.cse51 (store .cse4 v_arrayElimCell_300 0)) (.cse50 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse52 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse50 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse50 (select (store .cse51 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse50 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse50 (select (store .cse52 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse50 (select (store .cse51 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse50 (select (store .cse52 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse0 (and .cse1 (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_303 Int)) (let ((.cse53 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse54 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse53 (select (store .cse54 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse53 (select (store .cse54 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse53 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_303 Int)) (let ((.cse55 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse55 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse55 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1))))) (or .cse6 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_303 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_303 Int)) (let ((.cse56 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse56 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse56 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse56 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_303 Int)) (let ((.cse57 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse57 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse58 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse57 (select (store .cse58 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse57 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse57 (select (store .cse58 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) .cse12))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_303 Int)) (let ((.cse60 (store .cse4 v_arrayElimCell_300 0)) (.cse59 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse61 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse59 (select (store .cse60 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse59 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse59 (select (store .cse61 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse59 (select (store .cse60 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse59 (select (store .cse61 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse0) (or .cse42 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_303 Int)) (let ((.cse63 (store .cse4 v_arrayElimCell_300 0)) (.cse62 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse62 (select (store .cse63 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse62 (select (store .cse9 v_arrayElimCell_299 0) 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 (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (and (or .cse64 .cse29) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse65 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse65 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse65 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse65 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse26) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse66 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse67 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse66 (select (store .cse67 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (let ((.cse68 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse66 (select (store .cse68 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse66 (select (store .cse68 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse66 (select (store .cse67 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_303 Int)) (let ((.cse69 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse70 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse69 (select (store .cse70 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse69 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse69 (select (store .cse70 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse12) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_303 Int)) (let ((.cse72 (store .cse4 v_arrayElimCell_300 0)) (.cse71 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse71 (select (store .cse72 v_arrayElimCell_299 0) 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 (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse42) (or .cse73 .cse29)) .cse0) (or (and (or .cse0 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_303 Int)) (let ((.cse74 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse75 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse74 (select (store .cse75 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse74 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse74 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse74 (select (store .cse75 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse26 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse76 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse77 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse76 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse76 (select (store .cse77 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse76 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse76 (select (store .cse77 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_303 Int)) (let ((.cse78 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse79 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse78 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse78 (select (store .cse79 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse78 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse78 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse78 (select (store .cse79 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse12) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse80 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse81 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse80 (select (store .cse81 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse80 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse80 (select (store .cse81 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse29) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_303 Int)) (let ((.cse83 (store .cse4 v_arrayElimCell_300 0)) (.cse82 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse82 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse82 (select (store .cse83 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse82 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse82 (select (store .cse83 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse82 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse26)) .cse84) (or (and (or .cse26 .cse64) (or .cse73 .cse0) .cse85 .cse86 (or (and (or .cse28 .cse0) .cse34 (or .cse26 .cse36)) .cse12)) .cse29) (or .cse42 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int)) (let ((.cse87 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse87 (select .cse88 v_antiDerIndex_entry0_1)) (= .cse87 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse0 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse89 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse90 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse89 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse89 (select (store .cse90 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse89 (select (store .cse90 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse42 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse91 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse92 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse91 (select .cse88 v_antiDerIndex_entry0_1)) (= .cse91 (select (store .cse92 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse91 (select (store .cse92 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (or (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse93 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse93 (select .cse88 v_antiDerIndex_entry0_1)) (= .cse93 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse93 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse93 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse94 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse94 (select .cse88 v_antiDerIndex_entry0_1)) (= .cse94 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse94 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))))))) .cse0 .cse12) (or (and (or (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse95 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse95 (select .cse88 v_antiDerIndex_entry0_1)) (= .cse95 (select .cse5 v_antiDerIndex_entry0_1))))) .cse0) (or .cse42 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse88 v_antiDerIndex_entry0_1))))) .cse6) (or .cse42 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse96 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse97 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse96 (select .cse88 v_antiDerIndex_entry0_1)) (= .cse96 (select (store .cse97 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse96 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse96 (select (store .cse97 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))))) .cse104) (or .cse0 (and .cse105 (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse106 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse106 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse106 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse106 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse106 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse6 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse107 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse107 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse107 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse107 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse108 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse108 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse108 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse108 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse109 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse108 (select (store .cse109 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse108 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse108 (select (store .cse109 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse110 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse110 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse110 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse110 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse110 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse110 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse111 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse112 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse111 (select (store .cse112 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse111 (select (store .cse112 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse111 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse111 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse111 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse12))) (or (let ((.cse118 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse223 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse224 (store .cse4 v_arrayElimCell_305 0))) (or (= .cse223 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse223 (select (store .cse224 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse223 (select (store .cse224 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse191 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse221 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse222 (store .cse4 v_arrayElimCell_305 0))) (or (= .cse221 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse221 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse221 (select (store .cse222 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse221 (select (store .cse222 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse195 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse219 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse220 (store .cse4 v_arrayElimCell_305 0))) (or (= .cse219 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse219 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse219 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse219 (select (store .cse220 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse219 (select (store .cse220 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse115 (store .cse4 v_arrayElimCell_305 0)) (.cse113 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse114 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse113 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse113 (select (store .cse114 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse113 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse113 (select (store .cse115 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse113 (select (store .cse115 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse113 (select (store .cse114 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (and (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse116 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse117 (store .cse4 v_arrayElimCell_305 0))) (or (= .cse116 (select .cse88 v_antiDerIndex_entry0_1)) (= .cse116 (select (store .cse117 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse116 (select (store .cse117 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse42) .cse118) .cse6) (or .cse42 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse121 (store .cse4 v_arrayElimCell_305 0)) (.cse119 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse120 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse119 (select .cse88 v_antiDerIndex_entry0_1)) (= .cse119 (select (store .cse120 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse119 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse119 (select (store .cse121 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse119 (select (store .cse121 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse119 (select (store .cse120 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (and (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse124 (store .cse4 v_arrayElimCell_305 0)) (.cse122 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse123 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse122 (select (store .cse123 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse122 (select (store .cse123 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse122 (select (store .cse124 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse122 (select (store .cse124 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse122 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse126 (store .cse4 v_arrayElimCell_305 0)) (.cse125 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse125 (select (store .cse126 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse125 (select (store .cse126 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse125 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse6) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse128 (store .cse4 v_arrayElimCell_305 0)) (.cse127 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse127 (select (store .cse128 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse127 (select (store .cse128 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse127 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse129 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse127 (select (store .cse129 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse127 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse127 (select (store .cse129 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse131 (store .cse4 v_arrayElimCell_305 0)) (.cse130 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse130 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse130 (select (store .cse131 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse130 (select (store .cse131 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse130 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse133 (store .cse4 v_arrayElimCell_305 0)) (.cse132 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse132 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse132 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse132 (select (store .cse133 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse132 (select (store .cse133 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse132 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse12) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse135 (store .cse4 v_arrayElimCell_305 0)) (.cse134 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse136 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse134 (select (store .cse135 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse134 (select (store .cse135 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse134 (select (store .cse136 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse134 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse134 (select (store .cse136 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse42) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse139 (store .cse4 v_arrayElimCell_305 0)) (.cse137 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse138 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse137 (select (store .cse138 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse137 (select (store .cse138 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse137 (select (store .cse139 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse137 (select (store .cse139 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse137 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse141 (store .cse4 v_arrayElimCell_305 0)) (.cse140 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int)) (= .cse140 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse140 (select (store .cse141 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse140 (select (store .cse141 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse140 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse143 (store .cse4 v_arrayElimCell_305 0)) (.cse142 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse142 (select (store .cse143 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse142 (select (store .cse143 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse144 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse142 (select (store .cse144 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse142 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse142 (select (store .cse144 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse142 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse6 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse146 (store .cse4 v_arrayElimCell_305 0)) (.cse145 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse145 (select (store .cse146 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse145 (select (store .cse146 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse145 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse42) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse149 (store .cse4 v_arrayElimCell_305 0)) (.cse147 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse150 (store .cse4 v_arrayElimCell_303 0))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse148 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse147 (select (store .cse148 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse147 (select (store .cse148 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse147 (select (store .cse149 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse147 (select (store .cse149 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse147 (select (store .cse150 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse147 (select (store .cse150 |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_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse152 (store .cse4 v_arrayElimCell_305 0)) (.cse151 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse153 (store .cse4 v_arrayElimCell_303 0))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse151 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse151 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse151 (select (store .cse152 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse151 (select (store .cse152 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse151 (select (store .cse153 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse151 (select (store .cse153 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse155 (store .cse4 v_arrayElimCell_305 0)) (.cse154 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse156 (store .cse4 v_arrayElimCell_303 0))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse154 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse154 (select (store .cse155 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse154 (select (store .cse155 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse154 (select (store .cse156 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse154 (select (store .cse156 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse12) (or .cse6 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse158 (store .cse4 v_arrayElimCell_305 0)) (.cse157 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse159 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse157 (select (store .cse158 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse157 (select (store .cse158 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse157 (select (store .cse159 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse157 (select (store .cse159 |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_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse160 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse161 (store .cse4 v_arrayElimCell_305 0))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse160 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse160 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse160 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse160 (select (store .cse161 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse160 (select (store .cse161 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse6 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse162 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse163 (store .cse4 v_arrayElimCell_305 0))) (or (= .cse162 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse162 (select (store .cse163 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse162 (select (store .cse163 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse165 (store .cse4 v_arrayElimCell_305 0)) (.cse164 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse164 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse164 (select (store .cse165 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse164 (select (store .cse165 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse166 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse164 (select (store .cse166 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse164 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse164 (select (store .cse166 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse167 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse168 (store .cse4 v_arrayElimCell_305 0))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse167 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse167 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse167 (select (store .cse168 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse167 (select (store .cse168 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse169 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse171 (store .cse4 v_arrayElimCell_305 0))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse170 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse169 (select (store .cse170 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse169 (select (store .cse170 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse169 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse169 (select (store .cse171 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse169 (select (store .cse171 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse12) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse173 (store .cse4 v_arrayElimCell_305 0)) (.cse172 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse174 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse172 (select (store .cse173 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse172 (select (store .cse173 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse172 (select (store .cse174 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse175 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse172 (select (store .cse175 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse172 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse172 (select (store .cse175 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse172 (select (store .cse174 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse84) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse177 (store .cse4 v_arrayElimCell_305 0)) (.cse176 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse176 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse176 (select (store .cse177 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse176 (select (store .cse177 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse178 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse176 (select (store .cse178 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse176 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse176 (select (store .cse178 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (or .cse6 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse179 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse180 (store .cse4 v_arrayElimCell_305 0))) (or (= .cse179 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse179 (select (store .cse180 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse179 (select (store .cse180 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse181 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse183 (store .cse4 v_arrayElimCell_305 0))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse182 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse181 (select (store .cse182 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse181 (select (store .cse182 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse181 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse181 (select (store .cse183 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse181 (select (store .cse183 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse184 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse185 (store .cse4 v_arrayElimCell_305 0))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse184 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse184 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse184 (select (store .cse185 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse184 (select (store .cse185 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse186 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse187 (store .cse4 v_arrayElimCell_305 0))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse186 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse186 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse186 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse186 (select (store .cse187 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse186 (select (store .cse187 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse12) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse190 (store .cse4 v_arrayElimCell_305 0)) (.cse188 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse189 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse188 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse188 (select (store .cse189 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse188 (select (store .cse190 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse188 (select (store .cse190 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse188 (select (store .cse189 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (and .cse191 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse192 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse194 (store .cse4 v_arrayElimCell_305 0))) (or (= .cse192 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse193 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse192 (select (store .cse193 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse192 (select (store .cse193 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse192 (select (store .cse194 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse192 (select (store .cse194 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse6 .cse118) .cse195 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse197 (store .cse4 v_arrayElimCell_305 0)) (.cse196 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse196 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse196 (select (store .cse197 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse196 (select (store .cse197 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse198 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse196 (select (store .cse198 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse196 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse196 (select (store .cse198 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) .cse12) (or (and .cse191 .cse195) .cse12) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse199 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse200 (store .cse4 v_arrayElimCell_305 0))) (or (= .cse199 (select (store .cse200 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse199 (select (store .cse200 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse201) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse203 (store .cse4 v_arrayElimCell_305 0)) (.cse202 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse202 (select .cse88 v_antiDerIndex_entry0_1)) (= .cse202 (select (store .cse203 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse202 (select (store .cse203 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse202 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse42) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse206 (store .cse4 v_arrayElimCell_305 0)) (.cse204 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse205 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse204 (select .cse88 v_antiDerIndex_entry0_1)) (= .cse204 (select (store .cse205 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse204 (select (store .cse206 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse204 (select (store .cse206 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse204 (select (store .cse205 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse42) (or (and (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse208 (store .cse4 v_arrayElimCell_305 0)) (.cse207 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse207 (select (store .cse208 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse207 (select (store .cse208 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse207 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse42) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse209 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse211 (store .cse4 v_arrayElimCell_305 0))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse210 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse209 (select (store .cse210 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse209 (select (store .cse210 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse209 (select (store .cse211 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse209 (select (store .cse211 |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_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse212 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse213 (store .cse4 v_arrayElimCell_305 0))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse212 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse212 (select (store .cse213 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse212 (select (store .cse213 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse214 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse215 (store .cse4 v_arrayElimCell_305 0))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse214 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse214 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse214 (select (store .cse215 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse214 (select (store .cse215 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse12) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse217 (store .cse4 v_arrayElimCell_305 0)) (.cse216 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse216 (select (store .cse217 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse216 (select (store .cse217 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse218 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse216 (select (store .cse218 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse216 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse216 (select (store .cse218 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) .cse29))) .cse0) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse225 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse226 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse225 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse225 (select (store .cse226 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse225 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse225 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse225 (select (store .cse226 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse227 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse228 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse227 (select .cse88 v_antiDerIndex_entry0_1)) (= .cse227 (select (store .cse228 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse227 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse227 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse227 (select (store .cse228 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse42)) .cse0) (or (and (or .cse229 .cse0) (or .cse42 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse230 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse230 (select .cse88 v_antiDerIndex_entry0_1)) (= .cse230 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse230 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse6) (or (let ((.cse234 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse379 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse379 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse379 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse379 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse379 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)))))) (.cse235 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse377 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse377 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse377 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse378 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse377 (select (store .cse378 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse377 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse377 (select (store .cse378 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) (.cse236 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse376 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse376 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse376 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse376 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)))))) (.cse232 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse375 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse375 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse375 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse375 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse375 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse233 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse373 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse374 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse373 (select (store .cse374 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse373 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse373 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse373 (select (store .cse374 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse237 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse372 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse372 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse372 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse372 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))))) (and (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse231 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse231 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse231 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) .cse201) (or .cse29 (and (or .cse26 .cse232) (or .cse0 .cse233) .cse234 .cse235 (or .cse26 .cse236) (or .cse0 .cse237))) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse238 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse238 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse238 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse238 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse238 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse238 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse239 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse239 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse239 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse239 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse239 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse240 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse240 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse240 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse240 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse241 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse240 (select (store .cse241 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse240 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse240 (select (store .cse241 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (or .cse29 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse242 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse242 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse242 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse242 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) .cse234 .cse235 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse243 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse244 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse243 (select (store .cse244 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse243 (select (store .cse244 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse243 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse243 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse245 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse246 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse245 (select (store .cse246 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse245 (select (store .cse246 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse245 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse245 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse245 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse247 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse247 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse247 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse247 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) .cse6)) .cse0) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse248 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse248 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse248 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse248 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse248 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse249 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse249 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse249 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse249 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse249 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse249 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse250 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse250 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse250 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse250 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse251 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse250 (select (store .cse251 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse250 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse250 (select (store .cse251 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse252 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse252 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse252 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse252 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) .cse6) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse253 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse253 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse254 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse253 (select (store .cse254 v_arrayElimCell_299 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 (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse253 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)))))) .cse0) (or (let ((.cse275 (or .cse29 .cse237)) (.cse274 (or .cse29 .cse233))) (and (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse255 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse255 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse255 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse255 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse255 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) .cse29) (or .cse6 (and (or .cse26 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse256 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse256 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse256 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse256 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse256 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse257 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse257 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse257 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse257 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse257 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse0 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse258 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse258 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse258 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse258 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse259 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse259 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse259 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse259 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) .cse26) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse260 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse261 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse260 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse260 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse260 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse260 (select (store .cse261 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse260 (select (store .cse261 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse262 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse263 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse262 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse262 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse262 (select (store .cse263 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse262 (select (store .cse263 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse0))) (or .cse26 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse264 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse265 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse264 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse264 (select (store .cse265 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse264 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse264 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse264 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse264 (select (store .cse265 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse26 (and (or .cse236 .cse29) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse266 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse266 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse266 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse266 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse266 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))))) (or .cse0 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse267 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse268 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse267 (select (store .cse268 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_302 Int) (v_arrayElimCell_303 Int)) (= .cse267 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1))) (= .cse267 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse267 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse267 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse267 (select (store .cse268 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse269 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse269 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_302 Int) (v_arrayElimCell_303 Int)) (= .cse269 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1))) (= .cse269 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse269 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse269 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse270 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse270 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_302 Int) (v_arrayElimCell_303 Int)) (= .cse270 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1))) (= .cse270 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse270 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse271 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse272 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse271 (select (store .cse272 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_302 Int) (v_arrayElimCell_303 Int)) (= .cse271 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1))) (= .cse271 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse271 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse271 (select (store .cse272 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse6 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse273 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse273 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse273 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse273 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)))))) .cse274 .cse275)) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse276 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse277 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse276 (select (store .cse277 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse276 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse276 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse276 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse276 (select (store .cse277 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse29) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse278 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse279 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse278 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse278 (select (store .cse279 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse278 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse278 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse278 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse278 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse278 (select (store .cse279 |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_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse280 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse280 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse280 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse280 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (= .cse280 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse281 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse281 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (let ((.cse282 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse281 (select (store .cse282 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse281 (select (store .cse282 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse281 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse281 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) .cse275) .cse0) (or .cse26 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse283 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse283 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse283 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse283 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse283 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse283 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse232 .cse29))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse285 (store .cse4 v_arrayElimCell_300 0)) (.cse284 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse284 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse284 (select (store .cse285 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse284 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse284 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse284 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse284 (select (store .cse285 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse284 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse26) (or .cse0 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse286 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse287 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse286 (select (store .cse287 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse286 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse286 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (= .cse286 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse286 (select (store .cse287 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse288 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse289 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse288 (select (store .cse289 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (let ((.cse290 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse288 (select (store .cse290 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse288 (select (store .cse290 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse288 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse288 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse288 (select (store .cse289 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse274)) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse291 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse291 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse291 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse291 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse291 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse291 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse291 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse26) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse292 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse293 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse292 (select (store .cse293 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse292 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse292 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse292 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse292 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse292 (select (store .cse293 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse0) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse294 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse294 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse294 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse294 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse294 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse294 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) .cse26) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse295 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse295 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse295 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse295 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse295 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse295 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse0) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse297 (store .cse4 v_arrayElimCell_300 0)) (.cse296 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse298 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse296 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse296 (select (store .cse297 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse296 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse296 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse296 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse296 (select (store .cse298 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse296 (select (store .cse297 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse296 (select (store .cse298 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse0 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse300 (store .cse4 v_arrayElimCell_300 0)) (.cse299 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse301 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse299 (select (store .cse300 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse299 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse299 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse299 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse299 (select (store .cse301 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse299 (select (store .cse300 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse299 (select (store .cse301 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse302 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse303 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse302 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse302 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse302 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse302 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse302 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse302 (select (store .cse303 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse302 (select (store .cse303 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse304 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse304 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse304 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse304 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse304 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse304 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse304 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse0 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse305 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse306 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse305 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse305 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse305 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse305 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse305 (select (store .cse306 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse305 (select (store .cse306 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) .cse84) (or .cse26 (and (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int)) (let ((.cse307 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse307 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse307 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) .cse6) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int)) (let ((.cse308 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse308 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse308 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse308 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) .cse29) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int)) (let ((.cse309 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse310 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse309 (select (store .cse310 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse309 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse309 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse309 (select (store .cse310 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse29) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int)) (let ((.cse311 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse311 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse311 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse311 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int)) (let ((.cse312 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse312 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse313 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse312 (select (store .cse313 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse312 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse312 (select (store .cse313 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int)) (let ((.cse314 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse314 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse314 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse314 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int)) (let ((.cse315 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_299 Int)) (= .cse315 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse315 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)))))) .cse29) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int)) (let ((.cse316 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse317 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse316 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse316 (select (store .cse317 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse316 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse316 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse316 (select (store .cse317 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse29 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int)) (let ((.cse318 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse318 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse318 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int)) (let ((.cse319 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse319 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse319 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse319 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse319 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))) .cse201))) (or .cse0 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse320 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse320 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse320 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse320 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse321 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse321 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse321 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse321 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse321 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse322 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse323 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse322 (select (store .cse323 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse322 (select (store .cse323 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse322 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse324 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse324 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse324 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse324 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse325 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse325 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse326 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse325 (select (store .cse326 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse325 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse325 (select (store .cse326 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse327 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse327 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse327 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)))))) .cse29) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse328 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse328 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse328 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (= .cse328 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse329 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse330 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse329 (select (store .cse330 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse329 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse329 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse329 (select (store .cse330 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse29) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse331 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse331 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (let ((.cse332 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse331 (select (store .cse332 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse331 (select (store .cse332 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse331 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse331 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse333 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse333 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse333 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse333 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) .cse29) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse334 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse334 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse334 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) .cse29) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse335 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse335 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (let ((.cse336 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse335 (select (store .cse336 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse335 (select (store .cse336 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse335 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse337 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse338 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse337 (select (store .cse338 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (let ((.cse339 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse337 (select (store .cse339 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse337 (select (store .cse339 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse337 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse337 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse337 (select (store .cse338 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse340 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse340 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_302 Int) (v_arrayElimCell_303 Int)) (= .cse340 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1))) (= .cse340 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse341 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse341 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (= .cse341 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse342 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_303 Int)) (let ((.cse343 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse342 (select (store .cse343 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse342 (select (store .cse343 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse342 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)))))) .cse6) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse344 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse345 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse344 (select (store .cse345 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse344 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (= .cse344 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse344 (select (store .cse345 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse6 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse346 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse346 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse346 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse347 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse348 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse347 (select (store .cse348 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_302 Int) (v_arrayElimCell_303 Int)) (= .cse347 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1))) (= .cse347 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse347 (select (store .cse348 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse349 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse350 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse349 (select (store .cse350 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (let ((.cse351 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse349 (select (store .cse351 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse349 (select (store .cse351 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse349 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse349 (select (store .cse350 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse352 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse353 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse352 (select (store .cse353 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_302 Int) (v_arrayElimCell_303 Int)) (= .cse352 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1))) (= .cse352 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse352 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse352 (select (store .cse353 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse354 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse355 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse354 (select (store .cse355 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse354 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse354 (select (store .cse355 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse29) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse356 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse357 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse356 (select (store .cse357 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse356 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse356 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (= .cse356 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse356 (select (store .cse357 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse358 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse358 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_302 Int) (v_arrayElimCell_303 Int)) (= .cse358 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1))) (= .cse358 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse358 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse359 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse359 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse359 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse359 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (= .cse359 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse84) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse360 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse360 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse360 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse361 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse360 (select (store .cse361 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse360 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse360 (select (store .cse361 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse362 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse362 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse362 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse362 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse363 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse364 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse363 (select (store .cse364 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse363 (select (store .cse364 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse363 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse363 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (or .cse6 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse365 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse365 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse365 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))) .cse201) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse366 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse366 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse366 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) .cse6) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse367 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse367 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse367 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse367 (select (store .cse5 v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse367 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse368 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse368 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse368 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse369 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse368 (select (store .cse369 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse368 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse368 (select (store .cse369 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse370 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse370 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse371 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse370 (select (store .cse371 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse370 (select (store .cse371 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse370 (select (store (store .cse4 v_arrayElimCell_305 0) v_arrayElimCell_304 0) v_antiDerIndex_entry0_1))))))))) .cse12) (or .cse0 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse380 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse381 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse380 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse380 (select (store .cse381 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse380 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse380 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse380 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse380 (select (store .cse381 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (and .cse382 .cse383) .cse0 .cse12) (or (and (or .cse384 .cse0) (or .cse26 .cse385) .cse386 (or (and (or .cse0 .cse387) (or .cse388 .cse26) .cse389) .cse12) .cse390) .cse29) (or (and .cse391 .cse392 .cse393 (or (and .cse386 .cse389 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse394 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_299 Int)) (= .cse394 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse394 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse394 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse29) (or .cse6 .cse395) .cse396 .cse397 .cse398) .cse26) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse399 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse400 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse399 (select .cse88 v_antiDerIndex_entry0_1)) (= .cse399 (select (store .cse400 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse399 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse399 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse399 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse399 (select (store .cse400 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse42) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse401 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse401 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse401 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse201) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse402 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse402 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse403 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse402 (select (store .cse403 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse402 (select (store .cse403 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse402 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse402 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse404 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse404 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse404 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse404 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse405 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse404 (select (store .cse405 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse404 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse404 (select (store .cse405 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (or .cse229 .cse6) .cse382 .cse383) .cse0 .cse12) (or (and (or (and (or .cse26 (and .cse393 .cse398)) (or .cse0 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse406 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse406 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse406 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse406 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (= .cse406 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse407 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse407 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (let ((.cse408 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse407 (select (store .cse408 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse407 (select (store .cse408 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse407 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse407 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse387 .cse29))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse409 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse409 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse409 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse409 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse409 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse409 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse0) (or .cse26 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse410 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse410 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse410 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse410 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse410 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse410 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse410 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse411 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse411 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse411 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse411 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse411 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse411 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse411 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse26 .cse397) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse412 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse413 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse412 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse412 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse412 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse412 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse412 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse412 (select (store .cse413 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse412 (select (store .cse413 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse414 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse415 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse414 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse414 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse414 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse414 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse414 (select (store .cse415 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse414 (select (store .cse415 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse0) .cse396) .cse12) .cse391 (or (and (or .cse392 .cse26) (or .cse0 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse416 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse417 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse416 (select (store .cse417 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse416 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse416 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse416 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse416 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse416 (select (store .cse417 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse418 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse419 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse418 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse418 (select (store .cse419 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse418 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse418 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse418 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse418 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse418 (select (store .cse419 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse12) (or (and (or .cse385 .cse29) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse420 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse420 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse420 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse420 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse420 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse420 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse26) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse422 (store .cse4 v_arrayElimCell_300 0)) (.cse421 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse423 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse421 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse421 (select (store .cse422 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse421 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse421 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse421 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse421 (select (store .cse423 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse421 (select (store .cse422 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse421 (select (store .cse423 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse42 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse424 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_303 Int)) (let ((.cse425 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse424 (select (store .cse425 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse424 (select (store .cse425 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse424 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse424 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse424 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse426 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse426 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse426 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse426 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (= .cse426 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse427 .cse29))) (or .cse0 (and (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse428 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (or (= .cse428 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse428 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse428 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse428 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse428 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse429 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse429 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse429 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse429 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse430 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse429 (select (store .cse430 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse429 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse429 (select (store .cse430 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse431 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse432 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse431 (select (store .cse432 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse431 (select (store .cse432 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse431 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse431 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse431 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse433 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (= .cse433 (select (store (store .cse4 v_arrayElimCell_300 0) v_arrayElimCell_299 0) v_antiDerIndex_entry0_1))) (= .cse433 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse433 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse433 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse6 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_302 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse434 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse434 (select (store (store .cse4 v_arrayElimCell_303 0) v_arrayElimCell_302 0) v_antiDerIndex_entry0_1)) (= .cse434 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse434 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse12) .cse105)) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse436 (store .cse4 v_arrayElimCell_300 0)) (.cse435 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse435 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse435 (select (store .cse436 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse435 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse435 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse435 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse435 (select (store .cse436 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse435 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse26) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse438 (store .cse4 v_arrayElimCell_300 0)) (.cse437 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse437 (select (store .cse438 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse437 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse437 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse437 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) 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 (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse42) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse440 (store .cse4 v_arrayElimCell_300 0)) (.cse439 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse441 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse439 (select (store .cse440 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse439 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse439 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse439 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse439 (select (store .cse441 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse439 (select (store .cse440 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse439 (select (store .cse441 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse0) (or (and (or .cse26 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse442 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse442 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse442 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse442 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse442 (select (store (store .cse4 v_arrayElimCell_303 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_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse443 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse443 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse443 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse443 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse443 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse0 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse444 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse444 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse444 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse444 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse26 .cse395)) .cse12) (or .cse0 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse445 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse446 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse445 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse445 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse445 (select (store .cse446 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse445 (select (store .cse446 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or .cse42 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse447 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse447 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse447 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse447 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse448 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse449 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse448 (select .cse24 v_antiDerIndex_entry0_1)) (= .cse448 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse448 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse448 (select (store .cse449 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse448 (select (store .cse449 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse6) (or (and (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse451 (store .cse4 v_arrayElimCell_300 0)) (.cse450 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse450 (select (store .cse451 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse450 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse450 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse450 (select (store .cse451 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse450 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse42) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_303 Int) (v_arrayElimCell_305 Int)) (let ((.cse452 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse453 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse452 (select (store .cse453 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse452 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse452 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse452 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse452 (select (store .cse453 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse12) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse454 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse455 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse454 (select (store .cse455 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (let ((.cse456 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse454 (select (store .cse456 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse454 (select (store .cse456 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse454 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse454 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse454 (select (store .cse455 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse384 .cse29)) .cse0)) .cse84) (or (and (or .cse29 (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_305 Int)) (let ((.cse457 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int)) (= .cse457 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse457 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_305 Int)) (let ((.cse458 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse458 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_300 Int)) (let ((.cse459 (store .cse4 v_arrayElimCell_300 0))) (or (forall ((v_arrayElimCell_299 Int)) (or (= .cse458 (select (store .cse459 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse458 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)))) (= .cse458 (select (store .cse459 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_305 Int)) (let ((.cse460 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int)) (let ((.cse461 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse460 (select (store .cse461 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse460 (select (store .cse461 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse460 (select (store (store .cse4 v_arrayElimCell_305 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_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_305 Int)) (let ((.cse462 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse463 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse462 (select (store .cse463 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse462 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse462 (select (store .cse463 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse29) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_305 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse201) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_305 Int)) (let ((.cse465 (store .cse4 v_arrayElimCell_300 0)) (.cse464 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse464 (select (store .cse465 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse464 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse464 (select (store .cse465 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (= .cse464 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_305 Int)) (let ((.cse466 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse466 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse466 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (= .cse466 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_305 Int)) (let ((.cse468 (store .cse4 v_arrayElimCell_300 0)) (.cse467 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse467 (select (store .cse468 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse467 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse467 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) 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_303 Int)) (= .cse467 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_305 Int)) (let ((.cse469 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse469 (select .cse88 v_antiDerIndex_entry0_1)) (= .cse469 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse469 (select (store (store .cse4 v_arrayElimCell_300 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_300 Int) (v_arrayElimCell_305 Int)) (let ((.cse470 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse470 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse470 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse29) (or (and (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_305 Int)) (let ((.cse471 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse471 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (= .cse471 (select (store (store .cse4 v_arrayElimCell_303 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_305 Int)) (let ((.cse472 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_303 Int)) (let ((.cse473 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse472 (select (store .cse473 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse472 (select (store .cse473 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse472 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse6) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_305 Int)) (let ((.cse474 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse475 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse474 (select (store .cse475 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse474 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse474 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse474 (select (store .cse475 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse29) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_305 Int)) (let ((.cse476 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse477 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse476 (select .cse88 v_antiDerIndex_entry0_1)) (= .cse476 (select (store .cse477 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse476 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse476 (select (store .cse477 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_305 Int)) (let ((.cse478 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse479 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse478 (select (store .cse479 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (let ((.cse480 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse478 (select (store .cse480 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse478 (select (store .cse480 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse478 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse478 (select (store .cse479 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_305 Int)) (let ((.cse481 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse482 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse481 (select (store .cse482 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_303 Int)) (let ((.cse483 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse481 (select (store .cse483 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse481 (select (store .cse483 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse481 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse481 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse481 (select (store .cse482 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_305 Int)) (let ((.cse484 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse484 (select .cse88 v_antiDerIndex_entry0_1)) (= .cse484 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse6) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_299 Int) (v_arrayElimCell_305 Int)) (let ((.cse485 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse486 (store .cse4 v_arrayElimCell_300 0))) (or (= .cse485 (select .cse88 v_antiDerIndex_entry0_1)) (= .cse485 (select (store .cse486 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse485 (select (store .cse9 v_arrayElimCell_299 0) v_antiDerIndex_entry0_1)) (= .cse485 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse485 (select (store .cse486 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_305 Int)) (let ((.cse487 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_303 Int)) (let ((.cse488 (store .cse4 v_arrayElimCell_303 0))) (or (= .cse487 (select (store .cse488 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse487 (select (store .cse488 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse487 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse487 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse42) (or .cse42 (forall ((v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_300 Int) (v_arrayElimCell_304 Int) (v_arrayElimCell_305 Int)) (let ((.cse489 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse489 (select .cse88 v_antiDerIndex_entry0_1)) (= .cse489 (select (store .cse9 v_arrayElimCell_304 0) v_antiDerIndex_entry0_1)) (= .cse489 (select (store (store .cse4 v_arrayElimCell_305 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse489 (select (store (store .cse4 v_arrayElimCell_300 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))))))) is different from false