./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/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_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/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_08540b7b-acfc-4858-a30a-0ffe5e11482d/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 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 02:00:36,411 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 02:00:36,473 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 02:00:36,477 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 02:00:36,478 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 02:00:36,502 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 02:00:36,503 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 02:00:36,504 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 02:00:36,504 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 02:00:36,505 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 02:00:36,506 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 02:00:36,506 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 02:00:36,507 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 02:00:36,507 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 02:00:36,508 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 02:00:36,508 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 02:00:36,509 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 02:00:36,509 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 02:00:36,510 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 02:00:36,510 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 02:00:36,510 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 02:00:36,511 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 02:00:36,511 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 02:00:36,512 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 02:00:36,512 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 02:00:36,513 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 02:00:36,513 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 02:00:36,514 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 02:00:36,514 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 02:00:36,515 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 02:00:36,515 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 02:00:36,515 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 02:00:36,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:00:36,516 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 02:00:36,516 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 02:00:36,516 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 02:00:36,516 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 02:00:36,517 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 02:00:36,517 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 02:00:36,517 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 02:00:36,517 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 02:00:36,518 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_08540b7b-acfc-4858-a30a-0ffe5e11482d/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_08540b7b-acfc-4858-a30a-0ffe5e11482d/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 -> 0d6c543285e4316d7bccce7ec33cf3dc3eeb4c474821e85404caf1203b5dfc7e [2023-11-29 02:00:36,751 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 02:00:36,783 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 02:00:36,786 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 02:00:36,787 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 02:00:36,787 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 02:00:36,788 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2023-11-29 02:00:39,523 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 02:00:39,734 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 02:00:39,735 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/sv-benchmarks/c/memsafety-ext/skiplist_2lvl.i [2023-11-29 02:00:39,749 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/data/0c8246eb9/429f63c61b79414ab8f4bc46d2944a3d/FLAGbf88ff7d6 [2023-11-29 02:00:39,761 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/data/0c8246eb9/429f63c61b79414ab8f4bc46d2944a3d [2023-11-29 02:00:39,763 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 02:00:39,764 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 02:00:39,765 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 02:00:39,765 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 02:00:39,770 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 02:00:39,770 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:00:39" (1/1) ... [2023-11-29 02:00:39,771 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3d07b867 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:39, skipping insertion in model container [2023-11-29 02:00:39,771 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 02:00:39" (1/1) ... [2023-11-29 02:00:39,812 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 02:00:40,086 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:00:40,097 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 02:00:40,136 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 02:00:40,165 INFO L206 MainTranslator]: Completed translation [2023-11-29 02:00:40,166 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:40 WrapperNode [2023-11-29 02:00:40,166 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 02:00:40,167 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 02:00:40,167 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 02:00:40,168 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 02:00:40,175 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:40" (1/1) ... [2023-11-29 02:00:40,189 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:40" (1/1) ... [2023-11-29 02:00:40,211 INFO L138 Inliner]: procedures = 127, calls = 45, calls flagged for inlining = 5, calls inlined = 5, statements flattened = 141 [2023-11-29 02:00:40,211 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 02:00:40,212 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 02:00:40,212 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 02:00:40,213 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 02:00:40,230 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:40" (1/1) ... [2023-11-29 02:00:40,231 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:40" (1/1) ... [2023-11-29 02:00:40,235 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:40" (1/1) ... [2023-11-29 02:00:40,261 INFO L175 MemorySlicer]: Split 31 memory accesses to 3 slices as follows [2, 16, 13]. 52 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 11 writes are split as follows [0, 8, 3]. [2023-11-29 02:00:40,262 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:40" (1/1) ... [2023-11-29 02:00:40,262 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:40" (1/1) ... [2023-11-29 02:00:40,270 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:40" (1/1) ... [2023-11-29 02:00:40,273 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:40" (1/1) ... [2023-11-29 02:00:40,275 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:40" (1/1) ... [2023-11-29 02:00:40,276 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:40" (1/1) ... [2023-11-29 02:00:40,279 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 02:00:40,279 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 02:00:40,279 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 02:00:40,279 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 02:00:40,280 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:40" (1/1) ... [2023-11-29 02:00:40,285 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 02:00:40,296 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:00:40,308 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 02:00:40,311 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 02:00:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 02:00:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 02:00:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 02:00:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 02:00:40,344 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 02:00:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 02:00:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 02:00:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 02:00:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 02:00:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#0 [2023-11-29 02:00:40,345 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#1 [2023-11-29 02:00:40,346 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~int#2 [2023-11-29 02:00:40,346 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 02:00:40,346 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 02:00:40,481 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 02:00:40,483 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 02:00:40,853 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 02:00:40,896 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 02:00:40,896 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 02:00:40,897 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:00:40 BoogieIcfgContainer [2023-11-29 02:00:40,897 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 02:00:40,900 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 02:00:40,900 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 02:00:40,903 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 02:00:40,903 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 02:00:39" (1/3) ... [2023-11-29 02:00:40,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7902d2ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:00:40, skipping insertion in model container [2023-11-29 02:00:40,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 02:00:40" (2/3) ... [2023-11-29 02:00:40,904 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@7902d2ed and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 02:00:40, skipping insertion in model container [2023-11-29 02:00:40,904 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 02:00:40" (3/3) ... [2023-11-29 02:00:40,906 INFO L112 eAbstractionObserver]: Analyzing ICFG skiplist_2lvl.i [2023-11-29 02:00:40,924 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 02:00:40,924 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 65 error locations. [2023-11-29 02:00:40,965 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 02:00:40,971 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;@480f4d3, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 02:00:40,971 INFO L358 AbstractCegarLoop]: Starting to check reachability of 65 error locations. [2023-11-29 02:00:40,974 INFO L276 IsEmpty]: Start isEmpty. Operand has 115 states, 49 states have (on average 2.5510204081632653) internal successors, (125), 114 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 02:00:40,979 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 02:00:40,979 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:40,979 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 02:00:40,980 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:40,983 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:40,983 INFO L85 PathProgramCache]: Analyzing trace with hash 7413, now seen corresponding path program 1 times [2023-11-29 02:00:40,990 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:40,990 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1419386862] [2023-11-29 02:00:40,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:40,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:41,090 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:41,216 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 02:00:41,216 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:41,216 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1419386862] [2023-11-29 02:00:41,217 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1419386862] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:41,217 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:41,217 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:00:41,219 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1209947611] [2023-11-29 02:00:41,220 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:41,223 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:00:41,223 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:41,244 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:00:41,245 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:00:41,247 INFO L87 Difference]: Start difference. First operand has 115 states, 49 states have (on average 2.5510204081632653) internal successors, (125), 114 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 02:00:41,384 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:41,384 INFO L93 Difference]: Finished difference Result 108 states and 114 transitions. [2023-11-29 02:00:41,385 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:00:41,386 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-11-29 02:00:41,387 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:41,395 INFO L225 Difference]: With dead ends: 108 [2023-11-29 02:00:41,395 INFO L226 Difference]: Without dead ends: 107 [2023-11-29 02:00:41,397 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 02:00:41,401 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 24 mSDsluCounter, 44 mSDsCounter, 0 mSdLazyCounter, 79 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 24 SdHoareTripleChecker+Valid, 123 SdHoareTripleChecker+Invalid, 86 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 79 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:41,402 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [24 Valid, 123 Invalid, 86 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 79 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:00:41,419 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-29 02:00:41,436 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 107. [2023-11-29 02:00:41,437 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 107 states, 49 states have (on average 2.306122448979592) internal successors, (113), 106 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:41,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 107 states to 107 states and 113 transitions. [2023-11-29 02:00:41,441 INFO L78 Accepts]: Start accepts. Automaton has 107 states and 113 transitions. Word has length 2 [2023-11-29 02:00:41,441 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:41,441 INFO L495 AbstractCegarLoop]: Abstraction has 107 states and 113 transitions. [2023-11-29 02:00:41,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 02:00:41,442 INFO L276 IsEmpty]: Start isEmpty. Operand 107 states and 113 transitions. [2023-11-29 02:00:41,442 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 02:00:41,442 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:41,442 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 02:00:41,443 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable0 [2023-11-29 02:00:41,443 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:41,444 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:41,444 INFO L85 PathProgramCache]: Analyzing trace with hash 7414, now seen corresponding path program 1 times [2023-11-29 02:00:41,444 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:41,444 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [819946357] [2023-11-29 02:00:41,444 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:41,445 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:41,458 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:41,539 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 02:00:41,539 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:41,540 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [819946357] [2023-11-29 02:00:41,540 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [819946357] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:41,540 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:41,540 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 02:00:41,540 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1949300989] [2023-11-29 02:00:41,541 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:41,542 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:00:41,542 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:41,542 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:00:41,543 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:00:41,543 INFO L87 Difference]: Start difference. First operand 107 states and 113 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 02:00:41,648 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:41,648 INFO L93 Difference]: Finished difference Result 100 states and 106 transitions. [2023-11-29 02:00:41,649 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:00:41,649 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 2 [2023-11-29 02:00:41,649 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:41,665 INFO L225 Difference]: With dead ends: 100 [2023-11-29 02:00:41,665 INFO L226 Difference]: Without dead ends: 100 [2023-11-29 02:00:41,665 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 02:00:41,667 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 17 mSDsluCounter, 48 mSDsCounter, 0 mSdLazyCounter, 66 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 17 SdHoareTripleChecker+Valid, 127 SdHoareTripleChecker+Invalid, 73 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 66 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:41,668 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [17 Valid, 127 Invalid, 73 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 66 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:00:41,669 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-29 02:00:41,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 100. [2023-11-29 02:00:41,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 100 states, 49 states have (on average 2.163265306122449) internal successors, (106), 99 states have internal predecessors, (106), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:41,678 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 100 states to 100 states and 106 transitions. [2023-11-29 02:00:41,678 INFO L78 Accepts]: Start accepts. Automaton has 100 states and 106 transitions. Word has length 2 [2023-11-29 02:00:41,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:41,679 INFO L495 AbstractCegarLoop]: Abstraction has 100 states and 106 transitions. [2023-11-29 02:00:41,679 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 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 02:00:41,679 INFO L276 IsEmpty]: Start isEmpty. Operand 100 states and 106 transitions. [2023-11-29 02:00:41,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 02:00:41,680 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:41,680 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:41,680 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable1 [2023-11-29 02:00:41,680 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr10REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:41,681 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:41,681 INFO L85 PathProgramCache]: Analyzing trace with hash -708773178, now seen corresponding path program 1 times [2023-11-29 02:00:41,681 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:41,682 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2021780616] [2023-11-29 02:00:41,682 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:41,682 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:41,708 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:41,923 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 02:00:41,923 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:41,924 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2021780616] [2023-11-29 02:00:41,924 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2021780616] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:41,924 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:41,924 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:00:41,925 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1269700933] [2023-11-29 02:00:41,925 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:41,925 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:00:41,925 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:41,926 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:00:41,926 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:00:41,927 INFO L87 Difference]: Start difference. First operand 100 states and 106 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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 02:00:42,106 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:42,106 INFO L93 Difference]: Finished difference Result 99 states and 105 transitions. [2023-11-29 02:00:42,109 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:00:42,109 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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 02:00:42,110 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:42,111 INFO L225 Difference]: With dead ends: 99 [2023-11-29 02:00:42,111 INFO L226 Difference]: Without dead ends: 99 [2023-11-29 02:00:42,112 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 02:00:42,113 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 18 mSDsluCounter, 137 mSDsCounter, 0 mSdLazyCounter, 181 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 215 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 181 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:42,114 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 215 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 181 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:00:42,115 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-29 02:00:42,121 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 99. [2023-11-29 02:00:42,122 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 49 states have (on average 2.142857142857143) internal successors, (105), 98 states have internal predecessors, (105), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:42,123 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 105 transitions. [2023-11-29 02:00:42,124 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 105 transitions. Word has length 7 [2023-11-29 02:00:42,124 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:42,124 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 105 transitions. [2023-11-29 02:00:42,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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 02:00:42,125 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 105 transitions. [2023-11-29 02:00:42,125 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 8 [2023-11-29 02:00:42,125 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:42,125 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:42,125 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable2 [2023-11-29 02:00:42,126 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr11REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:42,126 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:42,126 INFO L85 PathProgramCache]: Analyzing trace with hash -708773177, now seen corresponding path program 1 times [2023-11-29 02:00:42,126 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:42,127 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [176463266] [2023-11-29 02:00:42,127 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:42,127 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:42,147 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:42,335 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 02:00:42,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:42,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [176463266] [2023-11-29 02:00:42,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [176463266] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:42,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:42,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:00:42,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1344364457] [2023-11-29 02:00:42,337 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:42,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:00:42,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:42,338 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:00:42,338 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:00:42,338 INFO L87 Difference]: Start difference. First operand 99 states and 105 transitions. Second operand has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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 02:00:42,544 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:42,544 INFO L93 Difference]: Finished difference Result 98 states and 104 transitions. [2023-11-29 02:00:42,544 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:00:42,545 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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 02:00:42,545 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:42,546 INFO L225 Difference]: With dead ends: 98 [2023-11-29 02:00:42,546 INFO L226 Difference]: Without dead ends: 98 [2023-11-29 02:00:42,546 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 02:00:42,548 INFO L413 NwaCegarLoop]: 78 mSDtfsCounter, 16 mSDsluCounter, 124 mSDsCounter, 0 mSdLazyCounter, 192 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 202 SdHoareTripleChecker+Invalid, 192 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 192 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:42,548 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 202 Invalid, 192 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 192 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:00:42,549 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 98 states. [2023-11-29 02:00:42,554 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 98 to 98. [2023-11-29 02:00:42,554 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 49 states have (on average 2.122448979591837) internal successors, (104), 97 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 02:00:42,555 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 104 transitions. [2023-11-29 02:00:42,555 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 104 transitions. Word has length 7 [2023-11-29 02:00:42,555 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:42,556 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 104 transitions. [2023-11-29 02:00:42,556 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 1.75) internal successors, (7), 4 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 02:00:42,556 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 104 transitions. [2023-11-29 02:00:42,556 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 02:00:42,556 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:42,557 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:42,557 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable3 [2023-11-29 02:00:42,557 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr12REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:42,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:42,558 INFO L85 PathProgramCache]: Analyzing trace with hash -497132045, now seen corresponding path program 1 times [2023-11-29 02:00:42,558 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:42,558 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [864286924] [2023-11-29 02:00:42,558 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:42,558 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:42,573 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:42,614 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 02:00:42,614 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:42,614 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [864286924] [2023-11-29 02:00:42,615 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [864286924] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:42,615 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:42,615 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:00:42,615 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [534165432] [2023-11-29 02:00:42,615 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:42,616 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:00:42,616 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:42,616 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:00:42,617 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:00:42,617 INFO L87 Difference]: Start difference. First operand 98 states and 104 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 02:00:42,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:42,736 INFO L93 Difference]: Finished difference Result 97 states and 103 transitions. [2023-11-29 02:00:42,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:00:42,736 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 02:00:42,737 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:42,737 INFO L225 Difference]: With dead ends: 97 [2023-11-29 02:00:42,737 INFO L226 Difference]: Without dead ends: 97 [2023-11-29 02:00:42,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:00:42,739 INFO L413 NwaCegarLoop]: 83 mSDtfsCounter, 7 mSDsluCounter, 206 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 289 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:42,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 289 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:00:42,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 97 states. [2023-11-29 02:00:42,745 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 97 to 97. [2023-11-29 02:00:42,745 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 97 states, 49 states have (on average 2.1020408163265305) internal successors, (103), 96 states have internal predecessors, (103), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:42,746 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 97 states to 97 states and 103 transitions. [2023-11-29 02:00:42,746 INFO L78 Accepts]: Start accepts. Automaton has 97 states and 103 transitions. Word has length 8 [2023-11-29 02:00:42,746 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:42,746 INFO L495 AbstractCegarLoop]: Abstraction has 97 states and 103 transitions. [2023-11-29 02:00:42,747 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 02:00:42,747 INFO L276 IsEmpty]: Start isEmpty. Operand 97 states and 103 transitions. [2023-11-29 02:00:42,747 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 9 [2023-11-29 02:00:42,747 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:42,747 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:42,747 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable4 [2023-11-29 02:00:42,748 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr13REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:42,748 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:42,748 INFO L85 PathProgramCache]: Analyzing trace with hash -497132044, now seen corresponding path program 1 times [2023-11-29 02:00:42,748 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:42,749 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [887899993] [2023-11-29 02:00:42,749 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:42,749 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:42,766 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:42,984 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 02:00:42,984 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:42,984 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [887899993] [2023-11-29 02:00:42,984 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [887899993] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:42,984 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:42,985 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:00:42,985 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1966372163] [2023-11-29 02:00:42,985 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:42,985 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:00:42,985 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:42,986 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:00:42,986 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=29, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:00:42,986 INFO L87 Difference]: Start difference. First operand 97 states and 103 transitions. Second operand has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 02:00:43,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:43,213 INFO L93 Difference]: Finished difference Result 96 states and 102 transitions. [2023-11-29 02:00:43,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:00:43,214 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 02:00:43,214 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:43,215 INFO L225 Difference]: With dead ends: 96 [2023-11-29 02:00:43,215 INFO L226 Difference]: Without dead ends: 96 [2023-11-29 02:00:43,215 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=25, Invalid=47, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:00:43,216 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 16 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 261 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 16 SdHoareTripleChecker+Valid, 325 SdHoareTripleChecker+Invalid, 261 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 261 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:43,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [16 Valid, 325 Invalid, 261 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 261 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:00:43,217 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 96 states. [2023-11-29 02:00:43,222 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 96 to 96. [2023-11-29 02:00:43,222 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 49 states have (on average 2.0816326530612246) internal successors, (102), 95 states have internal predecessors, (102), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:43,223 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 102 transitions. [2023-11-29 02:00:43,223 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 102 transitions. Word has length 8 [2023-11-29 02:00:43,223 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:43,223 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 102 transitions. [2023-11-29 02:00:43,223 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 1.3333333333333333) internal successors, (8), 6 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 02:00:43,224 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 102 transitions. [2023-11-29 02:00:43,224 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 02:00:43,224 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:43,224 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:43,224 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable5 [2023-11-29 02:00:43,225 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:43,225 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:43,225 INFO L85 PathProgramCache]: Analyzing trace with hash -1008275651, now seen corresponding path program 1 times [2023-11-29 02:00:43,225 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:43,225 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [311810650] [2023-11-29 02:00:43,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:43,225 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:43,242 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:43,312 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 02:00:43,312 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:43,312 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [311810650] [2023-11-29 02:00:43,312 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [311810650] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:43,312 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:43,312 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:00:43,313 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1113045008] [2023-11-29 02:00:43,313 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:43,313 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:00:43,313 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:43,314 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:00:43,314 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:00:43,314 INFO L87 Difference]: Start difference. First operand 96 states and 102 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:43,449 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:43,449 INFO L93 Difference]: Finished difference Result 95 states and 101 transitions. [2023-11-29 02:00:43,450 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:00:43,450 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 02:00:43,450 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:43,451 INFO L225 Difference]: With dead ends: 95 [2023-11-29 02:00:43,451 INFO L226 Difference]: Without dead ends: 95 [2023-11-29 02:00:43,451 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 02:00:43,452 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 9 mSDsluCounter, 133 mSDsCounter, 0 mSdLazyCounter, 177 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 209 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 177 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:43,452 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 209 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 177 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:00:43,453 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 95 states. [2023-11-29 02:00:43,457 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 95 to 95. [2023-11-29 02:00:43,457 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 49 states have (on average 2.061224489795918) internal successors, (101), 94 states have internal predecessors, (101), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:43,458 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 101 transitions. [2023-11-29 02:00:43,458 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 101 transitions. Word has length 11 [2023-11-29 02:00:43,458 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:43,458 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 101 transitions. [2023-11-29 02:00:43,459 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:43,459 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 101 transitions. [2023-11-29 02:00:43,459 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 02:00:43,459 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:43,459 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:43,459 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable6 [2023-11-29 02:00:43,460 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:43,460 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:43,460 INFO L85 PathProgramCache]: Analyzing trace with hash -1008275650, now seen corresponding path program 1 times [2023-11-29 02:00:43,460 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:43,461 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1511653063] [2023-11-29 02:00:43,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:43,461 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:43,478 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:43,584 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 02:00:43,584 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:43,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1511653063] [2023-11-29 02:00:43,585 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1511653063] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:43,585 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:43,585 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:00:43,585 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [29195247] [2023-11-29 02:00:43,585 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:43,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:00:43,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:43,586 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:00:43,586 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:00:43,586 INFO L87 Difference]: Start difference. First operand 95 states and 101 transitions. Second operand has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:43,736 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:43,736 INFO L93 Difference]: Finished difference Result 94 states and 100 transitions. [2023-11-29 02:00:43,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:00:43,736 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 02:00:43,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:43,737 INFO L225 Difference]: With dead ends: 94 [2023-11-29 02:00:43,737 INFO L226 Difference]: Without dead ends: 94 [2023-11-29 02:00:43,737 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 02:00:43,738 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 7 mSDsluCounter, 145 mSDsCounter, 0 mSdLazyCounter, 163 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 7 SdHoareTripleChecker+Valid, 221 SdHoareTripleChecker+Invalid, 163 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 163 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:43,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [7 Valid, 221 Invalid, 163 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 163 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:00:43,739 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 94 states. [2023-11-29 02:00:43,742 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 94 to 94. [2023-11-29 02:00:43,743 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 94 states, 49 states have (on average 2.0408163265306123) internal successors, (100), 93 states have internal predecessors, (100), 0 states have call successors, (0), 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 02:00:43,743 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 94 states to 94 states and 100 transitions. [2023-11-29 02:00:43,744 INFO L78 Accepts]: Start accepts. Automaton has 94 states and 100 transitions. Word has length 11 [2023-11-29 02:00:43,744 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:43,744 INFO L495 AbstractCegarLoop]: Abstraction has 94 states and 100 transitions. [2023-11-29 02:00:43,744 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 2.75) internal successors, (11), 5 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:43,744 INFO L276 IsEmpty]: Start isEmpty. Operand 94 states and 100 transitions. [2023-11-29 02:00:43,744 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 02:00:43,745 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:43,745 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:43,745 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable7 [2023-11-29 02:00:43,745 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr20REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:43,745 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:43,746 INFO L85 PathProgramCache]: Analyzing trace with hash -1191774103, now seen corresponding path program 1 times [2023-11-29 02:00:43,746 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:43,746 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [318647711] [2023-11-29 02:00:43,746 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:43,746 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:43,762 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:43,823 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 02:00:43,823 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:43,823 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [318647711] [2023-11-29 02:00:43,823 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [318647711] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:43,823 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:43,823 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:00:43,824 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [486891915] [2023-11-29 02:00:43,824 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:43,824 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:00:43,824 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:43,825 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:00:43,825 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:00:43,825 INFO L87 Difference]: Start difference. First operand 94 states and 100 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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 02:00:43,951 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:43,951 INFO L93 Difference]: Finished difference Result 93 states and 99 transitions. [2023-11-29 02:00:43,951 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:00:43,951 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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 12 [2023-11-29 02:00:43,952 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:43,952 INFO L225 Difference]: With dead ends: 93 [2023-11-29 02:00:43,952 INFO L226 Difference]: Without dead ends: 93 [2023-11-29 02:00:43,953 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 02:00:43,953 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 5 mSDsluCounter, 132 mSDsCounter, 0 mSdLazyCounter, 174 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 207 SdHoareTripleChecker+Invalid, 174 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 174 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:43,954 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 207 Invalid, 174 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 174 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:00:43,954 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 93 states. [2023-11-29 02:00:43,957 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 93 to 93. [2023-11-29 02:00:43,957 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 93 states, 49 states have (on average 2.020408163265306) internal successors, (99), 92 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 02:00:43,958 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 93 states to 93 states and 99 transitions. [2023-11-29 02:00:43,958 INFO L78 Accepts]: Start accepts. Automaton has 93 states and 99 transitions. Word has length 12 [2023-11-29 02:00:43,958 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:43,959 INFO L495 AbstractCegarLoop]: Abstraction has 93 states and 99 transitions. [2023-11-29 02:00:43,959 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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 02:00:43,959 INFO L276 IsEmpty]: Start isEmpty. Operand 93 states and 99 transitions. [2023-11-29 02:00:43,959 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 02:00:43,959 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:43,959 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:43,960 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable8 [2023-11-29 02:00:43,960 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr21REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:43,960 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:43,960 INFO L85 PathProgramCache]: Analyzing trace with hash -1191774102, now seen corresponding path program 1 times [2023-11-29 02:00:43,960 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:43,961 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1230541371] [2023-11-29 02:00:43,961 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:43,961 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:43,977 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:44,114 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 02:00:44,115 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:44,115 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1230541371] [2023-11-29 02:00:44,115 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1230541371] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:44,115 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:44,115 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:00:44,115 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1013425812] [2023-11-29 02:00:44,116 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:44,116 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:00:44,116 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:44,116 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:00:44,116 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:00:44,117 INFO L87 Difference]: Start difference. First operand 93 states and 99 transitions. Second operand has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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 02:00:44,251 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:44,251 INFO L93 Difference]: Finished difference Result 92 states and 98 transitions. [2023-11-29 02:00:44,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:00:44,252 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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 12 [2023-11-29 02:00:44,252 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:44,253 INFO L225 Difference]: With dead ends: 92 [2023-11-29 02:00:44,253 INFO L226 Difference]: Without dead ends: 92 [2023-11-29 02:00:44,253 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 02:00:44,253 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 3 mSDsluCounter, 144 mSDsCounter, 0 mSdLazyCounter, 160 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 219 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 160 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:44,254 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 219 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 160 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:00:44,255 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 92 states. [2023-11-29 02:00:44,257 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 92 to 92. [2023-11-29 02:00:44,257 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 92 states, 49 states have (on average 2.0) internal successors, (98), 91 states have internal predecessors, (98), 0 states have call successors, (0), 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 02:00:44,258 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 92 states to 92 states and 98 transitions. [2023-11-29 02:00:44,258 INFO L78 Accepts]: Start accepts. Automaton has 92 states and 98 transitions. Word has length 12 [2023-11-29 02:00:44,258 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:44,258 INFO L495 AbstractCegarLoop]: Abstraction has 92 states and 98 transitions. [2023-11-29 02:00:44,258 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.0) internal successors, (12), 5 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 02:00:44,258 INFO L276 IsEmpty]: Start isEmpty. Operand 92 states and 98 transitions. [2023-11-29 02:00:44,259 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 02:00:44,259 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:44,259 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:44,259 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable9 [2023-11-29 02:00:44,259 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:44,260 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:44,260 INFO L85 PathProgramCache]: Analyzing trace with hash -1937523427, now seen corresponding path program 1 times [2023-11-29 02:00:44,260 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:44,260 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [801055805] [2023-11-29 02:00:44,260 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:44,260 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:44,281 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:44,349 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 02:00:44,349 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:44,349 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [801055805] [2023-11-29 02:00:44,350 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [801055805] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:44,350 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:44,350 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:00:44,350 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1965352886] [2023-11-29 02:00:44,350 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:44,350 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:00:44,350 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:44,351 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:00:44,351 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:00:44,351 INFO L87 Difference]: Start difference. First operand 92 states and 98 transitions. Second operand has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:44,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:44,482 INFO L93 Difference]: Finished difference Result 118 states and 125 transitions. [2023-11-29 02:00:44,482 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:00:44,483 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 02:00:44,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:44,484 INFO L225 Difference]: With dead ends: 118 [2023-11-29 02:00:44,484 INFO L226 Difference]: Without dead ends: 118 [2023-11-29 02:00:44,484 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 02:00:44,485 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 127 mSDsluCounter, 72 mSDsCounter, 0 mSdLazyCounter, 155 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 127 SdHoareTripleChecker+Valid, 113 SdHoareTripleChecker+Invalid, 160 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 155 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:44,485 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [127 Valid, 113 Invalid, 160 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 155 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:00:44,486 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 118 states. [2023-11-29 02:00:44,488 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 118 to 90. [2023-11-29 02:00:44,488 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 90 states, 49 states have (on average 1.9591836734693877) internal successors, (96), 89 states have internal predecessors, (96), 0 states have call successors, (0), 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 02:00:44,488 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 90 states to 90 states and 96 transitions. [2023-11-29 02:00:44,489 INFO L78 Accepts]: Start accepts. Automaton has 90 states and 96 transitions. Word has length 15 [2023-11-29 02:00:44,489 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:44,489 INFO L495 AbstractCegarLoop]: Abstraction has 90 states and 96 transitions. [2023-11-29 02:00:44,489 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.75) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:44,489 INFO L276 IsEmpty]: Start isEmpty. Operand 90 states and 96 transitions. [2023-11-29 02:00:44,490 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 02:00:44,490 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:44,490 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:44,490 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable10 [2023-11-29 02:00:44,490 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:44,491 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:44,491 INFO L85 PathProgramCache]: Analyzing trace with hash -1937523426, now seen corresponding path program 1 times [2023-11-29 02:00:44,491 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:44,491 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1967368294] [2023-11-29 02:00:44,491 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:44,491 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:44,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:44,609 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 02:00:44,609 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:44,609 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1967368294] [2023-11-29 02:00:44,610 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1967368294] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:44,610 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:44,610 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:00:44,610 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [743995155] [2023-11-29 02:00:44,610 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:44,610 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:00:44,610 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:44,611 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:00:44,611 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:00:44,611 INFO L87 Difference]: Start difference. First operand 90 states and 96 transitions. Second operand has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:44,726 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:44,726 INFO L93 Difference]: Finished difference Result 88 states and 94 transitions. [2023-11-29 02:00:44,726 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:00:44,726 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 02:00:44,726 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:44,727 INFO L225 Difference]: With dead ends: 88 [2023-11-29 02:00:44,727 INFO L226 Difference]: Without dead ends: 88 [2023-11-29 02:00:44,727 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:00:44,728 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 126 mSDsluCounter, 65 mSDsCounter, 0 mSdLazyCounter, 125 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 126 SdHoareTripleChecker+Valid, 109 SdHoareTripleChecker+Invalid, 130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 125 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:44,728 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [126 Valid, 109 Invalid, 130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 125 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:00:44,729 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 88 states. [2023-11-29 02:00:44,730 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 88 to 88. [2023-11-29 02:00:44,731 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 88 states, 49 states have (on average 1.9183673469387754) internal successors, (94), 87 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 02:00:44,731 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 88 states to 88 states and 94 transitions. [2023-11-29 02:00:44,731 INFO L78 Accepts]: Start accepts. Automaton has 88 states and 94 transitions. Word has length 15 [2023-11-29 02:00:44,731 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:44,731 INFO L495 AbstractCegarLoop]: Abstraction has 88 states and 94 transitions. [2023-11-29 02:00:44,732 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.0) internal successors, (15), 5 states have internal predecessors, (15), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:00:44,732 INFO L276 IsEmpty]: Start isEmpty. Operand 88 states and 94 transitions. [2023-11-29 02:00:44,732 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 02:00:44,732 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:44,732 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:44,732 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable11 [2023-11-29 02:00:44,733 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:44,733 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:44,733 INFO L85 PathProgramCache]: Analyzing trace with hash 66317052, now seen corresponding path program 1 times [2023-11-29 02:00:44,733 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:44,733 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2002058943] [2023-11-29 02:00:44,733 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:44,734 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:44,752 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:44,797 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 02:00:44,797 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:44,798 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2002058943] [2023-11-29 02:00:44,798 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2002058943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:44,798 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:44,798 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:00:44,798 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2003095724] [2023-11-29 02:00:44,798 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:44,799 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:00:44,799 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:44,799 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:00:44,799 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:00:44,799 INFO L87 Difference]: Start difference. First operand 88 states and 94 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 02:00:44,935 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:44,935 INFO L93 Difference]: Finished difference Result 107 states and 114 transitions. [2023-11-29 02:00:44,936 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:00:44,936 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 02:00:44,936 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:44,937 INFO L225 Difference]: With dead ends: 107 [2023-11-29 02:00:44,937 INFO L226 Difference]: Without dead ends: 107 [2023-11-29 02:00:44,937 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 02:00:44,938 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 113 mSDsluCounter, 69 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 113 SdHoareTripleChecker+Valid, 105 SdHoareTripleChecker+Invalid, 181 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:44,938 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [113 Valid, 105 Invalid, 181 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:00:44,939 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 107 states. [2023-11-29 02:00:44,940 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 107 to 85. [2023-11-29 02:00:44,941 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 85 states, 50 states have (on average 1.84) internal successors, (92), 84 states have internal predecessors, (92), 0 states have call successors, (0), 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 02:00:44,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 85 states to 85 states and 92 transitions. [2023-11-29 02:00:44,941 INFO L78 Accepts]: Start accepts. Automaton has 85 states and 92 transitions. Word has length 16 [2023-11-29 02:00:44,941 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:44,941 INFO L495 AbstractCegarLoop]: Abstraction has 85 states and 92 transitions. [2023-11-29 02:00:44,942 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 02:00:44,942 INFO L276 IsEmpty]: Start isEmpty. Operand 85 states and 92 transitions. [2023-11-29 02:00:44,942 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 02:00:44,942 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:44,942 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:44,942 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable12 [2023-11-29 02:00:44,943 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr49REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:44,943 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:44,943 INFO L85 PathProgramCache]: Analyzing trace with hash 66317053, now seen corresponding path program 1 times [2023-11-29 02:00:44,943 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:44,943 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [991935031] [2023-11-29 02:00:44,943 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:44,943 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:44,969 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:45,070 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 02:00:45,070 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:45,071 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [991935031] [2023-11-29 02:00:45,071 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [991935031] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:45,071 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:45,071 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:00:45,071 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [230921692] [2023-11-29 02:00:45,071 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:45,071 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 02:00:45,072 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:45,072 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 02:00:45,072 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 02:00:45,072 INFO L87 Difference]: Start difference. First operand 85 states and 92 transitions. Second operand has 6 states, 5 states have (on average 3.2) 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 02:00:45,222 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:45,222 INFO L93 Difference]: Finished difference Result 80 states and 86 transitions. [2023-11-29 02:00:45,222 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:00:45,222 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 3.2) 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 02:00:45,223 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:45,223 INFO L225 Difference]: With dead ends: 80 [2023-11-29 02:00:45,223 INFO L226 Difference]: Without dead ends: 80 [2023-11-29 02:00:45,223 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 5 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 3 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:00:45,224 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 89 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 178 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 89 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 185 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 178 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:45,225 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [89 Valid, 131 Invalid, 185 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 178 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:00:45,225 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 80 states. [2023-11-29 02:00:45,226 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 80 to 80. [2023-11-29 02:00:45,227 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 80 states, 50 states have (on average 1.72) internal successors, (86), 79 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 02:00:45,227 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 80 states to 80 states and 86 transitions. [2023-11-29 02:00:45,227 INFO L78 Accepts]: Start accepts. Automaton has 80 states and 86 transitions. Word has length 16 [2023-11-29 02:00:45,228 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:45,228 INFO L495 AbstractCegarLoop]: Abstraction has 80 states and 86 transitions. [2023-11-29 02:00:45,228 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 3.2) 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 02:00:45,228 INFO L276 IsEmpty]: Start isEmpty. Operand 80 states and 86 transitions. [2023-11-29 02:00:45,228 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 02:00:45,228 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:45,228 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:45,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable13 [2023-11-29 02:00:45,229 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:45,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:45,229 INFO L85 PathProgramCache]: Analyzing trace with hash 66320432, now seen corresponding path program 1 times [2023-11-29 02:00:45,229 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:45,229 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [2100208747] [2023-11-29 02:00:45,229 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:45,230 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:45,247 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:45,336 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 02:00:45,336 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:45,336 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [2100208747] [2023-11-29 02:00:45,336 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [2100208747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:45,336 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:45,336 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:00:45,336 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1211922833] [2023-11-29 02:00:45,336 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:45,337 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:00:45,337 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:45,337 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:00:45,337 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:00:45,337 INFO L87 Difference]: Start difference. First operand 80 states and 86 transitions. Second operand has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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 02:00:45,516 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:45,516 INFO L93 Difference]: Finished difference Result 89 states and 96 transitions. [2023-11-29 02:00:45,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:00:45,516 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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 02:00:45,517 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:45,517 INFO L225 Difference]: With dead ends: 89 [2023-11-29 02:00:45,517 INFO L226 Difference]: Without dead ends: 89 [2023-11-29 02:00:45,518 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:00:45,518 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 142 mSDsluCounter, 96 mSDsCounter, 0 mSdLazyCounter, 214 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 131 SdHoareTripleChecker+Invalid, 222 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 214 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:45,518 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 131 Invalid, 222 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 214 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:00:45,519 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 89 states. [2023-11-29 02:00:45,520 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 89 to 77. [2023-11-29 02:00:45,521 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 77 states, 51 states have (on average 1.6470588235294117) internal successors, (84), 76 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 02:00:45,521 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 77 states to 77 states and 84 transitions. [2023-11-29 02:00:45,521 INFO L78 Accepts]: Start accepts. Automaton has 77 states and 84 transitions. Word has length 16 [2023-11-29 02:00:45,521 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:45,521 INFO L495 AbstractCegarLoop]: Abstraction has 77 states and 84 transitions. [2023-11-29 02:00:45,522 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 2.6666666666666665) internal successors, (16), 7 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 02:00:45,522 INFO L276 IsEmpty]: Start isEmpty. Operand 77 states and 84 transitions. [2023-11-29 02:00:45,522 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 02:00:45,522 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:45,522 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:45,523 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable14 [2023-11-29 02:00:45,523 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:45,523 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:45,523 INFO L85 PathProgramCache]: Analyzing trace with hash 66320433, now seen corresponding path program 1 times [2023-11-29 02:00:45,523 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:45,523 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1619295140] [2023-11-29 02:00:45,523 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:45,524 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:45,544 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:45,813 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 02:00:45,813 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:45,813 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1619295140] [2023-11-29 02:00:45,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1619295140] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:45,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:45,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:00:45,814 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [487141501] [2023-11-29 02:00:45,814 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:45,814 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:00:45,814 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:45,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:00:45,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:00:45,815 INFO L87 Difference]: Start difference. First operand 77 states and 84 transitions. Second operand has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 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 02:00:46,050 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:46,050 INFO L93 Difference]: Finished difference Result 121 states and 132 transitions. [2023-11-29 02:00:46,051 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 02:00:46,051 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 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 02:00:46,051 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:46,052 INFO L225 Difference]: With dead ends: 121 [2023-11-29 02:00:46,052 INFO L226 Difference]: Without dead ends: 121 [2023-11-29 02:00:46,052 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:00:46,053 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 207 mSDsluCounter, 130 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 207 SdHoareTripleChecker+Valid, 164 SdHoareTripleChecker+Invalid, 245 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:46,053 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [207 Valid, 164 Invalid, 245 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:00:46,054 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 121 states. [2023-11-29 02:00:46,056 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 121 to 95. [2023-11-29 02:00:46,057 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 95 states, 69 states have (on average 1.710144927536232) internal successors, (118), 94 states have internal predecessors, (118), 0 states have call successors, (0), 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 02:00:46,057 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 95 states to 95 states and 118 transitions. [2023-11-29 02:00:46,058 INFO L78 Accepts]: Start accepts. Automaton has 95 states and 118 transitions. Word has length 16 [2023-11-29 02:00:46,058 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:46,058 INFO L495 AbstractCegarLoop]: Abstraction has 95 states and 118 transitions. [2023-11-29 02:00:46,058 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 1.6) internal successors, (16), 10 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 02:00:46,058 INFO L276 IsEmpty]: Start isEmpty. Operand 95 states and 118 transitions. [2023-11-29 02:00:46,059 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 02:00:46,059 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:46,059 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:46,059 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable15 [2023-11-29 02:00:46,059 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:46,059 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:46,059 INFO L85 PathProgramCache]: Analyzing trace with hash -33533053, now seen corresponding path program 1 times [2023-11-29 02:00:46,059 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:46,060 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [712233194] [2023-11-29 02:00:46,060 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:46,060 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:46,077 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:46,226 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 02:00:46,226 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:46,226 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [712233194] [2023-11-29 02:00:46,226 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [712233194] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:46,226 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:46,226 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:00:46,227 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1523074493] [2023-11-29 02:00:46,227 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:46,227 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:00:46,227 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:46,228 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:00:46,228 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:00:46,228 INFO L87 Difference]: Start difference. First operand 95 states and 118 transitions. Second operand has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 02:00:46,345 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:46,345 INFO L93 Difference]: Finished difference Result 102 states and 125 transitions. [2023-11-29 02:00:46,346 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 02:00:46,346 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 19 [2023-11-29 02:00:46,346 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:46,348 INFO L225 Difference]: With dead ends: 102 [2023-11-29 02:00:46,348 INFO L226 Difference]: Without dead ends: 102 [2023-11-29 02:00:46,348 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:00:46,349 INFO L413 NwaCegarLoop]: 55 mSDtfsCounter, 60 mSDsluCounter, 232 mSDsCounter, 0 mSdLazyCounter, 138 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 60 SdHoareTripleChecker+Valid, 287 SdHoareTripleChecker+Invalid, 138 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 138 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:46,349 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [60 Valid, 287 Invalid, 138 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 138 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:00:46,349 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 102 states. [2023-11-29 02:00:46,352 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 102 to 96. [2023-11-29 02:00:46,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 96 states, 70 states have (on average 1.7) internal successors, (119), 95 states have internal predecessors, (119), 0 states have call successors, (0), 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 02:00:46,353 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 96 states to 96 states and 119 transitions. [2023-11-29 02:00:46,353 INFO L78 Accepts]: Start accepts. Automaton has 96 states and 119 transitions. Word has length 19 [2023-11-29 02:00:46,353 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:46,353 INFO L495 AbstractCegarLoop]: Abstraction has 96 states and 119 transitions. [2023-11-29 02:00:46,353 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 6 states have internal predecessors, (19), 0 states have call successors, (0), 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 02:00:46,353 INFO L276 IsEmpty]: Start isEmpty. Operand 96 states and 119 transitions. [2023-11-29 02:00:46,354 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 02:00:46,354 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:46,354 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:46,354 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable16 [2023-11-29 02:00:46,355 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:46,355 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:46,355 INFO L85 PathProgramCache]: Analyzing trace with hash -1039448246, now seen corresponding path program 1 times [2023-11-29 02:00:46,355 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:46,355 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1350961920] [2023-11-29 02:00:46,355 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:46,355 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:46,377 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:46,495 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 02:00:46,495 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:46,495 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1350961920] [2023-11-29 02:00:46,495 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1350961920] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:46,495 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:46,495 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 02:00:46,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1743688255] [2023-11-29 02:00:46,496 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:46,496 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:00:46,496 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:46,496 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:00:46,497 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:00:46,497 INFO L87 Difference]: Start difference. First operand 96 states and 119 transitions. Second operand has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 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 02:00:46,671 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:46,671 INFO L93 Difference]: Finished difference Result 101 states and 124 transitions. [2023-11-29 02:00:46,671 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:00:46,672 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 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 02:00:46,672 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:46,672 INFO L225 Difference]: With dead ends: 101 [2023-11-29 02:00:46,673 INFO L226 Difference]: Without dead ends: 101 [2023-11-29 02:00:46,673 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:00:46,673 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 56 mSDsluCounter, 149 mSDsCounter, 0 mSdLazyCounter, 237 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 56 SdHoareTripleChecker+Valid, 190 SdHoareTripleChecker+Invalid, 239 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 237 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:46,674 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [56 Valid, 190 Invalid, 239 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 237 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:00:46,674 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 101 states. [2023-11-29 02:00:46,676 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 101 to 99. [2023-11-29 02:00:46,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 73 states have (on average 1.6849315068493151) internal successors, (123), 98 states have internal predecessors, (123), 0 states have call successors, (0), 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 02:00:46,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 123 transitions. [2023-11-29 02:00:46,677 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 123 transitions. Word has length 20 [2023-11-29 02:00:46,677 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:46,677 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 123 transitions. [2023-11-29 02:00:46,677 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.3333333333333335) internal successors, (20), 7 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 02:00:46,677 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 123 transitions. [2023-11-29 02:00:46,678 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 02:00:46,678 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:46,678 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:46,678 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable17 [2023-11-29 02:00:46,678 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:46,679 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:46,679 INFO L85 PathProgramCache]: Analyzing trace with hash -1039448245, now seen corresponding path program 1 times [2023-11-29 02:00:46,679 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:46,679 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1156278413] [2023-11-29 02:00:46,679 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:46,679 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:46,700 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:46,976 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 02:00:46,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:46,977 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1156278413] [2023-11-29 02:00:46,977 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1156278413] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:46,977 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:46,977 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [9] imperfect sequences [] total 9 [2023-11-29 02:00:46,977 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1584549059] [2023-11-29 02:00:46,977 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:46,977 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 02:00:46,978 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:46,978 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 02:00:46,978 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=26, Invalid=84, Unknown=0, NotChecked=0, Total=110 [2023-11-29 02:00:46,978 INFO L87 Difference]: Start difference. First operand 99 states and 123 transitions. Second operand has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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 02:00:47,169 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:47,169 INFO L93 Difference]: Finished difference Result 100 states and 123 transitions. [2023-11-29 02:00:47,169 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 02:00:47,169 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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 02:00:47,170 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:47,170 INFO L225 Difference]: With dead ends: 100 [2023-11-29 02:00:47,170 INFO L226 Difference]: Without dead ends: 100 [2023-11-29 02:00:47,171 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 27 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=36, Invalid=120, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:00:47,171 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 55 mSDsluCounter, 151 mSDsCounter, 0 mSdLazyCounter, 257 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 55 SdHoareTripleChecker+Valid, 187 SdHoareTripleChecker+Invalid, 258 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 257 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:47,172 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [55 Valid, 187 Invalid, 258 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 257 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:00:47,172 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 100 states. [2023-11-29 02:00:47,174 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 100 to 99. [2023-11-29 02:00:47,174 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 99 states, 73 states have (on average 1.6712328767123288) internal successors, (122), 98 states have internal predecessors, (122), 0 states have call successors, (0), 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 02:00:47,175 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 99 states to 99 states and 122 transitions. [2023-11-29 02:00:47,175 INFO L78 Accepts]: Start accepts. Automaton has 99 states and 122 transitions. Word has length 20 [2023-11-29 02:00:47,175 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:47,175 INFO L495 AbstractCegarLoop]: Abstraction has 99 states and 122 transitions. [2023-11-29 02:00:47,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 10 states have (on average 2.0) internal successors, (20), 10 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 02:00:47,175 INFO L276 IsEmpty]: Start isEmpty. Operand 99 states and 122 transitions. [2023-11-29 02:00:47,176 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 02:00:47,176 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:47,176 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:47,176 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable18 [2023-11-29 02:00:47,176 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:47,177 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:47,177 INFO L85 PathProgramCache]: Analyzing trace with hash 152939461, now seen corresponding path program 1 times [2023-11-29 02:00:47,177 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:47,177 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1169497267] [2023-11-29 02:00:47,177 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:47,177 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:47,193 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:47,221 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 02:00:47,221 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:47,221 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1169497267] [2023-11-29 02:00:47,222 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1169497267] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:47,222 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:47,222 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:00:47,222 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [765877869] [2023-11-29 02:00:47,222 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:47,222 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 02:00:47,222 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:47,223 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 02:00:47,223 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 02:00:47,223 INFO L87 Difference]: Start difference. First operand 99 states and 122 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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 02:00:47,313 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:47,313 INFO L93 Difference]: Finished difference Result 99 states and 120 transitions. [2023-11-29 02:00:47,313 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 02:00:47,314 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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 02:00:47,314 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:47,315 INFO L225 Difference]: With dead ends: 99 [2023-11-29 02:00:47,315 INFO L226 Difference]: Without dead ends: 99 [2023-11-29 02:00:47,315 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 1 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 02:00:47,315 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 58 mSDsluCounter, 31 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 6 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 58 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 6 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:47,316 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [58 Valid, 76 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [6 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:00:47,316 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 99 states. [2023-11-29 02:00:47,318 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 99 to 98. [2023-11-29 02:00:47,319 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 98 states, 75 states have (on average 1.6) internal successors, (120), 97 states have internal predecessors, (120), 0 states have call successors, (0), 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 02:00:47,319 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 98 states to 98 states and 120 transitions. [2023-11-29 02:00:47,319 INFO L78 Accepts]: Start accepts. Automaton has 98 states and 120 transitions. Word has length 21 [2023-11-29 02:00:47,320 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:47,320 INFO L495 AbstractCegarLoop]: Abstraction has 98 states and 120 transitions. [2023-11-29 02:00:47,320 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 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 02:00:47,320 INFO L276 IsEmpty]: Start isEmpty. Operand 98 states and 120 transitions. [2023-11-29 02:00:47,320 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 02:00:47,320 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:47,321 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:47,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable19 [2023-11-29 02:00:47,321 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:47,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:47,321 INFO L85 PathProgramCache]: Analyzing trace with hash 152939462, now seen corresponding path program 1 times [2023-11-29 02:00:47,321 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:47,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [81162747] [2023-11-29 02:00:47,322 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:47,322 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:47,343 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:47,513 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 02:00:47,514 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:47,514 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [81162747] [2023-11-29 02:00:47,514 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [81162747] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:00:47,514 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:00:47,514 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 02:00:47,514 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1642280382] [2023-11-29 02:00:47,514 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:00:47,515 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 9 states [2023-11-29 02:00:47,515 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:47,515 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 9 interpolants. [2023-11-29 02:00:47,515 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=56, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:00:47,515 INFO L87 Difference]: Start difference. First operand 98 states and 120 transitions. Second operand has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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 02:00:47,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:47,764 INFO L93 Difference]: Finished difference Result 114 states and 128 transitions. [2023-11-29 02:00:47,764 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:00:47,764 INFO L78 Accepts]: Start accepts. Automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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 02:00:47,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:47,765 INFO L225 Difference]: With dead ends: 114 [2023-11-29 02:00:47,765 INFO L226 Difference]: Without dead ends: 114 [2023-11-29 02:00:47,766 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 12 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 2 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=44, Invalid=112, Unknown=0, NotChecked=0, Total=156 [2023-11-29 02:00:47,766 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 212 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 268 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 257 SdHoareTripleChecker+Invalid, 271 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 268 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:47,767 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 257 Invalid, 271 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 268 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:00:47,767 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 114 states. [2023-11-29 02:00:47,769 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 114 to 102. [2023-11-29 02:00:47,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 102 states, 79 states have (on average 1.5822784810126582) internal successors, (125), 101 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 02:00:47,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 102 states to 102 states and 125 transitions. [2023-11-29 02:00:47,770 INFO L78 Accepts]: Start accepts. Automaton has 102 states and 125 transitions. Word has length 21 [2023-11-29 02:00:47,771 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:47,771 INFO L495 AbstractCegarLoop]: Abstraction has 102 states and 125 transitions. [2023-11-29 02:00:47,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 9 states, 8 states have (on average 2.625) internal successors, (21), 8 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 02:00:47,771 INFO L276 IsEmpty]: Start isEmpty. Operand 102 states and 125 transitions. [2023-11-29 02:00:47,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 02:00:47,771 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:47,771 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:47,772 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable20 [2023-11-29 02:00:47,772 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:47,772 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:47,772 INFO L85 PathProgramCache]: Analyzing trace with hash 152945042, now seen corresponding path program 1 times [2023-11-29 02:00:47,772 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:47,772 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1462234243] [2023-11-29 02:00:47,773 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:47,773 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:47,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:48,541 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 02:00:48,542 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:00:48,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1462234243] [2023-11-29 02:00:48,542 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1462234243] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:00:48,542 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [413446375] [2023-11-29 02:00:48,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:48,542 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:00:48,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:00:48,547 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:00:48,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Waiting until timeout for monitored process [2023-11-29 02:00:48,703 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:00:48,706 INFO L262 TraceCheckSpWp]: Trace formula consists of 246 conjuncts, 56 conjunts are in the unsatisfiable core [2023-11-29 02:00:48,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:00:48,761 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 02:00:48,770 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 02:00:48,808 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 15 treesize of output 1 [2023-11-29 02:00:48,830 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-29 02:00:48,831 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 21 treesize of output 29 [2023-11-29 02:00:48,888 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 37 treesize of output 21 [2023-11-29 02:00:48,896 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 8 treesize of output 1 [2023-11-29 02:00:49,098 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 29 treesize of output 21 [2023-11-29 02:00:49,294 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 38 treesize of output 25 [2023-11-29 02:00:49,320 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2023-11-29 02:00:49,447 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 0 case distinctions, treesize of input 59 treesize of output 31 [2023-11-29 02:00:49,453 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 37 treesize of output 25 [2023-11-29 02:00:49,532 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 31 treesize of output 13 [2023-11-29 02:00:49,596 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 02:00:49,597 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:00:49,728 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_780 (Array Int Int))) (= (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_780) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 4))) 1)) is different from false [2023-11-29 02:00:53,737 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_780 (Array Int Int))) (= (select |c_#valid| (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem11#1.base| v_ArrVal_779) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_780) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 4))) 1)) is different from false [2023-11-29 02:00:57,748 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_779 (Array Int Int)) (v_ArrVal_780 (Array Int Int))) (= (select |c_#valid| (select (let ((.cse0 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|))) (select (store (store |c_#memory_$Pointer$#1.base| (select .cse0 (+ |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset| 4)) v_ArrVal_779) |c_ULTIMATE.start_create_sl_with_head_and_tail_#t~mem10#1.base| v_ArrVal_780) (select .cse0 |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|))) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.base|) |c_ULTIMATE.start_create_sl_with_head_and_tail_~sl~0#1.offset|) 4))) 1)) is different from false [2023-11-29 02:00:57,864 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:00:57,864 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 38 treesize of output 39 [2023-11-29 02:00:57,875 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:00:57,875 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 72 treesize of output 71 [2023-11-29 02:00:57,918 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 13 treesize of output 5 [2023-11-29 02:00:58,355 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 02:00:58,355 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [413446375] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:00:58,355 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:00:58,355 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 12, 13] total 37 [2023-11-29 02:00:58,355 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1844178346] [2023-11-29 02:00:58,356 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:00:58,356 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 39 states [2023-11-29 02:00:58,356 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:00:58,357 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 39 interpolants. [2023-11-29 02:00:58,358 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=121, Invalid=1136, Unknown=15, NotChecked=210, Total=1482 [2023-11-29 02:00:58,358 INFO L87 Difference]: Start difference. First operand 102 states and 125 transitions. Second operand has 39 states, 38 states have (on average 1.631578947368421) internal successors, (62), 38 states have internal predecessors, (62), 0 states have call successors, (0), 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 02:00:59,595 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:00:59,595 INFO L93 Difference]: Finished difference Result 164 states and 199 transitions. [2023-11-29 02:00:59,596 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 02:00:59,596 INFO L78 Accepts]: Start accepts. Automaton has has 39 states, 38 states have (on average 1.631578947368421) internal successors, (62), 38 states have internal predecessors, (62), 0 states have call successors, (0), 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 02:00:59,596 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:00:59,597 INFO L225 Difference]: With dead ends: 164 [2023-11-29 02:00:59,597 INFO L226 Difference]: Without dead ends: 164 [2023-11-29 02:00:59,598 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 65 GetRequests, 16 SyntacticMatches, 1 SemanticMatches, 48 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 351 ImplicationChecksByTransitivity, 9.8s TimeCoverageRelationStatistics Valid=233, Invalid=1926, Unknown=15, NotChecked=276, Total=2450 [2023-11-29 02:00:59,599 INFO L413 NwaCegarLoop]: 34 mSDtfsCounter, 416 mSDsluCounter, 572 mSDsCounter, 0 mSdLazyCounter, 915 mSolverCounterSat, 21 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 416 SdHoareTripleChecker+Valid, 606 SdHoareTripleChecker+Invalid, 1317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 21 IncrementalHoareTripleChecker+Valid, 915 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 381 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:00:59,599 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [416 Valid, 606 Invalid, 1317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [21 Valid, 915 Invalid, 0 Unknown, 381 Unchecked, 0.6s Time] [2023-11-29 02:00:59,600 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 164 states. [2023-11-29 02:00:59,603 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 164 to 111. [2023-11-29 02:00:59,603 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.5681818181818181) internal successors, (138), 110 states have internal predecessors, (138), 0 states have call successors, (0), 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 02:00:59,604 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 138 transitions. [2023-11-29 02:00:59,604 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 138 transitions. Word has length 21 [2023-11-29 02:00:59,604 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:00:59,604 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 138 transitions. [2023-11-29 02:00:59,604 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 39 states, 38 states have (on average 1.631578947368421) internal successors, (62), 38 states have internal predecessors, (62), 0 states have call successors, (0), 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 02:00:59,604 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 138 transitions. [2023-11-29 02:00:59,605 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 22 [2023-11-29 02:00:59,605 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:00:59,605 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:00:59,619 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (2)] Forceful destruction successful, exit code 0 [2023-11-29 02:00:59,811 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable21 [2023-11-29 02:00:59,811 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:00:59,812 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:00:59,812 INFO L85 PathProgramCache]: Analyzing trace with hash 152945043, now seen corresponding path program 1 times [2023-11-29 02:00:59,812 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:00:59,812 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1031890654] [2023-11-29 02:00:59,812 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:00:59,812 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:00:59,837 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:00,723 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 02:01:00,723 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:00,723 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1031890654] [2023-11-29 02:01:00,723 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1031890654] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:00,723 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:00,724 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [15] imperfect sequences [] total 15 [2023-11-29 02:01:00,724 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [432585514] [2023-11-29 02:01:00,724 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:00,724 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 02:01:00,724 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:00,725 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 02:01:00,725 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=37, Invalid=203, Unknown=0, NotChecked=0, Total=240 [2023-11-29 02:01:00,725 INFO L87 Difference]: Start difference. First operand 111 states and 138 transitions. Second operand has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 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 02:01:01,299 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:01:01,300 INFO L93 Difference]: Finished difference Result 136 states and 164 transitions. [2023-11-29 02:01:01,300 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 15 states. [2023-11-29 02:01:01,300 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 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 02:01:01,300 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:01:01,301 INFO L225 Difference]: With dead ends: 136 [2023-11-29 02:01:01,301 INFO L226 Difference]: Without dead ends: 136 [2023-11-29 02:01:01,301 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 21 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 19 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 56 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=72, Invalid=348, Unknown=0, NotChecked=0, Total=420 [2023-11-29 02:01:01,302 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 76 mSDsluCounter, 444 mSDsCounter, 0 mSdLazyCounter, 445 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 76 SdHoareTripleChecker+Valid, 488 SdHoareTripleChecker+Invalid, 448 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 445 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:01:01,302 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [76 Valid, 488 Invalid, 448 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 445 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 02:01:01,303 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 136 states. [2023-11-29 02:01:01,305 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 136 to 109. [2023-11-29 02:01:01,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 109 states, 86 states have (on average 1.5465116279069768) internal successors, (133), 108 states have internal predecessors, (133), 0 states have call successors, (0), 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 02:01:01,306 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 109 states to 109 states and 133 transitions. [2023-11-29 02:01:01,306 INFO L78 Accepts]: Start accepts. Automaton has 109 states and 133 transitions. Word has length 21 [2023-11-29 02:01:01,306 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:01:01,306 INFO L495 AbstractCegarLoop]: Abstraction has 109 states and 133 transitions. [2023-11-29 02:01:01,306 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 1.3125) internal successors, (21), 15 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 02:01:01,306 INFO L276 IsEmpty]: Start isEmpty. Operand 109 states and 133 transitions. [2023-11-29 02:01:01,307 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 23 [2023-11-29 02:01:01,307 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:01:01,307 INFO L195 NwaCegarLoop]: trace histogram [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 02:01:01,307 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable22 [2023-11-29 02:01:01,307 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:01:01,307 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:01,308 INFO L85 PathProgramCache]: Analyzing trace with hash 1817621130, now seen corresponding path program 1 times [2023-11-29 02:01:01,308 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:01,308 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [562659740] [2023-11-29 02:01:01,308 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:01,308 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:01,328 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:01,501 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 02:01:01,501 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:01,501 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [562659740] [2023-11-29 02:01:01,501 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [562659740] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:01,501 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:01,501 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:01:01,502 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [924324060] [2023-11-29 02:01:01,502 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:01,502 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:01:01,502 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:01,502 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:01:01,503 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:01:01,503 INFO L87 Difference]: Start difference. First operand 109 states and 133 transitions. Second operand has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:01,620 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:01:01,620 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions. [2023-11-29 02:01:01,621 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:01:01,621 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 22 [2023-11-29 02:01:01,621 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:01:01,622 INFO L225 Difference]: With dead ends: 111 [2023-11-29 02:01:01,622 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 02:01:01,622 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:01:01,623 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 63 mSDsluCounter, 213 mSDsCounter, 0 mSdLazyCounter, 142 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 63 SdHoareTripleChecker+Valid, 267 SdHoareTripleChecker+Invalid, 143 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 142 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:01:01,623 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [63 Valid, 267 Invalid, 143 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 142 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:01:01,623 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 02:01:01,625 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-29 02:01:01,625 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 88 states have (on average 1.5340909090909092) internal successors, (135), 110 states have internal predecessors, (135), 0 states have call successors, (0), 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 02:01:01,626 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2023-11-29 02:01:01,626 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 22 [2023-11-29 02:01:01,626 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:01:01,626 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2023-11-29 02:01:01,626 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.6666666666666665) internal successors, (22), 6 states have internal predecessors, (22), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:01,627 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2023-11-29 02:01:01,627 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 24 [2023-11-29 02:01:01,627 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:01:01,627 INFO L195 NwaCegarLoop]: trace histogram [1, 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 02:01:01,627 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable23 [2023-11-29 02:01:01,627 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:01:01,628 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:01,628 INFO L85 PathProgramCache]: Analyzing trace with hash 511680389, now seen corresponding path program 1 times [2023-11-29 02:01:01,628 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:01,628 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1665699943] [2023-11-29 02:01:01,628 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:01,628 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:01,650 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:01,835 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 02:01:01,835 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:01,835 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1665699943] [2023-11-29 02:01:01,835 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1665699943] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:01,835 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:01,835 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 02:01:01,835 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [950067719] [2023-11-29 02:01:01,835 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:01,836 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 02:01:01,836 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:01,836 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 02:01:01,836 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=31, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:01:01,836 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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 02:01:01,983 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:01:01,983 INFO L93 Difference]: Finished difference Result 112 states and 136 transitions. [2023-11-29 02:01:01,983 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 02:01:01,983 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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 23 [2023-11-29 02:01:01,984 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:01:01,984 INFO L225 Difference]: With dead ends: 112 [2023-11-29 02:01:01,984 INFO L226 Difference]: Without dead ends: 112 [2023-11-29 02:01:01,985 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 8 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 7 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=21, Invalid=51, Unknown=0, NotChecked=0, Total=72 [2023-11-29 02:01:01,985 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 61 mSDsluCounter, 193 mSDsCounter, 0 mSdLazyCounter, 169 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 61 SdHoareTripleChecker+Valid, 242 SdHoareTripleChecker+Invalid, 170 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 169 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:01:01,985 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [61 Valid, 242 Invalid, 170 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 169 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:01:01,986 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-29 02:01:01,988 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-29 02:01:01,988 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 89 states have (on average 1.5280898876404494) internal successors, (136), 111 states have internal predecessors, (136), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:01,989 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 136 transitions. [2023-11-29 02:01:01,989 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 136 transitions. Word has length 23 [2023-11-29 02:01:01,989 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:01:01,989 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 136 transitions. [2023-11-29 02:01:01,989 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 6 states have (on average 3.8333333333333335) internal successors, (23), 6 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 02:01:01,989 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 136 transitions. [2023-11-29 02:01:01,990 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 25 [2023-11-29 02:01:01,990 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:01:01,990 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 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 02:01:01,990 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable24 [2023-11-29 02:01:01,990 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr60ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:01:01,990 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:01,991 INFO L85 PathProgramCache]: Analyzing trace with hash -1317776916, now seen corresponding path program 1 times [2023-11-29 02:01:01,991 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:01,991 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1378174480] [2023-11-29 02:01:01,991 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:01,991 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:02,009 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:02,064 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 02:01:02,064 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:02,064 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1378174480] [2023-11-29 02:01:02,064 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1378174480] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:02,064 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:02,065 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 02:01:02,065 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105950757] [2023-11-29 02:01:02,065 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:02,065 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:01:02,065 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:02,066 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:01:02,066 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:01:02,067 INFO L87 Difference]: Start difference. First operand 112 states and 136 transitions. Second operand has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:02,170 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:01:02,170 INFO L93 Difference]: Finished difference Result 111 states and 135 transitions. [2023-11-29 02:01:02,171 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 02:01:02,171 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 24 [2023-11-29 02:01:02,171 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:01:02,172 INFO L225 Difference]: With dead ends: 111 [2023-11-29 02:01:02,172 INFO L226 Difference]: Without dead ends: 111 [2023-11-29 02:01:02,172 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 1 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 02:01:02,173 INFO L413 NwaCegarLoop]: 54 mSDtfsCounter, 9 mSDsluCounter, 127 mSDsCounter, 0 mSdLazyCounter, 112 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 181 SdHoareTripleChecker+Invalid, 112 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 112 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:01:02,173 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 181 Invalid, 112 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 112 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:01:02,173 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 111 states. [2023-11-29 02:01:02,175 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 111 to 111. [2023-11-29 02:01:02,175 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 111 states, 89 states have (on average 1.5168539325842696) internal successors, (135), 110 states have internal predecessors, (135), 0 states have call successors, (0), 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 02:01:02,176 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 111 states to 111 states and 135 transitions. [2023-11-29 02:01:02,176 INFO L78 Accepts]: Start accepts. Automaton has 111 states and 135 transitions. Word has length 24 [2023-11-29 02:01:02,176 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:01:02,176 INFO L495 AbstractCegarLoop]: Abstraction has 111 states and 135 transitions. [2023-11-29 02:01:02,176 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.0) internal successors, (24), 5 states have internal predecessors, (24), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:02,177 INFO L276 IsEmpty]: Start isEmpty. Operand 111 states and 135 transitions. [2023-11-29 02:01:02,177 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 26 [2023-11-29 02:01:02,177 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:01:02,177 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:01:02,177 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable25 [2023-11-29 02:01:02,177 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:01:02,178 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:02,178 INFO L85 PathProgramCache]: Analyzing trace with hash 2098588748, now seen corresponding path program 1 times [2023-11-29 02:01:02,178 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:02,178 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1032805407] [2023-11-29 02:01:02,178 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:02,178 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:02,196 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:02,453 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 02:01:02,453 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:02,453 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1032805407] [2023-11-29 02:01:02,454 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1032805407] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:01:02,454 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [192147129] [2023-11-29 02:01:02,454 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:02,454 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:01:02,454 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:01:02,455 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:01:02,457 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Waiting until timeout for monitored process [2023-11-29 02:01:02,612 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:02,615 INFO L262 TraceCheckSpWp]: Trace formula consists of 265 conjuncts, 36 conjunts are in the unsatisfiable core [2023-11-29 02:01:02,617 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:01:02,624 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 10 treesize of output 8 [2023-11-29 02:01:02,646 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 02:01:02,666 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 24 treesize of output 12 [2023-11-29 02:01:02,764 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 16 treesize of output 8 [2023-11-29 02:01:02,789 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 02:01:02,791 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 02:01:02,791 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:01:02,837 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 02:01:02,886 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 02:01:02,886 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [192147129] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:01:02,886 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:01:02,886 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7, 7] total 14 [2023-11-29 02:01:02,887 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1166830789] [2023-11-29 02:01:02,887 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:01:02,887 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 02:01:02,887 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:02,888 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 02:01:02,888 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=42, Invalid=198, Unknown=0, NotChecked=0, Total=240 [2023-11-29 02:01:02,888 INFO L87 Difference]: Start difference. First operand 111 states and 135 transitions. Second operand has 16 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:03,133 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:01:03,133 INFO L93 Difference]: Finished difference Result 119 states and 144 transitions. [2023-11-29 02:01:03,134 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 02:01:03,134 INFO L78 Accepts]: Start accepts. Automaton has has 16 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 25 [2023-11-29 02:01:03,134 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:01:03,135 INFO L225 Difference]: With dead ends: 119 [2023-11-29 02:01:03,135 INFO L226 Difference]: Without dead ends: 119 [2023-11-29 02:01:03,135 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 59 GetRequests, 40 SyntacticMatches, 1 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 54 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=76, Invalid=304, Unknown=0, NotChecked=0, Total=380 [2023-11-29 02:01:03,135 INFO L413 NwaCegarLoop]: 35 mSDtfsCounter, 129 mSDsluCounter, 212 mSDsCounter, 0 mSdLazyCounter, 349 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 129 SdHoareTripleChecker+Valid, 247 SdHoareTripleChecker+Invalid, 354 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 349 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 02:01:03,136 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [129 Valid, 247 Invalid, 354 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 349 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 02:01:03,136 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 119 states. [2023-11-29 02:01:03,137 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 119 to 113. [2023-11-29 02:01:03,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 91 states have (on average 1.5054945054945055) internal successors, (137), 112 states have internal predecessors, (137), 0 states have call successors, (0), 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 02:01:03,138 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 137 transitions. [2023-11-29 02:01:03,138 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 137 transitions. Word has length 25 [2023-11-29 02:01:03,138 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:01:03,138 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 137 transitions. [2023-11-29 02:01:03,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 15 states have (on average 3.8) internal successors, (57), 15 states have internal predecessors, (57), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:03,138 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 137 transitions. [2023-11-29 02:01:03,139 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 02:01:03,139 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:01:03,139 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:01:03,144 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (3)] Ended with exit code 0 [2023-11-29 02:01:03,343 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable26 [2023-11-29 02:01:03,343 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:01:03,343 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:03,343 INFO L85 PathProgramCache]: Analyzing trace with hash 1882812373, now seen corresponding path program 1 times [2023-11-29 02:01:03,344 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:03,344 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [512210634] [2023-11-29 02:01:03,344 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:03,344 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:03,361 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:03,871 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 02:01:03,871 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:03,871 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [512210634] [2023-11-29 02:01:03,871 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [512210634] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:03,871 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:03,871 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [12] imperfect sequences [] total 12 [2023-11-29 02:01:03,872 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [377902013] [2023-11-29 02:01:03,872 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:03,872 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 14 states [2023-11-29 02:01:03,872 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:03,872 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 14 interpolants. [2023-11-29 02:01:03,873 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=35, Invalid=147, Unknown=0, NotChecked=0, Total=182 [2023-11-29 02:01:03,873 INFO L87 Difference]: Start difference. First operand 113 states and 137 transitions. Second operand has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:04,273 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:01:04,273 INFO L93 Difference]: Finished difference Result 132 states and 148 transitions. [2023-11-29 02:01:04,273 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-29 02:01:04,274 INFO L78 Accepts]: Start accepts. Automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 02:01:04,274 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:01:04,275 INFO L225 Difference]: With dead ends: 132 [2023-11-29 02:01:04,275 INFO L226 Difference]: Without dead ends: 132 [2023-11-29 02:01:04,275 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 2 SyntacticMatches, 0 SemanticMatches, 18 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 49 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=79, Invalid=301, Unknown=0, NotChecked=0, Total=380 [2023-11-29 02:01:04,276 INFO L413 NwaCegarLoop]: 31 mSDtfsCounter, 315 mSDsluCounter, 196 mSDsCounter, 0 mSdLazyCounter, 340 mSolverCounterSat, 19 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 315 SdHoareTripleChecker+Valid, 227 SdHoareTripleChecker+Invalid, 359 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 19 IncrementalHoareTripleChecker+Valid, 340 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:01:04,276 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [315 Valid, 227 Invalid, 359 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [19 Valid, 340 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:01:04,276 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-29 02:01:04,278 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 112. [2023-11-29 02:01:04,279 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 92 states have (on average 1.4565217391304348) internal successors, (134), 111 states have internal predecessors, (134), 0 states have call successors, (0), 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 02:01:04,279 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 134 transitions. [2023-11-29 02:01:04,279 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 134 transitions. Word has length 26 [2023-11-29 02:01:04,280 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:01:04,280 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 134 transitions. [2023-11-29 02:01:04,280 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 14 states, 13 states have (on average 2.0) internal successors, (26), 13 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:04,280 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 134 transitions. [2023-11-29 02:01:04,280 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 02:01:04,280 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:01:04,281 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:01:04,281 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable27 [2023-11-29 02:01:04,281 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:01:04,281 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:04,281 INFO L85 PathProgramCache]: Analyzing trace with hash 1882817182, now seen corresponding path program 1 times [2023-11-29 02:01:04,281 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:04,282 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [482995824] [2023-11-29 02:01:04,282 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:04,282 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:04,301 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:04,976 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 02:01:04,976 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:04,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [482995824] [2023-11-29 02:01:04,976 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [482995824] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:01:04,976 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [9756124] [2023-11-29 02:01:04,976 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:04,976 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:01:04,976 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:01:04,977 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:01:04,978 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Waiting until timeout for monitored process [2023-11-29 02:01:05,108 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:05,111 INFO L262 TraceCheckSpWp]: Trace formula consists of 269 conjuncts, 89 conjunts are in the unsatisfiable core [2023-11-29 02:01:05,115 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:01:05,125 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 02:01:05,133 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 02:01:05,176 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 02:01:05,176 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 15 treesize of output 15 [2023-11-29 02:01:05,183 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 02:01:05,186 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 02:01:05,224 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 02:01:05,230 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-29 02:01:05,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 02:01:05,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 02:01:05,496 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 27 treesize of output 23 [2023-11-29 02:01:05,503 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 39 treesize of output 34 [2023-11-29 02:01:05,720 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2023-11-29 02:01:05,730 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 36 treesize of output 17 [2023-11-29 02:01:05,753 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 36 treesize of output 17 [2023-11-29 02:01:05,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 1 new quantified variables, introduced 0 case distinctions, treesize of input 47 treesize of output 28 [2023-11-29 02:01:05,904 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 0 case distinctions, treesize of input 69 treesize of output 33 [2023-11-29 02:01:06,133 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 0 case distinctions, treesize of input 11 treesize of output 3 [2023-11-29 02:01:06,177 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 02:01:06,178 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 02:01:06,178 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [9756124] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:06,178 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 02:01:06,178 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [17] imperfect sequences [16] total 33 [2023-11-29 02:01:06,178 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [582318731] [2023-11-29 02:01:06,178 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:06,178 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 18 states [2023-11-29 02:01:06,179 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:06,179 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 18 interpolants. [2023-11-29 02:01:06,180 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=88, Invalid=1034, Unknown=0, NotChecked=0, Total=1122 [2023-11-29 02:01:06,180 INFO L87 Difference]: Start difference. First operand 112 states and 134 transitions. Second operand has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:06,913 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:01:06,913 INFO L93 Difference]: Finished difference Result 129 states and 151 transitions. [2023-11-29 02:01:06,913 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 02:01:06,913 INFO L78 Accepts]: Start accepts. Automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 02:01:06,913 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:01:06,914 INFO L225 Difference]: With dead ends: 129 [2023-11-29 02:01:06,914 INFO L226 Difference]: Without dead ends: 129 [2023-11-29 02:01:06,915 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 48 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 38 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 238 ImplicationChecksByTransitivity, 1.3s TimeCoverageRelationStatistics Valid=135, Invalid=1425, Unknown=0, NotChecked=0, Total=1560 [2023-11-29 02:01:06,915 INFO L413 NwaCegarLoop]: 41 mSDtfsCounter, 51 mSDsluCounter, 332 mSDsCounter, 0 mSdLazyCounter, 379 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 51 SdHoareTripleChecker+Valid, 373 SdHoareTripleChecker+Invalid, 381 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 379 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 02:01:06,915 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [51 Valid, 373 Invalid, 381 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 379 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 02:01:06,916 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 129 states. [2023-11-29 02:01:06,917 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 129 to 117. [2023-11-29 02:01:06,917 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 117 states, 97 states have (on average 1.4329896907216495) internal successors, (139), 116 states have internal predecessors, (139), 0 states have call successors, (0), 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 02:01:06,918 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 117 states to 117 states and 139 transitions. [2023-11-29 02:01:06,918 INFO L78 Accepts]: Start accepts. Automaton has 117 states and 139 transitions. Word has length 26 [2023-11-29 02:01:06,918 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:01:06,918 INFO L495 AbstractCegarLoop]: Abstraction has 117 states and 139 transitions. [2023-11-29 02:01:06,918 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 18 states, 18 states have (on average 1.4444444444444444) internal successors, (26), 17 states have internal predecessors, (26), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:06,918 INFO L276 IsEmpty]: Start isEmpty. Operand 117 states and 139 transitions. [2023-11-29 02:01:06,918 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 02:01:06,919 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:01:06,919 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:01:06,924 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (4)] Ended with exit code 0 [2023-11-29 02:01:07,119 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable28 [2023-11-29 02:01:07,119 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr38REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:01:07,120 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:07,120 INFO L85 PathProgramCache]: Analyzing trace with hash -1760511481, now seen corresponding path program 1 times [2023-11-29 02:01:07,120 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:07,120 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1049615859] [2023-11-29 02:01:07,120 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:07,120 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:07,138 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:07,175 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 02:01:07,175 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:07,175 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1049615859] [2023-11-29 02:01:07,175 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1049615859] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:07,175 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:07,175 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:01:07,175 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1192637381] [2023-11-29 02:01:07,176 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:07,176 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:01:07,176 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:07,176 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:01:07,176 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:01:07,177 INFO L87 Difference]: Start difference. First operand 117 states and 139 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:07,246 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:01:07,246 INFO L93 Difference]: Finished difference Result 115 states and 135 transitions. [2023-11-29 02:01:07,246 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:01:07,246 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 02:01:07,247 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:01:07,247 INFO L225 Difference]: With dead ends: 115 [2023-11-29 02:01:07,247 INFO L226 Difference]: Without dead ends: 115 [2023-11-29 02:01:07,248 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 02:01:07,248 INFO L413 NwaCegarLoop]: 52 mSDtfsCounter, 12 mSDsluCounter, 26 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 12 SdHoareTripleChecker+Valid, 78 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:01:07,248 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [12 Valid, 78 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:01:07,249 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 115 states. [2023-11-29 02:01:07,251 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 115 to 115. [2023-11-29 02:01:07,251 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 115 states, 97 states have (on average 1.3917525773195876) internal successors, (135), 114 states have internal predecessors, (135), 0 states have call successors, (0), 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 02:01:07,252 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 115 states to 115 states and 135 transitions. [2023-11-29 02:01:07,252 INFO L78 Accepts]: Start accepts. Automaton has 115 states and 135 transitions. Word has length 27 [2023-11-29 02:01:07,252 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:01:07,252 INFO L495 AbstractCegarLoop]: Abstraction has 115 states and 135 transitions. [2023-11-29 02:01:07,252 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:07,252 INFO L276 IsEmpty]: Start isEmpty. Operand 115 states and 135 transitions. [2023-11-29 02:01:07,253 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 02:01:07,253 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:01:07,253 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:01:07,253 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable29 [2023-11-29 02:01:07,253 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr39REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:01:07,254 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:07,254 INFO L85 PathProgramCache]: Analyzing trace with hash -1760511480, now seen corresponding path program 1 times [2023-11-29 02:01:07,254 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:07,254 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1042938005] [2023-11-29 02:01:07,254 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:07,254 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:07,273 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:07,328 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 02:01:07,328 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:07,329 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1042938005] [2023-11-29 02:01:07,329 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1042938005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:07,329 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:07,329 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 02:01:07,329 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [692652517] [2023-11-29 02:01:07,329 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:07,329 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 02:01:07,329 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:07,330 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 02:01:07,330 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 02:01:07,330 INFO L87 Difference]: Start difference. First operand 115 states and 135 transitions. Second operand has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:07,393 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:01:07,394 INFO L93 Difference]: Finished difference Result 113 states and 131 transitions. [2023-11-29 02:01:07,394 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 02:01:07,394 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 02:01:07,394 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:01:07,395 INFO L225 Difference]: With dead ends: 113 [2023-11-29 02:01:07,395 INFO L226 Difference]: Without dead ends: 113 [2023-11-29 02:01:07,395 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 02:01:07,396 INFO L413 NwaCegarLoop]: 49 mSDtfsCounter, 10 mSDsluCounter, 27 mSDsCounter, 0 mSdLazyCounter, 54 mSolverCounterSat, 1 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 10 SdHoareTripleChecker+Valid, 76 SdHoareTripleChecker+Invalid, 55 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 1 IncrementalHoareTripleChecker+Valid, 54 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:01:07,396 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [10 Valid, 76 Invalid, 55 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [1 Valid, 54 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:01:07,396 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-29 02:01:07,398 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 113. [2023-11-29 02:01:07,398 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 113 states, 97 states have (on average 1.3505154639175259) internal successors, (131), 112 states have internal predecessors, (131), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:07,399 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 113 states to 113 states and 131 transitions. [2023-11-29 02:01:07,399 INFO L78 Accepts]: Start accepts. Automaton has 113 states and 131 transitions. Word has length 27 [2023-11-29 02:01:07,399 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:01:07,399 INFO L495 AbstractCegarLoop]: Abstraction has 113 states and 131 transitions. [2023-11-29 02:01:07,399 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 13.5) internal successors, (27), 3 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:07,399 INFO L276 IsEmpty]: Start isEmpty. Operand 113 states and 131 transitions. [2023-11-29 02:01:07,399 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 02:01:07,399 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:01:07,400 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:01:07,400 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable30 [2023-11-29 02:01:07,400 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr62ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:01:07,400 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:07,400 INFO L85 PathProgramCache]: Analyzing trace with hash 1513558067, now seen corresponding path program 1 times [2023-11-29 02:01:07,401 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:07,401 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [515233071] [2023-11-29 02:01:07,401 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:07,401 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:07,419 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:07,482 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 02:01:07,482 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:07,482 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [515233071] [2023-11-29 02:01:07,482 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [515233071] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 02:01:07,482 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 02:01:07,482 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 02:01:07,482 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [802145722] [2023-11-29 02:01:07,482 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 02:01:07,483 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 02:01:07,483 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:07,483 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 02:01:07,483 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 02:01:07,484 INFO L87 Difference]: Start difference. First operand 113 states and 131 transitions. Second operand has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:07,568 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:01:07,568 INFO L93 Difference]: Finished difference Result 112 states and 130 transitions. [2023-11-29 02:01:07,569 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 02:01:07,569 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 02:01:07,569 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:01:07,570 INFO L225 Difference]: With dead ends: 112 [2023-11-29 02:01:07,570 INFO L226 Difference]: Without dead ends: 112 [2023-11-29 02:01:07,570 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 4 GetRequests, 0 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 02:01:07,570 INFO L413 NwaCegarLoop]: 40 mSDtfsCounter, 62 mSDsluCounter, 71 mSDsCounter, 0 mSdLazyCounter, 81 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 62 SdHoareTripleChecker+Valid, 111 SdHoareTripleChecker+Invalid, 81 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 81 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:01:07,571 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [62 Valid, 111 Invalid, 81 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 81 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 02:01:07,571 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 112 states. [2023-11-29 02:01:07,573 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 112 to 112. [2023-11-29 02:01:07,573 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 97 states have (on average 1.3402061855670102) internal successors, (130), 111 states have internal predecessors, (130), 0 states have call successors, (0), 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 02:01:07,574 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 130 transitions. [2023-11-29 02:01:07,574 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 130 transitions. Word has length 28 [2023-11-29 02:01:07,574 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:01:07,574 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 130 transitions. [2023-11-29 02:01:07,574 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 6.75) internal successors, (27), 4 states have internal predecessors, (27), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:07,574 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 130 transitions. [2023-11-29 02:01:07,575 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 02:01:07,575 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:01:07,575 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 02:01:07,575 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable31 [2023-11-29 02:01:07,575 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:01:07,575 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:07,575 INFO L85 PathProgramCache]: Analyzing trace with hash -324263782, now seen corresponding path program 1 times [2023-11-29 02:01:07,575 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:07,576 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1813134033] [2023-11-29 02:01:07,576 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:07,576 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:07,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:08,460 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:08,460 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1813134033] [2023-11-29 02:01:08,460 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1813134033] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:01:08,460 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [288869924] [2023-11-29 02:01:08,461 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:08,461 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:01:08,461 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:01:08,462 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:01:08,462 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Waiting until timeout for monitored process [2023-11-29 02:01:08,598 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:08,600 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 78 conjunts are in the unsatisfiable core [2023-11-29 02:01:08,605 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:01:08,612 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 02:01:08,620 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:01:08,666 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 15 treesize of output 1 [2023-11-29 02:01:08,668 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 02:01:08,687 INFO L349 Elim1Store]: treesize reduction 30, result has 37.5 percent of original size [2023-11-29 02:01:08,687 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 21 treesize of output 29 [2023-11-29 02:01:08,745 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 02:01:08,751 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 37 treesize of output 21 [2023-11-29 02:01:09,038 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 02:01:09,129 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2023-11-29 02:01:09,130 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 45 treesize of output 32 [2023-11-29 02:01:09,421 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 55 treesize of output 30 [2023-11-29 02:01:09,448 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 55 treesize of output 30 [2023-11-29 02:01:09,797 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 7 treesize of output 3 [2023-11-29 02:01:09,876 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-29 02:01:09,876 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 50 treesize of output 14 [2023-11-29 02:01:09,948 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:01:09,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 53 treesize of output 32 [2023-11-29 02:01:10,073 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 16 [2023-11-29 02:01:10,134 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:01:10,134 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 28 treesize of output 12 [2023-11-29 02:01:10,136 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:10,137 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:01:10,784 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2023-11-29 02:01:10,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 48 treesize of output 41 [2023-11-29 02:01:10,809 INFO L349 Elim1Store]: treesize reduction 13, result has 71.7 percent of original size [2023-11-29 02:01:10,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 82 [2023-11-29 02:01:10,814 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 7 treesize of output 5 [2023-11-29 02:01:10,857 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2023-11-29 02:01:10,857 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 44 [2023-11-29 02:01:10,886 INFO L349 Elim1Store]: treesize reduction 13, result has 71.7 percent of original size [2023-11-29 02:01:10,887 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 75 treesize of output 89 [2023-11-29 02:01:10,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 46 [2023-11-29 02:01:11,250 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:11,251 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [288869924] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:01:11,251 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:01:11,251 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 19, 19] total 51 [2023-11-29 02:01:11,251 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [613780909] [2023-11-29 02:01:11,251 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:01:11,252 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 53 states [2023-11-29 02:01:11,252 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:11,252 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 53 interpolants. [2023-11-29 02:01:11,253 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=2532, Unknown=7, NotChecked=0, Total=2756 [2023-11-29 02:01:11,254 INFO L87 Difference]: Start difference. First operand 112 states and 130 transitions. Second operand has 53 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 52 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:12,975 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:01:12,975 INFO L93 Difference]: Finished difference Result 135 states and 154 transitions. [2023-11-29 02:01:12,975 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 02:01:12,976 INFO L78 Accepts]: Start accepts. Automaton has has 53 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 52 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 29 [2023-11-29 02:01:12,976 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:01:12,976 INFO L225 Difference]: With dead ends: 135 [2023-11-29 02:01:12,976 INFO L226 Difference]: Without dead ends: 135 [2023-11-29 02:01:12,978 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 87 GetRequests, 24 SyntacticMatches, 1 SemanticMatches, 62 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 950 ImplicationChecksByTransitivity, 2.8s TimeCoverageRelationStatistics Valid=350, Invalid=3675, Unknown=7, NotChecked=0, Total=4032 [2023-11-29 02:01:12,979 INFO L413 NwaCegarLoop]: 33 mSDtfsCounter, 54 mSDsluCounter, 697 mSDsCounter, 0 mSdLazyCounter, 1330 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 54 SdHoareTripleChecker+Valid, 730 SdHoareTripleChecker+Invalid, 1339 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1330 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:01:12,979 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [54 Valid, 730 Invalid, 1339 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1330 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 02:01:12,979 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 135 states. [2023-11-29 02:01:12,981 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 135 to 127. [2023-11-29 02:01:12,981 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 112 states have (on average 1.3125) internal successors, (147), 126 states have internal predecessors, (147), 0 states have call successors, (0), 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 02:01:12,982 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 147 transitions. [2023-11-29 02:01:12,982 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 147 transitions. Word has length 29 [2023-11-29 02:01:12,982 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:01:12,982 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 147 transitions. [2023-11-29 02:01:12,982 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 53 states, 52 states have (on average 1.4615384615384615) internal successors, (76), 52 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:12,982 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 147 transitions. [2023-11-29 02:01:12,982 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 30 [2023-11-29 02:01:12,982 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:01:12,982 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 02:01:12,987 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (5)] Ended with exit code 0 [2023-11-29 02:01:13,183 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable32,5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:01:13,183 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr55REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:01:13,183 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:13,183 INFO L85 PathProgramCache]: Analyzing trace with hash -324263781, now seen corresponding path program 1 times [2023-11-29 02:01:13,183 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:13,183 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1639523146] [2023-11-29 02:01:13,184 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:13,184 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:13,203 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:14,225 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:14,225 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:14,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1639523146] [2023-11-29 02:01:14,225 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1639523146] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:01:14,225 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [800110221] [2023-11-29 02:01:14,225 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:14,226 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:01:14,226 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:01:14,227 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:01:14,227 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Waiting until timeout for monitored process [2023-11-29 02:01:14,373 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:14,376 INFO L262 TraceCheckSpWp]: Trace formula consists of 290 conjuncts, 96 conjunts are in the unsatisfiable core [2023-11-29 02:01:14,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:01:14,389 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 02:01:14,396 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 02:01:14,448 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 02:01:14,448 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 15 treesize of output 15 [2023-11-29 02:01:14,456 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 02:01:14,460 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 02:01:14,465 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 02:01:14,519 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-29 02:01:14,525 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 02:01:14,808 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 02:01:14,827 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 02:01:14,915 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-29 02:01:14,915 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 41 treesize of output 36 [2023-11-29 02:01:14,928 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2023-11-29 02:01:14,928 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 33 treesize of output 28 [2023-11-29 02:01:15,228 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 41 treesize of output 22 [2023-11-29 02:01:15,234 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 49 treesize of output 30 [2023-11-29 02:01:15,269 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 41 treesize of output 22 [2023-11-29 02:01:15,275 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 49 treesize of output 30 [2023-11-29 02:01:15,810 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-29 02:01:15,811 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 44 treesize of output 18 [2023-11-29 02:01:15,816 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-29 02:01:15,816 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 25 treesize of output 7 [2023-11-29 02:01:15,890 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:01:15,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 37 treesize of output 24 [2023-11-29 02:01:15,896 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 21 [2023-11-29 02:01:16,055 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 0 case distinctions, treesize of input 28 treesize of output 12 [2023-11-29 02:01:16,060 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:16,060 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:01:17,027 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2023-11-29 02:01:17,028 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 39 [2023-11-29 02:01:17,052 INFO L349 Elim1Store]: treesize reduction 13, result has 71.7 percent of original size [2023-11-29 02:01:17,052 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 68 treesize of output 82 [2023-11-29 02:01:17,088 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2023-11-29 02:01:17,088 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 93 treesize of output 86 [2023-11-29 02:01:17,108 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2023-11-29 02:01:17,109 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 67 treesize of output 60 [2023-11-29 02:01:17,113 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:01:17,120 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 02:01:17,120 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 51 treesize of output 33 [2023-11-29 02:01:17,124 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 02:01:17,130 INFO L349 Elim1Store]: treesize reduction 16, result has 5.9 percent of original size [2023-11-29 02:01:17,130 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 34 treesize of output 16 [2023-11-29 02:01:17,474 INFO L134 CoverageAnalysis]: Checked inductivity of 5 backedges. 0 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:17,474 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [800110221] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:01:17,474 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:01:17,474 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 54 [2023-11-29 02:01:17,474 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2114795551] [2023-11-29 02:01:17,474 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:01:17,475 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 56 states [2023-11-29 02:01:17,475 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:17,475 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 56 interpolants. [2023-11-29 02:01:17,476 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=230, Invalid=2843, Unknown=7, NotChecked=0, Total=3080 [2023-11-29 02:01:17,476 INFO L87 Difference]: Start difference. First operand 127 states and 147 transitions. Second operand has 56 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 55 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 02:01:19,304 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:01:19,304 INFO L93 Difference]: Finished difference Result 134 states and 153 transitions. [2023-11-29 02:01:19,305 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 02:01:19,305 INFO L78 Accepts]: Start accepts. Automaton has has 56 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 55 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) Word has length 29 [2023-11-29 02:01:19,305 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:01:19,306 INFO L225 Difference]: With dead ends: 134 [2023-11-29 02:01:19,306 INFO L226 Difference]: Without dead ends: 134 [2023-11-29 02:01:19,308 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 85 GetRequests, 21 SyntacticMatches, 0 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1099 ImplicationChecksByTransitivity, 3.2s TimeCoverageRelationStatistics Valid=364, Invalid=3919, Unknown=7, NotChecked=0, Total=4290 [2023-11-29 02:01:19,308 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 66 mSDsluCounter, 723 mSDsCounter, 0 mSdLazyCounter, 1373 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 66 SdHoareTripleChecker+Valid, 759 SdHoareTripleChecker+Invalid, 1389 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 1373 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 02:01:19,308 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [66 Valid, 759 Invalid, 1389 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 1373 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 02:01:19,309 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-29 02:01:19,310 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 127. [2023-11-29 02:01:19,310 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 112 states have (on average 1.3035714285714286) internal successors, (146), 126 states have internal predecessors, (146), 0 states have call successors, (0), 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 02:01:19,310 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 146 transitions. [2023-11-29 02:01:19,310 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 146 transitions. Word has length 29 [2023-11-29 02:01:19,310 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:01:19,311 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 146 transitions. [2023-11-29 02:01:19,311 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 56 states, 55 states have (on average 1.5636363636363637) internal successors, (86), 55 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 02:01:19,311 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 146 transitions. [2023-11-29 02:01:19,311 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 02:01:19,311 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:01:19,311 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:01:19,316 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (6)] Ended with exit code 0 [2023-11-29 02:01:19,511 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable33,6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:01:19,512 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:01:19,512 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:19,512 INFO L85 PathProgramCache]: Analyzing trace with hash -1464603294, now seen corresponding path program 1 times [2023-11-29 02:01:19,512 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:19,512 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1721275929] [2023-11-29 02:01:19,512 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:19,512 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:19,529 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:20,192 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:20,192 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:20,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1721275929] [2023-11-29 02:01:20,192 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1721275929] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:01:20,192 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1434518704] [2023-11-29 02:01:20,192 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:20,192 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:01:20,193 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:01:20,193 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:01:20,196 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Waiting until timeout for monitored process [2023-11-29 02:01:20,345 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:20,347 INFO L262 TraceCheckSpWp]: Trace formula consists of 286 conjuncts, 70 conjunts are in the unsatisfiable core [2023-11-29 02:01:20,351 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:01:20,356 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 02:01:20,363 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 02:01:20,394 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 02:01:20,394 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 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 02:01:20,397 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 02:01:20,402 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 02:01:20,444 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 28 treesize of output 16 [2023-11-29 02:01:20,448 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 02:01:20,666 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 02:01:20,729 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2023-11-29 02:01:20,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 1 case distinctions, treesize of input 45 treesize of output 32 [2023-11-29 02:01:20,954 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 55 treesize of output 30 [2023-11-29 02:01:21,018 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 55 treesize of output 30 [2023-11-29 02:01:21,341 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:01:21,341 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 22 treesize of output 18 [2023-11-29 02:01:21,470 INFO L349 Elim1Store]: treesize reduction 10, result has 81.1 percent of original size [2023-11-29 02:01:21,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 50 treesize of output 56 [2023-11-29 02:01:21,587 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2023-11-29 02:01:21,588 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 64 treesize of output 63 [2023-11-29 02:01:21,828 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:01:21,828 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 62 treesize of output 50 [2023-11-29 02:01:21,916 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:21,916 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:01:26,925 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2023-11-29 02:01:26,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 40 [2023-11-29 02:01:26,950 INFO L349 Elim1Store]: treesize reduction 13, result has 71.7 percent of original size [2023-11-29 02:01:26,951 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 81 [2023-11-29 02:01:26,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2023-11-29 02:01:27,358 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 16 treesize of output 14 [2023-11-29 02:01:27,360 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 118 treesize of output 114 [2023-11-29 02:01:27,371 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 35 treesize of output 31 [2023-11-29 02:01:27,377 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 194 treesize of output 186 [2023-11-29 02:01:27,507 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:27,507 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1434518704] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:01:27,507 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:01:27,508 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [20, 22, 21] total 60 [2023-11-29 02:01:27,508 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [548563157] [2023-11-29 02:01:27,508 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:01:27,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 61 states [2023-11-29 02:01:27,508 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:27,509 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 61 interpolants. [2023-11-29 02:01:27,510 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=217, Invalid=3441, Unknown=2, NotChecked=0, Total=3660 [2023-11-29 02:01:27,511 INFO L87 Difference]: Start difference. First operand 127 states and 146 transitions. Second operand has 61 states, 61 states have (on average 1.360655737704918) internal successors, (83), 60 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 02:01:29,764 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:01:29,765 INFO L93 Difference]: Finished difference Result 131 states and 149 transitions. [2023-11-29 02:01:29,765 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 02:01:29,765 INFO L78 Accepts]: Start accepts. Automaton has has 61 states, 61 states have (on average 1.360655737704918) internal successors, (83), 60 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) Word has length 30 [2023-11-29 02:01:29,765 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:01:29,766 INFO L225 Difference]: With dead ends: 131 [2023-11-29 02:01:29,766 INFO L226 Difference]: Without dead ends: 131 [2023-11-29 02:01:29,768 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 94 GetRequests, 18 SyntacticMatches, 1 SemanticMatches, 75 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1240 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=424, Invalid=5426, Unknown=2, NotChecked=0, Total=5852 [2023-11-29 02:01:29,768 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 92 mSDsluCounter, 1267 mSDsCounter, 0 mSdLazyCounter, 1407 mSolverCounterSat, 17 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 92 SdHoareTripleChecker+Valid, 1306 SdHoareTripleChecker+Invalid, 1424 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 17 IncrementalHoareTripleChecker+Valid, 1407 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:01:29,768 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [92 Valid, 1306 Invalid, 1424 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [17 Valid, 1407 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 02:01:29,769 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 131 states. [2023-11-29 02:01:29,770 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 131 to 127. [2023-11-29 02:01:29,770 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 127 states, 112 states have (on average 1.2946428571428572) internal successors, (145), 126 states have internal predecessors, (145), 0 states have call successors, (0), 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 02:01:29,770 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 127 states to 127 states and 145 transitions. [2023-11-29 02:01:29,770 INFO L78 Accepts]: Start accepts. Automaton has 127 states and 145 transitions. Word has length 30 [2023-11-29 02:01:29,770 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:01:29,771 INFO L495 AbstractCegarLoop]: Abstraction has 127 states and 145 transitions. [2023-11-29 02:01:29,771 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 61 states, 61 states have (on average 1.360655737704918) internal successors, (83), 60 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 02:01:29,771 INFO L276 IsEmpty]: Start isEmpty. Operand 127 states and 145 transitions. [2023-11-29 02:01:29,771 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 32 [2023-11-29 02:01:29,771 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:01:29,771 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:01:29,776 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (7)] Ended with exit code 0 [2023-11-29 02:01:29,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable34,7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:01:29,972 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr58ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:01:29,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:29,972 INFO L85 PathProgramCache]: Analyzing trace with hash 1915123674, now seen corresponding path program 1 times [2023-11-29 02:01:29,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:29,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1039050087] [2023-11-29 02:01:29,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:29,973 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:29,994 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:30,746 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:30,746 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:30,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1039050087] [2023-11-29 02:01:30,747 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1039050087] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:01:30,747 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1887406446] [2023-11-29 02:01:30,747 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:30,747 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:01:30,747 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:01:30,748 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:01:30,748 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Waiting until timeout for monitored process [2023-11-29 02:01:30,904 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:30,907 INFO L262 TraceCheckSpWp]: Trace formula consists of 314 conjuncts, 78 conjunts are in the unsatisfiable core [2023-11-29 02:01:30,911 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:01:30,920 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 02:01:30,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 02:01:30,965 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 15 treesize of output 1 [2023-11-29 02:01:30,968 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 02:01:30,979 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 02:01:30,980 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 15 treesize of output 15 [2023-11-29 02:01:31,032 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-29 02:01:31,038 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 02:01:31,317 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 02:01:31,408 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2023-11-29 02:01:31,409 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 33 treesize of output 28 [2023-11-29 02:01:31,638 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 41 treesize of output 22 [2023-11-29 02:01:31,664 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 41 treesize of output 22 [2023-11-29 02:01:31,963 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 0 case distinctions, treesize of input 44 treesize of output 24 [2023-11-29 02:01:32,103 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:01:32,103 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 26 treesize of output 21 [2023-11-29 02:01:32,219 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:32,219 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:01:32,760 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2023-11-29 02:01:32,760 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 39 [2023-11-29 02:01:32,789 INFO L349 Elim1Store]: treesize reduction 13, result has 71.7 percent of original size [2023-11-29 02:01:32,790 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 78 [2023-11-29 02:01:33,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:33,095 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1887406446] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:01:33,095 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:01:33,095 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 49 [2023-11-29 02:01:33,095 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1650958093] [2023-11-29 02:01:33,095 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:01:33,096 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-29 02:01:33,096 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:33,096 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-29 02:01:33,097 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=220, Invalid=2321, Unknown=9, NotChecked=0, Total=2550 [2023-11-29 02:01:33,097 INFO L87 Difference]: Start difference. First operand 127 states and 145 transitions. Second operand has 51 states, 50 states have (on average 1.54) internal successors, (77), 50 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 02:01:34,129 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:01:34,130 INFO L93 Difference]: Finished difference Result 132 states and 150 transitions. [2023-11-29 02:01:34,130 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 21 states. [2023-11-29 02:01:34,130 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.54) internal successors, (77), 50 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 31 [2023-11-29 02:01:34,130 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:01:34,131 INFO L225 Difference]: With dead ends: 132 [2023-11-29 02:01:34,131 INFO L226 Difference]: Without dead ends: 132 [2023-11-29 02:01:34,132 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 88 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 58 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 887 ImplicationChecksByTransitivity, 2.3s TimeCoverageRelationStatistics Valid=354, Invalid=3177, Unknown=9, NotChecked=0, Total=3540 [2023-11-29 02:01:34,132 INFO L413 NwaCegarLoop]: 39 mSDtfsCounter, 97 mSDsluCounter, 836 mSDsCounter, 0 mSdLazyCounter, 848 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.5s Time, 0 mProtectedPredicate, 0 mProtectedAction, 97 SdHoareTripleChecker+Valid, 875 SdHoareTripleChecker+Invalid, 857 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 848 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 02:01:34,132 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [97 Valid, 875 Invalid, 857 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 848 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 02:01:34,133 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 132 states. [2023-11-29 02:01:34,135 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 132 to 129. [2023-11-29 02:01:34,135 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 129 states, 114 states have (on average 1.2894736842105263) internal successors, (147), 128 states have internal predecessors, (147), 0 states have call successors, (0), 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 02:01:34,135 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 129 states to 129 states and 147 transitions. [2023-11-29 02:01:34,135 INFO L78 Accepts]: Start accepts. Automaton has 129 states and 147 transitions. Word has length 31 [2023-11-29 02:01:34,135 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:01:34,135 INFO L495 AbstractCegarLoop]: Abstraction has 129 states and 147 transitions. [2023-11-29 02:01:34,135 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.54) internal successors, (77), 50 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 02:01:34,135 INFO L276 IsEmpty]: Start isEmpty. Operand 129 states and 147 transitions. [2023-11-29 02:01:34,136 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 02:01:34,136 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:01:34,136 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 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 02:01:34,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (8)] Ended with exit code 0 [2023-11-29 02:01:34,336 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable35,8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:01:34,336 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr59ASSERT_VIOLATIONMEMORY_FREE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:01:34,336 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:34,337 INFO L85 PathProgramCache]: Analyzing trace with hash -760708043, now seen corresponding path program 1 times [2023-11-29 02:01:34,337 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:34,337 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [565652331] [2023-11-29 02:01:34,337 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:34,337 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:34,357 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:35,163 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:35,163 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:35,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [565652331] [2023-11-29 02:01:35,163 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [565652331] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:01:35,163 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1281098932] [2023-11-29 02:01:35,163 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:35,163 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:01:35,164 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:01:35,164 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:01:35,167 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Waiting until timeout for monitored process [2023-11-29 02:01:35,338 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:35,341 INFO L262 TraceCheckSpWp]: Trace formula consists of 316 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-29 02:01:35,345 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:01:35,353 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 02:01:35,361 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 02:01:35,404 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 15 treesize of output 1 [2023-11-29 02:01:35,407 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 02:01:35,416 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 02:01:35,417 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 02:01:35,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 02:01:35,470 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-29 02:01:35,713 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 02:01:35,794 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2023-11-29 02:01:35,795 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 45 treesize of output 32 [2023-11-29 02:01:36,060 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 53 treesize of output 28 [2023-11-29 02:01:36,077 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 53 treesize of output 28 [2023-11-29 02:01:36,393 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 7 treesize of output 3 [2023-11-29 02:01:36,469 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-29 02:01:36,469 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 48 treesize of output 14 [2023-11-29 02:01:36,526 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:01:36,527 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 48 treesize of output 24 [2023-11-29 02:01:36,641 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:01:36,641 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 28 treesize of output 12 [2023-11-29 02:01:36,651 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:36,652 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:01:37,245 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2023-11-29 02:01:37,246 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 46 treesize of output 39 [2023-11-29 02:01:37,273 INFO L349 Elim1Store]: treesize reduction 13, result has 71.7 percent of original size [2023-11-29 02:01:37,273 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 64 treesize of output 78 [2023-11-29 02:01:37,292 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 7 treesize of output 5 [2023-11-29 02:01:37,637 INFO L134 CoverageAnalysis]: Checked inductivity of 8 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:37,637 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1281098932] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:01:37,637 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:01:37,637 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [19, 18, 18] total 49 [2023-11-29 02:01:37,637 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206060579] [2023-11-29 02:01:37,637 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:01:37,638 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 51 states [2023-11-29 02:01:37,638 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:37,638 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 51 interpolants. [2023-11-29 02:01:37,639 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=201, Invalid=2343, Unknown=6, NotChecked=0, Total=2550 [2023-11-29 02:01:37,640 INFO L87 Difference]: Start difference. First operand 129 states and 147 transitions. Second operand has 51 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:39,308 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:01:39,308 INFO L93 Difference]: Finished difference Result 133 states and 151 transitions. [2023-11-29 02:01:39,308 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 02:01:39,308 INFO L78 Accepts]: Start accepts. Automaton has has 51 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-29 02:01:39,308 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:01:39,309 INFO L225 Difference]: With dead ends: 133 [2023-11-29 02:01:39,309 INFO L226 Difference]: Without dead ends: 133 [2023-11-29 02:01:39,311 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 92 GetRequests, 30 SyntacticMatches, 2 SemanticMatches, 60 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 912 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=330, Invalid=3446, Unknown=6, NotChecked=0, Total=3782 [2023-11-29 02:01:39,311 INFO L413 NwaCegarLoop]: 37 mSDtfsCounter, 48 mSDsluCounter, 1099 mSDsCounter, 0 mSdLazyCounter, 1474 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 48 SdHoareTripleChecker+Valid, 1136 SdHoareTripleChecker+Invalid, 1483 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 1474 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:01:39,312 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [48 Valid, 1136 Invalid, 1483 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 1474 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 02:01:39,312 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 133 states. [2023-11-29 02:01:39,313 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 133 to 130. [2023-11-29 02:01:39,313 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 130 states, 115 states have (on average 1.2869565217391303) internal successors, (148), 129 states have internal predecessors, (148), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:39,314 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 130 states to 130 states and 148 transitions. [2023-11-29 02:01:39,314 INFO L78 Accepts]: Start accepts. Automaton has 130 states and 148 transitions. Word has length 32 [2023-11-29 02:01:39,314 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:01:39,314 INFO L495 AbstractCegarLoop]: Abstraction has 130 states and 148 transitions. [2023-11-29 02:01:39,314 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 51 states, 50 states have (on average 1.56) internal successors, (78), 50 states have internal predecessors, (78), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:39,314 INFO L276 IsEmpty]: Start isEmpty. Operand 130 states and 148 transitions. [2023-11-29 02:01:39,314 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 35 [2023-11-29 02:01:39,314 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:01:39,314 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:01:39,321 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (9)] Ended with exit code 0 [2023-11-29 02:01:39,515 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable36 [2023-11-29 02:01:39,515 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr48REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:01:39,516 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:39,516 INFO L85 PathProgramCache]: Analyzing trace with hash -895982340, now seen corresponding path program 2 times [2023-11-29 02:01:39,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:39,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1084026242] [2023-11-29 02:01:39,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:39,516 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:39,533 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:40,337 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:40,337 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:40,337 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1084026242] [2023-11-29 02:01:40,338 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1084026242] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:01:40,338 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [773616575] [2023-11-29 02:01:40,338 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:01:40,338 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:01:40,338 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:01:40,339 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:01:40,339 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Waiting until timeout for monitored process [2023-11-29 02:01:40,541 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 02:01:40,541 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:01:40,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 321 conjuncts, 82 conjunts are in the unsatisfiable core [2023-11-29 02:01:40,547 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:01:40,555 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 02:01:40,560 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 02:01:40,592 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 15 treesize of output 1 [2023-11-29 02:01:40,595 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 02:01:40,609 INFO L349 Elim1Store]: treesize reduction 20, result has 39.4 percent of original size [2023-11-29 02:01:40,610 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 20 treesize of output 22 [2023-11-29 02:01:40,658 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 28 treesize of output 16 [2023-11-29 02:01:40,664 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 02:01:40,912 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 02:01:40,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:01:40,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 41 treesize of output 36 [2023-11-29 02:01:41,277 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 49 treesize of output 30 [2023-11-29 02:01:41,306 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 49 treesize of output 30 [2023-11-29 02:01:41,687 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 7 treesize of output 3 [2023-11-29 02:01:41,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:01:41,784 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 44 treesize of output 18 [2023-11-29 02:01:41,845 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:01:41,845 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 36 treesize of output 23 [2023-11-29 02:01:42,008 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 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-29 02:01:42,028 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 02:01:42,030 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:42,030 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:01:42,092 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 02:01:42,557 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2023-11-29 02:01:42,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 47 treesize of output 40 [2023-11-29 02:01:42,581 INFO L349 Elim1Store]: treesize reduction 13, result has 71.7 percent of original size [2023-11-29 02:01:42,582 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 67 treesize of output 81 [2023-11-29 02:01:42,587 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 40 treesize of output 38 [2023-11-29 02:01:42,959 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 11 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:42,960 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [773616575] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:01:42,960 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:01:42,960 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [21, 20, 20] total 52 [2023-11-29 02:01:42,960 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [525475047] [2023-11-29 02:01:42,960 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:01:42,960 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 54 states [2023-11-29 02:01:42,960 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:42,961 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 54 interpolants. [2023-11-29 02:01:42,962 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=2638, Unknown=2, NotChecked=0, Total=2862 [2023-11-29 02:01:42,962 INFO L87 Difference]: Start difference. First operand 130 states and 148 transitions. Second operand has 54 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 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 02:01:44,445 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:01:44,445 INFO L93 Difference]: Finished difference Result 140 states and 159 transitions. [2023-11-29 02:01:44,446 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-29 02:01:44,446 INFO L78 Accepts]: Start accepts. Automaton has has 54 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 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) Word has length 34 [2023-11-29 02:01:44,446 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:01:44,447 INFO L225 Difference]: With dead ends: 140 [2023-11-29 02:01:44,447 INFO L226 Difference]: Without dead ends: 140 [2023-11-29 02:01:44,448 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 99 GetRequests, 34 SyntacticMatches, 1 SemanticMatches, 64 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1070 ImplicationChecksByTransitivity, 2.6s TimeCoverageRelationStatistics Valid=372, Invalid=3916, Unknown=2, NotChecked=0, Total=4290 [2023-11-29 02:01:44,448 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 111 mSDsluCounter, 969 mSDsCounter, 0 mSdLazyCounter, 1270 mSolverCounterSat, 10 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 111 SdHoareTripleChecker+Valid, 1007 SdHoareTripleChecker+Invalid, 1280 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 10 IncrementalHoareTripleChecker+Valid, 1270 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:01:44,448 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [111 Valid, 1007 Invalid, 1280 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [10 Valid, 1270 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 02:01:44,449 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 140 states. [2023-11-29 02:01:44,450 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 140 to 122. [2023-11-29 02:01:44,450 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 122 states, 107 states have (on average 1.308411214953271) internal successors, (140), 121 states have internal predecessors, (140), 0 states have call successors, (0), 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 02:01:44,450 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 122 states to 122 states and 140 transitions. [2023-11-29 02:01:44,450 INFO L78 Accepts]: Start accepts. Automaton has 122 states and 140 transitions. Word has length 34 [2023-11-29 02:01:44,450 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:01:44,450 INFO L495 AbstractCegarLoop]: Abstraction has 122 states and 140 transitions. [2023-11-29 02:01:44,451 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 54 states, 53 states have (on average 1.509433962264151) internal successors, (80), 53 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 02:01:44,451 INFO L276 IsEmpty]: Start isEmpty. Operand 122 states and 140 transitions. [2023-11-29 02:01:44,451 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 39 [2023-11-29 02:01:44,451 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:01:44,451 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:01:44,457 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (10)] Ended with exit code 0 [2023-11-29 02:01:44,651 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable37 [2023-11-29 02:01:44,652 INFO L420 AbstractCegarLoop]: === Iteration 39 === Targeting ULTIMATE.startErr54REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:01:44,652 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:44,652 INFO L85 PathProgramCache]: Analyzing trace with hash 1306706250, now seen corresponding path program 2 times [2023-11-29 02:01:44,652 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:44,652 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1999438637] [2023-11-29 02:01:44,652 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:44,652 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:44,672 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:45,938 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:45,938 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:45,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1999438637] [2023-11-29 02:01:45,939 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1999438637] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:01:45,939 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [1043624039] [2023-11-29 02:01:45,939 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:01:45,939 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:01:45,939 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:01:45,940 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:01:45,941 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Waiting until timeout for monitored process [2023-11-29 02:01:46,153 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 02:01:46,153 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:01:46,156 INFO L262 TraceCheckSpWp]: Trace formula consists of 346 conjuncts, 104 conjunts are in the unsatisfiable core [2023-11-29 02:01:46,160 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:01:46,167 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 02:01:46,175 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 02:01:46,217 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 02:01:46,222 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 15 treesize of output 1 [2023-11-29 02:01:46,228 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 02:01:46,228 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 15 treesize of output 15 [2023-11-29 02:01:46,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 18 [2023-11-29 02:01:46,276 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-29 02:01:46,537 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 02:01:46,618 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-29 02:01:46,619 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 41 treesize of output 36 [2023-11-29 02:01:46,924 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-29 02:01:46,925 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 50 [2023-11-29 02:01:46,942 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 02:01:47,055 INFO L349 Elim1Store]: treesize reduction 35, result has 23.9 percent of original size [2023-11-29 02:01:47,055 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 65 treesize of output 66 [2023-11-29 02:01:47,074 INFO L349 Elim1Store]: treesize reduction 25, result has 30.6 percent of original size [2023-11-29 02:01:47,075 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 33 treesize of output 28 [2023-11-29 02:01:47,575 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 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 02:01:47,855 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:01:47,855 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 112 treesize of output 71 [2023-11-29 02:01:48,588 INFO L349 Elim1Store]: treesize reduction 126, result has 17.6 percent of original size [2023-11-29 02:01:48,589 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 5 select indices, 5 select index equivalence classes, 0 disjoint index pairs (out of 10 index pairs), introduced 6 new quantified variables, introduced 10 case distinctions, treesize of input 119 treesize of output 76 [2023-11-29 02:01:48,622 INFO L349 Elim1Store]: treesize reduction 10, result has 73.0 percent of original size [2023-11-29 02:01:48,622 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 40 treesize of output 36 [2023-11-29 02:01:48,714 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 28 [2023-11-29 02:01:48,724 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 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 27 treesize of output 11 [2023-11-29 02:01:48,852 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:48,852 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:01:49,016 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 8 treesize of output 4 [2023-11-29 02:01:49,397 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 217 treesize of output 179 [2023-11-29 02:01:50,117 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 578 treesize of output 562 [2023-11-29 02:01:50,613 INFO L134 CoverageAnalysis]: Checked inductivity of 19 backedges. 6 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:50,614 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [1043624039] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:01:50,614 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:01:50,614 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 25] total 63 [2023-11-29 02:01:50,614 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1499015794] [2023-11-29 02:01:50,614 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:01:50,614 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 64 states [2023-11-29 02:01:50,615 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:01:50,615 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 64 interpolants. [2023-11-29 02:01:50,616 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=267, Invalid=3765, Unknown=0, NotChecked=0, Total=4032 [2023-11-29 02:01:50,616 INFO L87 Difference]: Start difference. First operand 122 states and 140 transitions. Second operand has 64 states, 64 states have (on average 1.484375) internal successors, (95), 63 states have internal predecessors, (95), 0 states have call successors, (0), 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 02:01:52,972 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:01:52,972 INFO L93 Difference]: Finished difference Result 139 states and 157 transitions. [2023-11-29 02:01:52,973 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 02:01:52,973 INFO L78 Accepts]: Start accepts. Automaton has has 64 states, 64 states have (on average 1.484375) internal successors, (95), 63 states have internal predecessors, (95), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 38 [2023-11-29 02:01:52,973 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:01:52,974 INFO L225 Difference]: With dead ends: 139 [2023-11-29 02:01:52,974 INFO L226 Difference]: Without dead ends: 139 [2023-11-29 02:01:52,976 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 113 GetRequests, 37 SyntacticMatches, 0 SemanticMatches, 76 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1486 ImplicationChecksByTransitivity, 4.9s TimeCoverageRelationStatistics Valid=451, Invalid=5555, Unknown=0, NotChecked=0, Total=6006 [2023-11-29 02:01:52,977 INFO L413 NwaCegarLoop]: 38 mSDtfsCounter, 47 mSDsluCounter, 1053 mSDsCounter, 0 mSdLazyCounter, 1329 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 47 SdHoareTripleChecker+Valid, 1091 SdHoareTripleChecker+Invalid, 1340 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 1329 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.1s IncrementalHoareTripleChecker+Time [2023-11-29 02:01:52,977 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [47 Valid, 1091 Invalid, 1340 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 1329 Invalid, 0 Unknown, 0 Unchecked, 1.1s Time] [2023-11-29 02:01:52,977 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 139 states. [2023-11-29 02:01:52,979 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 139 to 133. [2023-11-29 02:01:52,979 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 133 states, 118 states have (on average 1.2796610169491525) internal successors, (151), 132 states have internal predecessors, (151), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:01:52,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 133 states to 133 states and 151 transitions. [2023-11-29 02:01:52,979 INFO L78 Accepts]: Start accepts. Automaton has 133 states and 151 transitions. Word has length 38 [2023-11-29 02:01:52,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:01:52,979 INFO L495 AbstractCegarLoop]: Abstraction has 133 states and 151 transitions. [2023-11-29 02:01:52,979 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 64 states, 64 states have (on average 1.484375) internal successors, (95), 63 states have internal predecessors, (95), 0 states have call successors, (0), 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 02:01:52,980 INFO L276 IsEmpty]: Start isEmpty. Operand 133 states and 151 transitions. [2023-11-29 02:01:52,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 02:01:52,980 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:01:52,980 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:01:52,986 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (11)] Ended with exit code 0 [2023-11-29 02:01:53,180 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable38 [2023-11-29 02:01:53,180 INFO L420 AbstractCegarLoop]: === Iteration 40 === Targeting ULTIMATE.startErr64ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:01:53,181 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:01:53,181 INFO L85 PathProgramCache]: Analyzing trace with hash 1850827442, now seen corresponding path program 2 times [2023-11-29 02:01:53,181 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:01:53,181 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1442701268] [2023-11-29 02:01:53,181 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:01:53,181 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:01:53,204 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:01:54,971 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:01:54,971 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:01:54,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1442701268] [2023-11-29 02:01:54,971 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1442701268] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:01:54,971 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [370267680] [2023-11-29 02:01:54,971 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 02:01:54,971 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:01:54,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:01:54,972 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:01:54,973 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Waiting until timeout for monitored process [2023-11-29 02:01:55,169 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 02:01:55,169 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 02:01:55,172 INFO L262 TraceCheckSpWp]: Trace formula consists of 342 conjuncts, 89 conjunts are in the unsatisfiable core [2023-11-29 02:01:55,175 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:01:55,274 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 15 treesize of output 1 [2023-11-29 02:01:55,276 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 02:01:55,491 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 220 treesize of output 168 [2023-11-29 02:01:55,532 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 02:01:56,408 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 19 treesize of output 11 [2023-11-29 02:01:56,687 INFO L349 Elim1Store]: treesize reduction 29, result has 27.5 percent of original size [2023-11-29 02:01:56,687 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 41 treesize of output 36 [2023-11-29 02:01:57,499 INFO L349 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2023-11-29 02:01:57,499 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 49 treesize of output 42 [2023-11-29 02:01:57,509 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-29 02:01:57,509 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 21 treesize of output 15 [2023-11-29 02:01:57,769 INFO L349 Elim1Store]: treesize reduction 29, result has 42.0 percent of original size [2023-11-29 02:01:57,769 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 49 treesize of output 42 [2023-11-29 02:01:57,775 INFO L349 Elim1Store]: treesize reduction 9, result has 10.0 percent of original size [2023-11-29 02:01:57,775 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 21 treesize of output 15 [2023-11-29 02:01:58,816 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:01:58,816 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 22 treesize of output 18 [2023-11-29 02:01:59,150 INFO L349 Elim1Store]: treesize reduction 10, result has 81.1 percent of original size [2023-11-29 02:01:59,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 44 treesize of output 60 [2023-11-29 02:01:59,474 INFO L349 Elim1Store]: treesize reduction 32, result has 54.9 percent of original size [2023-11-29 02:01:59,475 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 255 treesize of output 178 [2023-11-29 02:02:05,455 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:02:05,455 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 2 case distinctions, treesize of input 1390 treesize of output 894 [2023-11-29 02:03:32,053 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse19 (= |c_ULTIMATE.start_destroy_sl_~sl#1.offset| 4)) (.cse17 (= |c_ULTIMATE.start_destroy_sl_~sl#1.offset| 0))) (let ((.cse13 (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_17 Int) (v_subst_3 Int)) (let ((.cse90 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_17) v_subst_3 1))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_3 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse90 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse90 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_3) 0))))) (.cse14 (exists ((v_prenex_16 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_1 Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_16) v_subst_1) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_1 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_1 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (.cse12 (not .cse17)) (.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select |c_#valid| |c_ULTIMATE.start_destroy_sl_~sl#1.base|))) (.cse18 (not .cse19))) (or (and (or (and (or (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_9 Int) (v_arrayElimCell_210 Int)) (let ((.cse1 (select |c_#valid| v_arrayElimCell_210))) (let ((.cse2 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse3 (store (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 .cse1) v_subst_9 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse3 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 (select .cse3 v_arrayElimCell_210))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (not (= v_arrayElimCell_210 v_subst_9)) (= |c_#valid| (store (store (store .cse0 v_arrayElimCell_210 .cse1) v_subst_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse2 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_9)) (= (select .cse2 v_arrayElimCell_210) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_7 Int) (v_prenex_11 Int)) (let ((.cse4 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select .cse4 v_prenex_7) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse4 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int)) (let ((.cse5 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse5 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= v_prenex_7 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse5 v_arrayElimCell_210) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_210 v_prenex_7))))) (exists ((v_DerPreprocessor_13 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int)) (let ((.cse6 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 v_DerPreprocessor_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select .cse6 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse6 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= |c_#valid| (store (store .cse0 v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_1 Int)) (let ((.cse7 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse7 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select .cse7 v_arrayElimCell_210) 0)))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_ArrVal_2314 Int)) (and (exists ((v_arrayElimCell_210 Int) (v_subst_7 Int)) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210) 0) (not (= v_arrayElimCell_210 v_subst_7)) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_7)))) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_ArrVal_2314 Int)) (and (exists ((v_subst_6 Int)) (and (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_6)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_6 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (exists ((v_arrayElimCell_210 Int)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210) 0)))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_8 Int)) (let ((.cse8 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 v_DerPreprocessor_8) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse8 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select .cse8 v_arrayElimCell_210) 0) (= |c_#valid| (store (store .cse0 v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_12 Int) (v_arrayElimCell_210 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_12) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int) (v_prenex_8 Int)) (let ((.cse9 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse9 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select .cse9 v_arrayElimCell_210) 0) (not (= v_prenex_8 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_prenex_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_7 Int)) (let ((.cse11 (select |c_#valid| v_arrayElimCell_210))) (let ((.cse10 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_7) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 .cse11) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) v_arrayElimCell_210)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select .cse10 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse10 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 .cse11) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_ArrVal_2314 Int)) (and (exists ((v_subst_7 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_subst_7) 0))) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0)))) .cse12) (and (or .cse13 .cse14 (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_2 Int) (v_DerPreprocessor_51 Int)) (let ((.cse15 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse16 (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_51) v_subst_2 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse16 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse16 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse15 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse0 v_subst_2 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse15 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2) 0))))) .cse17)) .cse18) (and .cse19 (or (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_13 Int) (v_subst_11 Int)) (let ((.cse20 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_subst_11 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_subst_11 v_prenex_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select .cse20 v_subst_11) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_11)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse20 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse0 v_subst_11 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_12 Int) (v_prenex_14 Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_subst_12) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_14) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_12 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))) (exists ((v_prenex_15 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_10 Int)) (let ((.cse21 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_15) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_10 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse21 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select .cse21 v_subst_10) 0)))))) (and (or .cse13 .cse14 (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_2 Int) (v_DerPreprocessor_40 Int)) (let ((.cse22 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse23 (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_40) v_subst_2 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse23 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse23 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse22 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse22 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2) 0) (= |c_#valid| (store (store .cse0 v_subst_2 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))))) .cse17) (and .cse12 (let ((.cse25 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_prenex_10 Int)) (let ((.cse89 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select .cse89 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_prenex_10 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse89 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0))))) (.cse35 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_4 Int) (v_ArrVal_2314 Int)) (let ((.cse88 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse88 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse88 v_subst_4 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))))) (or (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_1 Int)) (let ((.cse24 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) v_arrayElimCell_209 1))) (and (= (select .cse24 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse24 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (and .cse18 (or .cse25 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_8 Int)) (let ((.cse27 (store (store .cse0 v_arrayElimCell_209 1) v_arrayElimCell_210 0))) (let ((.cse26 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse27 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 v_DerPreprocessor_8) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse26 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse26 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store .cse27 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)))))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_28 Int) (v_subst_9 Int) (v_arrayElimCell_210 Int)) (let ((.cse29 (select |c_#valid| v_arrayElimCell_210))) (let ((.cse28 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse30 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_28) v_arrayElimCell_209 1) v_arrayElimCell_210 .cse29) v_subst_9 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse30 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 (select .cse30 v_arrayElimCell_210))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= v_arrayElimCell_210 v_subst_9)) (= (select .cse28 v_arrayElimCell_210) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 .cse29) v_subst_9 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0)) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse28 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (not (= v_arrayElimCell_209 v_subst_9)))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_subst_6 Int) (v_ArrVal_2314 Int)) (let ((.cse31 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse31 v_arrayElimCell_210) 0) (= |c_#valid| (store (store .cse31 v_subst_6 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_6)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_5 Int) (v_ArrVal_2314 Int) (v_DerPreprocessor_31 Int)) (let ((.cse32 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse32 v_subst_5 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse32 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= v_DerPreprocessor_31 (select (store (store .cse32 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_31) v_subst_5 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_33 Int) (v_DerPreprocessor_7 Int)) (let ((.cse34 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (let ((.cse33 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_7) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select (store (store .cse34 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse33 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse33 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse34 |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))))) .cse35 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_36 Int) (v_subst_8 Int)) (let ((.cse36 (store .cse0 v_arrayElimCell_209 1))) (let ((.cse37 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse38 (store (store .cse36 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_36) v_subst_8 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse38 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse38 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= |c_#valid| (store (store .cse36 v_subst_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_8)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse37 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse37 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_8)))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_DerPreprocessor_27 Int) (v_prenex_9 Int)) (let ((.cse40 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1)) (.cse39 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= v_DerPreprocessor_27 (select (store (store .cse39 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_27) v_prenex_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse40 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse40 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse39 v_prenex_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((v_arrayElimCell_209 Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_30 Int)) (let ((.cse41 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1)) (.cse42 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select (store (store .cse41 v_arrayElimCell_210 v_DerPreprocessor_30) v_prenex_7 0) v_arrayElimCell_210) v_DerPreprocessor_30) (= |c_#valid| (store (store .cse41 v_prenex_7 0) v_arrayElimCell_210 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse42 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse42 v_arrayElimCell_210) 0) (not (= v_arrayElimCell_209 v_prenex_7))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_7 Int) (v_ArrVal_2314 Int)) (let ((.cse43 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse43 v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse43 v_subst_7) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int)) (let ((.cse44 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse44 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse44 v_arrayElimCell_210) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_9 Int) (v_arrayElimCell_210 Int)) (let ((.cse45 (store (store (store .cse0 v_arrayElimCell_209 1) v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_subst_9 0))) (let ((.cse46 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse45 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 (select .cse45 v_arrayElimCell_210)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= v_arrayElimCell_210 v_subst_9)) (= |c_#valid| (store .cse45 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (= (select .cse46 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse46 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (not (= v_arrayElimCell_210 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= v_arrayElimCell_209 v_subst_9)))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_7 Int) (v_ArrVal_2314 Int) (v_DerPreprocessor_32 Int)) (let ((.cse47 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse47 v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_7)) (= (select (store (store .cse47 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_32) v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) v_DerPreprocessor_32) (= (select .cse47 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int) (v_prenex_8 Int)) (let ((.cse48 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse48 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse48 v_arrayElimCell_210) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_prenex_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_prenex_8))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_1 Int)) (let ((.cse49 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) v_arrayElimCell_209 1))) (and (= (select .cse49 v_arrayElimCell_210) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse49 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_29 Int) (v_subst_9 Int)) (let ((.cse51 (store .cse0 v_arrayElimCell_209 1))) (let ((.cse50 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse52 (store (store .cse51 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_29) v_subst_9 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse52 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse52 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_9)) (= (select .cse50 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse50 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse51 v_subst_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_9)))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_7 Int)) (let ((.cse53 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0))) (let ((.cse54 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_7) v_arrayElimCell_209 1) v_arrayElimCell_210 (select .cse53 v_arrayElimCell_210)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= |c_#valid| (store .cse53 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse54 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (not (= v_arrayElimCell_210 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse54 v_arrayElimCell_210) 0))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_12 Int) (v_arrayElimCell_210 Int)) (let ((.cse55 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse55 v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse55 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_12) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_13 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int)) (let ((.cse56 (store (store .cse0 v_arrayElimCell_209 1) v_arrayElimCell_210 0))) (let ((.cse57 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse56 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 v_DerPreprocessor_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= |c_#valid| (store .cse56 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select .cse57 v_arrayElimCell_210) 0) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse57 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209)))))) (exists ((v_arrayElimCell_209 Int) (v_prenex_7 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int)) (let ((.cse58 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse58 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse58 v_arrayElimCell_210) 0) (not (= v_arrayElimCell_209 v_prenex_7)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_210 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= v_arrayElimCell_210 v_prenex_7))))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_34 Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_8 Int)) (let ((.cse59 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_34) v_arrayElimCell_209 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 v_DerPreprocessor_8) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse59 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0)) (= (select .cse59 v_arrayElimCell_210) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_subst_7 Int) (v_ArrVal_2314 Int)) (let ((.cse60 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (not (= v_arrayElimCell_209 v_subst_7)) (= (store (store (store .cse60 v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0) |c_#valid|) (= (select .cse60 v_arrayElimCell_210) 0) (not (= v_arrayElimCell_210 v_subst_7)) (not (= v_arrayElimCell_210 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_26 Int) (v_arrayElimCell_210 Int)) (let ((.cse61 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_26) v_arrayElimCell_209 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 v_DerPreprocessor_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse61 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= 0 (select .cse61 v_arrayElimCell_210))))))) (and .cse19 (or (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_37 Int) (v_prenex_13 Int) (v_subst_11 Int)) (let ((.cse62 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_37) v_arrayElimCell_209 1) v_subst_11 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_subst_11 v_prenex_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= (select .cse62 v_subst_11) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_subst_11 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse62 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_11))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_12 Int) (v_prenex_14 Int)) (let ((.cse63 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse63 v_subst_12) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_14) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse63 v_subst_12 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_15 Int) (v_subst_10 Int)) (let ((.cse64 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_15) v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_subst_10 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse64 v_subst_10) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse64 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_13 Int) (v_subst_11 Int)) (let ((.cse66 (store (store .cse0 v_arrayElimCell_209 1) v_subst_11 0))) (let ((.cse65 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse66 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_subst_11 v_prenex_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse65 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store .cse66 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse65 v_subst_11) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_11)))))))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_13 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (let ((.cse68 (store (store .cse0 v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))) (let ((.cse67 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse68 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse67 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| .cse68) (= (select .cse67 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_12 Int)) (let ((.cse69 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse69 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_12) v_arrayElimCell_209) 0) (= |c_#valid| (store .cse69 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (and (or .cse25 (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_8 Int)) (let ((.cse71 (store (store .cse0 v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))) (let ((.cse70 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse71 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse70 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| .cse71) (= (select .cse70 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0))))))) .cse35 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_6 Int) (v_ArrVal_2314 Int)) (let ((.cse72 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse72 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse72 v_subst_6 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_6)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_prenex_8 Int)) (let ((.cse73 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select .cse73 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse73 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_prenex_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_prenex_8))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_21 Int)) (let ((.cse75 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (let ((.cse74 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_7) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select (store (store .cse75 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= (select .cse74 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse74 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse75 |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_18 Int) (v_subst_9 Int)) (let ((.cse77 (store .cse0 v_arrayElimCell_209 1))) (let ((.cse76 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse78 (store (store .cse77 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_18) v_subst_9 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse78 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse78 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse76 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_9)) (= |c_#valid| (store (store .cse77 v_subst_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse76 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= v_arrayElimCell_209 v_subst_9)))))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_7 Int) (v_DerPreprocessor_22 Int) (v_prenex_11 Int)) (let ((.cse79 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1)) (.cse80 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse79 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse80 v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse79 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= v_arrayElimCell_209 v_prenex_7)) (= v_DerPreprocessor_22 (select (store (store .cse80 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_22) v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_24 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_7 Int) (v_ArrVal_2314 Int)) (let ((.cse81 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse81 v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_7)) (= (select .cse81 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store (store .cse81 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_24) v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) v_DerPreprocessor_24) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_25 Int) (v_prenex_11 Int) (v_prenex_9 Int)) (let ((.cse82 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1)) (.cse83 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse82 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse82 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse83 v_prenex_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= v_DerPreprocessor_25 (select (store (store .cse83 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_25) v_prenex_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (exists ((v_arrayElimCell_209 Int) (v_subst_8 Int) (v_DerPreprocessor_20 Int)) (let ((.cse84 (store .cse0 v_arrayElimCell_209 1))) (let ((.cse85 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse86 (store (store .cse84 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_20) v_subst_8 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse86 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse86 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse84 v_subst_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse85 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_8)) (= (select .cse85 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_8)))))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_23 Int) (v_subst_5 Int) (v_ArrVal_2314 Int)) (let ((.cse87 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse87 v_subst_5 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse87 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= v_DerPreprocessor_23 (select (store (store .cse87 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_23) v_subst_5 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0))))) .cse18))))))) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 0)) is different from false [2023-11-29 02:03:38,330 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse19 (= |c_ULTIMATE.start_destroy_sl_~sl#1.offset| 4)) (.cse17 (= |c_ULTIMATE.start_destroy_sl_~sl#1.offset| 0))) (let ((.cse13 (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_17 Int) (v_subst_3 Int)) (let ((.cse90 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_17) v_subst_3 1))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_3 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse90 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse90 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_3) 0))))) (.cse14 (exists ((v_prenex_16 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_1 Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_16) v_subst_1) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_1 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_1 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (.cse12 (not .cse17)) (.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select |c_#valid| |c_ULTIMATE.start_destroy_sl_~sl#1.base|))) (.cse18 (not .cse19))) (or (and (or (and (or (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_9 Int) (v_arrayElimCell_210 Int)) (let ((.cse1 (select |c_#valid| v_arrayElimCell_210))) (let ((.cse2 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse3 (store (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 .cse1) v_subst_9 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse3 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 (select .cse3 v_arrayElimCell_210))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (not (= v_arrayElimCell_210 v_subst_9)) (= |c_#valid| (store (store (store .cse0 v_arrayElimCell_210 .cse1) v_subst_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse2 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_9)) (= (select .cse2 v_arrayElimCell_210) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_7 Int) (v_prenex_11 Int)) (let ((.cse4 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select .cse4 v_prenex_7) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse4 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int)) (let ((.cse5 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse5 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= v_prenex_7 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse5 v_arrayElimCell_210) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_210 v_prenex_7))))) (exists ((v_DerPreprocessor_13 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int)) (let ((.cse6 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 v_DerPreprocessor_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select .cse6 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse6 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= |c_#valid| (store (store .cse0 v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_1 Int)) (let ((.cse7 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse7 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select .cse7 v_arrayElimCell_210) 0)))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_ArrVal_2314 Int)) (and (exists ((v_arrayElimCell_210 Int) (v_subst_7 Int)) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210) 0) (not (= v_arrayElimCell_210 v_subst_7)) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_7)))) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_ArrVal_2314 Int)) (and (exists ((v_subst_6 Int)) (and (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_6)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_6 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (exists ((v_arrayElimCell_210 Int)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210) 0)))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_8 Int)) (let ((.cse8 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 v_DerPreprocessor_8) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse8 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select .cse8 v_arrayElimCell_210) 0) (= |c_#valid| (store (store .cse0 v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_12 Int) (v_arrayElimCell_210 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_12) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int) (v_prenex_8 Int)) (let ((.cse9 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse9 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select .cse9 v_arrayElimCell_210) 0) (not (= v_prenex_8 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_prenex_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_7 Int)) (let ((.cse11 (select |c_#valid| v_arrayElimCell_210))) (let ((.cse10 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_7) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 .cse11) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) v_arrayElimCell_210)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select .cse10 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse10 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 .cse11) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_ArrVal_2314 Int)) (and (exists ((v_subst_7 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_subst_7) 0))) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0)))) .cse12) (and (or .cse13 .cse14 (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_2 Int) (v_DerPreprocessor_51 Int)) (let ((.cse15 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse16 (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_51) v_subst_2 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse16 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse16 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse15 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse0 v_subst_2 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse15 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2) 0))))) .cse17)) .cse18) (and .cse19 (or (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_13 Int) (v_subst_11 Int)) (let ((.cse20 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_subst_11 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_subst_11 v_prenex_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select .cse20 v_subst_11) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_11)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse20 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse0 v_subst_11 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_12 Int) (v_prenex_14 Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_subst_12) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_14) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_12 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))) (exists ((v_prenex_15 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_10 Int)) (let ((.cse21 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_15) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_10 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse21 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select .cse21 v_subst_10) 0)))))) (and (or .cse13 .cse14 (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_2 Int) (v_DerPreprocessor_40 Int)) (let ((.cse22 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse23 (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_40) v_subst_2 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse23 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse23 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse22 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse22 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2) 0) (= |c_#valid| (store (store .cse0 v_subst_2 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))))) .cse17) (and .cse12 (let ((.cse25 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_prenex_10 Int)) (let ((.cse89 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select .cse89 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_prenex_10 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse89 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0))))) (.cse35 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_4 Int) (v_ArrVal_2314 Int)) (let ((.cse88 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse88 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse88 v_subst_4 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))))) (or (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_1 Int)) (let ((.cse24 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) v_arrayElimCell_209 1))) (and (= (select .cse24 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse24 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (and .cse18 (or .cse25 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_8 Int)) (let ((.cse27 (store (store .cse0 v_arrayElimCell_209 1) v_arrayElimCell_210 0))) (let ((.cse26 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse27 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 v_DerPreprocessor_8) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse26 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse26 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store .cse27 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)))))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_28 Int) (v_subst_9 Int) (v_arrayElimCell_210 Int)) (let ((.cse29 (select |c_#valid| v_arrayElimCell_210))) (let ((.cse28 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse30 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_28) v_arrayElimCell_209 1) v_arrayElimCell_210 .cse29) v_subst_9 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse30 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 (select .cse30 v_arrayElimCell_210))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= v_arrayElimCell_210 v_subst_9)) (= (select .cse28 v_arrayElimCell_210) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 .cse29) v_subst_9 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0)) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse28 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (not (= v_arrayElimCell_209 v_subst_9)))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_subst_6 Int) (v_ArrVal_2314 Int)) (let ((.cse31 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse31 v_arrayElimCell_210) 0) (= |c_#valid| (store (store .cse31 v_subst_6 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_6)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_5 Int) (v_ArrVal_2314 Int) (v_DerPreprocessor_31 Int)) (let ((.cse32 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse32 v_subst_5 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse32 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= v_DerPreprocessor_31 (select (store (store .cse32 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_31) v_subst_5 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_33 Int) (v_DerPreprocessor_7 Int)) (let ((.cse34 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (let ((.cse33 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_7) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select (store (store .cse34 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse33 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse33 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse34 |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))))) .cse35 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_36 Int) (v_subst_8 Int)) (let ((.cse36 (store .cse0 v_arrayElimCell_209 1))) (let ((.cse37 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse38 (store (store .cse36 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_36) v_subst_8 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse38 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse38 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= |c_#valid| (store (store .cse36 v_subst_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_8)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse37 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse37 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_8)))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_DerPreprocessor_27 Int) (v_prenex_9 Int)) (let ((.cse40 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1)) (.cse39 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= v_DerPreprocessor_27 (select (store (store .cse39 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_27) v_prenex_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse40 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse40 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse39 v_prenex_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((v_arrayElimCell_209 Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_30 Int)) (let ((.cse41 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1)) (.cse42 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select (store (store .cse41 v_arrayElimCell_210 v_DerPreprocessor_30) v_prenex_7 0) v_arrayElimCell_210) v_DerPreprocessor_30) (= |c_#valid| (store (store .cse41 v_prenex_7 0) v_arrayElimCell_210 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse42 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse42 v_arrayElimCell_210) 0) (not (= v_arrayElimCell_209 v_prenex_7))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_7 Int) (v_ArrVal_2314 Int)) (let ((.cse43 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse43 v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse43 v_subst_7) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int)) (let ((.cse44 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse44 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse44 v_arrayElimCell_210) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_9 Int) (v_arrayElimCell_210 Int)) (let ((.cse45 (store (store (store .cse0 v_arrayElimCell_209 1) v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_subst_9 0))) (let ((.cse46 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse45 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 (select .cse45 v_arrayElimCell_210)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= v_arrayElimCell_210 v_subst_9)) (= |c_#valid| (store .cse45 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (= (select .cse46 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse46 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (not (= v_arrayElimCell_210 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= v_arrayElimCell_209 v_subst_9)))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_7 Int) (v_ArrVal_2314 Int) (v_DerPreprocessor_32 Int)) (let ((.cse47 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse47 v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_7)) (= (select (store (store .cse47 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_32) v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) v_DerPreprocessor_32) (= (select .cse47 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int) (v_prenex_8 Int)) (let ((.cse48 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse48 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse48 v_arrayElimCell_210) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_prenex_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_prenex_8))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_1 Int)) (let ((.cse49 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) v_arrayElimCell_209 1))) (and (= (select .cse49 v_arrayElimCell_210) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse49 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_29 Int) (v_subst_9 Int)) (let ((.cse51 (store .cse0 v_arrayElimCell_209 1))) (let ((.cse50 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse52 (store (store .cse51 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_29) v_subst_9 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse52 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse52 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_9)) (= (select .cse50 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse50 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse51 v_subst_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_9)))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_7 Int)) (let ((.cse53 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0))) (let ((.cse54 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_7) v_arrayElimCell_209 1) v_arrayElimCell_210 (select .cse53 v_arrayElimCell_210)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= |c_#valid| (store .cse53 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse54 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (not (= v_arrayElimCell_210 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse54 v_arrayElimCell_210) 0))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_12 Int) (v_arrayElimCell_210 Int)) (let ((.cse55 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse55 v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse55 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_12) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_13 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int)) (let ((.cse56 (store (store .cse0 v_arrayElimCell_209 1) v_arrayElimCell_210 0))) (let ((.cse57 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse56 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 v_DerPreprocessor_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= |c_#valid| (store .cse56 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select .cse57 v_arrayElimCell_210) 0) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse57 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209)))))) (exists ((v_arrayElimCell_209 Int) (v_prenex_7 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int)) (let ((.cse58 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse58 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse58 v_arrayElimCell_210) 0) (not (= v_arrayElimCell_209 v_prenex_7)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_210 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= v_arrayElimCell_210 v_prenex_7))))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_34 Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_8 Int)) (let ((.cse59 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_34) v_arrayElimCell_209 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 v_DerPreprocessor_8) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse59 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0)) (= (select .cse59 v_arrayElimCell_210) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_subst_7 Int) (v_ArrVal_2314 Int)) (let ((.cse60 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (not (= v_arrayElimCell_209 v_subst_7)) (= (store (store (store .cse60 v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0) |c_#valid|) (= (select .cse60 v_arrayElimCell_210) 0) (not (= v_arrayElimCell_210 v_subst_7)) (not (= v_arrayElimCell_210 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_26 Int) (v_arrayElimCell_210 Int)) (let ((.cse61 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_26) v_arrayElimCell_209 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 v_DerPreprocessor_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse61 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= 0 (select .cse61 v_arrayElimCell_210))))))) (and .cse19 (or (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_37 Int) (v_prenex_13 Int) (v_subst_11 Int)) (let ((.cse62 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_37) v_arrayElimCell_209 1) v_subst_11 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_subst_11 v_prenex_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= (select .cse62 v_subst_11) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_subst_11 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse62 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_11))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_12 Int) (v_prenex_14 Int)) (let ((.cse63 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse63 v_subst_12) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_14) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse63 v_subst_12 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_15 Int) (v_subst_10 Int)) (let ((.cse64 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_15) v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_subst_10 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse64 v_subst_10) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse64 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_13 Int) (v_subst_11 Int)) (let ((.cse66 (store (store .cse0 v_arrayElimCell_209 1) v_subst_11 0))) (let ((.cse65 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse66 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_subst_11 v_prenex_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse65 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store .cse66 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse65 v_subst_11) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_11)))))))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_13 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (let ((.cse68 (store (store .cse0 v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))) (let ((.cse67 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse68 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse67 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| .cse68) (= (select .cse67 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_12 Int)) (let ((.cse69 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse69 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_12) v_arrayElimCell_209) 0) (= |c_#valid| (store .cse69 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (and (or .cse25 (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_8 Int)) (let ((.cse71 (store (store .cse0 v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))) (let ((.cse70 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse71 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse70 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| .cse71) (= (select .cse70 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0))))))) .cse35 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_6 Int) (v_ArrVal_2314 Int)) (let ((.cse72 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse72 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse72 v_subst_6 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_6)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_prenex_8 Int)) (let ((.cse73 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select .cse73 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse73 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_prenex_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_prenex_8))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_21 Int)) (let ((.cse75 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (let ((.cse74 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_7) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select (store (store .cse75 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= (select .cse74 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse74 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse75 |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_18 Int) (v_subst_9 Int)) (let ((.cse77 (store .cse0 v_arrayElimCell_209 1))) (let ((.cse76 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse78 (store (store .cse77 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_18) v_subst_9 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse78 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse78 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse76 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_9)) (= |c_#valid| (store (store .cse77 v_subst_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse76 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= v_arrayElimCell_209 v_subst_9)))))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_7 Int) (v_DerPreprocessor_22 Int) (v_prenex_11 Int)) (let ((.cse79 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1)) (.cse80 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse79 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse80 v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse79 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= v_arrayElimCell_209 v_prenex_7)) (= v_DerPreprocessor_22 (select (store (store .cse80 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_22) v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_24 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_7 Int) (v_ArrVal_2314 Int)) (let ((.cse81 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse81 v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_7)) (= (select .cse81 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store (store .cse81 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_24) v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) v_DerPreprocessor_24) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_25 Int) (v_prenex_11 Int) (v_prenex_9 Int)) (let ((.cse82 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1)) (.cse83 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse82 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse82 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse83 v_prenex_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= v_DerPreprocessor_25 (select (store (store .cse83 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_25) v_prenex_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (exists ((v_arrayElimCell_209 Int) (v_subst_8 Int) (v_DerPreprocessor_20 Int)) (let ((.cse84 (store .cse0 v_arrayElimCell_209 1))) (let ((.cse85 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse86 (store (store .cse84 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_20) v_subst_8 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse86 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse86 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse84 v_subst_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse85 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_8)) (= (select .cse85 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_8)))))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_23 Int) (v_subst_5 Int) (v_ArrVal_2314 Int)) (let ((.cse87 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse87 v_subst_5 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse87 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= v_DerPreprocessor_23 (select (store (store .cse87 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_23) v_subst_5 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0))))) .cse18))))))) (<= 0 |c_ULTIMATE.start_destroy_sl_~sl#1.offset|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 0)) is different from false [2023-11-29 02:03:47,411 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-29 02:03:47,411 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:03:50,940 INFO L349 Elim1Store]: treesize reduction 29, result has 39.6 percent of original size [2023-11-29 02:03:50,940 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 2 case distinctions, treesize of input 63 treesize of output 56 [2023-11-29 02:03:50,969 INFO L349 Elim1Store]: treesize reduction 13, result has 71.7 percent of original size [2023-11-29 02:03:50,969 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 3 case distinctions, treesize of input 98 treesize of output 112 [2023-11-29 02:03:50,975 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 34 [2023-11-29 02:03:53,758 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 395 treesize of output 365 [2023-11-29 02:03:53,769 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 2659 treesize of output 2599 [2023-11-29 02:03:58,049 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 16 treesize of output 14 [2023-11-29 02:03:58,051 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 118 treesize of output 114 [2023-11-29 02:05:03,274 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 13 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:05:03,274 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [370267680] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:05:03,274 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:05:03,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [25, 25, 24] total 72 [2023-11-29 02:05:03,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [118690943] [2023-11-29 02:05:03,274 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:05:03,275 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 74 states [2023-11-29 02:05:03,275 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:05:03,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 74 interpolants. [2023-11-29 02:05:03,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=231, Invalid=4854, Unknown=35, NotChecked=282, Total=5402 [2023-11-29 02:05:03,276 INFO L87 Difference]: Start difference. First operand 133 states and 151 transitions. Second operand has 74 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 73 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 02:05:13,726 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 02:05:22,125 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 02:05:26,162 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.04s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:05:30,228 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 02:05:34,368 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 02:05:43,402 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 02:05:47,588 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 02:05:51,763 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 02:05:55,894 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 02:05:59,965 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 02:06:04,189 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 02:06:13,306 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 02:06:17,411 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 02:06:26,668 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 02:06:30,790 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 02:06:40,067 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 02:06:44,208 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 02:06:53,312 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 02:06:57,457 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 02:07:10,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 [0, 1] [2023-11-29 02:07:14,709 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 02:07:18,837 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 02:07:22,944 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 02:07:32,591 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 02:07:36,795 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 02:07:41,708 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 02:07:45,859 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 02:07:50,189 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 02:08:00,714 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 02:08:11,115 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 02:08:21,195 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 02:10:24,690 WARN L293 SmtUtils]: Spent 7.41s on a formula simplification. DAG size of input: 599 DAG size of output: 539 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 02:10:26,975 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.18s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:10:28,575 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:10:32,602 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 02:10:34,217 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.61s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:10:36,956 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:10:39,015 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:10:41,812 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.69s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:10:44,259 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:10:45,814 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:10:46,837 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:10:49,458 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:10:50,461 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:10:52,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.97s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:10:56,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 02:10:59,808 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:11:02,652 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.20s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:11:06,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:11:10,246 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:11:11,370 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.12s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:11:17,024 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:11:18,731 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.71s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:11:22,584 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.25s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:11:23,599 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.01s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:11:26,989 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:11:29,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.63s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:11:32,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.38s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:11:38,816 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 02:11:41,526 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:11:44,707 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.10s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:11:46,305 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:11:47,437 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:11:50,882 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:11:53,289 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:11:58,293 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.86s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:12:02,564 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:12:06,577 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 [0] [2023-11-29 02:12:10,479 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:12:16,318 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:12:18,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.34s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:12:21,851 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.44s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:12:24,153 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.30s for a HTC check with result INVALID. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:12:29,014 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse17 (= |c_ULTIMATE.start_destroy_sl_~sl#1.offset| 0))) (let ((.cse92 (= |c_ULTIMATE.start_main_old_#valid#1| (store (store |c_#valid| |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0))) (.cse12 (not .cse17)) (.cse93 (= (store |c_#valid| |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) (.cse90 (select |c_#valid| |c_ULTIMATE.start_destroy_sl_~sl#1.base|))) (and (let ((.cse19 (= |c_ULTIMATE.start_destroy_sl_~sl#1.offset| 4))) (let ((.cse13 (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_17 Int) (v_subst_3 Int)) (let ((.cse91 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_17) v_subst_3 1))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_3 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse91 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse91 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_3) 0))))) (.cse14 (exists ((v_prenex_16 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_1 Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_16) v_subst_1) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_1 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_1 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| .cse90)) (.cse18 (not .cse19))) (or (and (or (and (or (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_9 Int) (v_arrayElimCell_210 Int)) (let ((.cse1 (select |c_#valid| v_arrayElimCell_210))) (let ((.cse2 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse3 (store (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 .cse1) v_subst_9 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse3 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 (select .cse3 v_arrayElimCell_210))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (not (= v_arrayElimCell_210 v_subst_9)) (= |c_#valid| (store (store (store .cse0 v_arrayElimCell_210 .cse1) v_subst_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse2 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_9)) (= (select .cse2 v_arrayElimCell_210) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_7 Int) (v_prenex_11 Int)) (let ((.cse4 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select .cse4 v_prenex_7) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse4 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int)) (let ((.cse5 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse5 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= v_prenex_7 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse5 v_arrayElimCell_210) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_210 v_prenex_7))))) (exists ((v_DerPreprocessor_13 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int)) (let ((.cse6 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 v_DerPreprocessor_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select .cse6 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse6 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= |c_#valid| (store (store .cse0 v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_1 Int)) (let ((.cse7 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse7 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select .cse7 v_arrayElimCell_210) 0)))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_ArrVal_2314 Int)) (and (exists ((v_arrayElimCell_210 Int) (v_subst_7 Int)) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210) 0) (not (= v_arrayElimCell_210 v_subst_7)) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_7)))) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_ArrVal_2314 Int)) (and (exists ((v_subst_6 Int)) (and (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_6)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_6 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (exists ((v_arrayElimCell_210 Int)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210) 0)))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_8 Int)) (let ((.cse8 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 v_DerPreprocessor_8) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse8 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select .cse8 v_arrayElimCell_210) 0) (= |c_#valid| (store (store .cse0 v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_12 Int) (v_arrayElimCell_210 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_12) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int) (v_prenex_8 Int)) (let ((.cse9 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse9 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select .cse9 v_arrayElimCell_210) 0) (not (= v_prenex_8 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_prenex_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_7 Int)) (let ((.cse11 (select |c_#valid| v_arrayElimCell_210))) (let ((.cse10 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_7) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 .cse11) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) v_arrayElimCell_210)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select .cse10 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse10 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 .cse11) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_ArrVal_2314 Int)) (and (exists ((v_subst_7 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_subst_7) 0))) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0)))) .cse12) (and (or .cse13 .cse14 (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_2 Int) (v_DerPreprocessor_51 Int)) (let ((.cse15 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse16 (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_51) v_subst_2 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse16 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse16 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse15 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse0 v_subst_2 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse15 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2) 0))))) .cse17)) .cse18) (and .cse19 (or (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_13 Int) (v_subst_11 Int)) (let ((.cse20 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_subst_11 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_subst_11 v_prenex_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select .cse20 v_subst_11) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_11)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse20 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse0 v_subst_11 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_12 Int) (v_prenex_14 Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_subst_12) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_14) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_12 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))) (exists ((v_prenex_15 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_10 Int)) (let ((.cse21 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_15) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_10 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse21 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select .cse21 v_subst_10) 0)))))) (and (or .cse13 .cse14 (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_2 Int) (v_DerPreprocessor_40 Int)) (let ((.cse22 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse23 (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_40) v_subst_2 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse23 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse23 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse22 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse22 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2) 0) (= |c_#valid| (store (store .cse0 v_subst_2 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))))) .cse17) (and .cse12 (let ((.cse25 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_prenex_10 Int)) (let ((.cse89 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select .cse89 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_prenex_10 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse89 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0))))) (.cse35 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_4 Int) (v_ArrVal_2314 Int)) (let ((.cse88 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse88 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse88 v_subst_4 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))))) (or (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_1 Int)) (let ((.cse24 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) v_arrayElimCell_209 1))) (and (= (select .cse24 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse24 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (and .cse18 (or .cse25 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_8 Int)) (let ((.cse27 (store (store .cse0 v_arrayElimCell_209 1) v_arrayElimCell_210 0))) (let ((.cse26 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse27 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 v_DerPreprocessor_8) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse26 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse26 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store .cse27 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)))))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_28 Int) (v_subst_9 Int) (v_arrayElimCell_210 Int)) (let ((.cse29 (select |c_#valid| v_arrayElimCell_210))) (let ((.cse28 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse30 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_28) v_arrayElimCell_209 1) v_arrayElimCell_210 .cse29) v_subst_9 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse30 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 (select .cse30 v_arrayElimCell_210))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= v_arrayElimCell_210 v_subst_9)) (= (select .cse28 v_arrayElimCell_210) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 .cse29) v_subst_9 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0)) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse28 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (not (= v_arrayElimCell_209 v_subst_9)))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_subst_6 Int) (v_ArrVal_2314 Int)) (let ((.cse31 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse31 v_arrayElimCell_210) 0) (= |c_#valid| (store (store .cse31 v_subst_6 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_6)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_5 Int) (v_ArrVal_2314 Int) (v_DerPreprocessor_31 Int)) (let ((.cse32 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse32 v_subst_5 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse32 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= v_DerPreprocessor_31 (select (store (store .cse32 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_31) v_subst_5 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_33 Int) (v_DerPreprocessor_7 Int)) (let ((.cse34 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (let ((.cse33 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_7) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select (store (store .cse34 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse33 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse33 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse34 |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))))) .cse35 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_36 Int) (v_subst_8 Int)) (let ((.cse36 (store .cse0 v_arrayElimCell_209 1))) (let ((.cse37 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse38 (store (store .cse36 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_36) v_subst_8 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse38 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse38 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= |c_#valid| (store (store .cse36 v_subst_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_8)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse37 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse37 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_8)))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_DerPreprocessor_27 Int) (v_prenex_9 Int)) (let ((.cse40 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1)) (.cse39 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= v_DerPreprocessor_27 (select (store (store .cse39 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_27) v_prenex_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse40 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse40 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse39 v_prenex_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((v_arrayElimCell_209 Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_30 Int)) (let ((.cse41 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1)) (.cse42 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select (store (store .cse41 v_arrayElimCell_210 v_DerPreprocessor_30) v_prenex_7 0) v_arrayElimCell_210) v_DerPreprocessor_30) (= |c_#valid| (store (store .cse41 v_prenex_7 0) v_arrayElimCell_210 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse42 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse42 v_arrayElimCell_210) 0) (not (= v_arrayElimCell_209 v_prenex_7))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_7 Int) (v_ArrVal_2314 Int)) (let ((.cse43 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse43 v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse43 v_subst_7) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int)) (let ((.cse44 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse44 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse44 v_arrayElimCell_210) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_9 Int) (v_arrayElimCell_210 Int)) (let ((.cse45 (store (store (store .cse0 v_arrayElimCell_209 1) v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_subst_9 0))) (let ((.cse46 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse45 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 (select .cse45 v_arrayElimCell_210)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= v_arrayElimCell_210 v_subst_9)) (= |c_#valid| (store .cse45 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (= (select .cse46 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse46 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (not (= v_arrayElimCell_210 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= v_arrayElimCell_209 v_subst_9)))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_7 Int) (v_ArrVal_2314 Int) (v_DerPreprocessor_32 Int)) (let ((.cse47 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse47 v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_7)) (= (select (store (store .cse47 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_32) v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) v_DerPreprocessor_32) (= (select .cse47 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int) (v_prenex_8 Int)) (let ((.cse48 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse48 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse48 v_arrayElimCell_210) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_prenex_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_prenex_8))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_1 Int)) (let ((.cse49 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) v_arrayElimCell_209 1))) (and (= (select .cse49 v_arrayElimCell_210) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse49 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_29 Int) (v_subst_9 Int)) (let ((.cse51 (store .cse0 v_arrayElimCell_209 1))) (let ((.cse50 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse52 (store (store .cse51 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_29) v_subst_9 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse52 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse52 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_9)) (= (select .cse50 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse50 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse51 v_subst_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_9)))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_7 Int)) (let ((.cse53 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0))) (let ((.cse54 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_7) v_arrayElimCell_209 1) v_arrayElimCell_210 (select .cse53 v_arrayElimCell_210)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= |c_#valid| (store .cse53 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse54 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (not (= v_arrayElimCell_210 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse54 v_arrayElimCell_210) 0))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_12 Int) (v_arrayElimCell_210 Int)) (let ((.cse55 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse55 v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse55 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_12) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_13 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int)) (let ((.cse56 (store (store .cse0 v_arrayElimCell_209 1) v_arrayElimCell_210 0))) (let ((.cse57 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse56 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 v_DerPreprocessor_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= |c_#valid| (store .cse56 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select .cse57 v_arrayElimCell_210) 0) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse57 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209)))))) (exists ((v_arrayElimCell_209 Int) (v_prenex_7 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int)) (let ((.cse58 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse58 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse58 v_arrayElimCell_210) 0) (not (= v_arrayElimCell_209 v_prenex_7)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_210 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= v_arrayElimCell_210 v_prenex_7))))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_34 Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_8 Int)) (let ((.cse59 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_34) v_arrayElimCell_209 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 v_DerPreprocessor_8) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse59 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0)) (= (select .cse59 v_arrayElimCell_210) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_subst_7 Int) (v_ArrVal_2314 Int)) (let ((.cse60 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (not (= v_arrayElimCell_209 v_subst_7)) (= (store (store (store .cse60 v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0) |c_#valid|) (= (select .cse60 v_arrayElimCell_210) 0) (not (= v_arrayElimCell_210 v_subst_7)) (not (= v_arrayElimCell_210 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_26 Int) (v_arrayElimCell_210 Int)) (let ((.cse61 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_26) v_arrayElimCell_209 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 v_DerPreprocessor_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse61 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= 0 (select .cse61 v_arrayElimCell_210))))))) (and .cse19 (or (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_37 Int) (v_prenex_13 Int) (v_subst_11 Int)) (let ((.cse62 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_37) v_arrayElimCell_209 1) v_subst_11 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_subst_11 v_prenex_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= (select .cse62 v_subst_11) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_subst_11 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse62 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_11))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_12 Int) (v_prenex_14 Int)) (let ((.cse63 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse63 v_subst_12) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_14) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse63 v_subst_12 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_15 Int) (v_subst_10 Int)) (let ((.cse64 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_15) v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_subst_10 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse64 v_subst_10) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse64 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_13 Int) (v_subst_11 Int)) (let ((.cse66 (store (store .cse0 v_arrayElimCell_209 1) v_subst_11 0))) (let ((.cse65 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse66 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_subst_11 v_prenex_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse65 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store .cse66 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse65 v_subst_11) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_11)))))))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_13 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (let ((.cse68 (store (store .cse0 v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))) (let ((.cse67 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse68 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse67 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| .cse68) (= (select .cse67 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_12 Int)) (let ((.cse69 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse69 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_12) v_arrayElimCell_209) 0) (= |c_#valid| (store .cse69 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (and (or .cse25 (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_8 Int)) (let ((.cse71 (store (store .cse0 v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))) (let ((.cse70 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse71 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse70 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| .cse71) (= (select .cse70 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0))))))) .cse35 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_6 Int) (v_ArrVal_2314 Int)) (let ((.cse72 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse72 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse72 v_subst_6 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_6)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_prenex_8 Int)) (let ((.cse73 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select .cse73 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse73 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_prenex_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_prenex_8))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_21 Int)) (let ((.cse75 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (let ((.cse74 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_7) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select (store (store .cse75 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= (select .cse74 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse74 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse75 |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_18 Int) (v_subst_9 Int)) (let ((.cse77 (store .cse0 v_arrayElimCell_209 1))) (let ((.cse76 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse78 (store (store .cse77 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_18) v_subst_9 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse78 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse78 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse76 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_9)) (= |c_#valid| (store (store .cse77 v_subst_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse76 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= v_arrayElimCell_209 v_subst_9)))))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_7 Int) (v_DerPreprocessor_22 Int) (v_prenex_11 Int)) (let ((.cse79 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1)) (.cse80 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse79 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse80 v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse79 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= v_arrayElimCell_209 v_prenex_7)) (= v_DerPreprocessor_22 (select (store (store .cse80 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_22) v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_24 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_7 Int) (v_ArrVal_2314 Int)) (let ((.cse81 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse81 v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_7)) (= (select .cse81 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store (store .cse81 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_24) v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) v_DerPreprocessor_24) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_25 Int) (v_prenex_11 Int) (v_prenex_9 Int)) (let ((.cse82 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1)) (.cse83 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse82 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse82 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse83 v_prenex_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= v_DerPreprocessor_25 (select (store (store .cse83 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_25) v_prenex_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (exists ((v_arrayElimCell_209 Int) (v_subst_8 Int) (v_DerPreprocessor_20 Int)) (let ((.cse84 (store .cse0 v_arrayElimCell_209 1))) (let ((.cse85 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse86 (store (store .cse84 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_20) v_subst_8 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse86 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse86 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse84 v_subst_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse85 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_8)) (= (select .cse85 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_8)))))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_23 Int) (v_subst_5 Int) (v_ArrVal_2314 Int)) (let ((.cse87 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse87 v_subst_5 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse87 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= v_DerPreprocessor_23 (select (store (store .cse87 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_23) v_subst_5 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0))))) .cse18))))))) (or .cse12 .cse92) (or .cse92 (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |c_ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (or .cse12 .cse93) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 0) (or .cse93 (= .cse90 0))))) is different from false [2023-11-29 02:12:33,126 WARN L854 $PredicateComparison]: unable to prove that (and (let ((.cse19 (= |c_ULTIMATE.start_destroy_sl_~sl#1.offset| 4)) (.cse17 (= |c_ULTIMATE.start_destroy_sl_~sl#1.offset| 0))) (let ((.cse13 (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_17 Int) (v_subst_3 Int)) (let ((.cse90 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_17) v_subst_3 1))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_3 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse90 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse90 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_3) 0))))) (.cse14 (exists ((v_prenex_16 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_1 Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_16) v_subst_1) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_1 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_1 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (.cse12 (not .cse17)) (.cse0 (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select |c_#valid| |c_ULTIMATE.start_destroy_sl_~sl#1.base|))) (.cse18 (not .cse19))) (or (and (or (and (or (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_9 Int) (v_arrayElimCell_210 Int)) (let ((.cse1 (select |c_#valid| v_arrayElimCell_210))) (let ((.cse2 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse3 (store (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 .cse1) v_subst_9 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse3 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 (select .cse3 v_arrayElimCell_210))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (not (= v_arrayElimCell_210 v_subst_9)) (= |c_#valid| (store (store (store .cse0 v_arrayElimCell_210 .cse1) v_subst_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse2 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_9)) (= (select .cse2 v_arrayElimCell_210) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_7 Int) (v_prenex_11 Int)) (let ((.cse4 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select .cse4 v_prenex_7) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse4 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int)) (let ((.cse5 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse5 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= v_prenex_7 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse5 v_arrayElimCell_210) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_210 v_prenex_7))))) (exists ((v_DerPreprocessor_13 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int)) (let ((.cse6 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 v_DerPreprocessor_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select .cse6 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse6 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= |c_#valid| (store (store .cse0 v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_1 Int)) (let ((.cse7 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse7 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select .cse7 v_arrayElimCell_210) 0)))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_ArrVal_2314 Int)) (and (exists ((v_arrayElimCell_210 Int) (v_subst_7 Int)) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210) 0) (not (= v_arrayElimCell_210 v_subst_7)) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_7)))) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_ArrVal_2314 Int)) (and (exists ((v_subst_6 Int)) (and (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_6)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_6 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (exists ((v_arrayElimCell_210 Int)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210) 0)))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_8 Int)) (let ((.cse8 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 v_DerPreprocessor_8) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse8 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select .cse8 v_arrayElimCell_210) 0) (= |c_#valid| (store (store .cse0 v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_12 Int) (v_arrayElimCell_210 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_12) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int) (v_prenex_8 Int)) (let ((.cse9 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse9 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select .cse9 v_arrayElimCell_210) 0) (not (= v_prenex_8 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_prenex_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_7 Int)) (let ((.cse11 (select |c_#valid| v_arrayElimCell_210))) (let ((.cse10 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_7) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_arrayElimCell_210 .cse11) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) v_arrayElimCell_210)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select .cse10 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse10 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_210 .cse11) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_ArrVal_2314 Int)) (and (exists ((v_subst_7 Int)) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_subst_7) 0))) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0)))) .cse12) (and (or .cse13 .cse14 (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_2 Int) (v_DerPreprocessor_51 Int)) (let ((.cse15 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse16 (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_51) v_subst_2 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse16 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse16 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse15 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse0 v_subst_2 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse15 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2) 0))))) .cse17)) .cse18) (and .cse19 (or (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_13 Int) (v_subst_11 Int)) (let ((.cse20 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_subst_11 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_subst_11 v_prenex_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= (select .cse20 v_subst_11) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_11)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse20 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse0 v_subst_11 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_12 Int) (v_prenex_14 Int)) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1) v_subst_12) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_14) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_12 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))) (exists ((v_prenex_15 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_10 Int)) (let ((.cse21 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_15) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 1))) (and (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_subst_10 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse21 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select .cse21 v_subst_10) 0)))))) (and (or .cse13 .cse14 (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_2 Int) (v_DerPreprocessor_40 Int)) (let ((.cse22 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse23 (store (store .cse0 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_40) v_subst_2 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse23 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse23 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse22 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse22 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_subst_2) 0) (= |c_#valid| (store (store .cse0 v_subst_2 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))))) .cse17) (and .cse12 (let ((.cse25 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_prenex_10 Int)) (let ((.cse89 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select .cse89 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_prenex_10 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse89 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0))))) (.cse35 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_4 Int) (v_ArrVal_2314 Int)) (let ((.cse88 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse88 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse88 v_subst_4 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))))) (or (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_1 Int)) (let ((.cse24 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) v_arrayElimCell_209 1))) (and (= (select .cse24 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse24 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209)) (= |c_#valid| (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (and .cse18 (or .cse25 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_8 Int)) (let ((.cse27 (store (store .cse0 v_arrayElimCell_209 1) v_arrayElimCell_210 0))) (let ((.cse26 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse27 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 v_DerPreprocessor_8) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse26 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse26 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store .cse27 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)))))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_28 Int) (v_subst_9 Int) (v_arrayElimCell_210 Int)) (let ((.cse29 (select |c_#valid| v_arrayElimCell_210))) (let ((.cse28 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse30 (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_28) v_arrayElimCell_209 1) v_arrayElimCell_210 .cse29) v_subst_9 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse30 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 (select .cse30 v_arrayElimCell_210))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= v_arrayElimCell_210 v_subst_9)) (= (select .cse28 v_arrayElimCell_210) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 .cse29) v_subst_9 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0)) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse28 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (not (= v_arrayElimCell_209 v_subst_9)))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_subst_6 Int) (v_ArrVal_2314 Int)) (let ((.cse31 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse31 v_arrayElimCell_210) 0) (= |c_#valid| (store (store .cse31 v_subst_6 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_6)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_5 Int) (v_ArrVal_2314 Int) (v_DerPreprocessor_31 Int)) (let ((.cse32 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse32 v_subst_5 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse32 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= v_DerPreprocessor_31 (select (store (store .cse32 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_31) v_subst_5 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_33 Int) (v_DerPreprocessor_7 Int)) (let ((.cse34 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (let ((.cse33 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_7) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select (store (store .cse34 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_33) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse33 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse33 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse34 |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))))) .cse35 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_36 Int) (v_subst_8 Int)) (let ((.cse36 (store .cse0 v_arrayElimCell_209 1))) (let ((.cse37 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse38 (store (store .cse36 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_36) v_subst_8 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse38 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse38 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= |c_#valid| (store (store .cse36 v_subst_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_8)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse37 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse37 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_8)))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_DerPreprocessor_27 Int) (v_prenex_9 Int)) (let ((.cse40 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1)) (.cse39 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= v_DerPreprocessor_27 (select (store (store .cse39 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_27) v_prenex_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse40 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse40 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse39 v_prenex_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((v_arrayElimCell_209 Int) (v_prenex_7 Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_30 Int)) (let ((.cse41 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1)) (.cse42 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select (store (store .cse41 v_arrayElimCell_210 v_DerPreprocessor_30) v_prenex_7 0) v_arrayElimCell_210) v_DerPreprocessor_30) (= |c_#valid| (store (store .cse41 v_prenex_7 0) v_arrayElimCell_210 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse42 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse42 v_arrayElimCell_210) 0) (not (= v_arrayElimCell_209 v_prenex_7))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_7 Int) (v_ArrVal_2314 Int)) (let ((.cse43 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse43 v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse43 v_subst_7) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int)) (let ((.cse44 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse44 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse44 v_arrayElimCell_210) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_9 Int) (v_arrayElimCell_210 Int)) (let ((.cse45 (store (store (store .cse0 v_arrayElimCell_209 1) v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_subst_9 0))) (let ((.cse46 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse45 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 (select .cse45 v_arrayElimCell_210)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= v_arrayElimCell_210 v_subst_9)) (= |c_#valid| (store .cse45 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (= (select .cse46 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse46 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (not (= v_arrayElimCell_210 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= v_arrayElimCell_209 v_subst_9)))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_7 Int) (v_ArrVal_2314 Int) (v_DerPreprocessor_32 Int)) (let ((.cse47 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse47 v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_7)) (= (select (store (store .cse47 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_32) v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) v_DerPreprocessor_32) (= (select .cse47 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int) (v_prenex_8 Int)) (let ((.cse48 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse48 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse48 v_arrayElimCell_210) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_prenex_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_prenex_8))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_1 Int)) (let ((.cse49 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_1) v_arrayElimCell_209 1))) (and (= (select .cse49 v_arrayElimCell_210) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse49 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_29 Int) (v_subst_9 Int)) (let ((.cse51 (store .cse0 v_arrayElimCell_209 1))) (let ((.cse50 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse52 (store (store .cse51 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_29) v_subst_9 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse52 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse52 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_9)) (= (select .cse50 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse50 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse51 v_subst_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_9)))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_7 Int)) (let ((.cse53 (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0))) (let ((.cse54 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_7) v_arrayElimCell_209 1) v_arrayElimCell_210 (select .cse53 v_arrayElimCell_210)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= |c_#valid| (store .cse53 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse54 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (not (= v_arrayElimCell_210 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select .cse54 v_arrayElimCell_210) 0))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_12 Int) (v_arrayElimCell_210 Int)) (let ((.cse55 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse55 v_arrayElimCell_210 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse55 v_arrayElimCell_210) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_12) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_13 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int)) (let ((.cse56 (store (store .cse0 v_arrayElimCell_209 1) v_arrayElimCell_210 0))) (let ((.cse57 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse56 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 v_DerPreprocessor_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= |c_#valid| (store .cse56 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select .cse57 v_arrayElimCell_210) 0) (= 0 (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse57 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209)))))) (exists ((v_arrayElimCell_209 Int) (v_prenex_7 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_arrayElimCell_210 Int)) (let ((.cse58 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse58 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= (select .cse58 v_arrayElimCell_210) 0) (not (= v_arrayElimCell_209 v_prenex_7)) (= |c_#valid| (store (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_210 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (not (= v_arrayElimCell_210 v_prenex_7))))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_34 Int) (v_arrayElimCell_210 Int) (v_DerPreprocessor_8 Int)) (let ((.cse59 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_34) v_arrayElimCell_209 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 v_DerPreprocessor_8) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse59 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0)) (= (select .cse59 v_arrayElimCell_210) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_arrayElimCell_210 Int) (v_subst_7 Int) (v_ArrVal_2314 Int)) (let ((.cse60 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (not (= v_arrayElimCell_209 v_subst_7)) (= (store (store (store .cse60 v_arrayElimCell_210 (select |c_#valid| v_arrayElimCell_210)) v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0) |c_#valid|) (= (select .cse60 v_arrayElimCell_210) 0) (not (= v_arrayElimCell_210 v_subst_7)) (not (= v_arrayElimCell_210 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_13 Int) (v_DerPreprocessor_26 Int) (v_arrayElimCell_210 Int)) (let ((.cse61 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_26) v_arrayElimCell_209 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_arrayElimCell_210 v_DerPreprocessor_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_arrayElimCell_210 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0)) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_arrayElimCell_210)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse61 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= 0 (select .cse61 v_arrayElimCell_210))))))) (and .cse19 (or (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_37 Int) (v_prenex_13 Int) (v_subst_11 Int)) (let ((.cse62 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_37) v_arrayElimCell_209 1) v_subst_11 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_subst_11 v_prenex_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= (select .cse62 v_subst_11) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_subst_11 0) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse62 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_11))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_12 Int) (v_prenex_14 Int)) (let ((.cse63 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse63 v_subst_12) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_14) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse63 v_subst_12 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_15 Int) (v_subst_10 Int)) (let ((.cse64 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_15) v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_subst_10 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse64 v_subst_10) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse64 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_13 Int) (v_subst_11 Int)) (let ((.cse66 (store (store .cse0 v_arrayElimCell_209 1) v_subst_11 0))) (let ((.cse65 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse66 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) v_subst_11 v_prenex_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse65 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store .cse66 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse65 v_subst_11) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_11)))))))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_13 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (let ((.cse68 (store (store .cse0 v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))) (let ((.cse67 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse68 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_13) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse67 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| .cse68) (= (select .cse67 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_12 Int)) (let ((.cse69 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse69 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_12) v_arrayElimCell_209) 0) (= |c_#valid| (store .cse69 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))))) (and (or .cse25 (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_8 Int)) (let ((.cse71 (store (store .cse0 v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0))) (let ((.cse70 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse71 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_8) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse70 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| .cse71) (= (select .cse70 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0))))))) .cse35 (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_6 Int) (v_ArrVal_2314 Int)) (let ((.cse72 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse72 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse72 v_subst_6 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_6)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_11 Int) (v_prenex_8 Int)) (let ((.cse73 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1))) (and (= (select .cse73 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse73 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1) v_prenex_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_prenex_8))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_7 Int) (v_DerPreprocessor_21 Int)) (let ((.cse75 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (let ((.cse74 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_DerPreprocessor_7) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select (store (store .cse75 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_21) |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= (select .cse74 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse74 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse75 |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)))))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_18 Int) (v_subst_9 Int)) (let ((.cse77 (store .cse0 v_arrayElimCell_209 1))) (let ((.cse76 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse78 (store (store .cse77 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_18) v_subst_9 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse78 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse78 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_9)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse76 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_9)) (= |c_#valid| (store (store .cse77 v_subst_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse76 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= v_arrayElimCell_209 v_subst_9)))))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_prenex_7 Int) (v_DerPreprocessor_22 Int) (v_prenex_11 Int)) (let ((.cse79 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1)) (.cse80 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse79 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= |c_#valid| (store (store .cse80 v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse79 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= v_arrayElimCell_209 v_prenex_7)) (= v_DerPreprocessor_22 (select (store (store .cse80 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_22) v_prenex_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))))) (exists ((v_arrayElimCell_209 Int) (v_DerPreprocessor_24 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_subst_7 Int) (v_ArrVal_2314 Int)) (let ((.cse81 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse81 v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (not (= v_arrayElimCell_209 v_subst_7)) (= (select .cse81 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store (store .cse81 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_24) v_subst_7 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) v_DerPreprocessor_24) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0)))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_25 Int) (v_prenex_11 Int) (v_prenex_9 Int)) (let ((.cse82 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_prenex_11) v_arrayElimCell_209 1)) (.cse83 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= (select .cse82 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse82 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (= |c_#valid| (store (store .cse83 v_prenex_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= v_DerPreprocessor_25 (select (store (store .cse83 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_25) v_prenex_9 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))))) (exists ((|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int)) (and (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (exists ((v_arrayElimCell_209 Int) (v_subst_8 Int) (v_DerPreprocessor_20 Int)) (let ((.cse84 (store .cse0 v_arrayElimCell_209 1))) (let ((.cse85 (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select (let ((.cse86 (store (store .cse84 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_20) v_subst_8 0))) (store (store (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse86 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| (select .cse86 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|))) |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse84 v_subst_8 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| (select .cse85 |c_ULTIMATE.start_destroy_sl_~sl#1.base|)) v_arrayElimCell_209) 0) (not (= |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_subst_8)) (= (select .cse85 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (not (= |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_subst_8)))))))) (exists ((v_arrayElimCell_209 Int) (|ULTIMATE.start_destroy_sl_~tmp~0#1.base| Int) (v_DerPreprocessor_23 Int) (v_subst_5 Int) (v_ArrVal_2314 Int)) (let ((.cse87 (store |c_ULTIMATE.start_main_old_#valid#1| v_arrayElimCell_209 1))) (and (= |c_#valid| (store (store .cse87 v_subst_5 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base| 0)) (= (select .cse87 |ULTIMATE.start_destroy_sl_~tmp~0#1.base|) 0) (= v_DerPreprocessor_23 (select (store (store .cse87 |ULTIMATE.start_destroy_sl_~tmp~0#1.base| v_DerPreprocessor_23) v_subst_5 0) |ULTIMATE.start_destroy_sl_~tmp~0#1.base|)) (= (select (store |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base| v_ArrVal_2314) v_arrayElimCell_209) 0))))) .cse18))))))) (<= 0 |c_ULTIMATE.start_destroy_sl_~sl#1.offset|) (= (select |c_ULTIMATE.start_main_old_#valid#1| |c_ULTIMATE.start_destroy_sl_~sl#1.base|) 0) (= (store |c_#valid| |c_ULTIMATE.start_destroy_sl_~sl#1.base| 0) |c_ULTIMATE.start_main_old_#valid#1|)) is different from false [2023-11-29 02:12:37,469 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 02:12:41,586 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 [0] [2023-11-29 02:12:45,915 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 02:12:50,687 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 02:12:54,987 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 02:12:55,558 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:12:55,559 INFO L93 Difference]: Finished difference Result 138 states and 155 transitions. [2023-11-29 02:12:55,559 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 30 states. [2023-11-29 02:12:55,559 INFO L78 Accepts]: Start accepts. Automaton has has 74 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 73 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) Word has length 39 [2023-11-29 02:12:55,559 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:12:55,560 INFO L225 Difference]: With dead ends: 138 [2023-11-29 02:12:55,560 INFO L226 Difference]: Without dead ends: 113 [2023-11-29 02:12:55,561 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 126 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 97 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 1636 ImplicationChecksByTransitivity, 360.2s TimeCoverageRelationStatistics Valid=519, Invalid=8374, Unknown=53, NotChecked=756, Total=9702 [2023-11-29 02:12:55,561 INFO L413 NwaCegarLoop]: 36 mSDtfsCounter, 118 mSDsluCounter, 1356 mSDsCounter, 0 mSdLazyCounter, 2281 mSolverCounterSat, 25 mSolverCounterUnsat, 43 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 275.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 118 SdHoareTripleChecker+Valid, 1392 SdHoareTripleChecker+Invalid, 2713 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 25 IncrementalHoareTripleChecker+Valid, 2281 IncrementalHoareTripleChecker+Invalid, 43 IncrementalHoareTripleChecker+Unknown, 364 IncrementalHoareTripleChecker+Unchecked, 276.8s IncrementalHoareTripleChecker+Time [2023-11-29 02:12:55,561 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [118 Valid, 1392 Invalid, 2713 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [25 Valid, 2281 Invalid, 43 Unknown, 364 Unchecked, 276.8s Time] [2023-11-29 02:12:55,562 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 113 states. [2023-11-29 02:12:55,563 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 113 to 112. [2023-11-29 02:12:55,563 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 112 states, 97 states have (on average 1.3298969072164948) internal successors, (129), 111 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 02:12:55,563 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 112 states to 112 states and 129 transitions. [2023-11-29 02:12:55,563 INFO L78 Accepts]: Start accepts. Automaton has 112 states and 129 transitions. Word has length 39 [2023-11-29 02:12:55,563 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:12:55,563 INFO L495 AbstractCegarLoop]: Abstraction has 112 states and 129 transitions. [2023-11-29 02:12:55,563 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 74 states, 73 states have (on average 1.5616438356164384) internal successors, (114), 73 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 02:12:55,563 INFO L276 IsEmpty]: Start isEmpty. Operand 112 states and 129 transitions. [2023-11-29 02:12:55,564 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 02:12:55,564 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:12:55,564 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:12:55,569 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (12)] Ended with exit code 0 [2023-11-29 02:12:55,764 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true,SelfDestructingSolverStorable39 [2023-11-29 02:12:55,765 INFO L420 AbstractCegarLoop]: === Iteration 41 === Targeting ULTIMATE.startErr24REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:12:55,765 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:12:55,765 INFO L85 PathProgramCache]: Analyzing trace with hash -967986046, now seen corresponding path program 1 times [2023-11-29 02:12:55,765 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:12:55,765 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1402843641] [2023-11-29 02:12:55,765 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:12:55,765 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:12:55,797 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:12:57,743 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:12:57,743 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:12:57,743 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1402843641] [2023-11-29 02:12:57,743 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1402843641] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:12:57,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [583929577] [2023-11-29 02:12:57,744 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:12:57,744 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:12:57,744 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:12:57,745 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:12:57,745 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Waiting until timeout for monitored process [2023-11-29 02:12:57,991 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:12:57,994 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 71 conjunts are in the unsatisfiable core [2023-11-29 02:12:57,997 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:12:58,023 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 02:12:58,059 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 15 treesize of output 1 [2023-11-29 02:12:58,063 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 8 treesize of output 1 [2023-11-29 02:12:58,757 INFO L349 Elim1Store]: treesize reduction 76, result has 31.5 percent of original size [2023-11-29 02:12:58,757 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 30 treesize of output 49 [2023-11-29 02:12:58,872 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 30 treesize of output 25 [2023-11-29 02:12:58,903 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:12:58,905 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2023-11-29 02:12:59,201 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 36 treesize of output 24 [2023-11-29 02:12:59,335 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:12:59,336 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 88 treesize of output 48 [2023-11-29 02:12:59,458 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:12:59,459 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 0 case distinctions, treesize of input 52 treesize of output 22 [2023-11-29 02:12:59,525 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 2 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:12:59,525 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:12:59,706 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2447 (Array Int Int))) (= (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sl_random_insert_~new~0#1.base| v_ArrVal_2447))) (store .cse0 |c_ULTIMATE.start_sl_random_insert_~a1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sl_random_insert_~a1~0#1.base|) |c_ULTIMATE.start_sl_random_insert_~a1~0#1.offset| |c_ULTIMATE.start_sl_random_insert_~new~0#1.base|))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~sl~1#1.base|) |c_ULTIMATE.start_main_~sl~1#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~sl~1#1.base|) |c_ULTIMATE.start_main_~sl~1#1.offset|) 4))) 1)) is different from false [2023-11-29 02:12:59,722 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2447 (Array Int Int)) (|v_ULTIMATE.start_sl_random_insert_~new~0#1.base_22| Int)) (or (= 1 (select (store |c_#valid| |v_ULTIMATE.start_sl_random_insert_~new~0#1.base_22| 1) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sl_random_insert_~new~0#1.base_22| v_ArrVal_2447))) (store .cse0 |c_ULTIMATE.start_sl_random_insert_~a1~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sl_random_insert_~a1~0#1.base|) |c_ULTIMATE.start_sl_random_insert_~a1~0#1.offset| |v_ULTIMATE.start_sl_random_insert_~new~0#1.base_22|))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~sl~1#1.base|) |c_ULTIMATE.start_main_~sl~1#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~sl~1#1.base|) |c_ULTIMATE.start_main_~sl~1#1.offset|) 4)))) (not (= (select |c_#valid| |v_ULTIMATE.start_sl_random_insert_~new~0#1.base_22|) 0)))) is different from false [2023-11-29 02:12:59,768 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_2447 (Array Int Int)) (|v_ULTIMATE.start_sl_random_insert_~a1~0#1.offset_23| Int) (|v_ULTIMATE.start_sl_random_insert_~new~0#1.base_22| Int)) (or (= (select (store |c_#valid| |v_ULTIMATE.start_sl_random_insert_~new~0#1.base_22| 1) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |v_ULTIMATE.start_sl_random_insert_~new~0#1.base_22| v_ArrVal_2447))) (store .cse0 |c_ULTIMATE.start_sl_random_insert_~a2~0#1.base| (store (select .cse0 |c_ULTIMATE.start_sl_random_insert_~a2~0#1.base|) |v_ULTIMATE.start_sl_random_insert_~a1~0#1.offset_23| |v_ULTIMATE.start_sl_random_insert_~new~0#1.base_22|))) (select (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~sl~1#1.base|) |c_ULTIMATE.start_main_~sl~1#1.offset|)) (+ (select (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~sl~1#1.base|) |c_ULTIMATE.start_main_~sl~1#1.offset|) 4))) 1) (< |c_ULTIMATE.start_sl_random_insert_~a2~0#1.offset| |v_ULTIMATE.start_sl_random_insert_~a1~0#1.offset_23|) (not (= (select |c_#valid| |v_ULTIMATE.start_sl_random_insert_~new~0#1.base_22|) 0)))) is different from false [2023-11-29 02:13:00,007 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:13:00,007 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 438 treesize of output 426 [2023-11-29 02:13:00,022 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 294 treesize of output 262 [2023-11-29 02:13:00,297 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 16 treesize of output 8 [2023-11-29 02:13:00,306 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 16 treesize of output 8 [2023-11-29 02:13:00,328 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:13:00,328 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 304 treesize of output 280 [2023-11-29 02:13:03,325 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 10 treesize of output 6 [2023-11-29 02:13:03,476 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 8 refuted. 0 times theorem prover too weak. 0 trivial. 1 not checked. [2023-11-29 02:13:03,476 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [583929577] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:13:03,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:13:03,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [24, 18, 18] total 59 [2023-11-29 02:13:03,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [865717901] [2023-11-29 02:13:03,476 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:13:03,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 60 states [2023-11-29 02:13:03,477 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:13:03,477 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 60 interpolants. [2023-11-29 02:13:03,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=319, Invalid=2882, Unknown=3, NotChecked=336, Total=3540 [2023-11-29 02:13:03,477 INFO L87 Difference]: Start difference. First operand 112 states and 129 transitions. Second operand has 60 states, 59 states have (on average 1.9661016949152543) internal successors, (116), 60 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:13,604 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 02:13:13,604 INFO L93 Difference]: Finished difference Result 339 states and 397 transitions. [2023-11-29 02:13:13,604 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 64 states. [2023-11-29 02:13:13,604 INFO L78 Accepts]: Start accepts. Automaton has has 60 states, 59 states have (on average 1.9661016949152543) internal successors, (116), 60 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 39 [2023-11-29 02:13:13,604 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 02:13:13,606 INFO L225 Difference]: With dead ends: 339 [2023-11-29 02:13:13,606 INFO L226 Difference]: Without dead ends: 339 [2023-11-29 02:13:13,607 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 168 GetRequests, 43 SyntacticMatches, 20 SemanticMatches, 105 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 3946 ImplicationChecksByTransitivity, 11.0s TimeCoverageRelationStatistics Valid=1663, Invalid=9058, Unknown=3, NotChecked=618, Total=11342 [2023-11-29 02:13:13,607 INFO L413 NwaCegarLoop]: 32 mSDtfsCounter, 1888 mSDsluCounter, 784 mSDsCounter, 0 mSdLazyCounter, 1608 mSolverCounterSat, 211 mSolverCounterUnsat, 3 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1888 SdHoareTripleChecker+Valid, 816 SdHoareTripleChecker+Invalid, 2859 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 211 IncrementalHoareTripleChecker+Valid, 1608 IncrementalHoareTripleChecker+Invalid, 3 IncrementalHoareTripleChecker+Unknown, 1037 IncrementalHoareTripleChecker+Unchecked, 2.4s IncrementalHoareTripleChecker+Time [2023-11-29 02:13:13,607 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1888 Valid, 816 Invalid, 2859 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [211 Valid, 1608 Invalid, 3 Unknown, 1037 Unchecked, 2.4s Time] [2023-11-29 02:13:13,608 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 339 states. [2023-11-29 02:13:13,610 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 339 to 160. [2023-11-29 02:13:13,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 160 states, 145 states have (on average 1.3793103448275863) internal successors, (200), 159 states have internal predecessors, (200), 0 states have call successors, (0), 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 02:13:13,611 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 160 states to 160 states and 200 transitions. [2023-11-29 02:13:13,611 INFO L78 Accepts]: Start accepts. Automaton has 160 states and 200 transitions. Word has length 39 [2023-11-29 02:13:13,612 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 02:13:13,612 INFO L495 AbstractCegarLoop]: Abstraction has 160 states and 200 transitions. [2023-11-29 02:13:13,612 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 60 states, 59 states have (on average 1.9661016949152543) internal successors, (116), 60 states have internal predecessors, (116), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:13,612 INFO L276 IsEmpty]: Start isEmpty. Operand 160 states and 200 transitions. [2023-11-29 02:13:13,612 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 40 [2023-11-29 02:13:13,612 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 02:13:13,613 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 02:13:13,619 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (13)] Ended with exit code 0 [2023-11-29 02:13:13,813 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: SelfDestructingSolverStorable40,13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:13:13,813 INFO L420 AbstractCegarLoop]: === Iteration 42 === Targeting ULTIMATE.startErr25REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 62 more)] === [2023-11-29 02:13:13,813 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 02:13:13,813 INFO L85 PathProgramCache]: Analyzing trace with hash -967986045, now seen corresponding path program 1 times [2023-11-29 02:13:13,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy CAMEL [2023-11-29 02:13:13,814 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleSmtInterpolCraig [1847558576] [2023-11-29 02:13:13,814 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:13:13,814 INFO L127 SolverBuilder]: Constructing new instance of SMTInterpol with explicit timeout -1 ms and remaining time -1 ms [2023-11-29 02:13:13,844 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:13:15,869 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:15,870 INFO L136 FreeRefinementEngine]: Strategy CAMEL found an infeasible trace [2023-11-29 02:13:15,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleSmtInterpolCraig [1847558576] [2023-11-29 02:13:15,870 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleSmtInterpolCraig [1847558576] provided 0 perfect and 1 imperfect interpolant sequences [2023-11-29 02:13:15,870 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleZ3 [340837917] [2023-11-29 02:13:15,870 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 02:13:15,870 INFO L173 SolverBuilder]: Constructing external solver with command: z3 -smt2 -in SMTLIB2_COMPLIANT=true [2023-11-29 02:13:15,870 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 02:13:15,871 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (exit command is (exit), workingDir is null) [2023-11-29 02:13:15,872 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_08540b7b-acfc-4858-a30a-0ffe5e11482d/bin/uautomizer-verify-BQ2R08f2Ya/z3 -smt2 -in SMTLIB2_COMPLIANT=true (14)] Waiting until timeout for monitored process [2023-11-29 02:13:16,063 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 02:13:16,066 INFO L262 TraceCheckSpWp]: Trace formula consists of 364 conjuncts, 92 conjunts are in the unsatisfiable core [2023-11-29 02:13:16,070 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 02:13:16,076 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 02:13:16,085 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 02:13:16,135 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 15 treesize of output 1 [2023-11-29 02:13:16,142 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 02:13:16,142 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 15 treesize of output 15 [2023-11-29 02:13:16,187 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 15 treesize of output 1 [2023-11-29 02:13:16,189 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 16 [2023-11-29 02:13:16,368 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 29 treesize of output 21 [2023-11-29 02:13:16,374 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 29 treesize of output 21 [2023-11-29 02:13:16,587 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 38 treesize of output 25 [2023-11-29 02:13:16,596 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 38 treesize of output 25 [2023-11-29 02:13:16,621 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 38 treesize of output 25 [2023-11-29 02:13:16,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 38 treesize of output 25 [2023-11-29 02:13:17,147 INFO L349 Elim1Store]: treesize reduction 4, result has 66.7 percent of original size [2023-11-29 02:13:17,147 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 1 case distinctions, treesize of input 15 treesize of output 15 [2023-11-29 02:13:17,267 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 30 treesize of output 25 [2023-11-29 02:13:17,276 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 30 treesize of output 25 [2023-11-29 02:13:17,299 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:13:17,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 49 treesize of output 25 [2023-11-29 02:13:17,306 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:13:17,306 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 49 treesize of output 25 [2023-11-29 02:13:17,725 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 39 treesize of output 11 [2023-11-29 02:13:17,732 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 02:13:17,732 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 2 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 19 [2023-11-29 02:13:17,857 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:17,857 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 02:13:18,352 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select |c_#memory_$Pointer$#2.offset| |c_ULTIMATE.start_main_~sl~1#1.base|)) (.cse5 (select |c_#memory_$Pointer$#2.base| |c_ULTIMATE.start_main_~sl~1#1.base|))) (let ((.cse1 (+ |c_ULTIMATE.start_main_~sl~1#1.offset| 4)) (.cse3 (select .cse5 |c_ULTIMATE.start_main_~sl~1#1.offset|)) (.cse4 (+ (select .cse0 |c_ULTIMATE.start_main_~sl~1#1.offset|) 4))) (and (forall ((v_ArrVal_2575 (Array Int Int)) (v_ArrVal_2578 Int)) (= (select .cse0 .cse1) (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_sl_random_insert_~new~0#1.base| v_ArrVal_2575))) (store .cse2 |c_ULTIMATE.start_sl_random_insert_~a1~0#1.base| (store (select .cse2 |c_ULTIMATE.start_sl_random_insert_~a1~0#1.base|) |c_ULTIMATE.start_sl_random_insert_~a1~0#1.offset| v_ArrVal_2578))) .cse3) .cse4))) (forall ((v_ArrVal_2574 (Array Int Int))) (= (select .cse5 .cse1) (select (select (let ((.cse6 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_sl_random_insert_~new~0#1.base| v_ArrVal_2574))) (store .cse6 |c_ULTIMATE.start_sl_random_insert_~a1~0#1.base| (store (select .cse6 |c_ULTIMATE.start_sl_random_insert_~a1~0#1.base|) |c_ULTIMATE.start_sl_random_insert_~a1~0#1.offset| |c_ULTIMATE.start_sl_random_insert_~new~0#1.base|))) .cse3) .cse4)))))) is different from false [2023-11-29 02:13:28,137 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:13:28,137 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 125 treesize of output 126 [2023-11-29 02:13:28,145 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:13:28,146 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 115 treesize of output 116 [2023-11-29 02:13:28,159 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:13:28,160 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 423 treesize of output 421 [2023-11-29 02:13:28,171 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 252 treesize of output 244 [2023-11-29 02:13:28,181 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 269 treesize of output 253 [2023-11-29 02:13:28,208 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:13:28,208 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 198 treesize of output 216 [2023-11-29 02:13:28,228 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:13:28,229 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 505 treesize of output 503 [2023-11-29 02:13:28,243 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 334 treesize of output 326 [2023-11-29 02:13:28,257 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 351 treesize of output 335 [2023-11-29 02:13:28,513 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 8 treesize of output 4 [2023-11-29 02:13:28,524 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 8 treesize of output 4 [2023-11-29 02:13:28,534 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:13:28,534 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 156 treesize of output 156 [2023-11-29 02:13:28,627 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 02:13:28,627 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 171 treesize of output 163 [2023-11-29 02:13:29,090 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 3 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 02:13:29,090 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleZ3 [340837917] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 02:13:29,090 INFO L185 FreeRefinementEngine]: Found 0 perfect and 3 imperfect interpolant sequences. [2023-11-29 02:13:29,090 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [23, 19, 21] total 61 [2023-11-29 02:13:29,090 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [678835487] [2023-11-29 02:13:29,091 INFO L85 oduleStraightlineAll]: Using 3 imperfect interpolants to construct interpolant automaton [2023-11-29 02:13:29,091 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 62 states [2023-11-29 02:13:29,091 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy CAMEL [2023-11-29 02:13:29,092 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 62 interpolants. [2023-11-29 02:13:29,092 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=222, Invalid=3430, Unknown=12, NotChecked=118, Total=3782 [2023-11-29 02:13:29,092 INFO L87 Difference]: Start difference. First operand 160 states and 200 transitions. Second operand has 62 states, 62 states have (on average 1.8225806451612903) internal successors, (113), 61 states have internal predecessors, (113), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 02:13:33,957 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:13:38,943 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:13:42,955 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:13:46,968 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:13:59,187 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:14:03,201 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:14:07,214 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 02:14:23,212 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:14:27,237 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:14:31,264 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:14:47,569 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:14:51,571 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:14:55,574 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:14:59,579 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:15:03,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, Int], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 02:15:07,588 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 [0, 1] [2023-11-29 02:15:11,617 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]