./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 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya --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.4-dev-0e0057c [2023-11-29 04:12:09,212 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:12:09,288 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 04:12:09,293 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:12:09,293 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:12:09,322 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:12:09,323 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:12:09,323 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:12:09,324 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:12:09,325 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:12:09,325 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:12:09,326 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:12:09,327 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:12:09,327 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:12:09,328 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:12:09,329 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:12:09,329 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:12:09,330 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:12:09,331 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:12:09,331 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:12:09,332 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:12:09,333 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:12:09,333 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:12:09,334 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:12:09,334 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:12:09,335 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:12:09,335 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:12:09,336 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:12:09,336 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:12:09,336 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:12:09,337 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:12:09,337 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:12:09,338 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:12:09,338 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:12:09,338 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:12:09,339 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:12:09,339 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:12:09,339 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:12:09,339 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:12:09,340 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:12:09,340 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:12:09,340 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:/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/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 -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya 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 [2023-11-29 04:12:09,600 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:12:09,627 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:12:09,631 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:12:09,632 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:12:09,633 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:12:09,634 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2023-11-29 04:12:12,893 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:12:13,177 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:12:13,178 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/sv-benchmarks/c/list-ext3-properties/dll_nondet_free_order-1.i [2023-11-29 04:12:13,194 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/data/6f7ff637e/7911e1ebe22d49588bfa8b33890a90d5/FLAG6cf8c1a72 [2023-11-29 04:12:13,210 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/data/6f7ff637e/7911e1ebe22d49588bfa8b33890a90d5 [2023-11-29 04:12:13,213 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:12:13,214 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:12:13,216 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:12:13,216 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:12:13,221 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:12:13,222 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:12:13" (1/1) ... [2023-11-29 04:12:13,223 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@4fa7c8f1 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:13, skipping insertion in model container [2023-11-29 04:12:13,223 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:12:13" (1/1) ... [2023-11-29 04:12:13,267 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:12:13,528 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:12:13,536 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:12:13,572 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:12:13,600 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:12:13,601 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:13 WrapperNode [2023-11-29 04:12:13,601 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:12:13,602 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:12:13,602 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:12:13,602 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:12:13,609 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:13" (1/1) ... [2023-11-29 04:12:13,621 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:13" (1/1) ... [2023-11-29 04:12:13,645 INFO L138 Inliner]: procedures = 116, calls = 31, calls flagged for inlining = 4, calls inlined = 4, statements flattened = 133 [2023-11-29 04:12:13,645 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:12:13,646 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:12:13,646 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:12:13,646 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:12:13,657 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:13" (1/1) ... [2023-11-29 04:12:13,657 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:13" (1/1) ... [2023-11-29 04:12:13,661 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:13" (1/1) ... [2023-11-29 04:12:13,679 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]. [2023-11-29 04:12:13,680 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:13" (1/1) ... [2023-11-29 04:12:13,680 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:13" (1/1) ... [2023-11-29 04:12:13,689 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:13" (1/1) ... [2023-11-29 04:12:13,693 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:13" (1/1) ... [2023-11-29 04:12:13,695 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:13" (1/1) ... [2023-11-29 04:12:13,696 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:13" (1/1) ... [2023-11-29 04:12:13,700 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:12:13,701 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:12:13,701 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:12:13,701 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:12:13,702 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:13" (1/1) ... [2023-11-29 04:12:13,708 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:12:13,721 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:13,741 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:12:13,744 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:12:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure myexit [2023-11-29 04:12:13,778 INFO L138 BoogieDeclarations]: Found implementation of procedure myexit [2023-11-29 04:12:13,778 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:12:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 04:12:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 04:12:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:12:13,779 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:12:13,779 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:12:13,886 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:12:13,888 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:12:13,915 INFO L775 $ProcedureCfgBuilder]: dead code at ProgramPoint myexitFINAL: assume true; [2023-11-29 04:12:14,225 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:12:14,263 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:12:14,264 INFO L309 CfgBuilder]: Removed 1 assume(true) statements. [2023-11-29 04:12:14,264 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:12:14 BoogieIcfgContainer [2023-11-29 04:12:14,264 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:12:14,268 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:12:14,268 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:12:14,272 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:12:14,272 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:12:13" (1/3) ... [2023-11-29 04:12:14,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40359802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:12:14, skipping insertion in model container [2023-11-29 04:12:14,273 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:12:13" (2/3) ... [2023-11-29 04:12:14,273 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@40359802 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:12:14, skipping insertion in model container [2023-11-29 04:12:14,274 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:12:14" (3/3) ... [2023-11-29 04:12:14,275 INFO L112 eAbstractionObserver]: Analyzing ICFG dll_nondet_free_order-1.i [2023-11-29 04:12:14,297 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:12:14,298 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 62 error locations. [2023-11-29 04:12:14,348 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:12:14,355 INFO L357 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, mHoare=false, mAutomataTypeConcurrency=PETRI_NET, mHoareTripleChecks=INCREMENTAL, mHoareAnnotationPositions=All, 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;@7eb6609e, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:12:14,355 INFO L358 AbstractCegarLoop]: Starting to check reachability of 62 error locations. [2023-11-29 04:12:14,359 INFO L276 IsEmpty]: Start isEmpty. Operand has 131 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 129 states have internal predecessors, (137), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:14,365 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 04:12:14,365 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:14,366 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 04:12:14,367 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:14,372 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:14,373 INFO L85 PathProgramCache]: Analyzing trace with hash 218566, now seen corresponding path program 1 times [2023-11-29 04:12:14,384 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:14,385 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [943642691] [2023-11-29 04:12:14,385 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:14,386 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:14,504 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:14,628 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:14,628 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:14,629 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [943642691] [2023-11-29 04:12:14,629 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [943642691] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:14,630 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:14,630 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:12:14,631 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1306407884] [2023-11-29 04:12:14,632 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:14,636 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:14,637 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:14,665 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:14,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:14,668 INFO L87 Difference]: Start difference. First operand has 131 states, 66 states have (on average 2.0757575757575757) internal successors, (137), 129 states have internal predecessors, (137), 2 states have call successors, (2), 1 states have call predecessors, (2), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:14,804 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:14,804 INFO L93 Difference]: Finished difference Result 128 states and 135 transitions. [2023-11-29 04:12:14,805 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:14,807 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-29 04:12:14,807 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:14,816 INFO L225 Difference]: With dead ends: 128 [2023-11-29 04:12:14,816 INFO L226 Difference]: Without dead ends: 123 [2023-11-29 04:12:14,817 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:14,821 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 18 mSDsluCounter, 75 mSDsCounter, 0 mSdLazyCounter, 58 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 191 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 58 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:14,822 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 191 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 58 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:12:14,838 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 123 states. [2023-11-29 04:12:14,856 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 123 to 123. [2023-11-29 04:12:14,858 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 64 states have (on average 2.0) internal successors, (128), 122 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:14,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 128 transitions. [2023-11-29 04:12:14,862 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 128 transitions. Word has length 3 [2023-11-29 04:12:14,862 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:14,862 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 128 transitions. [2023-11-29 04:12:14,862 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:14,863 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 128 transitions. [2023-11-29 04:12:14,863 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 4 [2023-11-29 04:12:14,863 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:14,863 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1] [2023-11-29 04:12:14,864 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 04:12:14,864 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:14,865 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:14,865 INFO L85 PathProgramCache]: Analyzing trace with hash 218567, now seen corresponding path program 1 times [2023-11-29 04:12:14,865 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:14,866 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [615368129] [2023-11-29 04:12:14,866 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:14,866 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:14,883 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:14,969 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:14,970 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:14,970 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [615368129] [2023-11-29 04:12:14,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [615368129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:14,971 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:14,971 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:12:14,971 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [195241149] [2023-11-29 04:12:14,971 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:14,972 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:14,973 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:14,973 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:14,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:14,974 INFO L87 Difference]: Start difference. First operand 123 states and 128 transitions. Second operand has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,031 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:15,031 INFO L93 Difference]: Finished difference Result 126 states and 132 transitions. [2023-11-29 04:12:15,032 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:15,032 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 3 [2023-11-29 04:12:15,033 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:15,035 INFO L225 Difference]: With dead ends: 126 [2023-11-29 04:12:15,035 INFO L226 Difference]: Without dead ends: 126 [2023-11-29 04:12:15,035 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:15,037 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 6 mSDsluCounter, 109 mSDsCounter, 0 mSdLazyCounter, 24 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 224 SdHoareTripleChecker+Invalid, 26 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 24 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:15,038 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 224 Invalid, 26 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 24 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:12:15,039 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 126 states. [2023-11-29 04:12:15,050 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 126 to 123. [2023-11-29 04:12:15,050 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 66 states have (on average 1.9545454545454546) internal successors, (129), 122 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,053 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2023-11-29 04:12:15,053 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 3 [2023-11-29 04:12:15,053 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:15,054 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2023-11-29 04:12:15,054 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.5) internal successors, (3), 2 states have internal predecessors, (3), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,054 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2023-11-29 04:12:15,055 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 04:12:15,055 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:15,055 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:15,055 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 04:12:15,056 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:15,056 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:15,056 INFO L85 PathProgramCache]: Analyzing trace with hash -8198272, now seen corresponding path program 1 times [2023-11-29 04:12:15,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:15,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [543363312] [2023-11-29 04:12:15,057 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:15,057 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:15,078 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:15,153 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:15,153 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:15,153 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [543363312] [2023-11-29 04:12:15,154 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [543363312] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:15,154 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:15,154 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:12:15,154 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [302242598] [2023-11-29 04:12:15,154 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:15,155 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:15,155 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:15,155 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:15,155 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:15,156 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,186 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:15,186 INFO L93 Difference]: Finished difference Result 129 states and 134 transitions. [2023-11-29 04:12:15,187 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:15,187 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 04:12:15,187 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:15,189 INFO L225 Difference]: With dead ends: 129 [2023-11-29 04:12:15,189 INFO L226 Difference]: Without dead ends: 129 [2023-11-29 04:12:15,189 INFO L412 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 [2023-11-29 04:12:15,191 INFO L413 NwaCegarLoop]: 119 mSDtfsCounter, 7 mSDsluCounter, 116 mSDsCounter, 0 mSdLazyCounter, 13 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 235 SdHoareTripleChecker+Invalid, 13 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 13 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:15,192 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 235 Invalid, 13 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 13 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:12:15,193 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-29 04:12:15,201 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 122. [2023-11-29 04:12:15,201 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 65 states have (on average 1.9538461538461538) internal successors, (127), 121 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,203 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2023-11-29 04:12:15,203 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 7 [2023-11-29 04:12:15,204 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:15,204 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2023-11-29 04:12:15,204 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 2.3333333333333335) internal successors, (7), 2 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,204 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2023-11-29 04:12:15,205 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 04:12:15,205 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:15,205 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:15,206 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 04:12:15,206 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:15,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:15,207 INFO L85 PathProgramCache]: Analyzing trace with hash -8196735, now seen corresponding path program 1 times [2023-11-29 04:12:15,207 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:15,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [992919661] [2023-11-29 04:12:15,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:15,208 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:15,226 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:15,274 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:15,274 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:15,275 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [992919661] [2023-11-29 04:12:15,275 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [992919661] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:15,275 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:15,275 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:12:15,276 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [37994339] [2023-11-29 04:12:15,276 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:15,276 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:15,276 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:15,277 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:15,277 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:15,278 INFO L87 Difference]: Start difference. First operand 122 states and 127 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,361 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:15,362 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2023-11-29 04:12:15,362 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:15,362 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 04:12:15,362 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:15,364 INFO L225 Difference]: With dead ends: 121 [2023-11-29 04:12:15,364 INFO L226 Difference]: Without dead ends: 121 [2023-11-29 04:12:15,364 INFO L412 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 [2023-11-29 04:12:15,366 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 4 mSDsluCounter, 77 mSDsCounter, 0 mSdLazyCounter, 52 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 192 SdHoareTripleChecker+Invalid, 52 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 52 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:15,367 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 192 Invalid, 52 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 52 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:12:15,368 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-29 04:12:15,375 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-11-29 04:12:15,376 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 65 states have (on average 1.9384615384615385) internal successors, (126), 120 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,377 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2023-11-29 04:12:15,377 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 7 [2023-11-29 04:12:15,377 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:15,378 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2023-11-29 04:12:15,378 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,378 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2023-11-29 04:12:15,378 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 04:12:15,379 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:15,379 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:15,379 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 04:12:15,379 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:15,380 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:15,380 INFO L85 PathProgramCache]: Analyzing trace with hash -8196734, now seen corresponding path program 1 times [2023-11-29 04:12:15,380 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:15,380 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [503299856] [2023-11-29 04:12:15,381 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:15,381 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:15,397 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:15,471 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:15,472 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:15,472 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [503299856] [2023-11-29 04:12:15,472 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [503299856] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:15,472 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:15,473 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:12:15,473 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [502918357] [2023-11-29 04:12:15,473 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:15,473 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:15,474 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:15,474 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:15,475 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:15,475 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,512 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:15,513 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2023-11-29 04:12:15,514 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:15,514 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 7 [2023-11-29 04:12:15,514 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:15,515 INFO L225 Difference]: With dead ends: 120 [2023-11-29 04:12:15,516 INFO L226 Difference]: Without dead ends: 120 [2023-11-29 04:12:15,516 INFO L412 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 [2023-11-29 04:12:15,518 INFO L413 NwaCegarLoop]: 115 mSDtfsCounter, 3 mSDsluCounter, 107 mSDsCounter, 0 mSdLazyCounter, 21 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 222 SdHoareTripleChecker+Invalid, 21 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 21 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:15,519 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 222 Invalid, 21 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 21 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:12:15,520 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-29 04:12:15,526 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-11-29 04:12:15,527 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 65 states have (on average 1.9230769230769231) internal successors, (125), 119 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,528 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2023-11-29 04:12:15,529 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 7 [2023-11-29 04:12:15,529 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:15,529 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2023-11-29 04:12:15,530 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 3.5) internal successors, (7), 3 states have internal predecessors, (7), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,530 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2023-11-29 04:12:15,530 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 04:12:15,531 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:15,531 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:15,531 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 04:12:15,531 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr6REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:15,532 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:15,532 INFO L85 PathProgramCache]: Analyzing trace with hash -254098774, now seen corresponding path program 1 times [2023-11-29 04:12:15,532 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:15,532 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1649377742] [2023-11-29 04:12:15,532 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:15,533 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:15,553 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:15,663 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:15,663 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:15,664 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1649377742] [2023-11-29 04:12:15,664 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1649377742] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:15,664 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:15,664 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:12:15,664 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [740358486] [2023-11-29 04:12:15,664 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:15,665 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:12:15,665 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:15,666 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:12:15,666 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:12:15,666 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,800 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:15,800 INFO L93 Difference]: Finished difference Result 124 states and 129 transitions. [2023-11-29 04:12:15,800 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:12:15,801 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 04:12:15,801 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:15,802 INFO L225 Difference]: With dead ends: 124 [2023-11-29 04:12:15,802 INFO L226 Difference]: Without dead ends: 124 [2023-11-29 04:12:15,802 INFO L412 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 [2023-11-29 04:12:15,804 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 19 mSDsluCounter, 147 mSDsCounter, 0 mSdLazyCounter, 100 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 19 SdHoareTripleChecker+Valid, 256 SdHoareTripleChecker+Invalid, 104 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 100 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:15,804 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [19 Valid, 256 Invalid, 104 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 100 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:12:15,805 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 124 states. [2023-11-29 04:12:15,811 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 124 to 123. [2023-11-29 04:12:15,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 123 states, 68 states have (on average 1.8970588235294117) internal successors, (129), 122 states have internal predecessors, (129), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,812 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 123 states to 123 states and 129 transitions. [2023-11-29 04:12:15,812 INFO L78 Accepts]: Start accepts. Automaton has 123 states and 129 transitions. Word has length 8 [2023-11-29 04:12:15,813 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:15,813 INFO L495 AbstractCegarLoop]: Abstraction has 123 states and 129 transitions. [2023-11-29 04:12:15,813 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.0) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:15,813 INFO L276 IsEmpty]: Start isEmpty. Operand 123 states and 129 transitions. [2023-11-29 04:12:15,814 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 04:12:15,814 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:15,814 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:15,814 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 04:12:15,814 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:15,815 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:15,815 INFO L85 PathProgramCache]: Analyzing trace with hash -254098773, now seen corresponding path program 1 times [2023-11-29 04:12:15,815 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:15,815 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [193757337] [2023-11-29 04:12:15,815 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:15,816 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:15,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:16,023 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:16,023 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:16,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [193757337] [2023-11-29 04:12:16,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [193757337] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:16,024 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:16,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:12:16,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2125235423] [2023-11-29 04:12:16,024 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:16,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:12:16,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:16,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:12:16,026 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:12:16,026 INFO L87 Difference]: Start difference. First operand 123 states and 129 transitions. Second operand has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:16,140 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:16,140 INFO L93 Difference]: Finished difference Result 122 states and 127 transitions. [2023-11-29 04:12:16,140 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:12:16,140 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 8 [2023-11-29 04:12:16,141 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:16,142 INFO L225 Difference]: With dead ends: 122 [2023-11-29 04:12:16,142 INFO L226 Difference]: Without dead ends: 122 [2023-11-29 04:12:16,142 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:12:16,143 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 16 mSDsluCounter, 281 mSDsCounter, 0 mSdLazyCounter, 74 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 389 SdHoareTripleChecker+Invalid, 79 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 74 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:16,143 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 389 Invalid, 79 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 74 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:12:16,144 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 122 states. [2023-11-29 04:12:16,149 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 122 to 122. [2023-11-29 04:12:16,149 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 68 states have (on average 1.8676470588235294) internal successors, (127), 121 states have internal predecessors, (127), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:16,150 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 127 transitions. [2023-11-29 04:12:16,150 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 127 transitions. Word has length 8 [2023-11-29 04:12:16,150 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:16,151 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 127 transitions. [2023-11-29 04:12:16,151 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 1.6) internal successors, (8), 5 states have internal predecessors, (8), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:16,151 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 127 transitions. [2023-11-29 04:12:16,151 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 04:12:16,151 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:16,152 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:16,152 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 04:12:16,152 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:16,153 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:16,153 INFO L85 PathProgramCache]: Analyzing trace with hash -2119614211, now seen corresponding path program 1 times [2023-11-29 04:12:16,153 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:16,153 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1551850467] [2023-11-29 04:12:16,153 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:16,153 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:16,168 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:16,204 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:16,204 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:16,204 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1551850467] [2023-11-29 04:12:16,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1551850467] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:16,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:16,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:12:16,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [770318003] [2023-11-29 04:12:16,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:16,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:12:16,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:16,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:12:16,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:12:16,206 INFO L87 Difference]: Start difference. First operand 122 states and 127 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) [2023-11-29 04:12:16,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:16,304 INFO L93 Difference]: Finished difference Result 120 states and 125 transitions. [2023-11-29 04:12:16,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:12:16,305 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 [2023-11-29 04:12:16,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:16,306 INFO L225 Difference]: With dead ends: 120 [2023-11-29 04:12:16,306 INFO L226 Difference]: Without dead ends: 120 [2023-11-29 04:12:16,306 INFO L412 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 [2023-11-29 04:12:16,307 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 6 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 92 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 6 SdHoareTripleChecker+Valid, 258 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 92 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:16,307 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [6 Valid, 258 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 92 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:12:16,308 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 120 states. [2023-11-29 04:12:16,312 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 120 to 120. [2023-11-29 04:12:16,312 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 120 states, 68 states have (on average 1.838235294117647) internal successors, (125), 119 states have internal predecessors, (125), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:16,313 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 120 states to 120 states and 125 transitions. [2023-11-29 04:12:16,313 INFO L78 Accepts]: Start accepts. Automaton has 120 states and 125 transitions. Word has length 11 [2023-11-29 04:12:16,313 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:16,313 INFO L495 AbstractCegarLoop]: Abstraction has 120 states and 125 transitions. [2023-11-29 04:12:16,314 INFO L496 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) [2023-11-29 04:12:16,314 INFO L276 IsEmpty]: Start isEmpty. Operand 120 states and 125 transitions. [2023-11-29 04:12:16,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 04:12:16,314 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:16,314 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:16,314 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 04:12:16,315 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:16,315 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:16,315 INFO L85 PathProgramCache]: Analyzing trace with hash -2119614210, now seen corresponding path program 1 times [2023-11-29 04:12:16,315 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:16,315 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [806406365] [2023-11-29 04:12:16,316 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:16,316 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:16,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:16,376 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:16,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:16,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [806406365] [2023-11-29 04:12:16,377 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [806406365] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:12:16,377 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [307048464] [2023-11-29 04:12:16,377 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:16,377 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:16,377 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:16,379 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:12:16,390 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 04:12:16,473 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:16,475 INFO L262 TraceCheckSpWp]: Trace formula consists of 111 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:12:16,481 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:16,531 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:16,531 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:12:16,555 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:16,555 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [307048464] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:12:16,556 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:12:16,556 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3, 3] total 3 [2023-11-29 04:12:16,556 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949954726] [2023-11-29 04:12:16,556 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:12:16,557 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:12:16,557 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:16,558 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:12:16,558 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:12:16,558 INFO L87 Difference]: Start difference. First operand 120 states and 125 transitions. Second operand has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:16,586 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:16,586 INFO L93 Difference]: Finished difference Result 121 states and 126 transitions. [2023-11-29 04:12:16,586 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:12:16,587 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 04:12:16,587 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:16,588 INFO L225 Difference]: With dead ends: 121 [2023-11-29 04:12:16,588 INFO L226 Difference]: Without dead ends: 121 [2023-11-29 04:12:16,588 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 19 SyntacticMatches, 2 SemanticMatches, 2 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:12:16,589 INFO L413 NwaCegarLoop]: 114 mSDtfsCounter, 4 mSDsluCounter, 219 mSDsCounter, 0 mSdLazyCounter, 18 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 4 SdHoareTripleChecker+Valid, 333 SdHoareTripleChecker+Invalid, 19 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 18 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.0s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:16,589 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [4 Valid, 333 Invalid, 19 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 18 Invalid, 0 Unknown, 0 Unchecked, 0.0s Time] [2023-11-29 04:12:16,590 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-29 04:12:16,592 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 121. [2023-11-29 04:12:16,593 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 121 states, 69 states have (on average 1.826086956521739) internal successors, (126), 120 states have internal predecessors, (126), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:16,593 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 121 states to 121 states and 126 transitions. [2023-11-29 04:12:16,594 INFO L78 Accepts]: Start accepts. Automaton has 121 states and 126 transitions. Word has length 11 [2023-11-29 04:12:16,594 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:16,594 INFO L495 AbstractCegarLoop]: Abstraction has 121 states and 126 transitions. [2023-11-29 04:12:16,594 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.75) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:16,594 INFO L276 IsEmpty]: Start isEmpty. Operand 121 states and 126 transitions. [2023-11-29 04:12:16,595 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 04:12:16,595 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:16,595 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:16,607 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 04:12:16,796 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8,2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:16,797 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:16,798 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:16,798 INFO L85 PathProgramCache]: Analyzing trace with hash -1283483442, now seen corresponding path program 1 times [2023-11-29 04:12:16,798 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:16,798 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [365238840] [2023-11-29 04:12:16,798 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:16,799 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:16,840 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:16,986 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:16,986 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:16,986 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [365238840] [2023-11-29 04:12:16,987 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [365238840] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:12:16,987 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1074356693] [2023-11-29 04:12:16,987 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:16,987 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:16,987 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:16,988 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:12:16,994 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 04:12:17,083 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:17,085 INFO L262 TraceCheckSpWp]: Trace formula consists of 124 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 04:12:17,087 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:17,124 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 [2023-11-29 04:12:17,131 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 8 treesize of output 1 [2023-11-29 04:12:17,179 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:12:17,181 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 [2023-11-29 04:12:17,197 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 04:12:17,197 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 [2023-11-29 04:12:17,212 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:17,212 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:12:17,413 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 1 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:17,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1074356693] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:12:17,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:12:17,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 4, 4] total 8 [2023-11-29 04:12:17,414 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [795809259] [2023-11-29 04:12:17,414 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:12:17,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 04:12:17,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:17,415 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 04:12:17,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:12:17,415 INFO L87 Difference]: Start difference. First operand 121 states and 126 transitions. Second operand has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:17,681 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:17,681 INFO L93 Difference]: Finished difference Result 119 states and 124 transitions. [2023-11-29 04:12:17,681 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:12:17,682 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 04:12:17,682 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:17,683 INFO L225 Difference]: With dead ends: 119 [2023-11-29 04:12:17,683 INFO L226 Difference]: Without dead ends: 119 [2023-11-29 04:12:17,683 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 30 GetRequests, 20 SyntacticMatches, 0 SemanticMatches, 10 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=45, Invalid=87, Unknown=0, NotChecked=0, Total=132 [2023-11-29 04:12:17,684 INFO L413 NwaCegarLoop]: 109 mSDtfsCounter, 10 mSDsluCounter, 534 mSDsCounter, 0 mSdLazyCounter, 171 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 643 SdHoareTripleChecker+Invalid, 176 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 171 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:17,684 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 643 Invalid, 176 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 171 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:12:17,685 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-29 04:12:17,687 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 119. [2023-11-29 04:12:17,687 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 69 states have (on average 1.7971014492753623) internal successors, (124), 118 states have internal predecessors, (124), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:17,687 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 124 transitions. [2023-11-29 04:12:17,688 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 124 transitions. Word has length 12 [2023-11-29 04:12:17,688 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:17,688 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 124 transitions. [2023-11-29 04:12:17,688 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.875) internal successors, (23), 9 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:17,688 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 124 transitions. [2023-11-29 04:12:17,688 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 04:12:17,689 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:17,689 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:17,694 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 04:12:17,889 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9,3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:17,890 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:17,890 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:17,890 INFO L85 PathProgramCache]: Analyzing trace with hash 1303772338, now seen corresponding path program 1 times [2023-11-29 04:12:17,890 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:17,891 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2132589906] [2023-11-29 04:12:17,891 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:17,891 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:17,917 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:17,985 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 6 trivial. 0 not checked. [2023-11-29 04:12:17,985 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:17,985 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2132589906] [2023-11-29 04:12:17,985 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2132589906] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:17,986 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:17,986 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:12:17,986 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1830409785] [2023-11-29 04:12:17,986 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:17,987 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:12:17,987 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:17,987 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:12:17,988 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:12:17,988 INFO L87 Difference]: Start difference. First operand 119 states and 124 transitions. Second operand has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:18,077 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:18,078 INFO L93 Difference]: Finished difference Result 116 states and 121 transitions. [2023-11-29 04:12:18,078 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:12:18,078 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-29 04:12:18,079 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:18,080 INFO L225 Difference]: With dead ends: 116 [2023-11-29 04:12:18,080 INFO L226 Difference]: Without dead ends: 116 [2023-11-29 04:12:18,080 INFO L412 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 [2023-11-29 04:12:18,081 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 22 mSDsluCounter, 49 mSDsCounter, 0 mSdLazyCounter, 59 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 150 SdHoareTripleChecker+Invalid, 61 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 59 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:18,082 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 150 Invalid, 61 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 59 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:12:18,083 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 116 states. [2023-11-29 04:12:18,085 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 116 to 116. [2023-11-29 04:12:18,086 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 116 states, 69 states have (on average 1.7536231884057971) internal successors, (121), 115 states have internal predecessors, (121), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:18,086 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 116 states to 116 states and 121 transitions. [2023-11-29 04:12:18,087 INFO L78 Accepts]: Start accepts. Automaton has 116 states and 121 transitions. Word has length 16 [2023-11-29 04:12:18,087 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:18,087 INFO L495 AbstractCegarLoop]: Abstraction has 116 states and 121 transitions. [2023-11-29 04:12:18,087 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 6.0) internal successors, (12), 3 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:18,088 INFO L276 IsEmpty]: Start isEmpty. Operand 116 states and 121 transitions. [2023-11-29 04:12:18,088 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 04:12:18,088 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:18,089 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:18,089 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 04:12:18,089 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:18,090 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:18,090 INFO L85 PathProgramCache]: Analyzing trace with hash 1303772339, now seen corresponding path program 1 times [2023-11-29 04:12:18,090 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:18,091 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1374774972] [2023-11-29 04:12:18,091 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:18,091 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:18,115 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:18,293 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:12:18,293 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:18,293 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1374774972] [2023-11-29 04:12:18,293 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1374774972] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:18,293 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:18,293 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:12:18,294 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [956089982] [2023-11-29 04:12:18,294 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:18,294 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:12:18,294 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:18,295 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:12:18,295 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:12:18,295 INFO L87 Difference]: Start difference. First operand 116 states and 121 transitions. Second operand has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:18,414 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:18,414 INFO L93 Difference]: Finished difference Result 109 states and 114 transitions. [2023-11-29 04:12:18,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:12:18,415 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-29 04:12:18,415 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:18,416 INFO L225 Difference]: With dead ends: 109 [2023-11-29 04:12:18,416 INFO L226 Difference]: Without dead ends: 109 [2023-11-29 04:12:18,416 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:12:18,417 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 98 mSDsluCounter, 150 mSDsCounter, 0 mSdLazyCounter, 116 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 98 SdHoareTripleChecker+Valid, 226 SdHoareTripleChecker+Invalid, 123 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 116 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:18,417 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [98 Valid, 226 Invalid, 123 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 116 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:12:18,418 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 109 states. [2023-11-29 04:12:18,420 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 109 to 109. [2023-11-29 04:12:18,420 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 69 states have (on average 1.6521739130434783) internal successors, (114), 108 states have internal predecessors, (114), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:18,420 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 114 transitions. [2023-11-29 04:12:18,421 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 114 transitions. Word has length 16 [2023-11-29 04:12:18,421 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:18,421 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 114 transitions. [2023-11-29 04:12:18,421 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.0) internal successors, (16), 5 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:18,421 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 114 transitions. [2023-11-29 04:12:18,422 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 04:12:18,422 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:18,422 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:18,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 04:12:18,422 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr17ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:18,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:18,423 INFO L85 PathProgramCache]: Analyzing trace with hash 1546954811, now seen corresponding path program 1 times [2023-11-29 04:12:18,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:18,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [50661589] [2023-11-29 04:12:18,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:18,423 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:18,447 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:18,561 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:12:18,562 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:18,562 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [50661589] [2023-11-29 04:12:18,562 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [50661589] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:18,562 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:18,562 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 04:12:18,562 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1252651386] [2023-11-29 04:12:18,562 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:18,563 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:12:18,563 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:18,563 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:12:18,563 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:12:18,564 INFO L87 Difference]: Start difference. First operand 109 states and 114 transitions. Second operand has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:18,710 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:18,710 INFO L93 Difference]: Finished difference Result 104 states and 109 transitions. [2023-11-29 04:12:18,710 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:12:18,711 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-29 04:12:18,711 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:18,712 INFO L225 Difference]: With dead ends: 104 [2023-11-29 04:12:18,712 INFO L226 Difference]: Without dead ends: 104 [2023-11-29 04:12:18,712 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:12:18,713 INFO L413 NwaCegarLoop]: 61 mSDtfsCounter, 90 mSDsluCounter, 123 mSDsCounter, 0 mSdLazyCounter, 143 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 147 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 143 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:18,713 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 184 Invalid, 147 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 143 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:12:18,714 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 104 states. [2023-11-29 04:12:18,716 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 104 to 104. [2023-11-29 04:12:18,717 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 104 states, 69 states have (on average 1.5797101449275361) internal successors, (109), 103 states have internal predecessors, (109), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:18,717 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 104 states to 104 states and 109 transitions. [2023-11-29 04:12:18,718 INFO L78 Accepts]: Start accepts. Automaton has 104 states and 109 transitions. Word has length 20 [2023-11-29 04:12:18,718 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:18,718 INFO L495 AbstractCegarLoop]: Abstraction has 104 states and 109 transitions. [2023-11-29 04:12:18,718 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 5.0) internal successors, (20), 5 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:18,718 INFO L276 IsEmpty]: Start isEmpty. Operand 104 states and 109 transitions. [2023-11-29 04:12:18,719 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 04:12:18,719 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:18,719 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:18,720 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 04:12:18,720 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr46ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:18,720 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:18,720 INFO L85 PathProgramCache]: Analyzing trace with hash 1546993793, now seen corresponding path program 1 times [2023-11-29 04:12:18,721 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:18,721 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1666228909] [2023-11-29 04:12:18,721 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:18,721 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:18,761 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:19,099 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:12:19,099 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:19,099 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1666228909] [2023-11-29 04:12:19,099 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1666228909] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:19,099 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:19,100 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:12:19,100 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1448509550] [2023-11-29 04:12:19,100 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:19,100 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:12:19,100 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:19,101 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:12:19,101 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:12:19,101 INFO L87 Difference]: Start difference. First operand 104 states and 109 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:19,224 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:19,224 INFO L93 Difference]: Finished difference Result 99 states and 104 transitions. [2023-11-29 04:12:19,224 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:12:19,225 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-29 04:12:19,225 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:19,226 INFO L225 Difference]: With dead ends: 99 [2023-11-29 04:12:19,226 INFO L226 Difference]: Without dead ends: 99 [2023-11-29 04:12:19,226 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:12:19,227 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 171 mSDsluCounter, 131 mSDsCounter, 0 mSdLazyCounter, 117 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 171 SdHoareTripleChecker+Valid, 195 SdHoareTripleChecker+Invalid, 122 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 117 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:19,227 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [171 Valid, 195 Invalid, 122 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 117 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:12:19,228 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-29 04:12:19,230 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-29 04:12:19,231 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 69 states have (on average 1.5072463768115942) internal successors, (104), 98 states have internal predecessors, (104), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:19,231 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 104 transitions. [2023-11-29 04:12:19,232 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 104 transitions. Word has length 20 [2023-11-29 04:12:19,232 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:19,232 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 104 transitions. [2023-11-29 04:12:19,232 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 6 states have internal predecessors, (20), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:19,232 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 104 transitions. [2023-11-29 04:12:19,233 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 04:12:19,233 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:19,233 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:19,233 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 04:12:19,234 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr31ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:19,234 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:19,234 INFO L85 PathProgramCache]: Analyzing trace with hash 1546992577, now seen corresponding path program 1 times [2023-11-29 04:12:19,234 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:19,235 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [65198225] [2023-11-29 04:12:19,235 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:19,235 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:19,265 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:19,732 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:19,732 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:19,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [65198225] [2023-11-29 04:12:19,732 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [65198225] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:12:19,732 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2140467568] [2023-11-29 04:12:19,732 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:19,733 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:19,733 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:19,734 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:12:19,736 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 04:12:19,846 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:19,849 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-29 04:12:19,852 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:19,856 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 [2023-11-29 04:12:19,907 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 04:12:19,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 12 treesize of output 14 [2023-11-29 04:12:20,018 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-29 04:12:20,018 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 [2023-11-29 04:12:20,090 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 [2023-11-29 04:12:20,146 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 [2023-11-29 04:12:20,201 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 [2023-11-29 04:12:20,247 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 19 treesize of output 18 [2023-11-29 04:12:20,291 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:20,291 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:12:20,311 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 (Array Int Int))) (= (select (select (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_434) |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 [2023-11-29 04:12:20,325 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_434 (Array Int Int)) (v_ArrVal_433 (Array Int Int))) (= (select (select (store (store |c_#memory_$Pointer$#0.offset| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_433) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_434) |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 [2023-11-29 04:12:20,333 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:20,334 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 [2023-11-29 04:12:20,340 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 [2023-11-29 04:12:20,349 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 20 treesize of output 16 [2023-11-29 04:12:20,357 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 04:12:20,565 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 3 not checked. [2023-11-29 04:12:20,565 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2140467568] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:12:20,565 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:12:20,565 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 25 [2023-11-29 04:12:20,565 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1552978704] [2023-11-29 04:12:20,565 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:12:20,566 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 04:12:20,566 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:20,567 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 04:12:20,567 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=484, Unknown=2, NotChecked=90, Total=650 [2023-11-29 04:12:20,567 INFO L87 Difference]: Start difference. First operand 99 states and 104 transitions. Second operand has 26 states, 25 states have (on average 2.04) internal successors, (51), 26 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:21,225 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:21,226 INFO L93 Difference]: Finished difference Result 94 states and 99 transitions. [2023-11-29 04:12:21,226 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:12:21,226 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.04) internal successors, (51), 26 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-29 04:12:21,226 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:21,227 INFO L225 Difference]: With dead ends: 94 [2023-11-29 04:12:21,227 INFO L226 Difference]: Without dead ends: 94 [2023-11-29 04:12:21,228 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 57 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 31 ConstructedPredicates, 2 IntricatePredicates, 0 DeprecatedPredicates, 162 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=170, Invalid=766, Unknown=2, NotChecked=118, Total=1056 [2023-11-29 04:12:21,229 INFO L413 NwaCegarLoop]: 58 mSDtfsCounter, 186 mSDsluCounter, 535 mSDsCounter, 0 mSdLazyCounter, 552 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 186 SdHoareTripleChecker+Valid, 593 SdHoareTripleChecker+Invalid, 758 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 552 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 189 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:21,229 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [186 Valid, 593 Invalid, 758 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 552 Invalid, 0 Unknown, 189 Unchecked, 0.4s Time] [2023-11-29 04:12:21,230 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-29 04:12:21,232 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-29 04:12:21,233 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 69 states have (on average 1.434782608695652) internal successors, (99), 93 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:21,233 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 99 transitions. [2023-11-29 04:12:21,233 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 99 transitions. Word has length 20 [2023-11-29 04:12:21,233 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:21,234 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 99 transitions. [2023-11-29 04:12:21,234 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.04) internal successors, (51), 26 states have internal predecessors, (51), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:21,234 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 99 transitions. [2023-11-29 04:12:21,235 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 04:12:21,235 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:21,235 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:21,242 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Forceful destruction successful, exit code 0 [2023-11-29 04:12:21,438 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14,4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:21,439 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr47ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:21,439 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:21,439 INFO L85 PathProgramCache]: Analyzing trace with hash 712167507, now seen corresponding path program 1 times [2023-11-29 04:12:21,439 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:21,439 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [730743663] [2023-11-29 04:12:21,440 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:21,440 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:21,470 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:21,748 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:12:21,748 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:21,749 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [730743663] [2023-11-29 04:12:21,749 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [730743663] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:21,749 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:21,749 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:12:21,749 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [25671226] [2023-11-29 04:12:21,749 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:21,750 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 04:12:21,750 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:21,750 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 04:12:21,751 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:12:21,751 INFO L87 Difference]: Start difference. First operand 94 states and 99 transitions. Second operand has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:21,969 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:21,969 INFO L93 Difference]: Finished difference Result 89 states and 94 transitions. [2023-11-29 04:12:21,969 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:12:21,969 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-29 04:12:21,970 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:21,970 INFO L225 Difference]: With dead ends: 89 [2023-11-29 04:12:21,970 INFO L226 Difference]: Without dead ends: 89 [2023-11-29 04:12:21,971 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 0 SyntacticMatches, 1 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 9 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=22, Invalid=50, Unknown=0, NotChecked=0, Total=72 [2023-11-29 04:12:21,971 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 150 mSDsluCounter, 101 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 150 SdHoareTripleChecker+Valid, 134 SdHoareTripleChecker+Invalid, 232 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:21,972 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [150 Valid, 134 Invalid, 232 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:12:21,972 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-29 04:12:21,974 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 89. [2023-11-29 04:12:21,974 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 89 states, 69 states have (on average 1.3623188405797102) internal successors, (94), 88 states have internal predecessors, (94), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:21,975 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 89 states to 89 states and 94 transitions. [2023-11-29 04:12:21,975 INFO L78 Accepts]: Start accepts. Automaton has 89 states and 94 transitions. Word has length 21 [2023-11-29 04:12:21,975 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:21,975 INFO L495 AbstractCegarLoop]: Abstraction has 89 states and 94 transitions. [2023-11-29 04:12:21,976 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.5) internal successors, (21), 6 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:21,976 INFO L276 IsEmpty]: Start isEmpty. Operand 89 states and 94 transitions. [2023-11-29 04:12:21,976 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 04:12:21,976 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:21,977 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:21,977 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 04:12:21,977 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr32ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:21,978 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:21,978 INFO L85 PathProgramCache]: Analyzing trace with hash 712129773, now seen corresponding path program 1 times [2023-11-29 04:12:21,978 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:21,978 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [846300789] [2023-11-29 04:12:21,978 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:21,979 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:22,001 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:22,390 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:22,390 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:22,390 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [846300789] [2023-11-29 04:12:22,391 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [846300789] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:12:22,391 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [693262027] [2023-11-29 04:12:22,391 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:22,391 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:22,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:22,392 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:12:22,399 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 04:12:22,510 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:22,512 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 04:12:22,515 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:22,517 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 [2023-11-29 04:12:22,556 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 04:12:22,556 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 [2023-11-29 04:12:22,615 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-29 04:12:22,616 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 [2023-11-29 04:12:22,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 04:12:22,688 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 [2023-11-29 04:12:22,789 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 35 [2023-11-29 04:12:22,859 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 51 treesize of output 31 [2023-11-29 04:12:22,933 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2023-11-29 04:12:22,944 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:22,944 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:12:23,083 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:23,084 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 25 treesize of output 26 [2023-11-29 04:12:23,092 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 39 treesize of output 31 [2023-11-29 04:12:23,096 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 [2023-11-29 04:12:23,305 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:23,305 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [693262027] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:12:23,305 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:12:23,305 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 9, 9] total 22 [2023-11-29 04:12:23,306 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1854681966] [2023-11-29 04:12:23,306 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:12:23,306 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 04:12:23,306 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:23,307 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 04:12:23,308 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=434, Unknown=5, NotChecked=0, Total=506 [2023-11-29 04:12:23,308 INFO L87 Difference]: Start difference. First operand 89 states and 94 transitions. Second operand has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:24,094 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:24,094 INFO L93 Difference]: Finished difference Result 87 states and 92 transitions. [2023-11-29 04:12:24,095 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:12:24,095 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 21 [2023-11-29 04:12:24,095 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:24,096 INFO L225 Difference]: With dead ends: 87 [2023-11-29 04:12:24,096 INFO L226 Difference]: Without dead ends: 87 [2023-11-29 04:12:24,097 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 27 SyntacticMatches, 3 SemanticMatches, 29 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 184 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=158, Invalid=767, Unknown=5, NotChecked=0, Total=930 [2023-11-29 04:12:24,097 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 153 mSDsluCounter, 299 mSDsCounter, 0 mSdLazyCounter, 685 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 153 SdHoareTripleChecker+Valid, 332 SdHoareTripleChecker+Invalid, 697 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 685 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:24,098 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [153 Valid, 332 Invalid, 697 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 685 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 04:12:24,099 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 87 states. [2023-11-29 04:12:24,100 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 87 to 84. [2023-11-29 04:12:24,101 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 84 states, 69 states have (on average 1.289855072463768) internal successors, (89), 83 states have internal predecessors, (89), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:24,101 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 84 states to 84 states and 89 transitions. [2023-11-29 04:12:24,101 INFO L78 Accepts]: Start accepts. Automaton has 84 states and 89 transitions. Word has length 21 [2023-11-29 04:12:24,102 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:24,102 INFO L495 AbstractCegarLoop]: Abstraction has 84 states and 89 transitions. [2023-11-29 04:12:24,102 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.1818181818181817) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:24,102 INFO L276 IsEmpty]: Start isEmpty. Operand 84 states and 89 transitions. [2023-11-29 04:12:24,103 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 04:12:24,103 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:24,103 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:24,110 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Forceful destruction successful, exit code 0 [2023-11-29 04:12:24,303 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:24,304 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr48ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:24,304 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:24,304 INFO L85 PathProgramCache]: Analyzing trace with hash 602356419, now seen corresponding path program 1 times [2023-11-29 04:12:24,304 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:24,304 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2011368579] [2023-11-29 04:12:24,304 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:24,304 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:24,334 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:24,592 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 5 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:12:24,592 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:24,592 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2011368579] [2023-11-29 04:12:24,592 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2011368579] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:12:24,592 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:12:24,593 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:12:24,593 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [282089592] [2023-11-29 04:12:24,593 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:12:24,593 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:12:24,593 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:24,594 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:12:24,594 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=17, Invalid=39, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:12:24,594 INFO L87 Difference]: Start difference. First operand 84 states and 89 transitions. Second operand has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:24,715 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:24,715 INFO L93 Difference]: Finished difference Result 83 states and 88 transitions. [2023-11-29 04:12:24,716 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:12:24,716 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-29 04:12:24,716 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:24,717 INFO L225 Difference]: With dead ends: 83 [2023-11-29 04:12:24,717 INFO L226 Difference]: Without dead ends: 83 [2023-11-29 04:12:24,717 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 10 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:12:24,718 INFO L413 NwaCegarLoop]: 64 mSDtfsCounter, 26 mSDsluCounter, 114 mSDsCounter, 0 mSdLazyCounter, 127 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 26 SdHoareTripleChecker+Valid, 178 SdHoareTripleChecker+Invalid, 131 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 127 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:24,718 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [26 Valid, 178 Invalid, 131 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 127 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 04:12:24,719 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 83 states. [2023-11-29 04:12:24,720 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 83 to 83. [2023-11-29 04:12:24,721 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 83 states, 69 states have (on average 1.2753623188405796) internal successors, (88), 82 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:24,721 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 83 states to 83 states and 88 transitions. [2023-11-29 04:12:24,721 INFO L78 Accepts]: Start accepts. Automaton has 83 states and 88 transitions. Word has length 22 [2023-11-29 04:12:24,722 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:24,722 INFO L495 AbstractCegarLoop]: Abstraction has 83 states and 88 transitions. [2023-11-29 04:12:24,722 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 3.142857142857143) internal successors, (22), 7 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:24,722 INFO L276 IsEmpty]: Start isEmpty. Operand 83 states and 88 transitions. [2023-11-29 04:12:24,722 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 04:12:24,723 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:24,723 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:24,723 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 04:12:24,723 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr33ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:24,724 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:24,724 INFO L85 PathProgramCache]: Analyzing trace with hash 601186627, now seen corresponding path program 1 times [2023-11-29 04:12:24,724 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:24,724 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1794038422] [2023-11-29 04:12:24,724 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:24,724 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:24,745 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:25,073 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:25,074 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:25,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1794038422] [2023-11-29 04:12:25,074 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1794038422] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:12:25,074 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [2048344417] [2023-11-29 04:12:25,074 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:25,074 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:25,074 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:25,075 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:12:25,078 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 04:12:25,199 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:25,202 INFO L262 TraceCheckSpWp]: Trace formula consists of 210 conjuncts, 49 conjunts are in the unsatisfiable core [2023-11-29 04:12:25,205 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:25,208 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:12:25,250 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 04:12:25,251 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 [2023-11-29 04:12:25,299 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-29 04:12:25,299 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 [2023-11-29 04:12:25,316 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 [2023-11-29 04:12:25,346 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:12:25,346 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 [2023-11-29 04:12:25,393 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 [2023-11-29 04:12:25,454 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 [2023-11-29 04:12:25,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:25,520 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 22 [2023-11-29 04:12:25,546 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:25,546 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:12:25,629 INFO L349 Elim1Store]: treesize reduction 18, result has 60.0 percent of original size [2023-11-29 04:12:25,629 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 28 treesize of output 38 [2023-11-29 04:12:25,694 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:25,694 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 43 treesize of output 35 [2023-11-29 04:12:25,698 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 235 treesize of output 215 [2023-11-29 04:12:25,707 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 49 treesize of output 41 [2023-11-29 04:12:25,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 39 treesize of output 35 [2023-11-29 04:12:25,862 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:25,862 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [2048344417] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:12:25,862 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:12:25,862 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9, 9] total 21 [2023-11-29 04:12:25,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [531810602] [2023-11-29 04:12:25,863 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:12:25,863 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 04:12:25,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:25,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 04:12:25,865 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=67, Invalid=389, Unknown=6, NotChecked=0, Total=462 [2023-11-29 04:12:25,865 INFO L87 Difference]: Start difference. First operand 83 states and 88 transitions. Second operand has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:26,381 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:26,381 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2023-11-29 04:12:26,381 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:12:26,382 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-29 04:12:26,382 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:26,382 INFO L225 Difference]: With dead ends: 82 [2023-11-29 04:12:26,382 INFO L226 Difference]: Without dead ends: 82 [2023-11-29 04:12:26,383 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 27 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 141 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=154, Invalid=652, Unknown=6, NotChecked=0, Total=812 [2023-11-29 04:12:26,384 INFO L413 NwaCegarLoop]: 60 mSDtfsCounter, 37 mSDsluCounter, 493 mSDsCounter, 0 mSdLazyCounter, 463 mSolverCounterSat, 15 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 37 SdHoareTripleChecker+Valid, 553 SdHoareTripleChecker+Invalid, 478 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 15 IncrementalHoareTripleChecker+Valid, 463 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:26,384 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [37 Valid, 553 Invalid, 478 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [15 Valid, 463 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:12:26,385 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-29 04:12:26,386 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 82. [2023-11-29 04:12:26,387 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 82 states, 69 states have (on average 1.2608695652173914) internal successors, (87), 81 states have internal predecessors, (87), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:26,388 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 82 states to 82 states and 87 transitions. [2023-11-29 04:12:26,388 INFO L78 Accepts]: Start accepts. Automaton has 82 states and 87 transitions. Word has length 22 [2023-11-29 04:12:26,388 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:26,388 INFO L495 AbstractCegarLoop]: Abstraction has 82 states and 87 transitions. [2023-11-29 04:12:26,389 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:26,389 INFO L276 IsEmpty]: Start isEmpty. Operand 82 states and 87 transitions. [2023-11-29 04:12:26,389 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 04:12:26,390 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:26,390 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:26,397 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 04:12:26,594 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:26,595 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr27ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:26,595 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:26,595 INFO L85 PathProgramCache]: Analyzing trace with hash 1023811472, now seen corresponding path program 1 times [2023-11-29 04:12:26,596 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:26,596 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1103640580] [2023-11-29 04:12:26,596 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:26,596 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:26,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:26,948 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:26,948 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:26,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1103640580] [2023-11-29 04:12:26,949 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1103640580] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:12:26,949 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1764465374] [2023-11-29 04:12:26,949 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:26,949 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:26,949 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:26,950 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:12:26,953 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 04:12:27,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:27,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 217 conjuncts, 32 conjunts are in the unsatisfiable core [2023-11-29 04:12:27,097 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:27,130 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 04:12:27,130 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 [2023-11-29 04:12:27,207 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 [2023-11-29 04:12:27,233 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:27,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 [2023-11-29 04:12:27,380 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 04:12:27,380 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 [2023-11-29 04:12:27,386 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:27,386 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:12:27,468 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 [2023-11-29 04:12:27,470 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 [2023-11-29 04:12:27,481 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 [2023-11-29 04:12:27,525 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 04:12:27,526 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 [2023-11-29 04:12:27,533 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:27,533 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1764465374] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:12:27,533 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:12:27,534 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 11, 11] total 21 [2023-11-29 04:12:27,534 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [270104730] [2023-11-29 04:12:27,534 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:12:27,534 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 22 states [2023-11-29 04:12:27,535 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:27,535 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 22 interpolants. [2023-11-29 04:12:27,536 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=77, Invalid=385, Unknown=0, NotChecked=0, Total=462 [2023-11-29 04:12:27,536 INFO L87 Difference]: Start difference. First operand 82 states and 87 transitions. Second operand has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:27,924 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:27,924 INFO L93 Difference]: Finished difference Result 81 states and 86 transitions. [2023-11-29 04:12:27,924 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 04:12:27,924 INFO L78 Accepts]: Start accepts. Automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-29 04:12:27,924 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:27,925 INFO L225 Difference]: With dead ends: 81 [2023-11-29 04:12:27,925 INFO L226 Difference]: Without dead ends: 81 [2023-11-29 04:12:27,926 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 61 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 24 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=118, Invalid=532, Unknown=0, NotChecked=0, Total=650 [2023-11-29 04:12:27,926 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 59 mSDsluCounter, 563 mSDsCounter, 0 mSdLazyCounter, 546 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 59 SdHoareTripleChecker+Valid, 622 SdHoareTripleChecker+Invalid, 551 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 546 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:27,926 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [59 Valid, 622 Invalid, 551 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 546 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:12:27,927 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 81 states. [2023-11-29 04:12:27,928 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 81 to 81. [2023-11-29 04:12:27,928 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 81 states, 69 states have (on average 1.2463768115942029) internal successors, (86), 80 states have internal predecessors, (86), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:27,929 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 81 states to 81 states and 86 transitions. [2023-11-29 04:12:27,929 INFO L78 Accepts]: Start accepts. Automaton has 81 states and 86 transitions. Word has length 25 [2023-11-29 04:12:27,929 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:27,930 INFO L495 AbstractCegarLoop]: Abstraction has 81 states and 86 transitions. [2023-11-29 04:12:27,930 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 22 states, 21 states have (on average 2.380952380952381) internal successors, (50), 22 states have internal predecessors, (50), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:27,930 INFO L276 IsEmpty]: Start isEmpty. Operand 81 states and 86 transitions. [2023-11-29 04:12:27,931 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 04:12:27,931 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:27,931 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:27,937 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 04:12:28,134 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:28,135 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr21ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:28,135 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:28,135 INFO L85 PathProgramCache]: Analyzing trace with hash 1023380496, now seen corresponding path program 1 times [2023-11-29 04:12:28,135 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:28,136 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [338910708] [2023-11-29 04:12:28,136 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:28,136 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:28,155 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:28,559 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:28,559 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:28,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [338910708] [2023-11-29 04:12:28,559 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [338910708] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:12:28,559 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [809286796] [2023-11-29 04:12:28,560 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:28,560 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:28,560 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:28,561 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:12:28,564 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 04:12:28,710 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:28,713 INFO L262 TraceCheckSpWp]: Trace formula consists of 216 conjuncts, 42 conjunts are in the unsatisfiable core [2023-11-29 04:12:28,716 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:28,719 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 [2023-11-29 04:12:28,747 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 04:12:28,747 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 [2023-11-29 04:12:28,802 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-29 04:12:28,802 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 [2023-11-29 04:12:28,824 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 [2023-11-29 04:12:28,863 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:12:28,863 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 [2023-11-29 04:12:28,899 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 [2023-11-29 04:12:28,947 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-29 04:12:28,947 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 23 [2023-11-29 04:12:29,016 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:29,017 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 25 treesize of output 21 [2023-11-29 04:12:29,132 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 [2023-11-29 04:12:29,139 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:29,139 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:12:29,367 INFO L349 Elim1Store]: treesize reduction 8, result has 82.2 percent of original size [2023-11-29 04:12:29,367 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 47 treesize of output 67 [2023-11-29 04:12:29,458 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:29,458 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 43 treesize of output 35 [2023-11-29 04:12:29,460 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:12:29,465 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:29,466 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 47 [2023-11-29 04:12:29,469 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 19 treesize of output 15 [2023-11-29 04:12:29,483 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 04:12:29,483 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 1 [2023-11-29 04:12:29,597 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:29,597 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [809286796] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:12:29,597 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:12:29,597 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2023-11-29 04:12:29,597 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [677892623] [2023-11-29 04:12:29,597 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:12:29,598 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 04:12:29,598 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:29,599 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 04:12:29,599 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=74, Invalid=576, Unknown=0, NotChecked=0, Total=650 [2023-11-29 04:12:29,599 INFO L87 Difference]: Start difference. First operand 81 states and 86 transitions. Second operand has 26 states, 25 states have (on average 2.4) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:30,233 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:30,233 INFO L93 Difference]: Finished difference Result 80 states and 85 transitions. [2023-11-29 04:12:30,233 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:12:30,234 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-29 04:12:30,234 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:30,234 INFO L225 Difference]: With dead ends: 80 [2023-11-29 04:12:30,234 INFO L226 Difference]: Without dead ends: 80 [2023-11-29 04:12:30,235 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 67 GetRequests, 32 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 1 DeprecatedPredicates, 201 ImplicationChecksByTransitivity, 0.7s TimeCoverageRelationStatistics Valid=169, Invalid=953, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 04:12:30,236 INFO L413 NwaCegarLoop]: 59 mSDtfsCounter, 90 mSDsluCounter, 564 mSDsCounter, 0 mSdLazyCounter, 645 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 90 SdHoareTripleChecker+Valid, 623 SdHoareTripleChecker+Invalid, 665 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 645 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:30,236 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [90 Valid, 623 Invalid, 665 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 645 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:12:30,237 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-29 04:12:30,238 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-29 04:12:30,239 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 69 states have (on average 1.2318840579710144) internal successors, (85), 79 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:30,239 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 85 transitions. [2023-11-29 04:12:30,239 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 85 transitions. Word has length 25 [2023-11-29 04:12:30,239 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:30,239 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 85 transitions. [2023-11-29 04:12:30,240 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.4) internal successors, (60), 26 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:30,240 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 85 transitions. [2023-11-29 04:12:30,240 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 04:12:30,240 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:30,240 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:30,245 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 04:12:30,441 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:30,441 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr57ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:30,442 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:30,442 INFO L85 PathProgramCache]: Analyzing trace with hash 349414151, now seen corresponding path program 1 times [2023-11-29 04:12:30,442 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:30,442 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1961331341] [2023-11-29 04:12:30,442 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:30,442 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:30,469 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:30,994 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:30,994 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:30,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1961331341] [2023-11-29 04:12:30,994 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1961331341] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:12:30,994 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192225108] [2023-11-29 04:12:30,994 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:30,994 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:30,994 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:30,995 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:12:30,997 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 04:12:31,119 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:31,121 INFO L262 TraceCheckSpWp]: Trace formula consists of 222 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-29 04:12:31,125 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:31,128 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 [2023-11-29 04:12:31,180 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 04:12:31,180 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 [2023-11-29 04:12:31,264 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-29 04:12:31,265 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 [2023-11-29 04:12:31,305 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 [2023-11-29 04:12:31,365 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:12:31,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 2 new quantified variables, introduced 1 case distinctions, treesize of input 42 treesize of output 39 [2023-11-29 04:12:31,412 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 [2023-11-29 04:12:31,438 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 [2023-11-29 04:12:31,514 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:31,514 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 24 [2023-11-29 04:12:31,532 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 [2023-11-29 04:12:31,538 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:31,538 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:12:31,718 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:31,719 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 37 treesize of output 41 [2023-11-29 04:12:31,738 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_931 (Array Int Int)) (v_ArrVal_932 (Array Int Int))) (not (= (select (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_931) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_932) |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|))) (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 [2023-11-29 04:12:31,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:31,745 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 [2023-11-29 04:12:31,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 131 treesize of output 119 [2023-11-29 04:12:31,754 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 [2023-11-29 04:12:31,758 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 [2023-11-29 04:12:31,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 04:12:31,771 INFO L349 Elim1Store]: treesize reduction 7, result has 12.5 percent of original size [2023-11-29 04:12:31,772 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 1 new quantified variables, introduced 1 case distinctions, treesize of input 21 treesize of output 1 [2023-11-29 04:12:32,047 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 04:12:32,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192225108] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:12:32,047 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:12:32,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 12] total 33 [2023-11-29 04:12:32,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1625670778] [2023-11-29 04:12:32,048 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:12:32,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 35 states [2023-11-29 04:12:32,048 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:32,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 35 interpolants. [2023-11-29 04:12:32,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=134, Invalid=986, Unknown=6, NotChecked=64, Total=1190 [2023-11-29 04:12:32,050 INFO L87 Difference]: Start difference. First operand 80 states and 85 transitions. Second operand has 35 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:32,906 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:32,906 INFO L93 Difference]: Finished difference Result 82 states and 87 transitions. [2023-11-29 04:12:32,907 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 04:12:32,907 INFO L78 Accepts]: Start accepts. Automaton has has 35 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 04:12:32,908 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:32,908 INFO L225 Difference]: With dead ends: 82 [2023-11-29 04:12:32,908 INFO L226 Difference]: Without dead ends: 82 [2023-11-29 04:12:32,909 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 30 SyntacticMatches, 1 SemanticMatches, 40 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 511 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=240, Invalid=1398, Unknown=6, NotChecked=78, Total=1722 [2023-11-29 04:12:32,910 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 172 mSDsluCounter, 598 mSDsCounter, 0 mSdLazyCounter, 852 mSolverCounterSat, 33 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 172 SdHoareTripleChecker+Valid, 645 SdHoareTripleChecker+Invalid, 942 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 33 IncrementalHoareTripleChecker+Valid, 852 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 57 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:32,910 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [172 Valid, 645 Invalid, 942 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [33 Valid, 852 Invalid, 0 Unknown, 57 Unchecked, 0.6s Time] [2023-11-29 04:12:32,911 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 82 states. [2023-11-29 04:12:32,913 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 82 to 79. [2023-11-29 04:12:32,913 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 79 states, 69 states have (on average 1.2173913043478262) internal successors, (84), 78 states have internal predecessors, (84), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:32,914 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 79 states to 79 states and 84 transitions. [2023-11-29 04:12:32,914 INFO L78 Accepts]: Start accepts. Automaton has 79 states and 84 transitions. Word has length 26 [2023-11-29 04:12:32,914 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:32,914 INFO L495 AbstractCegarLoop]: Abstraction has 79 states and 84 transitions. [2023-11-29 04:12:32,914 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 35 states, 34 states have (on average 1.7647058823529411) internal successors, (60), 34 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:32,915 INFO L276 IsEmpty]: Start isEmpty. Operand 79 states and 84 transitions. [2023-11-29 04:12:32,915 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 04:12:32,915 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:32,916 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:32,922 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 04:12:33,118 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 04:12:33,119 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr51ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:33,119 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:33,119 INFO L85 PathProgramCache]: Analyzing trace with hash 348983175, now seen corresponding path program 1 times [2023-11-29 04:12:33,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:33,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [696614989] [2023-11-29 04:12:33,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:33,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:33,150 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:33,555 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:33,556 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:33,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [696614989] [2023-11-29 04:12:33,556 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [696614989] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:12:33,556 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1162771942] [2023-11-29 04:12:33,556 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:33,556 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:33,556 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:33,557 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:12:33,560 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 04:12:33,706 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:33,708 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 04:12:33,711 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:33,714 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 [2023-11-29 04:12:33,740 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 04:12:33,740 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 [2023-11-29 04:12:33,805 INFO L349 Elim1Store]: treesize reduction 4, result has 50.0 percent of original size [2023-11-29 04:12:33,805 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 [2023-11-29 04:12:33,857 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 [2023-11-29 04:12:33,880 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:33,880 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 [2023-11-29 04:12:34,008 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 04:12:34,008 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 [2023-11-29 04:12:34,049 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:12:34,049 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:12:34,164 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 [2023-11-29 04:12:34,171 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 [2023-11-29 04:12:34,174 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 [2023-11-29 04:12:34,254 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-29 04:12:34,254 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1162771942] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:12:34,255 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:12:34,255 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9, 8] total 21 [2023-11-29 04:12:34,255 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [915496885] [2023-11-29 04:12:34,255 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:12:34,255 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 04:12:34,256 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:34,256 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 04:12:34,257 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=83, Invalid=423, Unknown=0, NotChecked=0, Total=506 [2023-11-29 04:12:34,257 INFO L87 Difference]: Start difference. First operand 79 states and 84 transitions. Second operand has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:34,608 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:34,608 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2023-11-29 04:12:34,608 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:12:34,609 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 04:12:34,609 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:34,609 INFO L225 Difference]: With dead ends: 78 [2023-11-29 04:12:34,609 INFO L226 Difference]: Without dead ends: 78 [2023-11-29 04:12:34,610 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 64 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 26 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 204 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=134, Invalid=622, Unknown=0, NotChecked=0, Total=756 [2023-11-29 04:12:34,610 INFO L413 NwaCegarLoop]: 47 mSDtfsCounter, 156 mSDsluCounter, 323 mSDsCounter, 0 mSdLazyCounter, 377 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 156 SdHoareTripleChecker+Valid, 370 SdHoareTripleChecker+Invalid, 386 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 377 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:34,610 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [156 Valid, 370 Invalid, 386 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 377 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 04:12:34,611 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-29 04:12:34,612 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 78. [2023-11-29 04:12:34,613 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 78 states, 69 states have (on average 1.2028985507246377) internal successors, (83), 77 states have internal predecessors, (83), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:34,613 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 78 states to 78 states and 83 transitions. [2023-11-29 04:12:34,614 INFO L78 Accepts]: Start accepts. Automaton has 78 states and 83 transitions. Word has length 26 [2023-11-29 04:12:34,614 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:34,614 INFO L495 AbstractCegarLoop]: Abstraction has 78 states and 83 transitions. [2023-11-29 04:12:34,614 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 3.090909090909091) internal successors, (68), 22 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:34,614 INFO L276 IsEmpty]: Start isEmpty. Operand 78 states and 83 transitions. [2023-11-29 04:12:34,615 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 04:12:34,615 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:34,615 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:34,622 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 04:12:34,822 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable22 [2023-11-29 04:12:34,823 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr42ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:34,823 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:34,823 INFO L85 PathProgramCache]: Analyzing trace with hash -1942441977, now seen corresponding path program 1 times [2023-11-29 04:12:34,823 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:34,823 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [34549542] [2023-11-29 04:12:34,823 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:34,823 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:34,845 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:35,376 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:35,376 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:35,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [34549542] [2023-11-29 04:12:35,376 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [34549542] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:12:35,376 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1299042889] [2023-11-29 04:12:35,376 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:35,376 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:35,376 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:35,377 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:12:35,379 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 04:12:35,518 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:35,520 INFO L262 TraceCheckSpWp]: Trace formula consists of 221 conjuncts, 53 conjunts are in the unsatisfiable core [2023-11-29 04:12:35,522 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:35,525 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 [2023-11-29 04:12:35,552 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 04:12:35,552 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 [2023-11-29 04:12:35,618 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-29 04:12:35,618 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 [2023-11-29 04:12:35,651 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 [2023-11-29 04:12:35,691 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:12:35,692 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 32 [2023-11-29 04:12:35,729 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 [2023-11-29 04:12:35,773 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 [2023-11-29 04:12:35,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:35,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 24 [2023-11-29 04:12:35,878 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 [2023-11-29 04:12:35,884 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:35,885 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:12:36,040 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 [2023-11-29 04:12:36,100 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:36,100 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 [2023-11-29 04:12:36,103 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 131 treesize of output 119 [2023-11-29 04:12:36,109 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 [2023-11-29 04:12:36,117 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 [2023-11-29 04:12:36,121 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 [2023-11-29 04:12:36,314 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:36,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1299042889] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:12:36,315 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:12:36,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [14, 11, 11] total 32 [2023-11-29 04:12:36,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1295583607] [2023-11-29 04:12:36,315 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:12:36,315 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 34 states [2023-11-29 04:12:36,315 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:36,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 34 interpolants. [2023-11-29 04:12:36,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=124, Invalid=998, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 04:12:36,317 INFO L87 Difference]: Start difference. First operand 78 states and 83 transitions. Second operand has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:36,856 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:36,857 INFO L93 Difference]: Finished difference Result 78 states and 83 transitions. [2023-11-29 04:12:36,857 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 04:12:36,857 INFO L78 Accepts]: Start accepts. Automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 04:12:36,857 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:36,858 INFO L225 Difference]: With dead ends: 78 [2023-11-29 04:12:36,858 INFO L226 Difference]: Without dead ends: 78 [2023-11-29 04:12:36,858 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 71 GetRequests, 31 SyntacticMatches, 1 SemanticMatches, 39 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 454 ImplicationChecksByTransitivity, 0.8s TimeCoverageRelationStatistics Valid=241, Invalid=1399, Unknown=0, NotChecked=0, Total=1640 [2023-11-29 04:12:36,859 INFO L413 NwaCegarLoop]: 42 mSDtfsCounter, 184 mSDsluCounter, 406 mSDsCounter, 0 mSdLazyCounter, 611 mSolverCounterSat, 41 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 184 SdHoareTripleChecker+Valid, 448 SdHoareTripleChecker+Invalid, 652 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 41 IncrementalHoareTripleChecker+Valid, 611 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:36,859 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [184 Valid, 448 Invalid, 652 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [41 Valid, 611 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:12:36,859 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 78 states. [2023-11-29 04:12:36,861 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 78 to 75. [2023-11-29 04:12:36,861 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 75 states, 69 states have (on average 1.1594202898550725) internal successors, (80), 74 states have internal predecessors, (80), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:36,861 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 75 states to 75 states and 80 transitions. [2023-11-29 04:12:36,861 INFO L78 Accepts]: Start accepts. Automaton has 75 states and 80 transitions. Word has length 26 [2023-11-29 04:12:36,861 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:36,861 INFO L495 AbstractCegarLoop]: Abstraction has 75 states and 80 transitions. [2023-11-29 04:12:36,861 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 34 states, 33 states have (on average 1.8181818181818181) internal successors, (60), 33 states have internal predecessors, (60), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:36,861 INFO L276 IsEmpty]: Start isEmpty. Operand 75 states and 80 transitions. [2023-11-29 04:12:36,862 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 04:12:36,862 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:36,862 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:36,867 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 04:12:37,062 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable23 [2023-11-29 04:12:37,063 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr36ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:37,063 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:37,063 INFO L85 PathProgramCache]: Analyzing trace with hash -1942872953, now seen corresponding path program 1 times [2023-11-29 04:12:37,063 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:37,063 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [11895285] [2023-11-29 04:12:37,063 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:37,063 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:37,082 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:37,442 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:37,443 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:37,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [11895285] [2023-11-29 04:12:37,443 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [11895285] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:12:37,443 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [348511948] [2023-11-29 04:12:37,443 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:37,443 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:37,443 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:37,444 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:12:37,450 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 04:12:37,580 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:37,582 INFO L262 TraceCheckSpWp]: Trace formula consists of 220 conjuncts, 40 conjunts are in the unsatisfiable core [2023-11-29 04:12:37,584 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:37,586 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 [2023-11-29 04:12:37,606 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 04:12:37,606 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 [2023-11-29 04:12:37,641 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-29 04:12:37,641 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 [2023-11-29 04:12:37,653 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 [2023-11-29 04:12:37,680 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:12:37,680 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 [2023-11-29 04:12:37,703 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 [2023-11-29 04:12:37,724 INFO L349 Elim1Store]: treesize reduction 21, result has 38.2 percent of original size [2023-11-29 04:12:37,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 18 [2023-11-29 04:12:37,775 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:37,775 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 [2023-11-29 04:12:37,845 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 04:12:37,846 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 [2023-11-29 04:12:37,880 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:37,880 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:12:37,971 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 04:12:38,048 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:38,048 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 19 treesize of output 20 [2023-11-29 04:12:38,054 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:38,054 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 33 treesize of output 33 [2023-11-29 04:12:38,058 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 [2023-11-29 04:12:38,155 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:38,155 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [348511948] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:12:38,155 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:12:38,155 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11, 11] total 25 [2023-11-29 04:12:38,155 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [815042697] [2023-11-29 04:12:38,155 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:12:38,156 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 26 states [2023-11-29 04:12:38,156 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:38,156 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 26 interpolants. [2023-11-29 04:12:38,157 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=78, Invalid=572, Unknown=0, NotChecked=0, Total=650 [2023-11-29 04:12:38,157 INFO L87 Difference]: Start difference. First operand 75 states and 80 transitions. Second operand has 26 states, 25 states have (on average 2.68) internal successors, (67), 26 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) [2023-11-29 04:12:38,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:38,604 INFO L93 Difference]: Finished difference Result 74 states and 79 transitions. [2023-11-29 04:12:38,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 04:12:38,604 INFO L78 Accepts]: Start accepts. Automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 26 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 26 [2023-11-29 04:12:38,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:38,605 INFO L225 Difference]: With dead ends: 74 [2023-11-29 04:12:38,605 INFO L226 Difference]: Without dead ends: 74 [2023-11-29 04:12:38,606 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 69 GetRequests, 34 SyntacticMatches, 3 SemanticMatches, 32 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 212 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=171, Invalid=951, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 04:12:38,606 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 119 mSDsluCounter, 442 mSDsCounter, 0 mSdLazyCounter, 516 mSolverCounterSat, 18 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 119 SdHoareTripleChecker+Valid, 486 SdHoareTripleChecker+Invalid, 534 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 18 IncrementalHoareTripleChecker+Valid, 516 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:38,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [119 Valid, 486 Invalid, 534 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [18 Valid, 516 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 04:12:38,607 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 74 states. [2023-11-29 04:12:38,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 74 to 74. [2023-11-29 04:12:38,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 74 states, 69 states have (on average 1.144927536231884) internal successors, (79), 73 states have internal predecessors, (79), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:38,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 74 states to 74 states and 79 transitions. [2023-11-29 04:12:38,609 INFO L78 Accepts]: Start accepts. Automaton has 74 states and 79 transitions. Word has length 26 [2023-11-29 04:12:38,609 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:38,609 INFO L495 AbstractCegarLoop]: Abstraction has 74 states and 79 transitions. [2023-11-29 04:12:38,610 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 26 states, 25 states have (on average 2.68) internal successors, (67), 26 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) [2023-11-29 04:12:38,610 INFO L276 IsEmpty]: Start isEmpty. Operand 74 states and 79 transitions. [2023-11-29 04:12:38,610 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 04:12:38,610 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:38,610 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:38,616 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 04:12:38,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable24 [2023-11-29 04:12:38,811 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr30ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:38,811 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:38,811 INFO L85 PathProgramCache]: Analyzing trace with hash 1804920626, now seen corresponding path program 1 times [2023-11-29 04:12:38,811 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:38,811 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [116861439] [2023-11-29 04:12:38,811 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:38,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:38,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:39,398 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:39,399 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:39,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [116861439] [2023-11-29 04:12:39,399 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [116861439] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:12:39,399 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [196455943] [2023-11-29 04:12:39,399 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:39,399 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:39,399 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:39,400 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:12:39,402 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 04:12:39,556 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:39,558 INFO L262 TraceCheckSpWp]: Trace formula consists of 224 conjuncts, 51 conjunts are in the unsatisfiable core [2023-11-29 04:12:39,561 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:39,564 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 [2023-11-29 04:12:39,614 INFO L349 Elim1Store]: treesize reduction 18, result has 35.7 percent of original size [2023-11-29 04:12:39,615 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 [2023-11-29 04:12:39,678 INFO L349 Elim1Store]: treesize reduction 8, result has 52.9 percent of original size [2023-11-29 04:12:39,678 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 [2023-11-29 04:12:39,709 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 [2023-11-29 04:12:39,759 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:12:39,759 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 [2023-11-29 04:12:39,811 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 [2023-11-29 04:12:39,833 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 [2023-11-29 04:12:39,916 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:12:39,932 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:39,933 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 [2023-11-29 04:12:40,251 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 [2023-11-29 04:12:40,268 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 [2023-11-29 04:12:40,274 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:40,274 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:12:40,614 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:40,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 81 treesize of output 85 [2023-11-29 04:12:40,644 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (forall ((v_prenex_5 (Array Int Int)) (v_prenex_6 (Array Int Int))) (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| (select (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_prenex_6) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_5) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|) 0))) (forall ((v_ArrVal_1278 (Array Int Int)) (v_ArrVal_1277 (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_1277) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1278) |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|))) (forall ((v_prenex_8 (Array Int Int)) (v_prenex_7 (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_prenex_8) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_prenex_7) |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|) .cse0 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base|))) (= (select .cse1 0) (select .cse1 4))))))) is different from false [2023-11-29 04:12:40,650 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:40,651 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 [2023-11-29 04:12:40,653 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 [2023-11-29 04:12:40,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:40,661 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 [2023-11-29 04:12:40,667 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 [2023-11-29 04:12:40,673 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 [2023-11-29 04:12:40,702 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:40,702 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 [2023-11-29 04:12:40,705 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:12:40,706 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 [2023-11-29 04:12:40,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:12:40,717 INFO L349 Elim1Store]: treesize reduction 5, result has 37.5 percent of original size [2023-11-29 04:12:40,718 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 [2023-11-29 04:12:40,730 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:40,730 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 [2023-11-29 04:12:40,732 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:12:40,732 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:12:40,734 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 [2023-11-29 04:12:40,739 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:12:40,744 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:40,744 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 [2023-11-29 04:12:40,969 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 04:12:40,970 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [196455943] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:12:40,970 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:12:40,970 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [16, 13, 14] total 37 [2023-11-29 04:12:40,970 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [22690154] [2023-11-29 04:12:40,970 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:12:40,970 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 04:12:40,970 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:40,971 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 04:12:40,971 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=148, Invalid=1255, Unknown=7, NotChecked=72, Total=1482 [2023-11-29 04:12:40,972 INFO L87 Difference]: Start difference. First operand 74 states and 79 transitions. Second operand has 39 states, 38 states have (on average 1.763157894736842) internal successors, (67), 38 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:41,826 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:41,826 INFO L93 Difference]: Finished difference Result 75 states and 80 transitions. [2023-11-29 04:12:41,827 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 04:12:41,827 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.763157894736842) internal successors, (67), 38 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 04:12:41,827 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:41,828 INFO L225 Difference]: With dead ends: 75 [2023-11-29 04:12:41,828 INFO L226 Difference]: Without dead ends: 75 [2023-11-29 04:12:41,829 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 31 SyntacticMatches, 2 SemanticMatches, 46 ConstructedPredicates, 1 IntricatePredicates, 0 DeprecatedPredicates, 687 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=271, Invalid=1888, Unknown=7, NotChecked=90, Total=2256 [2023-11-29 04:12:41,830 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 226 mSDsluCounter, 424 mSDsCounter, 0 mSdLazyCounter, 663 mSolverCounterSat, 48 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 226 SdHoareTripleChecker+Valid, 464 SdHoareTripleChecker+Invalid, 765 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 48 IncrementalHoareTripleChecker+Valid, 663 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 54 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:41,830 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [226 Valid, 464 Invalid, 765 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [48 Valid, 663 Invalid, 0 Unknown, 54 Unchecked, 0.5s Time] [2023-11-29 04:12:41,830 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 75 states. [2023-11-29 04:12:41,831 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 75 to 72. [2023-11-29 04:12:41,832 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 72 states, 69 states have (on average 1.1159420289855073) internal successors, (77), 71 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:41,832 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 72 states to 72 states and 77 transitions. [2023-11-29 04:12:41,832 INFO L78 Accepts]: Start accepts. Automaton has 72 states and 77 transitions. Word has length 28 [2023-11-29 04:12:41,832 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:41,832 INFO L495 AbstractCegarLoop]: Abstraction has 72 states and 77 transitions. [2023-11-29 04:12:41,832 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.763157894736842) internal successors, (67), 38 states have internal predecessors, (67), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:41,832 INFO L276 IsEmpty]: Start isEmpty. Operand 72 states and 77 transitions. [2023-11-29 04:12:41,833 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 04:12:41,833 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:41,833 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:41,838 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 04:12:42,033 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable25 [2023-11-29 04:12:42,034 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:42,034 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:42,034 INFO L85 PathProgramCache]: Analyzing trace with hash -1603547446, now seen corresponding path program 1 times [2023-11-29 04:12:42,034 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:42,034 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [438081034] [2023-11-29 04:12:42,034 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:42,034 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:42,059 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:42,616 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:42,616 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:42,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [438081034] [2023-11-29 04:12:42,617 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [438081034] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:12:42,617 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [95820954] [2023-11-29 04:12:42,617 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:42,617 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:42,617 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:42,618 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:12:42,620 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 04:12:42,751 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:42,753 INFO L262 TraceCheckSpWp]: Trace formula consists of 229 conjuncts, 45 conjunts are in the unsatisfiable core [2023-11-29 04:12:42,756 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:42,759 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 [2023-11-29 04:12:42,783 INFO L349 Elim1Store]: treesize reduction 15, result has 25.0 percent of original size [2023-11-29 04:12:42,783 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 [2023-11-29 04:12:42,833 INFO L349 Elim1Store]: treesize reduction 16, result has 36.0 percent of original size [2023-11-29 04:12:42,833 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 [2023-11-29 04:12:42,858 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 [2023-11-29 04:12:42,894 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:12:42,894 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 [2023-11-29 04:12:42,927 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 [2023-11-29 04:12:42,941 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 [2023-11-29 04:12:43,000 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:12:43,014 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:43,014 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 [2023-11-29 04:12:43,188 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 04:12:43,188 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 [2023-11-29 04:12:43,301 INFO L349 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-29 04:12:43,301 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 [2023-11-29 04:12:43,330 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:43,330 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:12:43,454 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 [2023-11-29 04:12:43,653 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:43,654 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 [2023-11-29 04:12:43,656 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 [2023-11-29 04:12:43,660 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 88 [2023-11-29 04:12:43,665 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 79 treesize of output 77 [2023-11-29 04:12:43,672 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:43,673 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 [2023-11-29 04:12:43,705 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:43,705 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 [2023-11-29 04:12:43,708 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:12:43,710 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 [2023-11-29 04:12:43,713 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:12:43,714 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 [2023-11-29 04:12:43,716 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:12:43,721 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:43,722 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 27 treesize of output 31 [2023-11-29 04:12:43,822 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 1 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:43,822 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [95820954] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:12:43,823 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:12:43,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 34 [2023-11-29 04:12:43,823 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1452270496] [2023-11-29 04:12:43,823 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:12:43,823 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 36 states [2023-11-29 04:12:43,823 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:12:43,824 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 36 interpolants. [2023-11-29 04:12:43,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=147, Invalid=1102, Unknown=11, NotChecked=0, Total=1260 [2023-11-29 04:12:43,825 INFO L87 Difference]: Start difference. First operand 72 states and 77 transitions. Second operand has 36 states, 35 states have (on average 2.342857142857143) internal successors, (82), 35 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:44,480 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 04:12:44,480 INFO L93 Difference]: Finished difference Result 70 states and 75 transitions. [2023-11-29 04:12:44,480 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 13 states. [2023-11-29 04:12:44,480 INFO L78 Accepts]: Start accepts. Automaton has has 36 states, 35 states have (on average 2.342857142857143) internal successors, (82), 35 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-29 04:12:44,480 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 04:12:44,481 INFO L225 Difference]: With dead ends: 70 [2023-11-29 04:12:44,481 INFO L226 Difference]: Without dead ends: 70 [2023-11-29 04:12:44,482 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 36 SyntacticMatches, 0 SemanticMatches, 43 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 549 ImplicationChecksByTransitivity, 0.9s TimeCoverageRelationStatistics Valid=281, Invalid=1688, Unknown=11, NotChecked=0, Total=1980 [2023-11-29 04:12:44,483 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 219 mSDsluCounter, 501 mSDsCounter, 0 mSdLazyCounter, 706 mSolverCounterSat, 36 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 219 SdHoareTripleChecker+Valid, 536 SdHoareTripleChecker+Invalid, 742 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 36 IncrementalHoareTripleChecker+Valid, 706 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 04:12:44,483 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [219 Valid, 536 Invalid, 742 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [36 Valid, 706 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 04:12:44,483 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 70 states. [2023-11-29 04:12:44,484 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 70 to 70. [2023-11-29 04:12:44,485 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 70 states, 69 states have (on average 1.0869565217391304) internal successors, (75), 69 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:44,485 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 70 states to 70 states and 75 transitions. [2023-11-29 04:12:44,485 INFO L78 Accepts]: Start accepts. Automaton has 70 states and 75 transitions. Word has length 29 [2023-11-29 04:12:44,485 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 04:12:44,485 INFO L495 AbstractCegarLoop]: Abstraction has 70 states and 75 transitions. [2023-11-29 04:12:44,486 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 36 states, 35 states have (on average 2.342857142857143) internal successors, (82), 35 states have internal predecessors, (82), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:12:44,486 INFO L276 IsEmpty]: Start isEmpty. Operand 70 states and 75 transitions. [2023-11-29 04:12:44,486 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 04:12:44,486 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 04:12:44,486 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:12:44,492 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Ended with exit code 0 [2023-11-29 04:12:44,687 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 04:12:44,687 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr61ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 59 more)] === [2023-11-29 04:12:44,687 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:12:44,687 INFO L85 PathProgramCache]: Analyzing trace with hash -638059179, now seen corresponding path program 1 times [2023-11-29 04:12:44,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 04:12:44,688 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1536298576] [2023-11-29 04:12:44,688 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:44,688 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 04:12:44,713 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:45,590 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:45,590 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 04:12:45,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1536298576] [2023-11-29 04:12:45,590 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1536298576] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 04:12:45,590 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [940118189] [2023-11-29 04:12:45,590 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:12:45,590 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 04:12:45,591 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:12:45,593 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 04:12:45,594 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_6d6bd5b1-612e-4739-934a-c58b7edd17f6/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (15)] Waiting until timeout for monitored process [2023-11-29 04:12:45,732 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:12:45,734 INFO L262 TraceCheckSpWp]: Trace formula consists of 233 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-29 04:12:45,736 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:12:45,914 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 [2023-11-29 04:12:45,986 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 04:12:45,986 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2023-11-29 04:12:46,088 INFO L349 Elim1Store]: treesize reduction 17, result has 22.7 percent of original size [2023-11-29 04:12:46,088 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 [2023-11-29 04:12:46,109 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 [2023-11-29 04:12:46,292 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:12:46,311 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:46,311 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 [2023-11-29 04:12:47,115 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 1))) (and (exists ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| Int)) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0)) (= (select (store .cse0 |c_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 0))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 0) (= (select .cse0 |c_ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 0)))) is different from true [2023-11-29 04:12:47,147 WARN L876 $PredicateComparison]: unable to prove that (exists ((|ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| Int) (|ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| Int)) (let ((.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 1))) (and (= (select .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base|) 0) (= (select |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base|) 0) (= (select (store .cse0 |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 1) |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start__destroy_in_nondeterministic_order_~head#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~pred~0#1.base| 0) |ULTIMATE.start__destroy_in_nondeterministic_order_~succ~0#1.base| 0))))) is different from true [2023-11-29 04:12:47,158 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:12:47,158 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:12:47,503 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1461 (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_1461) |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 [2023-11-29 04:12:47,512 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1461 (Array Int Int)) (v_ArrVal_1460 (Array Int Int))) (= |c_ULTIMATE.start_main_old_#valid#1| (let ((.cse0 (store (select (store (store |c_#memory_$Pointer$#0.base| |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| v_ArrVal_1460) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| v_ArrVal_1461) |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)))) is different from false [2023-11-29 04:12:47,520 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:47,520 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 [2023-11-29 04:12:47,523 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 [2023-11-29 04:12:47,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:12:47,552 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 155 treesize of output 161 [2023-11-29 04:12:47,565 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 190 treesize of output 182 [2023-11-29 04:12:47,587 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 [2023-11-29 04:12:59,200 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (store |c_#valid| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base| 0))) (let ((.cse48 (= |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse18 (= (+ |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4) 0)) (.cse1 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 0)) (.cse4 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (let ((.cse526 (forall ((v_arrayElimCell_184 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))) (.cse208 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse592 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse592 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse592 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse592 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (.cse72 (and (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse588 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse589 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse588 (select (store .cse589 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (= .cse588 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))) (= .cse588 (select (store .cse589 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse590 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse591 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse590 (select (store .cse591 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse590 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse590 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))) (= .cse590 (select (store .cse591 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))) (.cse224 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))) (.cse222 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse587 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse587 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse587 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (.cse9 (= |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.base|)) (.cse171 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse586 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse586 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse586 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse586 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))) (.cse116 (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse585 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse585 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse585 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse585 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse585 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))))) (.cse26 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse583 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse584 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse583 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse583 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse583 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse583 (select (store .cse584 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse583 (select (store .cse584 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (.cse27 (not .cse1)) (.cse169 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse582 (store .cse3 v_arrayElimCell_184 0)) (.cse581 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse581 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse581 (select (store .cse582 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse581 (select (store .cse582 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse581 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))) (.cse21 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse579 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse580 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse579 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse579 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse579 (select (store .cse580 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse579 (select (store .cse580 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (.cse22 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse577 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse578 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse577 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse577 (select (store .cse578 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse577 (select (store .cse578 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (.cse20 (not .cse18)) (.cse23 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse576 (store .cse3 v_arrayElimCell_184 0)) (.cse574 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse575 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse574 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse574 (select (store .cse575 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse574 (select (store .cse576 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse574 (select (store .cse576 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse574 (select (store .cse575 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))) (.cse414 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse572 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse573 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse572 (select (store .cse573 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse572 (select (store .cse573 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (.cse19 (not .cse48))) (let ((.cse256 (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse571 (store .cse3 v_arrayElimCell_184 0)) (.cse569 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse570 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse569 (select (store .cse570 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse569 (select (store .cse571 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse569 (select (store .cse571 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse569 (select (store .cse570 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse19)) (.cse271 (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse567 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse568 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse567 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse567 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse567 (select (store .cse568 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse567 (select (store .cse568 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) .cse19)) (.cse214 (or .cse414 .cse19)) (.cse5 (store .cse3 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0)) (.cse58 (or .cse23 .cse19)) (.cse77 (or .cse20 (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse566 (store .cse3 v_arrayElimCell_184 0)) (.cse564 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse565 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse564 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse564 (select (store .cse565 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse564 (select (store .cse566 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse564 (select (store .cse566 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse564 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse564 (select (store .cse565 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))) (.cse109 (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse563 (store .cse3 v_arrayElimCell_184 0)) (.cse562 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse562 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse562 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse562 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse562 (select (store .cse563 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse562 (select (store .cse563 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse562 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse20)) (.cse230 (or .cse20 (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse561 (store .cse3 v_arrayElimCell_184 0)) (.cse560 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse560 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse560 (select (store .cse561 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse560 (select (store .cse561 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse560 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (.cse225 (or .cse22 .cse19)) (.cse295 (or .cse19 .cse21)) (.cse100 (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse558 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse559 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse558 (select (store .cse559 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse558 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse558 (select (store .cse559 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse20)) (.cse231 (or (forall ((v_arrayElimCell_182 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse20)) (.cse121 (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse557 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse557 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse557 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse557 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse20)) (.cse234 (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse556 (store .cse3 v_arrayElimCell_184 0)) (.cse555 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse555 (select (store .cse556 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse555 (select (store .cse556 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse555 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse282 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse553 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse554 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse553 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse553 (select (store .cse554 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse553 (select (store .cse554 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (.cse319 (and (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse550 (store .cse3 v_arrayElimCell_184 0)) (.cse549 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse549 (select (store .cse550 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse549 (select (store .cse550 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse549 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse549 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse551 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse552 (store .cse3 v_arrayElimCell_184 0))) (or (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (= .cse551 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse551 (select (store .cse552 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse551 (select (store .cse552 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))))) (.cse28 (and (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse546 (store .cse3 v_arrayElimCell_184 0)) (.cse545 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse545 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse545 (select (store .cse546 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse545 (select (store .cse546 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse545 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse545 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))) (or .cse27 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse547 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse548 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse547 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse547 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse547 (select (store .cse548 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse547 (select (store .cse548 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (or .cse169 .cse1))) (.cse260 (or .cse26 .cse19)) (.cse315 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse544 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse544 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse544 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse0 (or (and (or .cse1 .cse208) (or (and (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse536 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (= .cse536 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))) (= .cse536 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse537 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse537 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse537 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))) (= .cse537 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))) .cse1) (or (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse538 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse538 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse538 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_183 Int)) (= .cse538 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) .cse27) (or .cse1 .cse72) (or .cse27 (and (forall ((v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse539 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse539 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse539 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse539 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse540 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse540 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_183 Int)) (= .cse540 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))))) (or (and (or .cse224 .cse1) .cse222 (or .cse27 (forall ((v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) .cse9) (or .cse171 .cse1) (or (forall ((v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse541 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse541 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse541 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse541 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse27) (or .cse27 (forall ((v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse542 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse542 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse542 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse542 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse116 (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse543 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse543 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse543 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse543 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))) (= .cse543 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))) .cse19)) (.cse124 (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse535 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse535 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse535 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse535 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse19)) (.cse279 (or .cse19 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse534 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse534 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse534 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (.cse88 (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse532 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse533 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse532 (select (store .cse533 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse532 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse532 (select (store .cse533 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse19)) (.cse228 (or .cse19 .cse526)) (.cse243 (forall ((v_arrayElimCell_184 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse531 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_182 Int)) (= .cse531 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse531 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (.cse103 (= |c_ULTIMATE.start_dll_circular_create_~new_head~0#1.offset| 4))) (and (or (and .cse0 (or .cse1 (and (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse2 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_186 Int)) (= .cse2 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse2 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse2 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_185 Int)) (= .cse2 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse2 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse6 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (= .cse6 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse6 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse6 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse7 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (= .cse7 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse7 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse7 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse7 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse8 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse8 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse8 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse8 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse8 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse8 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))) (or .cse9 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse10 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse10 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse10 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse10 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse11 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_186 Int)) (= .cse11 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse11 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_185 Int)) (= .cse11 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse11 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse12 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse12 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse12 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (let ((.cse13 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse12 (select (store .cse13 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse12 (select (store .cse13 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))))) (or .cse9 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse14 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse14 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse14 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (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)) (= .cse15 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse15 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse15 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse16 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse16 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse16 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse16 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (let ((.cse17 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse16 (select (store .cse17 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse16 (select (store .cse17 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))))))) .cse18) (or .cse19 (and (or .cse20 .cse21) (or .cse22 .cse9) (or .cse23 .cse1) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse24 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse25 (store .cse3 v_arrayElimCell_184 0))) (or (forall ((v_arrayElimCell_186 Int)) (= .cse24 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse24 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_185 Int)) (= .cse24 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse24 (select (store .cse25 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse24 (select (store .cse25 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (or .cse26 .cse27) (or .cse28 .cse18))) (or (and (forall ((v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse29 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_185 Int)) (= .cse29 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse29 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse20) (or (and (forall ((v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse30 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse30 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse30 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) .cse27) (or .cse1 (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse18) (or .cse27 (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse31 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse31 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse31 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse32 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse33 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse32 (select (store .cse33 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse32 (select (store .cse33 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse1)) (not .cse9)) (or .cse1 (and (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse35 (store .cse3 v_arrayElimCell_184 0)) (.cse34 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse34 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse34 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse34 (select (store .cse35 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse34 (select (store .cse35 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse34 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse34 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse37 (store .cse3 v_arrayElimCell_184 0)) (.cse36 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse36 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse36 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse36 (select (store .cse37 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse36 (select (store .cse37 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (let ((.cse38 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse36 (select (store .cse38 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse36 (select (store .cse38 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse39 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse40 (store .cse3 v_arrayElimCell_184 0))) (or (forall ((v_arrayElimCell_186 Int)) (= .cse39 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse39 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse39 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_185 Int)) (= .cse39 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse39 (select (store .cse40 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse39 (select (store .cse40 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (or .cse9 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse41 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse42 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse41 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse41 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse41 (select (store .cse42 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse41 (select (store .cse42 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse43 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse44 (store .cse3 v_arrayElimCell_184 0))) (or (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (= .cse43 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse43 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse43 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse43 (select (store .cse44 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse43 (select (store .cse44 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) .cse18) (or (let ((.cse46 (store .cse5 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0))) (and (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse45 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse47 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse45 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse45 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse45 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse45 (select (store .cse47 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse45 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse45 (select (store .cse47 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (or .cse48 (and (forall ((v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse49 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse50 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse49 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse49 (select (store .cse50 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse49 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse49 (select (store .cse50 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_181 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse51 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse52 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse51 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse51 (select (store .cse52 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse51 (select (store .cse52 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse18) (or (forall ((v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse53 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse54 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse53 (select .cse46 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 .cse54 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse20))) (or .cse20 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse57 (store .cse3 v_arrayElimCell_184 0)) (.cse55 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse56 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse55 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse55 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse55 (select (store .cse56 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse55 (select (store .cse57 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse55 (select (store .cse57 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse55 (select (store .cse56 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))) .cse58 (or (forall ((v_arrayElimCell_181 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse61 (store .cse3 v_arrayElimCell_184 0)) (.cse59 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse60 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse59 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse59 (select (store .cse4 v_arrayElimCell_183 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)) (= .cse59 (select (store .cse61 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse59 (select (store .cse60 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse18) (or (and (or (and (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse63 (store .cse3 v_arrayElimCell_182 0)) (.cse62 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse64 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse62 (select (store .cse63 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse62 (select (store .cse64 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (= .cse62 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 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 .cse64 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse65 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse66 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse65 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse65 (select (store .cse66 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse65 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse65 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))) (= .cse65 (select (store .cse66 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse67 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse68 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse67 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse67 (select (store .cse68 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (= .cse67 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))) (= .cse67 (select (store .cse68 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse70 (store .cse3 v_arrayElimCell_182 0)) (.cse69 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse71 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse69 (select (store .cse70 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse69 (select (store .cse71 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse69 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse69 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))) (= .cse69 (select (store .cse70 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse69 (select (store .cse71 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (or .cse19 .cse72)) .cse18) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse75 (store .cse3 v_arrayElimCell_184 0)) (.cse73 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse74 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse73 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse73 (select (store .cse74 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse73 (select (store .cse75 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse76 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse73 (select (store .cse76 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse73 (select (store .cse76 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse73 (select (store .cse75 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse73 (select (store .cse74 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse77 (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse80 (store .cse3 v_arrayElimCell_184 0)) (.cse78 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse79 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse78 (select (store .cse79 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse78 (select (store .cse80 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse78 (select (store .cse80 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse78 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse78 (select (store .cse79 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse20) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse83 (store .cse3 v_arrayElimCell_184 0)) (.cse81 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse82 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse81 (select (store .cse82 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse81 (select (store .cse83 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse84 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse81 (select (store .cse84 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse81 (select (store .cse84 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse81 (select (store .cse83 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse81 (select (store .cse82 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse87 (store .cse3 v_arrayElimCell_184 0)) (.cse85 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse86 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse85 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse85 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse85 (select (store .cse86 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse85 (select (store .cse87 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse85 (select (store .cse87 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse85 (select (store .cse86 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse18) (or (and .cse88 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse89 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse90 (store .cse3 v_arrayElimCell_186 0))) (or (forall ((v_arrayElimCell_182 Int)) (= .cse89 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse89 (select (store .cse90 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse89 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse89 (select (store .cse90 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse91 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse92 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse91 (select (store .cse92 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse91 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse93 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse91 (select (store .cse93 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse91 (select (store .cse93 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse91 (select (store .cse92 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))) .cse20) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse96 (store .cse3 v_arrayElimCell_184 0)) (.cse94 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse95 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse94 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse94 (select (store .cse95 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse94 (select (store .cse96 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse94 (select (store .cse96 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse94 (select (store .cse95 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse18) (or .cse48 (and (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse97 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse98 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse97 (select (store .cse98 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse99 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse97 (select (store .cse99 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse97 (select (store .cse99 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse97 (select (store .cse98 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse100 (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse101 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse102 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse101 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse101 (select (store .cse102 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse101 (select (store .cse102 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse18)))) .cse103) (or (and (forall ((v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse104 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse104 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse104 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse104 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse104 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)))))) (or (forall ((v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse105 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse105 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse105 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse105 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse20) (or (forall ((v_arrayElimCell_181 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse106 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse106 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse106 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse106 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse18)) .cse48) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse107 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse108 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse107 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse107 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse107 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse107 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse107 (select (store .cse108 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse107 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse107 (select (store .cse108 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (or (and .cse109 (or (and (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse110 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse111 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse110 (select (store .cse111 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse110 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse110 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (= .cse110 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))) (= .cse110 (select (store .cse111 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse112 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse113 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse112 (select (store .cse113 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse112 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse112 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse112 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse112 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))) (= .cse112 (select (store .cse113 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse114 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse114 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse114 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse114 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (= .cse114 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (or .cse19 (and (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse115 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse115 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse115 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (= .cse115 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) .cse116)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse117 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse117 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse117 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse117 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse117 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse117 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))))) .cse18) (or (and (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse118 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse118 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse118 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse118 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse18) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse119 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse119 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse119 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse120 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse119 (select (store .cse120 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse119 (select (store .cse120 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) .cse121) .cse48) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse123 (store .cse3 v_arrayElimCell_184 0)) (.cse122 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse122 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse122 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 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 .cse123 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse122 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse20) (or .cse20 (and .cse124 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse125 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_182 Int)) (= .cse125 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse125 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse125 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse125 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse126 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse126 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse126 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse126 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse127 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse126 (select (store .cse127 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse126 (select (store .cse127 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))))) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse128 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse129 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse128 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse128 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse128 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse128 (select (store .cse129 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse128 (select (store .cse129 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) .cse18) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse130 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse131 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse130 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse130 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse130 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse130 (select (store .cse131 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse132 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse130 (select (store .cse132 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse130 (select (store .cse132 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse130 (select (store .cse131 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse133 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse134 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse133 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse133 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse133 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse133 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse133 (select (store .cse134 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse133 (select (store .cse134 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) .cse18) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse135 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse136 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse135 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse135 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse135 (select (store .cse136 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse137 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse135 (select (store .cse137 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse135 (select (store .cse137 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse135 (select (store .cse136 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) .cse103) (or (and (or (forall ((v_arrayElimCell_181 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse138 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse138 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse138 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse48) (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse140 (store .cse3 v_arrayElimCell_184 0)) (.cse139 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse139 (select (store .cse140 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse139 (select (store .cse140 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse139 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse19) (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse142 (store .cse3 v_arrayElimCell_184 0)) (.cse141 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse141 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse141 (select (store .cse142 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse141 (select (store .cse142 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse141 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse19) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse144 (store .cse3 v_arrayElimCell_184 0)) (.cse143 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse143 (select (store .cse144 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse143 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse143 (select (store .cse144 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse143 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_181 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse145 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse145 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse145 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse145 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse48) (or (and (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse147 (store .cse3 v_arrayElimCell_184 0)) (.cse146 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse146 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (= .cse146 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse146 (select (store .cse147 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse146 (select (store .cse147 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse146 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse148 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse149 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse148 (select (store .cse149 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse148 (select (store .cse149 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse148 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse148 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse150 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse150 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (= .cse150 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse150 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse150 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse152 (store .cse3 v_arrayElimCell_184 0)) (.cse151 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse151 (select (store .cse152 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse153 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse151 (select (store .cse153 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse151 (select (store .cse153 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse151 (select (store .cse152 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse151 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse155 (store .cse3 v_arrayElimCell_184 0)) (.cse154 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (= .cse154 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 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 .cse155 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse154 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse156 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (= .cse156 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse156 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse156 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse157 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse157 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse158 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse157 (select (store .cse158 v_arrayElimCell_181 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 (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse157 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse160 (store .cse3 v_arrayElimCell_184 0)) (.cse159 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse159 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse159 (select (store .cse160 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse161 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse159 (select (store .cse161 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse159 (select (store .cse161 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse159 (select (store .cse160 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse159 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (or .cse48 (and (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse162 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (= .cse162 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse162 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse163 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse164 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse163 (select (store .cse164 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse163 (select (store .cse164 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse163 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))))) .cse103) (or .cse19 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse165 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse165 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse165 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse167 (store .cse3 v_arrayElimCell_184 0)) (.cse166 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse166 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse166 (select (store .cse167 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse166 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse166 (select (store .cse167 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse166 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse168 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_181 Int)) (= .cse168 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse168 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse168 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (or .cse169 .cse19) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse170 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse170 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse170 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse170 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse170 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (or .cse171 .cse19) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse173 (store .cse3 v_arrayElimCell_184 0)) (.cse172 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse172 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse172 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse172 (select (store .cse173 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse172 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse172 (select (store .cse173 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse172 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse174 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse174 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse174 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse174 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse174 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse174 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse176 (store .cse3 v_arrayElimCell_184 0)) (.cse175 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse175 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse175 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse175 (select (store .cse176 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse175 (select (store .cse176 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse175 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse19) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse178 (store .cse3 v_arrayElimCell_184 0)) (.cse177 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse177 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse177 (select (store .cse178 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse177 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse177 (select (store .cse178 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse177 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse179 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse179 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse179 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse179 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse179 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse19) (or (and (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse181 (store .cse3 v_arrayElimCell_184 0)) (.cse180 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse180 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse180 (select (store .cse181 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse182 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse180 (select (store .cse182 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse180 (select (store .cse182 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse180 (select (store .cse181 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse180 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse183 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (= .cse183 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse183 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse183 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse183 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse185 (store .cse3 v_arrayElimCell_184 0)) (.cse184 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse184 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse184 (select (store .cse4 v_arrayElimCell_185 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_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse186 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse184 (select (store .cse186 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse184 (select (store .cse186 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse184 (select (store .cse185 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse184 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse187 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse187 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse187 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse188 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse187 (select (store .cse188 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse187 (select (store .cse188 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse187 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse187 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse190 (store .cse3 v_arrayElimCell_184 0)) (.cse189 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (= .cse189 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse189 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse189 (select (store .cse190 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse189 (select (store .cse190 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse189 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse192 (store .cse3 v_arrayElimCell_184 0)) (.cse191 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse191 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (= .cse191 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse191 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse191 (select (store .cse192 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse191 (select (store .cse192 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse191 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse193 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse193 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (= .cse193 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse193 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse193 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse193 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (or .cse48 (and (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse194 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (= .cse194 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse194 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse194 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse195 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse195 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse196 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse195 (select (store .cse196 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse195 (select (store .cse196 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse195 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse197 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse197 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse198 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse197 (select (store .cse198 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse197 (select (store .cse198 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse197 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse197 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))) .cse103) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse199 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse199 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse199 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse199 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse199 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse200 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse200 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse200 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse200 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse19)) .cse18) (or (forall ((v_arrayElimCell_181 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse201 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse202 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse201 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse201 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse201 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse201 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse201 (select (store .cse202 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse201 (select (store .cse202 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) .cse18) (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse203 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse204 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse203 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse203 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse203 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse203 (select (store .cse204 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse203 (select (store .cse204 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) .cse20) (or (and (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse205 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse205 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse205 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse205 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse205 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse205 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse206 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse206 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse206 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse206 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse206 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse207 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse207 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse207 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse207 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse207 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) .cse19) (or .cse208 .cse19)) .cse18) (or .cse9 (and (or (and (or (forall ((v_arrayElimCell_181 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) .cse18) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse209 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse209 (select .cse46 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse209 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)))))) (or .cse20 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse46 v_antiDerIndex_entry0_1))))) .cse48) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse210 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse211 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse210 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse210 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse210 (select (store .cse211 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse210 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse210 (select (store .cse211 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_181 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse212 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse213 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse212 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse212 (select (store .cse213 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse212 (select (store .cse213 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) .cse18) .cse214 (or .cse20 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse215 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse216 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse215 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse215 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse215 (select (store .cse216 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse215 (select (store .cse216 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (or .cse20 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse217 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse218 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse217 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse217 (select (store .cse218 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse217 (select (store .cse218 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse219 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse220 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse219 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse219 (select (store .cse220 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse219 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse219 (select (store .cse220 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse221 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_181 Int)) (= .cse221 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse221 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (or .cse222 .cse19) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse223 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse223 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse223 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse223 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (or .cse224 .cse19)) .cse18) .cse225 (or (forall ((v_arrayElimCell_181 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse226 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse227 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse226 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse226 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse226 (select (store .cse227 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse226 (select (store .cse227 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) .cse18) (or (and .cse228 (forall ((v_arrayElimCell_184 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse229 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse229 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse229 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse20) (or (and .cse230 (or (and (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) .cse18) .cse231 (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse232 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse233 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse232 (select (store .cse233 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse232 (select (store .cse233 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse48) (or .cse234 .cse20) (or (and (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse235 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse235 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse235 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse235 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse236 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse237 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse236 (select (store .cse237 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (= .cse236 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))) (= .cse236 (select (store .cse237 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse238 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse239 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse238 (select (store .cse239 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse238 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse238 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))) (= .cse238 (select (store .cse239 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse240 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse240 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (= .cse240 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (or (and .cse224 .cse222) .cse19)) .cse18) (or (and .cse228 (forall ((v_arrayElimCell_184 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse241 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse241 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse242 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse241 (select (store .cse242 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse241 (select (store .cse242 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) .cse243) .cse20) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse244 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse245 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse244 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse244 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse244 (select (store .cse245 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse244 (select (store .cse245 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) .cse18) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse246 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse247 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse246 (select (store (store .cse3 v_arrayElimCell_182 0) v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse246 (select (store .cse247 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse246 (select (store .cse247 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) .cse18) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse248 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse249 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse248 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse248 (select (store .cse249 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse250 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse248 (select (store .cse250 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse248 (select (store .cse250 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse248 (select (store .cse249 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse251 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse252 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse251 (select (store .cse252 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int)) (let ((.cse253 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse251 (select (store .cse253 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse251 (select (store .cse253 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse251 (select (store .cse252 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) .cse103))) (or (forall ((v_arrayElimCell_181 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse254 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse255 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse254 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse254 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse254 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse254 (select (store .cse255 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse254 (select (store .cse255 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) .cse18) .cse256 (or (forall ((v_arrayElimCell_181 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse259 (store .cse3 v_arrayElimCell_184 0)) (.cse257 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse258 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse257 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse257 (select (store .cse258 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse257 (select (store .cse259 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse257 (select (store .cse259 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse257 (select (store .cse258 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse18) .cse260 (or (and (or .cse19 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse261 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse262 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse261 (select (store .cse262 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse261 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse261 (select (store .cse262 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse263 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse264 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse263 (select (store .cse264 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse263 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse263 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse263 (select (store .cse264 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse265 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse266 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse265 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse265 (select (store .cse266 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse265 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse265 (select (store .cse266 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse19) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse267 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse268 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse267 (select (store .cse4 v_arrayElimCell_183 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_arrayElimCell_181 Int)) (= .cse267 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse267 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse267 (select (store .cse268 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))) .cse18) (or .cse20 (and .cse88 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse269 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse270 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse269 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse269 (select (store .cse270 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse269 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse269 (select (store .cse270 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))) .cse271 (or .cse20 (and .cse124 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse272 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse272 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse272 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse272 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse272 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or .cse20 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse275 (store .cse3 v_arrayElimCell_184 0)) (.cse273 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse274 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse273 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse273 (select (store .cse274 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse273 (select (store .cse275 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse273 (select (store .cse275 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse273 (select (store .cse274 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse276 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse276 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse276 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse276 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse277 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse278 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse277 (select (store .cse278 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int)) (= .cse277 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse277 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse277 (select (store .cse278 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse279 (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse280 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_184 Int)) (let ((.cse281 (store .cse3 v_arrayElimCell_184 0))) (or (forall ((v_arrayElimCell_183 Int)) (or (= .cse280 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse280 (select (store .cse281 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))) (= .cse280 (select (store .cse281 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse280 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse280 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse282 .cse19) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse283 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse284 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse283 (select (store .cse284 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (let ((.cse285 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse283 (select (store .cse285 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse283 (select (store .cse285 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (= .cse283 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse283 (select (store .cse284 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse286 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse286 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse286 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse48) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse287 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_184 Int)) (= .cse287 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse287 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse287 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse288 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_184 Int)) (let ((.cse289 (store .cse3 v_arrayElimCell_184 0))) (or (forall ((v_arrayElimCell_183 Int)) (or (= .cse288 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse288 (select (store .cse289 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))) (= .cse288 (select (store .cse289 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse288 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse290 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (let ((.cse291 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse290 (select (store .cse291 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse290 (select (store .cse291 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (= .cse290 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse292 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_184 Int)) (= .cse292 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse292 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse19) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse293 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (let ((.cse294 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse293 (select (store .cse294 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse293 (select (store .cse294 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (= .cse293 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse293 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse295 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse296 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse297 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse296 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse296 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse296 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~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 .cse297 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse298 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse299 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse298 (select (store .cse299 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int)) (let ((.cse300 (store .cse3 v_arrayElimCell_184 0))) (or (forall ((v_arrayElimCell_183 Int)) (or (= .cse298 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse298 (select (store .cse300 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))) (= .cse298 (select (store .cse300 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse298 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse298 (select (store .cse299 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse301 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse302 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse301 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse301 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse301 (select (store .cse302 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse301 (select (store .cse302 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse303 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse303 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse303 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse48) (or .cse48 (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_181 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse304 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse305 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse304 (select (store .cse305 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1)) (= .cse304 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse304 (select (store .cse305 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) .cse20) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse308 (store .cse3 v_arrayElimCell_184 0)) (.cse306 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse307 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse306 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse306 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse306 (select (store .cse307 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse306 (select (store .cse308 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse306 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse306 (select (store .cse308 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse306 (select (store .cse307 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse311 (store .cse3 v_arrayElimCell_184 0)) (.cse309 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse310 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse309 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse309 (select (store .cse310 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse309 (select (store .cse311 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_181 Int)) (= .cse309 (select (store .cse5 v_arrayElimCell_181 0) v_antiDerIndex_entry0_1))) (= .cse309 (select (store .cse311 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse309 (select (store .cse310 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (or .cse20 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse312 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse313 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse312 (select .cse46 v_antiDerIndex_entry0_1)) (= .cse312 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse312 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse312 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse312 (select (store .cse313 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse312 (select (store .cse313 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))))) .cse1) (or .cse27 .cse19 (and (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse314 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse314 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse314 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse314 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse314 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))) (or .cse9 .cse315) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse316 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse316 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_185 Int)) (= .cse316 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse316 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or .cse1 (and (or .cse282 .cse20 .cse19) (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse317 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse318 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse317 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse317 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse317 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse317 (select (store .cse318 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse317 (select (store .cse318 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) .cse18) (or (and (or .cse319 .cse19) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse320 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse321 (store .cse3 v_arrayElimCell_184 0))) (or (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (= .cse320 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse320 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse320 (select (store .cse321 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse320 (select (store .cse321 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse323 (store .cse3 v_arrayElimCell_184 0)) (.cse322 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse322 (select .cse5 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 .cse323 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse322 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse322 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))))) .cse18) .cse256 .cse271 (or .cse9 (and .cse214 (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse324 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse325 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse324 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse324 (select (store .cse325 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse324 (select (store .cse325 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) .cse18))) (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse328 (store .cse3 v_arrayElimCell_184 0)) (.cse326 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse327 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse326 (select .cse5 v_antiDerIndex_entry0_1)) (= .cse326 (select (store .cse327 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse326 (select (store .cse328 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse326 (select (store .cse328 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse326 (select (store .cse327 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse18))) (or .cse1 .cse48 (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse329 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_186 Int)) (= .cse329 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse329 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_185 Int)) (= .cse329 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))) (or .cse9 (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse5 v_antiDerIndex_entry0_1)))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse330 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (= .cse330 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse330 (select .cse5 v_antiDerIndex_entry0_1))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse331 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse331 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse331 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse331 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse332 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse332 (select .cse5 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (let ((.cse333 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse332 (select (store .cse333 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse332 (select (store .cse333 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))))) .cse18) (or (let ((.cse344 (store .cse4 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0))) (and (or .cse1 (and (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse336 (store .cse3 v_arrayElimCell_184 0)) (.cse334 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse335 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse334 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse334 (select (store .cse335 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse334 (select (store .cse336 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse334 (select (store .cse336 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int)) (let ((.cse337 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse334 (select (store .cse337 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse334 (select (store .cse337 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse334 (select (store .cse335 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse58 .cse77 (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse340 (store .cse3 v_arrayElimCell_184 0)) (.cse338 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse339 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse338 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse338 (select (store .cse339 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse338 (select (store .cse340 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse338 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse338 (select (store .cse340 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse338 (select (store .cse339 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse18))) .cse109 (or (and .cse230 (or (and (or .cse1 (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse341 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse342 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse341 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse341 (select (store .cse342 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse341 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse341 (select (store .cse342 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse343 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse345 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse343 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int)) (= .cse343 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse343 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse343 (select (store .cse345 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse343 (select (store .cse345 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (or .cse27 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse346 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse347 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse346 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse346 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse346 (select (store .cse347 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse346 (select (store .cse347 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))))) .cse18) .cse225 (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse349 (store .cse3 v_arrayElimCell_184 0)) (.cse348 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse350 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse348 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse348 (select (store .cse349 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse348 (select (store .cse350 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse348 (select (store .cse349 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse348 (select (store .cse350 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse1)) .cse9) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse352 (store .cse3 v_arrayElimCell_184 0)) (.cse351 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse353 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse351 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse351 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse351 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse351 (select (store .cse352 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse351 (select (store .cse353 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse351 (select (store .cse352 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse351 (select (store .cse353 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse1) (or .cse20 (and (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse355 (store .cse3 v_arrayElimCell_184 0)) (.cse354 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse354 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse354 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse354 (select (store .cse355 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse354 (select (store .cse355 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int)) (let ((.cse356 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse354 (select (store .cse356 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse354 (select (store .cse356 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse357 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse358 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse357 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int)) (= .cse357 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse357 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse357 (select (store .cse358 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse357 (select (store .cse358 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) .cse295)) (or (and (or .cse20 (and (forall ((v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse359 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse359 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int)) (let ((.cse360 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse359 (select (store .cse360 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse359 (select (store .cse360 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse361 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_182 Int)) (= .cse361 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse361 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or .cse1 (and .cse100 (forall ((v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse362 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse363 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse362 (select (store .cse363 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int)) (let ((.cse364 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse362 (select (store .cse364 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse362 (select (store .cse364 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse362 (select (store .cse363 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse365 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse366 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse365 (select (store .cse366 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse365 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse365 (select (store .cse366 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse18))) (or (and (or (and (forall ((v_arrayElimCell_182 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse367 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse367 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse367 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse367 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_182 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse368 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (= .cse368 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse368 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse1) (forall ((v_arrayElimCell_182 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse369 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse369 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse369 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse369 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse369 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))) (or .cse27 (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse370 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse370 (select .cse344 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse370 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse370 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse371 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse371 (select .cse344 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_185 Int)) (= .cse371 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))))) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse372 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse372 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse372 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse372 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse1) (or .cse27 (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse373 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse373 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse373 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse373 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_arrayElimCell_182 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse374 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse375 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse374 (select (store .cse375 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse374 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse374 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))) (= .cse374 (select (store .cse375 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse376 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse377 (store .cse3 v_arrayElimCell_182 0))) (or (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (= .cse376 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse376 (select (store .cse377 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse376 (select (store .cse377 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse1)) .cse18) (or .cse9 (and (or (and (or (forall ((v_arrayElimCell_182 Int) (v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) .cse1) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse378 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_182 Int)) (= .cse378 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse378 (select .cse344 v_antiDerIndex_entry0_1))))) (or (forall ((v_antiDerIndex_entry0_1 Int)) (= (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1) (select .cse344 v_antiDerIndex_entry0_1))) .cse27)) .cse18) (or .cse1 (forall ((v_arrayElimCell_182 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse379 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse380 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse379 (select (store .cse380 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse379 (select (store .cse380 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse231)) (or (and (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse381 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse381 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse381 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse381 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse1) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse382 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_182 Int)) (= .cse382 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse382 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse382 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse382 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse18) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse383 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse384 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse383 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse383 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse383 (select (store .cse384 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse383 (select (store .cse384 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse1) .cse121 (or (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse385 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse385 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse385 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse385 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse27)) .cse48) (or .cse1 (and (or (and (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse387 (store .cse3 v_arrayElimCell_184 0)) (.cse386 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse386 (select (store .cse387 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse386 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse386 (select (store .cse387 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse386 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse386 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse388 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse389 (store .cse3 v_arrayElimCell_184 0))) (or (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (= .cse388 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse388 (select (store .cse389 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse388 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse388 (select (store .cse389 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse391 (store .cse3 v_arrayElimCell_184 0)) (.cse390 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse390 (select (store .cse391 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse390 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse390 (select (store .cse391 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (let ((.cse392 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse390 (select (store .cse392 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse390 (select (store .cse392 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse393 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse394 (store .cse3 v_arrayElimCell_184 0))) (or (forall ((v_arrayElimCell_186 Int)) (= .cse393 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_185 Int)) (= .cse393 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse393 (select (store .cse394 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse393 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse393 (select (store .cse394 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (or .cse9 (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse395 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse396 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse395 (select (store .cse396 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse395 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse395 (select (store .cse396 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))))) .cse18) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse398 (store .cse3 v_arrayElimCell_184 0)) (.cse397 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse399 (store .cse3 v_arrayElimCell_182 0))) (or (forall ((v_arrayElimCell_186 Int)) (= .cse397 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_185 Int)) (= .cse397 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse397 (select (store .cse398 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse397 (select (store .cse399 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse397 (select (store .cse398 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse397 (select (store .cse399 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (and (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse401 (store .cse3 v_arrayElimCell_184 0)) (.cse400 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_186 Int)) (= .cse400 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_185 Int)) (= .cse400 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse400 (select (store .cse401 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse400 (select (store .cse401 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse400 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse403 (store .cse3 v_arrayElimCell_184 0)) (.cse402 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_186 Int)) (= .cse402 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 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 .cse403 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse402 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse234 .cse9) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse405 (store .cse3 v_arrayElimCell_184 0)) (.cse404 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse404 (select (store .cse405 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse404 (select (store .cse405 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (let ((.cse406 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse404 (select (store .cse406 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse404 (select (store .cse406 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (= .cse404 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse20) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse408 (store .cse3 v_arrayElimCell_184 0)) (.cse407 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse409 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse407 (select (store .cse408 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse407 (select (store .cse409 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse407 (select (store .cse408 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse407 (select (store .cse409 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse9) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse411 (store .cse3 v_arrayElimCell_184 0)) (.cse410 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse412 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse410 (select (store .cse411 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse410 (select (store .cse412 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse410 (select (store .cse411 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (let ((.cse413 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse410 (select (store .cse413 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse410 (select (store .cse413 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (= .cse410 (select (store .cse412 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (and (or .cse414 .cse9) (or .cse282 .cse20) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse416 (store .cse3 v_arrayElimCell_184 0)) (.cse415 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse415 (select (store .cse416 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse415 (select (store .cse416 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (let ((.cse417 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse415 (select (store .cse417 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse415 (select (store .cse417 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))))) (or .cse319 .cse18) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse418 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse419 (store .cse3 v_arrayElimCell_184 0))) (or (forall ((v_arrayElimCell_186 Int)) (= .cse418 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_185 Int)) (= .cse418 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse418 (select (store .cse419 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse418 (select (store .cse419 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) .cse19) (or (and (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse421 (store .cse3 v_arrayElimCell_184 0)) (.cse420 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse422 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse420 (select (store .cse421 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse420 (select (store .cse422 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse420 (select (store .cse421 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse420 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse420 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))) (= .cse420 (select (store .cse422 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse424 (store .cse3 v_arrayElimCell_184 0)) (.cse423 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse425 (store .cse3 v_arrayElimCell_182 0))) (or (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (= .cse423 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse423 (select (store .cse424 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse423 (select (store .cse425 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse423 (select (store .cse424 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse423 (select (store .cse425 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse18) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse427 (store .cse3 v_arrayElimCell_184 0)) (.cse426 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse428 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse426 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse426 (select (store .cse427 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse426 (select (store .cse428 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse426 (select (store .cse427 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse426 (select (store .cse428 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse20))) (or (and (or .cse28 .cse19) (or .cse27 (and (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse429 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse430 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse429 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse429 (select .cse344 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_185 Int)) (= .cse429 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse429 (select (store .cse430 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse429 (select (store .cse430 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse432 (store .cse3 v_arrayElimCell_184 0)) (.cse431 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse431 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse431 (select .cse344 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 .cse432 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse431 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse431 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))))) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse434 (store .cse3 v_arrayElimCell_184 0)) (.cse433 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse433 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse433 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse433 (select (store .cse434 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse433 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse433 (select (store .cse434 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse433 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse1) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse435 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse436 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse435 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse435 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse435 (select (store .cse4 v_arrayElimCell_185 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 .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse435 (select (store .cse436 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) .cse27) (or (and (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse438 (store .cse3 v_arrayElimCell_184 0)) (.cse437 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse439 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse437 (select (store .cse4 v_arrayElimCell_183 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 .cse439 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse437 (select (store .cse438 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse437 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse437 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))) (= .cse437 (select (store .cse439 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse441 (store .cse3 v_arrayElimCell_184 0)) (.cse440 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse442 (store .cse3 v_arrayElimCell_182 0))) (or (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (= .cse440 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse440 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse440 (select (store .cse441 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse440 (select (store .cse442 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse440 (select (store .cse441 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse440 (select (store .cse442 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) .cse1) (or .cse1 (and (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse444 (store .cse3 v_arrayElimCell_184 0)) (.cse443 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse443 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse443 (select (store .cse444 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse443 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse443 (select (store .cse444 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse443 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse443 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse445 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse446 (store .cse3 v_arrayElimCell_184 0))) (or (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (= .cse445 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse445 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse445 (select (store .cse446 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse445 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse445 (select (store .cse446 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse448 (store .cse3 v_arrayElimCell_184 0)) (.cse447 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse447 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse447 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse447 (select (store .cse448 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse447 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse447 (select (store .cse448 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse447 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse447 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))))) .cse18) (or (and (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse449 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse450 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse449 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse449 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse449 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse449 (select (store .cse450 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse449 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse449 (select (store .cse450 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) .cse1) (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse451 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse452 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse451 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse451 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse451 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse451 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse451 (select (store .cse452 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse451 (select (store .cse452 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))) .cse27) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse453 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse454 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse453 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int)) (= .cse453 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse453 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse453 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse453 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse453 (select (store .cse454 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse453 (select (store .cse454 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) .cse18) (or .cse27 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse455 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse456 (store .cse3 v_arrayElimCell_184 0))) (or (= .cse455 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse455 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse455 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse455 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse455 (select (store .cse456 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse455 (select (store .cse456 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) .cse260 (or .cse27 (and (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse457 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse457 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse457 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse457 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse457 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse19 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse458 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse458 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse458 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse458 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse458 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse459 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse459 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse459 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse459 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse459 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse459 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse460 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse460 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse460 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse460 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse19) (or .cse9 (and (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse461 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse461 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse461 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse461 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or .cse315 .cse19))))) (or (and (or .cse1 (and (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse462 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse462 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse462 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse462 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse462 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))) (= .cse462 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse463 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse463 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse463 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (= .cse463 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))) (= .cse463 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))) (or (and (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse464 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse464 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse464 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse464 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse464 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))) (= .cse464 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse465 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse465 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse465 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_183 Int)) (= .cse465 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))) (= .cse465 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))) .cse27) (or (and (forall ((v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse466 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse466 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse466 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_183 Int)) (= .cse466 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse467 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse467 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse467 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse467 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse467 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))))) .cse27) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse468 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse468 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse468 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse468 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse468 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse468 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))) (= .cse468 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (or .cse1 (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse469 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse469 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse469 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse469 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse469 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse469 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse470 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse470 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (= .cse470 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))) (= .cse470 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse471 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse471 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse471 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse471 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))) (= .cse471 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))) .cse1) (or .cse1 (and (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse472 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse473 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse472 (select (store .cse473 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse472 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (let ((.cse474 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse472 (select (store .cse474 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse472 (select (store .cse474 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (= .cse472 (select (store .cse473 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse475 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse476 (store .cse3 v_arrayElimCell_182 0))) (or (forall ((v_arrayElimCell_186 Int)) (= .cse475 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_185 Int)) (= .cse475 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse475 (select (store .cse476 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse475 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse475 (select (store .cse476 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse477 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse478 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse477 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse477 (select (store .cse478 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse477 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse477 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse477 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))) (= .cse477 (select (store .cse478 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse479 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse480 (store .cse3 v_arrayElimCell_182 0))) (or (forall ((v_arrayElimCell_186 Int)) (= .cse479 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse479 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_185 Int)) (= .cse479 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse479 (select (store .cse480 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse479 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse479 (select (store .cse480 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse481 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse482 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse481 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse481 (select (store .cse482 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse481 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (let ((.cse483 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse481 (select (store .cse483 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse481 (select (store .cse483 v_arrayElimCell_185 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 .cse9 (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse484 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse485 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse484 (select (store .cse485 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse484 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse484 (select (store .cse485 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse486 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse487 (store .cse3 v_arrayElimCell_182 0))) (or (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (= .cse486 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse486 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse486 (select (store .cse487 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse486 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse486 (select (store .cse487 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse488 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse489 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse488 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse488 (select (store .cse489 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse488 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse488 (select (store .cse489 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse9) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse490 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse491 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse490 (select (store .cse491 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse490 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (or (= .cse490 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse490 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))) (= .cse490 (select (store .cse491 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse492 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse493 (store .cse3 v_arrayElimCell_182 0))) (or (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (= .cse492 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse492 (select (store .cse493 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse492 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse492 (select (store .cse493 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))) (or .cse9 (and (or .cse1 (and (forall ((v_arrayElimCell_182 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse494 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse494 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse494 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse494 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))))) (forall ((v_arrayElimCell_182 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse495 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse495 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (= .cse495 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))))) (or .cse1 (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse496 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse496 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse496 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse496 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (or .cse27 (and (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse497 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse497 (select .cse344 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse497 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse497 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))))) (forall ((v_antiDerIndex_entry0_1 Int)) (let ((.cse498 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse498 (select .cse344 v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_183 Int)) (= .cse498 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_182 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse499 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse499 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse499 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse499 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse499 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_183 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse500 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse500 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse500 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse500 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse27))) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse501 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse501 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse501 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse501 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse501 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse501 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) .cse27) (or (and (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse502 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse502 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse502 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse502 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_183 Int)) (= .cse502 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse503 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse503 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse503 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse503 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse503 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse503 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))))) .cse27) .cse0 (or .cse1 (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse504 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse504 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse504 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse504 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse504 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse504 (select (store (store .cse3 v_arrayElimCell_186 0) v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))) (or (and (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse505 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse505 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse505 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse505 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (= .cse505 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse506 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse506 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse506 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse506 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse506 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse506 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))))))) .cse1) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse507 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse507 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse507 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse507 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse507 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse507 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse507 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))))))) (or .cse1 (and (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse508 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse509 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse508 (select (store .cse509 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse508 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (= .cse508 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1))) (= .cse508 (select (store .cse509 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse510 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse511 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse510 (select (store .cse511 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse510 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_183 Int)) (or (= .cse510 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse510 (select (store (store .cse3 v_arrayElimCell_184 0) v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)))) (= .cse510 (select (store .cse511 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))))) (or (forall ((v_arrayElimCell_182 Int) (v_arrayElimCell_183 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int) (v_arrayElimCell_185 Int)) (let ((.cse512 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse512 (select (store .cse4 v_arrayElimCell_183 0) v_antiDerIndex_entry0_1)) (= .cse512 (select .cse344 v_antiDerIndex_entry0_1)) (= .cse512 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse512 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse512 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1))))) .cse27)) .cse18) (or (and .cse124 .cse279 (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse513 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse514 (store .cse3 v_arrayElimCell_186 0))) (or (forall ((v_arrayElimCell_182 Int)) (= .cse513 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse513 (select (store .cse514 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse513 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse513 (select (store .cse514 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse515 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse515 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse515 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int)) (let ((.cse516 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse515 (select (store .cse516 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse515 (select (store .cse516 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) .cse88 (or .cse9 (and .cse228 (forall ((v_arrayElimCell_184 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse517 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse517 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int)) (let ((.cse518 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse517 (select (store .cse518 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse517 (select (store .cse518 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))) .cse243)) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse519 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1)) (.cse520 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse519 (select (store .cse520 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse519 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int)) (let ((.cse521 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse519 (select (store .cse521 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse519 (select (store .cse521 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (= .cse519 (select (store .cse520 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse522 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_182 Int)) (= .cse522 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse522 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse522 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse522 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_186 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse523 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_182 Int)) (= .cse523 (select (store (store .cse3 v_arrayElimCell_182 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse523 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse523 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse524 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse524 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)) (= .cse524 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse524 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_182 Int)) (let ((.cse525 (store .cse3 v_arrayElimCell_182 0))) (or (= .cse524 (select (store .cse525 |c_ULTIMATE.start_dll_circular_create_~head~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse524 (select (store .cse525 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))))))) .cse20))) .cse103) (or .cse20 .cse19 (and (or .cse9 .cse526) (forall ((v_arrayElimCell_184 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse527 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_186 Int)) (= .cse527 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (forall ((v_arrayElimCell_185 Int)) (= .cse527 (select (store .cse4 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1))) (= .cse527 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))))) (forall ((v_arrayElimCell_184 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse528 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (= .cse528 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (forall ((v_arrayElimCell_186 Int) (v_arrayElimCell_185 Int)) (let ((.cse529 (store .cse3 v_arrayElimCell_186 0))) (or (= .cse528 (select (store .cse529 |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)) (= .cse528 (select (store .cse529 v_arrayElimCell_185 0) v_antiDerIndex_entry0_1)))))))) (forall ((v_arrayElimCell_184 Int) (v_antiDerIndex_entry0_1 Int)) (let ((.cse530 (select |c_ULTIMATE.start_main_old_#valid#1| v_antiDerIndex_entry0_1))) (or (forall ((v_arrayElimCell_186 Int)) (= .cse530 (select (store (store .cse3 v_arrayElimCell_186 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1))) (= .cse530 (select (store (store .cse3 v_arrayElimCell_184 0) |c_ULTIMATE.start_dll_circular_create_~last~0#1.base| 0) v_antiDerIndex_entry0_1)))))))))))) is different from false [2023-11-29 04:16:36,819 INFO L134 CoverageAnalysis]: Checked inductivity of 6 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 5 not checked. [2023-11-29 04:16:36,819 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [940118189] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:16:36,819 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 04:16:36,820 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [17, 13, 14] total 42 [2023-11-29 04:16:36,820 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [819952724] [2023-11-29 04:16:36,820 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 04:16:36,820 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 44 states [2023-11-29 04:16:36,820 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 04:16:36,821 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 44 interpolants. [2023-11-29 04:16:36,822 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=123, Invalid=1327, Unknown=52, NotChecked=390, Total=1892 [2023-11-29 04:16:36,822 INFO L87 Difference]: Start difference. First operand 70 states and 75 transitions. Second operand has 44 states, 43 states have (on average 1.9767441860465116) internal successors, (85), 43 states have internal predecessors, (85), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:16:40,871 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:16:44,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:16:48,937 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:16:52,982 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:16:57,003 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:17:01,044 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:17:05,085 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:17:09,115 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:17:51,403 WARN L293 SmtUtils]: Spent 11.69s on a formula simplification. DAG size of input: 1038 DAG size of output: 436 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:17:55,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:17:59,799 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:18:03,915 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:18:07,953 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:18:24,316 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:18:28,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:18:40,592 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:18:44,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:18:48,651 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:19:08,451 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:19:12,478 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:19:16,494 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:19:20,530 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:19:23,879 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:19:27,899 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:19:44,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:19:48,150 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:19:52,170 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:20:08,342 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:20:12,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:20:16,380 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:20:20,414 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:20:24,447 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:20:28,468 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:20:32,505 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:20:36,533 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:20:40,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:20:56,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:21:00,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:21:04,782 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:21:21,131 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:21:25,158 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:21:29,175 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:21:45,516 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:21:49,544 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:21:53,570 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:22:09,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:22:13,779 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:22:17,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:22:21,818 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:22:25,838 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:22:29,860 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:22:33,881 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:22:37,900 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:22:41,923 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:22:46,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:22:50,320 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:22:54,343 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:22:58,373 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:23:02,397 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:23:06,418 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:23:10,439 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:23:14,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:23:18,475 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:23:22,862 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:23:26,895 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:23:30,922 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:23:34,952 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:23:38,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:23:42,996 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:23:47,018 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:23:51,039 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:23:55,061 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:23:59,326 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:24:03,357 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:24:07,385 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:24:23,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:24:27,656 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:24:31,678 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:24:35,710 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:24:39,740 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:24:43,762 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:24:47,876 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:24:51,897 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:24:55,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:24:59,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:25:03,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:25:07,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:25:12,014 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:25:16,047 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:25:20,068 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:25:36,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:25:40,292 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:25:44,312 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:25:48,340 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:25:52,362 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:25:56,383 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:26:00,406 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:26:04,429 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:26:08,454 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:26:12,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:26:16,501 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:26:20,520 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:26:24,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:26:28,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:26:32,580 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:26:36,603 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:26:40,621 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:26:44,643 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:26:48,660 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:26:52,677 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [1]