./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version e7bb482b Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 95e3bac7f28ae020b684175cea363a5866905518c289fbd40a07a7a3764acade --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:39:07,054 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:39:07,185 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-06 22:39:07,192 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:39:07,193 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:39:07,235 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:39:07,236 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:39:07,236 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:39:07,237 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:39:07,243 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:39:07,244 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:39:07,245 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:39:07,245 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:39:07,247 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:39:07,248 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:39:07,248 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:39:07,248 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:39:07,249 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:39:07,249 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:39:07,250 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:39:07,250 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:39:07,251 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:39:07,251 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:39:07,252 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:39:07,252 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:39:07,252 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:39:07,253 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:39:07,254 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:39:07,254 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:39:07,255 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:39:07,258 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:39:07,258 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:39:07,258 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-06 22:39:07,259 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-06 22:39:07,259 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:39:07,259 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:39:07,259 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:39:07,260 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:39:07,260 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_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/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_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 95e3bac7f28ae020b684175cea363a5866905518c289fbd40a07a7a3764acade [2023-11-06 22:39:07,565 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:39:07,609 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:39:07,612 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:39:07,613 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:39:07,614 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:39:07,616 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c [2023-11-06 22:39:10,814 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:39:11,041 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:39:11,042 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/sv-benchmarks/c/weaver/unroll-cond-3.wvr.c [2023-11-06 22:39:11,049 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/data/323c21f3f/02720813a045488eb0aabe6f771468e1/FLAGfc6e0debf [2023-11-06 22:39:11,062 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/data/323c21f3f/02720813a045488eb0aabe6f771468e1 [2023-11-06 22:39:11,065 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:39:11,066 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:39:11,067 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:39:11,068 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:39:11,075 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:39:11,076 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:11" (1/1) ... [2023-11-06 22:39:11,077 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@26711ff7 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:11, skipping insertion in model container [2023-11-06 22:39:11,077 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:11" (1/1) ... [2023-11-06 22:39:11,102 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:39:11,292 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:39:11,304 ERROR L324 MainTranslator]: Unsupported Syntax: Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) [2023-11-06 22:39:11,305 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@4f13dbdd and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:11, skipping insertion in model container [2023-11-06 22:39:11,305 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:39:11,306 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-06 22:39:11,308 INFO L158 Benchmark]: Toolchain (without parser) took 240.57ms. Allocated memory is still 148.9MB. Free memory was 102.1MB in the beginning and 91.7MB in the end (delta: 10.4MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:39:11,308 INFO L158 Benchmark]: CDTParser took 0.51ms. Allocated memory is still 148.9MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-06 22:39:11,309 INFO L158 Benchmark]: CACSL2BoogieTranslator took 238.22ms. Allocated memory is still 148.9MB. Free memory was 101.5MB in the beginning and 91.7MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-06 22:39:11,310 INFO L338 ainManager$Toolchain]: ####################### End [Toolchain 1] ####################### --- Results --- * Results from de.uni_freiburg.informatik.ultimate.core: - StatisticsResult: Toolchain Benchmarks Benchmark results are: * CDTParser took 0.51ms. Allocated memory is still 148.9MB. Free memory is still 122.0MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 238.22ms. Allocated memory is still 148.9MB. Free memory was 101.5MB in the beginning and 91.7MB in the end (delta: 9.8MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 108]: Unsupported Syntax Found a cast between two array/pointer types of different sizes while using memory model HoenickeLindenmann_Original (while Not using bitvector translation) RESULT: Ultimate could not prove your program: Toolchain returned no result. Received shutdown request... --- End real Ultimate output --- Execution finished normally Using bit-precise analysis Retrying with bit-precise analysis ### Bit-precise run ### Calling Ultimate with: /usr/lib/jvm/java-11-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP --witnessprinter.witness.filename witness.graphml --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 95e3bac7f28ae020b684175cea363a5866905518c289fbd40a07a7a3764acade --- Real Ultimate output --- This is Ultimate 0.2.3-dev-e7bb482 [2023-11-06 22:39:13,819 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-06 22:39:13,980 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-06 22:39:13,987 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-06 22:39:13,988 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-06 22:39:14,019 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-06 22:39:14,020 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-06 22:39:14,020 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-06 22:39:14,021 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-06 22:39:14,022 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-06 22:39:14,023 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-06 22:39:14,023 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-06 22:39:14,024 INFO L153 SettingsManager]: * Use SBE=true [2023-11-06 22:39:14,024 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-06 22:39:14,025 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-06 22:39:14,026 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-06 22:39:14,026 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-06 22:39:14,027 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-06 22:39:14,027 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-06 22:39:14,028 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-06 22:39:14,029 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-06 22:39:14,033 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-06 22:39:14,034 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-06 22:39:14,034 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-06 22:39:14,038 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-06 22:39:14,039 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-06 22:39:14,039 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-06 22:39:14,040 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-06 22:39:14,041 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-06 22:39:14,041 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-06 22:39:14,042 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-06 22:39:14,043 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:39:14,043 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-06 22:39:14,044 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-06 22:39:14,044 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-06 22:39:14,044 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-06 22:39:14,044 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-06 22:39:14,045 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-06 22:39:14,045 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-06 22:39:14,046 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-06 22:39:14,046 INFO L153 SettingsManager]: * Independence relation used for large block encoding in concurrent analysis=SYNTACTIC [2023-11-06 22:39:14,047 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_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/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_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness.graphml 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 -> 95e3bac7f28ae020b684175cea363a5866905518c289fbd40a07a7a3764acade [2023-11-06 22:39:14,492 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-06 22:39:14,529 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-06 22:39:14,532 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-06 22:39:14,533 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-06 22:39:14,534 INFO L274 PluginConnector]: CDTParser initialized [2023-11-06 22:39:14,536 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/../../sv-benchmarks/c/weaver/unroll-cond-3.wvr.c [2023-11-06 22:39:17,702 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-06 22:39:17,977 INFO L384 CDTParser]: Found 1 translation units. [2023-11-06 22:39:17,977 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/sv-benchmarks/c/weaver/unroll-cond-3.wvr.c [2023-11-06 22:39:17,984 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/data/6f5156925/5a5f1186e8fa41978f60987af95ab1aa/FLAG8666a44ea [2023-11-06 22:39:18,004 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/data/6f5156925/5a5f1186e8fa41978f60987af95ab1aa [2023-11-06 22:39:18,010 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-06 22:39:18,012 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-06 22:39:18,017 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-06 22:39:18,017 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-06 22:39:18,022 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-06 22:39:18,023 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:18" (1/1) ... [2023-11-06 22:39:18,024 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@59958c74 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:18, skipping insertion in model container [2023-11-06 22:39:18,024 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 06.11 10:39:18" (1/1) ... [2023-11-06 22:39:18,061 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:39:18,315 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:39:18,337 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-06 22:39:18,351 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-06 22:39:18,384 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:39:18,397 INFO L202 MainTranslator]: Completed pre-run [2023-11-06 22:39:18,444 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-06 22:39:18,476 INFO L206 MainTranslator]: Completed translation [2023-11-06 22:39:18,477 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:18 WrapperNode [2023-11-06 22:39:18,477 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-06 22:39:18,479 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-06 22:39:18,480 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-06 22:39:18,480 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-06 22:39:18,488 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:18" (1/1) ... [2023-11-06 22:39:18,513 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:18" (1/1) ... [2023-11-06 22:39:18,555 INFO L138 Inliner]: procedures = 26, calls = 38, calls flagged for inlining = 14, calls inlined = 14, statements flattened = 165 [2023-11-06 22:39:18,556 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-06 22:39:18,557 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-06 22:39:18,557 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-06 22:39:18,557 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-06 22:39:18,567 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:18" (1/1) ... [2023-11-06 22:39:18,568 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:18" (1/1) ... [2023-11-06 22:39:18,590 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:18" (1/1) ... [2023-11-06 22:39:18,591 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:18" (1/1) ... [2023-11-06 22:39:18,601 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:18" (1/1) ... [2023-11-06 22:39:18,613 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:18" (1/1) ... [2023-11-06 22:39:18,616 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:18" (1/1) ... [2023-11-06 22:39:18,617 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:18" (1/1) ... [2023-11-06 22:39:18,621 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-06 22:39:18,622 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-06 22:39:18,623 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-06 22:39:18,623 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-06 22:39:18,624 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:18" (1/1) ... [2023-11-06 22:39:18,630 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 [2023-11-06 22:39:18,651 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/z3 [2023-11-06 22:39:18,667 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (exit command is (exit), workingDir is null) [2023-11-06 22:39:18,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:2000 (1)] Waiting until timeout for monitored process [2023-11-06 22:39:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-06 22:39:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1 [2023-11-06 22:39:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-06 22:39:18,713 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4 [2023-11-06 22:39:18,714 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-06 22:39:18,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-06 22:39:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-06 22:39:18,715 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-06 22:39:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-06 22:39:18,715 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-06 22:39:18,716 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-06 22:39:18,717 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-06 22:39:18,718 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4 [2023-11-06 22:39:18,719 WARN L210 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-06 22:39:18,881 INFO L236 CfgBuilder]: Building ICFG [2023-11-06 22:39:18,883 INFO L262 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-06 22:39:19,477 INFO L277 CfgBuilder]: Performing block encoding [2023-11-06 22:39:19,486 INFO L297 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-06 22:39:19,486 INFO L302 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-06 22:39:19,488 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:39:19 BoogieIcfgContainer [2023-11-06 22:39:19,489 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-06 22:39:19,491 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-06 22:39:19,491 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-06 22:39:19,494 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-06 22:39:19,495 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 06.11 10:39:18" (1/3) ... [2023-11-06 22:39:19,495 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a32bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:39:19, skipping insertion in model container [2023-11-06 22:39:19,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 06.11 10:39:18" (2/3) ... [2023-11-06 22:39:19,496 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@71a32bcb and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 06.11 10:39:19, skipping insertion in model container [2023-11-06 22:39:19,496 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 06.11 10:39:19" (3/3) ... [2023-11-06 22:39:19,497 INFO L112 eAbstractionObserver]: Analyzing ICFG unroll-cond-3.wvr.c [2023-11-06 22:39:19,516 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-06 22:39:19,516 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 24 error locations. [2023-11-06 22:39:19,517 INFO L519 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-06 22:39:19,679 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-06 22:39:19,734 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 225 places, 236 transitions, 486 flow [2023-11-06 22:39:19,823 INFO L124 PetriNetUnfolderBase]: 18/234 cut-off events. [2023-11-06 22:39:19,823 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:39:19,831 INFO L83 FinitePrefix]: Finished finitePrefix Result has 243 conditions, 234 events. 18/234 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 452 event pairs, 0 based on Foata normal form. 0/192 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2023-11-06 22:39:19,831 INFO L82 GeneralOperation]: Start removeDead. Operand has 225 places, 236 transitions, 486 flow [2023-11-06 22:39:19,840 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 218 places, 229 transitions, 470 flow [2023-11-06 22:39:19,844 INFO L124 etLargeBlockEncoding]: Petri net LBE is using variable-based independence relation. [2023-11-06 22:39:19,854 INFO L131 etLargeBlockEncoding]: Starting large block encoding on Petri net that has 218 places, 229 transitions, 470 flow [2023-11-06 22:39:19,857 INFO L113 LiptonReduction]: Starting Lipton reduction on Petri net that has 218 places, 229 transitions, 470 flow [2023-11-06 22:39:19,857 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 218 places, 229 transitions, 470 flow [2023-11-06 22:39:19,909 INFO L124 PetriNetUnfolderBase]: 18/229 cut-off events. [2023-11-06 22:39:19,910 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-06 22:39:19,912 INFO L83 FinitePrefix]: Finished finitePrefix Result has 238 conditions, 229 events. 18/229 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 10. Compared 443 event pairs, 0 based on Foata normal form. 0/188 useless extension candidates. Maximal degree in co-relation 127. Up to 2 conditions per place. [2023-11-06 22:39:19,918 INFO L119 LiptonReduction]: Number of co-enabled transitions 6332 [2023-11-06 22:39:58,922 INFO L134 LiptonReduction]: Checked pairs total: 6477 [2023-11-06 22:39:58,923 INFO L136 LiptonReduction]: Total number of compositions: 284 [2023-11-06 22:39:58,939 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-06 22:39:58,945 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;@7a550c10, mLbeIndependenceSettings=[IndependenceType=SYNTACTIC, AbstractionType=NONE, UseConditional=, UseSemiCommutativity=, Solver=, SolverTimeout=] [2023-11-06 22:39:58,946 INFO L358 AbstractCegarLoop]: Starting to check reachability of 38 error locations. [2023-11-06 22:39:58,950 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-06 22:39:58,951 INFO L124 PetriNetUnfolderBase]: 1/2 cut-off events. [2023-11-06 22:39:58,951 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-06 22:39:58,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:39:58,952 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:39:58,952 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:39:58,957 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:39:58,958 INFO L85 PathProgramCache]: Analyzing trace with hash 30946, now seen corresponding path program 1 times [2023-11-06 22:39:58,971 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:39:58,971 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1503258405] [2023-11-06 22:39:58,972 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:39:58,972 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:39:58,972 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:39:58,975 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:39:58,998 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Waiting until timeout for monitored process [2023-11-06 22:39:59,074 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:39:59,077 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:39:59,081 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:39:59,159 INFO L351 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 7 [2023-11-06 22:39:59,171 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:59,172 INFO L351 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 6 treesize of output 1 [2023-11-06 22:39:59,193 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:59,194 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 1 [2023-11-06 22:39:59,204 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:59,205 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:39:59,213 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:59,213 INFO L351 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 6 treesize of output 1 [2023-11-06 22:39:59,222 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:39:59,223 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:39:59,230 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-06 22:39:59,230 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:39:59,231 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:39:59,231 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1503258405] [2023-11-06 22:39:59,232 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1503258405] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:39:59,232 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:39:59,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:39:59,234 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2062351873] [2023-11-06 22:39:59,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:39:59,243 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:39:59,248 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:39:59,269 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:39:59,270 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:39:59,434 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 211 out of 520 [2023-11-06 22:39:59,438 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 40 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 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-06 22:39:59,438 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:39:59,439 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 211 of 520 [2023-11-06 22:39:59,440 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:00,087 INFO L124 PetriNetUnfolderBase]: 737/1028 cut-off events. [2023-11-06 22:40:00,088 INFO L125 PetriNetUnfolderBase]: For 15/15 co-relation queries the response was YES. [2023-11-06 22:40:00,092 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2078 conditions, 1028 events. 737/1028 cut-off events. For 15/15 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 4467 event pairs, 356 based on Foata normal form. 0/228 useless extension candidates. Maximal degree in co-relation 1794. Up to 1020 conditions per place. [2023-11-06 22:40:00,105 INFO L140 encePairwiseOnDemand]: 512/520 looper letters, 30 selfloop transitions, 4 changer transitions 0/36 dead transitions. [2023-11-06 22:40:00,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 42 places, 36 transitions, 152 flow [2023-11-06 22:40:00,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:40:00,110 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:40:00,127 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 671 transitions. [2023-11-06 22:40:00,132 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.43012820512820515 [2023-11-06 22:40:00,133 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 671 transitions. [2023-11-06 22:40:00,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 671 transitions. [2023-11-06 22:40:00,137 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:00,140 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 671 transitions. [2023-11-06 22:40:00,145 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 223.66666666666666) internal successors, (671), 3 states have internal predecessors, (671), 0 states have call successors, (0), 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-06 22:40:00,153 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 520.0) internal successors, (2080), 4 states have internal predecessors, (2080), 0 states have call successors, (0), 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-06 22:40:00,155 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 520.0) internal successors, (2080), 4 states have internal predecessors, (2080), 0 states have call successors, (0), 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-06 22:40:00,157 INFO L175 Difference]: Start difference. First operand has 44 places, 40 transitions, 92 flow. Second operand 3 states and 671 transitions. [2023-11-06 22:40:00,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 42 places, 36 transitions, 152 flow [2023-11-06 22:40:00,161 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 36 transitions, 144 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-06 22:40:00,163 INFO L231 Difference]: Finished difference. Result has 38 places, 36 transitions, 84 flow [2023-11-06 22:40:00,165 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=84, PETRI_PLACES=38, PETRI_TRANSITIONS=36} [2023-11-06 22:40:00,169 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -6 predicate places. [2023-11-06 22:40:00,169 INFO L495 AbstractCegarLoop]: Abstraction has has 38 places, 36 transitions, 84 flow [2023-11-06 22:40:00,170 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 211.66666666666666) internal successors, (635), 3 states have internal predecessors, (635), 0 states have call successors, (0), 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-06 22:40:00,170 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:00,171 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:40:00,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (2)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:00,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:00,389 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:40:00,389 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:00,389 INFO L85 PathProgramCache]: Analyzing trace with hash 31056, now seen corresponding path program 1 times [2023-11-06 22:40:00,390 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:00,390 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [819986842] [2023-11-06 22:40:00,390 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:00,391 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:00,391 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:00,394 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:40:00,421 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Waiting until timeout for monitored process [2023-11-06 22:40:00,472 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:00,474 INFO L262 TraceCheckSpWp]: Trace formula consists of 45 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-06 22:40:00,475 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:00,500 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-06 22:40:00,501 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:40:00,501 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:00,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [819986842] [2023-11-06 22:40:00,502 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [819986842] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:00,502 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:00,502 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:40:00,504 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454189542] [2023-11-06 22:40:00,505 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:00,508 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:40:00,509 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:00,510 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:40:00,514 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:40:00,581 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 212 out of 520 [2023-11-06 22:40:00,583 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 38 places, 36 transitions, 84 flow. Second operand has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 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-06 22:40:00,583 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:00,583 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 212 of 520 [2023-11-06 22:40:00,583 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:01,145 INFO L124 PetriNetUnfolderBase]: 737/1030 cut-off events. [2023-11-06 22:40:01,145 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-06 22:40:01,146 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2067 conditions, 1030 events. 737/1030 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 4471 event pairs, 356 based on Foata normal form. 1/231 useless extension candidates. Maximal degree in co-relation 2044. Up to 1023 conditions per place. [2023-11-06 22:40:01,155 INFO L140 encePairwiseOnDemand]: 515/520 looper letters, 34 selfloop transitions, 2 changer transitions 0/38 dead transitions. [2023-11-06 22:40:01,155 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 40 places, 38 transitions, 160 flow [2023-11-06 22:40:01,156 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:40:01,156 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:40:01,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 675 transitions. [2023-11-06 22:40:01,159 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4326923076923077 [2023-11-06 22:40:01,160 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 675 transitions. [2023-11-06 22:40:01,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 675 transitions. [2023-11-06 22:40:01,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:01,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 675 transitions. [2023-11-06 22:40:01,163 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 225.0) internal successors, (675), 3 states have internal predecessors, (675), 0 states have call successors, (0), 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-06 22:40:01,168 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 520.0) internal successors, (2080), 4 states have internal predecessors, (2080), 0 states have call successors, (0), 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-06 22:40:01,169 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 520.0) internal successors, (2080), 4 states have internal predecessors, (2080), 0 states have call successors, (0), 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-06 22:40:01,170 INFO L175 Difference]: Start difference. First operand has 38 places, 36 transitions, 84 flow. Second operand 3 states and 675 transitions. [2023-11-06 22:40:01,171 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 40 places, 38 transitions, 160 flow [2023-11-06 22:40:01,171 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 38 places, 38 transitions, 152 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:40:01,173 INFO L231 Difference]: Finished difference. Result has 39 places, 37 transitions, 92 flow [2023-11-06 22:40:01,173 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=76, PETRI_DIFFERENCE_MINUEND_PLACES=36, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=39, PETRI_TRANSITIONS=37} [2023-11-06 22:40:01,174 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -5 predicate places. [2023-11-06 22:40:01,175 INFO L495 AbstractCegarLoop]: Abstraction has has 39 places, 37 transitions, 92 flow [2023-11-06 22:40:01,175 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 212.66666666666666) internal successors, (638), 3 states have internal predecessors, (638), 0 states have call successors, (0), 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-06 22:40:01,175 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:01,176 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1] [2023-11-06 22:40:01,188 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (3)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:01,387 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:01,388 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:40:01,388 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:01,388 INFO L85 PathProgramCache]: Analyzing trace with hash 30947, now seen corresponding path program 1 times [2023-11-06 22:40:01,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:01,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [528702556] [2023-11-06 22:40:01,389 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:01,389 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:01,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:01,390 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:40:01,423 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Waiting until timeout for monitored process [2023-11-06 22:40:01,471 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:01,473 INFO L262 TraceCheckSpWp]: Trace formula consists of 39 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-06 22:40:01,474 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:01,498 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-06 22:40:01,512 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:01,513 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-06 22:40:01,528 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:01,529 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-06 22:40:01,548 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:01,549 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-06 22:40:01,561 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:01,562 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-06 22:40:01,569 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:01,570 INFO L351 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-06 22:40:01,597 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-06 22:40:01,598 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:40:01,598 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:01,598 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [528702556] [2023-11-06 22:40:01,598 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [528702556] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:01,598 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:01,599 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:40:01,599 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1105047321] [2023-11-06 22:40:01,599 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:01,599 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:40:01,600 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:01,600 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:40:01,600 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:40:01,840 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 210 out of 520 [2023-11-06 22:40:01,841 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 39 places, 37 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 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-06 22:40:01,841 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:01,841 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 210 of 520 [2023-11-06 22:40:01,841 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:02,343 INFO L124 PetriNetUnfolderBase]: 737/1029 cut-off events. [2023-11-06 22:40:02,343 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-06 22:40:02,344 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2069 conditions, 1029 events. 737/1029 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 4470 event pairs, 356 based on Foata normal form. 1/231 useless extension candidates. Maximal degree in co-relation 2058. Up to 1023 conditions per place. [2023-11-06 22:40:02,352 INFO L140 encePairwiseOnDemand]: 517/520 looper letters, 33 selfloop transitions, 2 changer transitions 0/37 dead transitions. [2023-11-06 22:40:02,352 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 41 places, 37 transitions, 162 flow [2023-11-06 22:40:02,352 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:40:02,352 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:40:02,354 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 666 transitions. [2023-11-06 22:40:02,355 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4269230769230769 [2023-11-06 22:40:02,355 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 666 transitions. [2023-11-06 22:40:02,355 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 666 transitions. [2023-11-06 22:40:02,356 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:02,356 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 666 transitions. [2023-11-06 22:40:02,358 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 222.0) internal successors, (666), 3 states have internal predecessors, (666), 0 states have call successors, (0), 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-06 22:40:02,362 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 520.0) internal successors, (2080), 4 states have internal predecessors, (2080), 0 states have call successors, (0), 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-06 22:40:02,364 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 520.0) internal successors, (2080), 4 states have internal predecessors, (2080), 0 states have call successors, (0), 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-06 22:40:02,364 INFO L175 Difference]: Start difference. First operand has 39 places, 37 transitions, 92 flow. Second operand 3 states and 666 transitions. [2023-11-06 22:40:02,364 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 41 places, 37 transitions, 162 flow [2023-11-06 22:40:02,365 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 40 places, 37 transitions, 158 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-06 22:40:02,366 INFO L231 Difference]: Finished difference. Result has 41 places, 37 transitions, 96 flow [2023-11-06 22:40:02,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=38, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=96, PETRI_PLACES=41, PETRI_TRANSITIONS=37} [2023-11-06 22:40:02,367 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, -3 predicate places. [2023-11-06 22:40:02,367 INFO L495 AbstractCegarLoop]: Abstraction has has 41 places, 37 transitions, 96 flow [2023-11-06 22:40:02,368 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 210.66666666666666) internal successors, (632), 3 states have internal predecessors, (632), 0 states have call successors, (0), 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-06 22:40:02,368 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:02,368 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-06 22:40:02,384 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (4)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:02,579 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:02,579 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:40:02,580 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:02,580 INFO L85 PathProgramCache]: Analyzing trace with hash 962900, now seen corresponding path program 1 times [2023-11-06 22:40:02,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:02,580 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [470192220] [2023-11-06 22:40:02,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:02,581 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:02,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:02,582 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:40:02,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Waiting until timeout for monitored process [2023-11-06 22:40:02,639 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:02,641 INFO L262 TraceCheckSpWp]: Trace formula consists of 50 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:40:02,643 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:02,670 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 7 [2023-11-06 22:40:02,687 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:02,688 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-06 22:40:02,697 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:02,698 INFO L351 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-06 22:40:02,709 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:02,710 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-06 22:40:02,719 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:02,720 INFO L351 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-06 22:40:02,731 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:02,732 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-06 22:40:02,798 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-06 22:40:02,798 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:40:03,047 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-06 22:40:03,047 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:03,047 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [470192220] [2023-11-06 22:40:03,047 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [470192220] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:40:03,048 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:40:03,048 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2023-11-06 22:40:03,048 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1531902560] [2023-11-06 22:40:03,048 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:40:03,048 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-06 22:40:03,049 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:03,049 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-06 22:40:03,049 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-06 22:40:04,335 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 205 out of 520 [2023-11-06 22:40:04,338 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 41 places, 37 transitions, 96 flow. Second operand has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 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-06 22:40:04,338 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:04,338 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 205 of 520 [2023-11-06 22:40:04,338 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:05,405 INFO L124 PetriNetUnfolderBase]: 746/1041 cut-off events. [2023-11-06 22:40:05,405 INFO L125 PetriNetUnfolderBase]: For 1/1 co-relation queries the response was YES. [2023-11-06 22:40:05,406 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2108 conditions, 1041 events. 746/1041 cut-off events. For 1/1 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 4496 event pairs, 356 based on Foata normal form. 3/236 useless extension candidates. Maximal degree in co-relation 2095. Up to 1032 conditions per place. [2023-11-06 22:40:05,413 INFO L140 encePairwiseOnDemand]: 514/520 looper letters, 33 selfloop transitions, 14 changer transitions 0/49 dead transitions. [2023-11-06 22:40:05,414 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 49 transitions, 238 flow [2023-11-06 22:40:05,415 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:40:05,415 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:40:05,419 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1280 transitions. [2023-11-06 22:40:05,422 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41025641025641024 [2023-11-06 22:40:05,422 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1280 transitions. [2023-11-06 22:40:05,422 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1280 transitions. [2023-11-06 22:40:05,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:05,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1280 transitions. [2023-11-06 22:40:05,440 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 213.33333333333334) internal successors, (1280), 6 states have internal predecessors, (1280), 0 states have call successors, (0), 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-06 22:40:05,448 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 520.0) internal successors, (3640), 7 states have internal predecessors, (3640), 0 states have call successors, (0), 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-06 22:40:05,454 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 520.0) internal successors, (3640), 7 states have internal predecessors, (3640), 0 states have call successors, (0), 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-06 22:40:05,454 INFO L175 Difference]: Start difference. First operand has 41 places, 37 transitions, 96 flow. Second operand 6 states and 1280 transitions. [2023-11-06 22:40:05,454 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 49 transitions, 238 flow [2023-11-06 22:40:05,456 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 49 transitions, 234 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:40:05,458 INFO L231 Difference]: Finished difference. Result has 47 places, 49 transitions, 197 flow [2023-11-06 22:40:05,458 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=39, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=197, PETRI_PLACES=47, PETRI_TRANSITIONS=49} [2023-11-06 22:40:05,460 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2023-11-06 22:40:05,460 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 49 transitions, 197 flow [2023-11-06 22:40:05,462 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 206.0) internal successors, (1236), 6 states have internal predecessors, (1236), 0 states have call successors, (0), 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-06 22:40:05,462 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:05,463 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1] [2023-11-06 22:40:05,483 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (5)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:05,674 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:05,674 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:40:05,675 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:05,675 INFO L85 PathProgramCache]: Analyzing trace with hash 29853552, now seen corresponding path program 1 times [2023-11-06 22:40:05,675 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:05,675 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [76180261] [2023-11-06 22:40:05,676 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:05,676 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:05,676 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:05,677 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:40:05,684 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Waiting until timeout for monitored process [2023-11-06 22:40:05,769 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:05,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-06 22:40:05,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:05,806 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:05,833 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:40:05,833 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2023-11-06 22:40:05,853 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 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 10 treesize of output 8 [2023-11-06 22:40:05,871 INFO L351 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-06 22:40:05,895 INFO L351 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 13 [2023-11-06 22:40:06,104 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:06,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:40:06,502 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:06,502 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:06,502 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [76180261] [2023-11-06 22:40:06,503 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [76180261] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:40:06,503 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:40:06,503 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2023-11-06 22:40:06,503 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1216082436] [2023-11-06 22:40:06,503 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:40:06,503 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:40:06,504 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:06,504 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:40:06,504 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:40:08,538 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 198 out of 520 [2023-11-06 22:40:08,541 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 49 transitions, 197 flow. Second operand has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 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-06 22:40:08,541 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:08,541 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 198 of 520 [2023-11-06 22:40:08,541 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:10,278 INFO L124 PetriNetUnfolderBase]: 747/1046 cut-off events. [2023-11-06 22:40:10,278 INFO L125 PetriNetUnfolderBase]: For 17/17 co-relation queries the response was YES. [2023-11-06 22:40:10,280 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2163 conditions, 1046 events. 747/1046 cut-off events. For 17/17 co-relation queries the response was YES. Maximal size of possible extension queue 187. Compared 4585 event pairs, 356 based on Foata normal form. 0/239 useless extension candidates. Maximal degree in co-relation 2129. Up to 1028 conditions per place. [2023-11-06 22:40:10,287 INFO L140 encePairwiseOnDemand]: 514/520 looper letters, 35 selfloop transitions, 17 changer transitions 0/54 dead transitions. [2023-11-06 22:40:10,288 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 54 places, 54 transitions, 336 flow [2023-11-06 22:40:10,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:40:10,291 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:40:10,297 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1641 transitions. [2023-11-06 22:40:10,299 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39447115384615383 [2023-11-06 22:40:10,299 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1641 transitions. [2023-11-06 22:40:10,299 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1641 transitions. [2023-11-06 22:40:10,301 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:10,301 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1641 transitions. [2023-11-06 22:40:10,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 205.125) internal successors, (1641), 8 states have internal predecessors, (1641), 0 states have call successors, (0), 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-06 22:40:10,316 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 520.0) internal successors, (4680), 9 states have internal predecessors, (4680), 0 states have call successors, (0), 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-06 22:40:10,318 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 520.0) internal successors, (4680), 9 states have internal predecessors, (4680), 0 states have call successors, (0), 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-06 22:40:10,318 INFO L175 Difference]: Start difference. First operand has 47 places, 49 transitions, 197 flow. Second operand 8 states and 1641 transitions. [2023-11-06 22:40:10,318 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 54 places, 54 transitions, 336 flow [2023-11-06 22:40:10,322 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 54 transitions, 288 flow, removed 22 selfloop flow, removed 2 redundant places. [2023-11-06 22:40:10,324 INFO L231 Difference]: Finished difference. Result has 55 places, 53 transitions, 231 flow [2023-11-06 22:40:10,324 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=140, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=12, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=33, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=231, PETRI_PLACES=55, PETRI_TRANSITIONS=53} [2023-11-06 22:40:10,328 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 11 predicate places. [2023-11-06 22:40:10,328 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 53 transitions, 231 flow [2023-11-06 22:40:10,329 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 199.0) internal successors, (1592), 8 states have internal predecessors, (1592), 0 states have call successors, (0), 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-06 22:40:10,329 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:10,329 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1] [2023-11-06 22:40:10,346 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (6)] Ended with exit code 0 [2023-11-06 22:40:10,540 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:10,541 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:40:10,541 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:10,541 INFO L85 PathProgramCache]: Analyzing trace with hash 29853551, now seen corresponding path program 1 times [2023-11-06 22:40:10,541 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:10,541 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1111892006] [2023-11-06 22:40:10,542 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:10,542 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:10,542 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:10,543 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:40:10,544 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Waiting until timeout for monitored process [2023-11-06 22:40:10,625 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:10,629 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:40:10,630 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:10,653 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:40:10,653 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-11-06 22:40:10,696 INFO L322 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-06 22:40:10,696 INFO L351 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 1 case distinctions, treesize of input 24 treesize of output 22 [2023-11-06 22:40:10,777 INFO L134 CoverageAnalysis]: Checked inductivity of 3 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 3 trivial. 0 not checked. [2023-11-06 22:40:10,777 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:40:10,777 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:10,777 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1111892006] [2023-11-06 22:40:10,778 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1111892006] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:10,778 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:10,778 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:40:10,778 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1510807103] [2023-11-06 22:40:10,778 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:10,779 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:40:10,779 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:10,779 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:40:10,779 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:40:10,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 520 [2023-11-06 22:40:11,000 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 53 transitions, 231 flow. Second operand has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 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-06 22:40:11,000 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:11,000 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 520 [2023-11-06 22:40:11,000 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:11,399 INFO L124 PetriNetUnfolderBase]: 560/802 cut-off events. [2023-11-06 22:40:11,399 INFO L125 PetriNetUnfolderBase]: For 28/28 co-relation queries the response was YES. [2023-11-06 22:40:11,401 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1669 conditions, 802 events. 560/802 cut-off events. For 28/28 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 3436 event pairs, 267 based on Foata normal form. 0/211 useless extension candidates. Maximal degree in co-relation 1628. Up to 796 conditions per place. [2023-11-06 22:40:11,406 INFO L140 encePairwiseOnDemand]: 517/520 looper letters, 43 selfloop transitions, 1 changer transitions 0/46 dead transitions. [2023-11-06 22:40:11,407 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 46 transitions, 278 flow [2023-11-06 22:40:11,407 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:40:11,407 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:40:11,409 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 658 transitions. [2023-11-06 22:40:11,410 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4217948717948718 [2023-11-06 22:40:11,410 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 658 transitions. [2023-11-06 22:40:11,411 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 658 transitions. [2023-11-06 22:40:11,411 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:11,411 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 658 transitions. [2023-11-06 22:40:11,413 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 219.33333333333334) internal successors, (658), 3 states have internal predecessors, (658), 0 states have call successors, (0), 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-06 22:40:11,417 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 520.0) internal successors, (2080), 4 states have internal predecessors, (2080), 0 states have call successors, (0), 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-06 22:40:11,418 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 520.0) internal successors, (2080), 4 states have internal predecessors, (2080), 0 states have call successors, (0), 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-06 22:40:11,418 INFO L175 Difference]: Start difference. First operand has 55 places, 53 transitions, 231 flow. Second operand 3 states and 658 transitions. [2023-11-06 22:40:11,418 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 46 transitions, 278 flow [2023-11-06 22:40:11,420 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 46 transitions, 247 flow, removed 8 selfloop flow, removed 4 redundant places. [2023-11-06 22:40:11,421 INFO L231 Difference]: Finished difference. Result has 51 places, 46 transitions, 161 flow [2023-11-06 22:40:11,422 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=159, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=46, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=45, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=161, PETRI_PLACES=51, PETRI_TRANSITIONS=46} [2023-11-06 22:40:11,422 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2023-11-06 22:40:11,423 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 46 transitions, 161 flow [2023-11-06 22:40:11,423 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.0) internal successors, (627), 3 states have internal predecessors, (627), 0 states have call successors, (0), 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-06 22:40:11,423 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:11,423 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:40:11,442 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (7)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:11,635 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:11,635 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:40:11,635 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:11,636 INFO L85 PathProgramCache]: Analyzing trace with hash 925473939, now seen corresponding path program 1 times [2023-11-06 22:40:11,636 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:11,636 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [74919002] [2023-11-06 22:40:11,636 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:11,636 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:11,637 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:11,638 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:40:11,639 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Waiting until timeout for monitored process [2023-11-06 22:40:11,715 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:11,719 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:40:11,720 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:11,748 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:40:11,748 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 14 treesize of output 15 [2023-11-06 22:40:11,773 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:40:11,773 INFO L351 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-06 22:40:11,794 INFO L322 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-06 22:40:11,795 INFO L351 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 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-06 22:40:11,862 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:40:11,862 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:40:11,862 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:11,862 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [74919002] [2023-11-06 22:40:11,863 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [74919002] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:11,863 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:11,863 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-06 22:40:11,863 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1723883387] [2023-11-06 22:40:11,863 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:11,864 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-06 22:40:11,864 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:11,864 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-06 22:40:11,864 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-06 22:40:12,053 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 520 [2023-11-06 22:40:12,054 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 46 transitions, 161 flow. Second operand has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 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-06 22:40:12,054 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:12,054 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 520 [2023-11-06 22:40:12,055 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:12,445 INFO L124 PetriNetUnfolderBase]: 533/759 cut-off events. [2023-11-06 22:40:12,445 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-06 22:40:12,446 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1568 conditions, 759 events. 533/759 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 3308 event pairs, 254 based on Foata normal form. 0/207 useless extension candidates. Maximal degree in co-relation 1552. Up to 753 conditions per place. [2023-11-06 22:40:12,452 INFO L140 encePairwiseOnDemand]: 517/520 looper letters, 41 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-11-06 22:40:12,452 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 51 places, 44 transitions, 241 flow [2023-11-06 22:40:12,453 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:40:12,453 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:40:12,455 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 656 transitions. [2023-11-06 22:40:12,456 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4205128205128205 [2023-11-06 22:40:12,456 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 656 transitions. [2023-11-06 22:40:12,456 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 656 transitions. [2023-11-06 22:40:12,457 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:12,457 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 656 transitions. [2023-11-06 22:40:12,459 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 218.66666666666666) internal successors, (656), 3 states have internal predecessors, (656), 0 states have call successors, (0), 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-06 22:40:12,462 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 520.0) internal successors, (2080), 4 states have internal predecessors, (2080), 0 states have call successors, (0), 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-06 22:40:12,463 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 520.0) internal successors, (2080), 4 states have internal predecessors, (2080), 0 states have call successors, (0), 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-06 22:40:12,463 INFO L175 Difference]: Start difference. First operand has 51 places, 46 transitions, 161 flow. Second operand 3 states and 656 transitions. [2023-11-06 22:40:12,464 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 51 places, 44 transitions, 241 flow [2023-11-06 22:40:12,465 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 50 places, 44 transitions, 240 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:40:12,466 INFO L231 Difference]: Finished difference. Result has 50 places, 44 transitions, 158 flow [2023-11-06 22:40:12,467 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=156, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=158, PETRI_PLACES=50, PETRI_TRANSITIONS=44} [2023-11-06 22:40:12,468 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 6 predicate places. [2023-11-06 22:40:12,468 INFO L495 AbstractCegarLoop]: Abstraction has has 50 places, 44 transitions, 158 flow [2023-11-06 22:40:12,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 209.66666666666666) internal successors, (629), 3 states have internal predecessors, (629), 0 states have call successors, (0), 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-06 22:40:12,468 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:12,469 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-06 22:40:12,495 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (8)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:12,686 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:12,686 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:40:12,687 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:12,687 INFO L85 PathProgramCache]: Analyzing trace with hash 925473938, now seen corresponding path program 1 times [2023-11-06 22:40:12,687 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:12,687 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1946786928] [2023-11-06 22:40:12,687 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:12,687 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:12,688 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:12,688 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:40:12,692 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Waiting until timeout for monitored process [2023-11-06 22:40:12,783 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:12,787 INFO L262 TraceCheckSpWp]: Trace formula consists of 69 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-06 22:40:12,789 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:12,827 INFO L322 Elim1Store]: treesize reduction 13, result has 40.9 percent of original size [2023-11-06 22:40:12,828 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 16 treesize of output 17 [2023-11-06 22:40:12,853 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:12,867 INFO L322 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2023-11-06 22:40:12,867 INFO L351 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 1 case distinctions, treesize of input 11 treesize of output 13 [2023-11-06 22:40:12,885 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:12,900 INFO L322 Elim1Store]: treesize reduction 9, result has 35.7 percent of original size [2023-11-06 22:40:12,901 INFO L351 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 1 case distinctions, treesize of input 11 treesize of output 13 [2023-11-06 22:40:13,249 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-06 22:40:13,250 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:40:13,510 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-06 22:40:13,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:13,511 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1946786928] [2023-11-06 22:40:13,511 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1946786928] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:40:13,511 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:40:13,511 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2023-11-06 22:40:13,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1989989858] [2023-11-06 22:40:13,511 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:40:13,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:40:13,512 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:13,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:40:13,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=22, Invalid=34, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:40:14,803 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 520 [2023-11-06 22:40:14,805 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 50 places, 44 transitions, 158 flow. Second operand has 8 states, 8 states have (on average 201.25) internal successors, (1610), 8 states have internal predecessors, (1610), 0 states have call successors, (0), 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-06 22:40:14,805 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:14,805 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 520 [2023-11-06 22:40:14,805 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:15,675 INFO L124 PetriNetUnfolderBase]: 506/716 cut-off events. [2023-11-06 22:40:15,675 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-06 22:40:15,677 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1483 conditions, 716 events. 506/716 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 3074 event pairs, 241 based on Foata normal form. 0/203 useless extension candidates. Maximal degree in co-relation 1466. Up to 708 conditions per place. [2023-11-06 22:40:15,683 INFO L140 encePairwiseOnDemand]: 515/520 looper letters, 36 selfloop transitions, 4 changer transitions 0/42 dead transitions. [2023-11-06 22:40:15,683 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 42 transitions, 234 flow [2023-11-06 22:40:15,684 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:40:15,695 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:40:15,699 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1033 transitions. [2023-11-06 22:40:15,700 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3973076923076923 [2023-11-06 22:40:15,701 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1033 transitions. [2023-11-06 22:40:15,701 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1033 transitions. [2023-11-06 22:40:15,702 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:15,702 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1033 transitions. [2023-11-06 22:40:15,705 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 206.6) internal successors, (1033), 5 states have internal predecessors, (1033), 0 states have call successors, (0), 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-06 22:40:15,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 520.0) internal successors, (3120), 6 states have internal predecessors, (3120), 0 states have call successors, (0), 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-06 22:40:15,711 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 520.0) internal successors, (3120), 6 states have internal predecessors, (3120), 0 states have call successors, (0), 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-06 22:40:15,712 INFO L175 Difference]: Start difference. First operand has 50 places, 44 transitions, 158 flow. Second operand 5 states and 1033 transitions. [2023-11-06 22:40:15,712 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 42 transitions, 234 flow [2023-11-06 22:40:15,714 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 51 places, 42 transitions, 233 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-06 22:40:15,717 INFO L231 Difference]: Finished difference. Result has 51 places, 42 transitions, 161 flow [2023-11-06 22:40:15,717 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=153, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=161, PETRI_PLACES=51, PETRI_TRANSITIONS=42} [2023-11-06 22:40:15,719 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 7 predicate places. [2023-11-06 22:40:15,720 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 42 transitions, 161 flow [2023-11-06 22:40:15,721 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 201.25) internal successors, (1610), 8 states have internal predecessors, (1610), 0 states have call successors, (0), 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-06 22:40:15,721 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:15,721 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:40:15,734 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (9)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:15,933 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:15,933 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:40:15,934 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:15,934 INFO L85 PathProgramCache]: Analyzing trace with hash -1375088030, now seen corresponding path program 1 times [2023-11-06 22:40:15,934 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:15,934 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1626918352] [2023-11-06 22:40:15,934 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:15,934 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:15,935 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:15,936 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:40:15,965 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Waiting until timeout for monitored process [2023-11-06 22:40:16,021 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:16,025 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-06 22:40:16,026 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:16,118 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-06 22:40:16,118 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:40:16,296 INFO L351 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 35 treesize of output 31 [2023-11-06 22:40:16,422 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-06 22:40:16,423 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:16,423 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1626918352] [2023-11-06 22:40:16,423 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1626918352] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:40:16,423 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:40:16,423 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2023-11-06 22:40:16,423 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [163001096] [2023-11-06 22:40:16,423 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:40:16,424 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:40:16,424 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:16,424 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:40:16,425 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=16, Invalid=40, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:40:18,361 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 520 [2023-11-06 22:40:18,362 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 42 transitions, 161 flow. Second operand has 8 states, 8 states have (on average 203.25) internal successors, (1626), 8 states have internal predecessors, (1626), 0 states have call successors, (0), 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-06 22:40:18,362 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:18,363 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 520 [2023-11-06 22:40:18,363 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:19,488 INFO L124 PetriNetUnfolderBase]: 640/945 cut-off events. [2023-11-06 22:40:19,489 INFO L125 PetriNetUnfolderBase]: For 23/23 co-relation queries the response was YES. [2023-11-06 22:40:19,490 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1949 conditions, 945 events. 640/945 cut-off events. For 23/23 co-relation queries the response was YES. Maximal size of possible extension queue 172. Compared 4704 event pairs, 143 based on Foata normal form. 0/274 useless extension candidates. Maximal degree in co-relation 1931. Up to 575 conditions per place. [2023-11-06 22:40:19,496 INFO L140 encePairwiseOnDemand]: 514/520 looper letters, 50 selfloop transitions, 11 changer transitions 0/63 dead transitions. [2023-11-06 22:40:19,496 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 56 places, 63 transitions, 328 flow [2023-11-06 22:40:19,497 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-06 22:40:19,497 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-06 22:40:19,501 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 1265 transitions. [2023-11-06 22:40:19,503 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40544871794871795 [2023-11-06 22:40:19,503 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 1265 transitions. [2023-11-06 22:40:19,503 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 1265 transitions. [2023-11-06 22:40:19,504 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:19,504 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 1265 transitions. [2023-11-06 22:40:19,508 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 210.83333333333334) internal successors, (1265), 6 states have internal predecessors, (1265), 0 states have call successors, (0), 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-06 22:40:19,513 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 520.0) internal successors, (3640), 7 states have internal predecessors, (3640), 0 states have call successors, (0), 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-06 22:40:19,515 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 520.0) internal successors, (3640), 7 states have internal predecessors, (3640), 0 states have call successors, (0), 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-06 22:40:19,515 INFO L175 Difference]: Start difference. First operand has 51 places, 42 transitions, 161 flow. Second operand 6 states and 1265 transitions. [2023-11-06 22:40:19,515 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 56 places, 63 transitions, 328 flow [2023-11-06 22:40:19,517 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 63 transitions, 322 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:40:19,518 INFO L231 Difference]: Finished difference. Result has 54 places, 43 transitions, 191 flow [2023-11-06 22:40:19,519 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=10, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=191, PETRI_PLACES=54, PETRI_TRANSITIONS=43} [2023-11-06 22:40:19,520 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 10 predicate places. [2023-11-06 22:40:19,520 INFO L495 AbstractCegarLoop]: Abstraction has has 54 places, 43 transitions, 191 flow [2023-11-06 22:40:19,521 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 203.25) internal successors, (1626), 8 states have internal predecessors, (1626), 0 states have call successors, (0), 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-06 22:40:19,521 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:19,521 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1] [2023-11-06 22:40:19,537 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (10)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:19,737 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:19,738 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:40:19,738 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:19,738 INFO L85 PathProgramCache]: Analyzing trace with hash -1375498973, now seen corresponding path program 2 times [2023-11-06 22:40:19,738 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:19,738 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [82086032] [2023-11-06 22:40:19,738 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:40:19,738 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:19,739 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:19,739 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:40:19,741 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Waiting until timeout for monitored process [2023-11-06 22:40:19,836 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:40:19,836 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:40:19,840 INFO L262 TraceCheckSpWp]: Trace formula consists of 83 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:40:19,842 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:19,859 INFO L351 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 13 treesize of output 7 [2023-11-06 22:40:19,874 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:19,874 INFO L351 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-06 22:40:19,888 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:19,889 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-06 22:40:19,911 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:19,912 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-06 22:40:19,920 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:19,921 INFO L351 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-06 22:40:19,931 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:19,932 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-06 22:40:20,121 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:20,121 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:40:20,927 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 0 proven. 10 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:20,927 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:20,927 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [82086032] [2023-11-06 22:40:20,927 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [82086032] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:40:20,927 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:40:20,927 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2023-11-06 22:40:20,928 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1187122711] [2023-11-06 22:40:20,928 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:40:20,928 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-06 22:40:20,928 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:20,929 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-06 22:40:20,929 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=46, Invalid=86, Unknown=0, NotChecked=0, Total=132 [2023-11-06 22:40:25,999 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 520 [2023-11-06 22:40:26,001 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 54 places, 43 transitions, 191 flow. Second operand has 12 states, 12 states have (on average 207.0) internal successors, (2484), 12 states have internal predecessors, (2484), 0 states have call successors, (0), 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-06 22:40:26,001 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:26,002 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 520 [2023-11-06 22:40:26,002 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:29,018 INFO L124 PetriNetUnfolderBase]: 610/918 cut-off events. [2023-11-06 22:40:29,018 INFO L125 PetriNetUnfolderBase]: For 136/136 co-relation queries the response was YES. [2023-11-06 22:40:29,019 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2063 conditions, 918 events. 610/918 cut-off events. For 136/136 co-relation queries the response was YES. Maximal size of possible extension queue 170. Compared 4612 event pairs, 366 based on Foata normal form. 6/354 useless extension candidates. Maximal degree in co-relation 2044. Up to 902 conditions per place. [2023-11-06 22:40:29,024 INFO L140 encePairwiseOnDemand]: 515/520 looper letters, 28 selfloop transitions, 24 changer transitions 0/54 dead transitions. [2023-11-06 22:40:29,024 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 65 places, 54 transitions, 387 flow [2023-11-06 22:40:29,025 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 12 states. [2023-11-06 22:40:29,025 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 12 states. [2023-11-06 22:40:29,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 12 states to 12 states and 2529 transitions. [2023-11-06 22:40:29,035 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40528846153846154 [2023-11-06 22:40:29,035 INFO L72 ComplementDD]: Start complementDD. Operand 12 states and 2529 transitions. [2023-11-06 22:40:29,035 INFO L73 IsDeterministic]: Start isDeterministic. Operand 12 states and 2529 transitions. [2023-11-06 22:40:29,037 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:29,038 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 12 states and 2529 transitions. [2023-11-06 22:40:29,045 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 13 states, 12 states have (on average 210.75) internal successors, (2529), 12 states have internal predecessors, (2529), 0 states have call successors, (0), 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-06 22:40:29,056 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 13 states, 13 states have (on average 520.0) internal successors, (6760), 13 states have internal predecessors, (6760), 0 states have call successors, (0), 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-06 22:40:29,058 INFO L81 ComplementDD]: Finished complementDD. Result has 13 states, 13 states have (on average 520.0) internal successors, (6760), 13 states have internal predecessors, (6760), 0 states have call successors, (0), 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-06 22:40:29,059 INFO L175 Difference]: Start difference. First operand has 54 places, 43 transitions, 191 flow. Second operand 12 states and 2529 transitions. [2023-11-06 22:40:29,059 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 65 places, 54 transitions, 387 flow [2023-11-06 22:40:29,061 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 54 transitions, 359 flow, removed 1 selfloop flow, removed 8 redundant places. [2023-11-06 22:40:29,062 INFO L231 Difference]: Finished difference. Result has 61 places, 54 transitions, 333 flow [2023-11-06 22:40:29,062 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=155, PETRI_DIFFERENCE_MINUEND_PLACES=46, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=15, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=12, PETRI_FLOW=333, PETRI_PLACES=61, PETRI_TRANSITIONS=54} [2023-11-06 22:40:29,063 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 17 predicate places. [2023-11-06 22:40:29,063 INFO L495 AbstractCegarLoop]: Abstraction has has 61 places, 54 transitions, 333 flow [2023-11-06 22:40:29,064 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 207.0) internal successors, (2484), 12 states have internal predecessors, (2484), 0 states have call successors, (0), 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-06 22:40:29,065 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:29,065 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-06 22:40:29,077 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (11)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:29,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:29,276 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:40:29,277 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:29,277 INFO L85 PathProgramCache]: Analyzing trace with hash -1375088031, now seen corresponding path program 1 times [2023-11-06 22:40:29,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:29,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1556923230] [2023-11-06 22:40:29,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:29,278 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:29,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:29,279 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:40:29,316 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Waiting until timeout for monitored process [2023-11-06 22:40:29,350 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:29,352 INFO L262 TraceCheckSpWp]: Trace formula consists of 70 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:40:29,353 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:29,368 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 3 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 7 [2023-11-06 22:40:29,385 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:29,386 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:40:29,391 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:29,396 INFO L351 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 6 treesize of output 1 [2023-11-06 22:40:29,403 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:29,404 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:40:29,414 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:29,415 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 1 [2023-11-06 22:40:29,419 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:29,419 INFO L351 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 6 treesize of output 1 [2023-11-06 22:40:29,441 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:40:29,441 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:40:29,441 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:29,441 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1556923230] [2023-11-06 22:40:29,442 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1556923230] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:29,442 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:29,442 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:40:29,442 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1272982718] [2023-11-06 22:40:29,442 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:29,443 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:40:29,443 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:29,443 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:40:29,443 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:40:29,730 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 197 out of 520 [2023-11-06 22:40:29,731 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 61 places, 54 transitions, 333 flow. Second operand has 4 states, 4 states have (on average 198.25) internal successors, (793), 4 states have internal predecessors, (793), 0 states have call successors, (0), 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-06 22:40:29,731 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:29,731 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 197 of 520 [2023-11-06 22:40:29,731 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:30,101 INFO L124 PetriNetUnfolderBase]: 334/515 cut-off events. [2023-11-06 22:40:30,101 INFO L125 PetriNetUnfolderBase]: For 107/107 co-relation queries the response was YES. [2023-11-06 22:40:30,102 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1222 conditions, 515 events. 334/515 cut-off events. For 107/107 co-relation queries the response was YES. Maximal size of possible extension queue 85. Compared 2251 event pairs, 186 based on Foata normal form. 0/249 useless extension candidates. Maximal degree in co-relation 1204. Up to 497 conditions per place. [2023-11-06 22:40:30,106 INFO L140 encePairwiseOnDemand]: 513/520 looper letters, 32 selfloop transitions, 16 changer transitions 0/50 dead transitions. [2023-11-06 22:40:30,106 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 50 transitions, 421 flow [2023-11-06 22:40:30,107 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:40:30,107 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:40:30,109 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 816 transitions. [2023-11-06 22:40:30,110 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.3923076923076923 [2023-11-06 22:40:30,110 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 816 transitions. [2023-11-06 22:40:30,110 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 816 transitions. [2023-11-06 22:40:30,111 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:30,111 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 816 transitions. [2023-11-06 22:40:30,113 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 204.0) internal successors, (816), 4 states have internal predecessors, (816), 0 states have call successors, (0), 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-06 22:40:30,117 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 520.0) internal successors, (2600), 5 states have internal predecessors, (2600), 0 states have call successors, (0), 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-06 22:40:30,118 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 520.0) internal successors, (2600), 5 states have internal predecessors, (2600), 0 states have call successors, (0), 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-06 22:40:30,118 INFO L175 Difference]: Start difference. First operand has 61 places, 54 transitions, 333 flow. Second operand 4 states and 816 transitions. [2023-11-06 22:40:30,118 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 50 transitions, 421 flow [2023-11-06 22:40:30,120 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 50 transitions, 329 flow, removed 33 selfloop flow, removed 8 redundant places. [2023-11-06 22:40:30,122 INFO L231 Difference]: Finished difference. Result has 52 places, 50 transitions, 265 flow [2023-11-06 22:40:30,122 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=233, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=16, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=265, PETRI_PLACES=52, PETRI_TRANSITIONS=50} [2023-11-06 22:40:30,123 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 8 predicate places. [2023-11-06 22:40:30,123 INFO L495 AbstractCegarLoop]: Abstraction has has 52 places, 50 transitions, 265 flow [2023-11-06 22:40:30,124 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 198.25) internal successors, (793), 4 states have internal predecessors, (793), 0 states have call successors, (0), 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-06 22:40:30,124 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:30,124 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:30,139 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (12)] Ended with exit code 0 [2023-11-06 22:40:30,334 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:30,334 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:40:30,335 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:30,335 INFO L85 PathProgramCache]: Analyzing trace with hash 321944883, now seen corresponding path program 1 times [2023-11-06 22:40:30,335 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:30,335 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1080513185] [2023-11-06 22:40:30,335 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:30,336 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:30,336 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:30,337 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:40:30,351 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Waiting until timeout for monitored process [2023-11-06 22:40:30,421 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:30,425 INFO L262 TraceCheckSpWp]: Trace formula consists of 77 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 22:40:30,427 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:30,458 INFO L351 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 13 treesize of output 7 [2023-11-06 22:40:30,472 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:30,473 INFO L351 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-06 22:40:30,484 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:30,486 INFO L351 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-06 22:40:30,495 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:30,496 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-06 22:40:30,508 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:30,508 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-06 22:40:30,527 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:30,528 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-06 22:40:30,672 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:40:30,673 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:40:31,259 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:40:31,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:31,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1080513185] [2023-11-06 22:40:31,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1080513185] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:40:31,259 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:40:31,259 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 6 [2023-11-06 22:40:31,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [887795939] [2023-11-06 22:40:31,260 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:40:31,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-06 22:40:31,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:31,260 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-06 22:40:31,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-06 22:40:35,537 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 201 out of 520 [2023-11-06 22:40:35,538 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 52 places, 50 transitions, 265 flow. Second operand has 8 states, 8 states have (on average 202.5) internal successors, (1620), 8 states have internal predecessors, (1620), 0 states have call successors, (0), 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-06 22:40:35,538 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:35,538 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 201 of 520 [2023-11-06 22:40:35,538 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:37,537 INFO L124 PetriNetUnfolderBase]: 494/799 cut-off events. [2023-11-06 22:40:37,537 INFO L125 PetriNetUnfolderBase]: For 213/213 co-relation queries the response was YES. [2023-11-06 22:40:37,538 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1799 conditions, 799 events. 494/799 cut-off events. For 213/213 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 3812 event pairs, 272 based on Foata normal form. 0/462 useless extension candidates. Maximal degree in co-relation 1782. Up to 503 conditions per place. [2023-11-06 22:40:37,541 INFO L140 encePairwiseOnDemand]: 510/520 looper letters, 67 selfloop transitions, 9 changer transitions 0/78 dead transitions. [2023-11-06 22:40:37,542 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 78 transitions, 489 flow [2023-11-06 22:40:37,543 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-06 22:40:37,543 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-06 22:40:37,547 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 1677 transitions. [2023-11-06 22:40:37,548 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.403125 [2023-11-06 22:40:37,548 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 1677 transitions. [2023-11-06 22:40:37,549 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 1677 transitions. [2023-11-06 22:40:37,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:37,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 1677 transitions. [2023-11-06 22:40:37,554 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 209.625) internal successors, (1677), 8 states have internal predecessors, (1677), 0 states have call successors, (0), 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-06 22:40:37,561 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 520.0) internal successors, (4680), 9 states have internal predecessors, (4680), 0 states have call successors, (0), 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-06 22:40:37,562 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 520.0) internal successors, (4680), 9 states have internal predecessors, (4680), 0 states have call successors, (0), 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-06 22:40:37,562 INFO L175 Difference]: Start difference. First operand has 52 places, 50 transitions, 265 flow. Second operand 8 states and 1677 transitions. [2023-11-06 22:40:37,562 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 78 transitions, 489 flow [2023-11-06 22:40:37,565 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 78 transitions, 472 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:40:37,566 INFO L231 Difference]: Finished difference. Result has 59 places, 50 transitions, 293 flow [2023-11-06 22:40:37,567 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=248, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=50, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=293, PETRI_PLACES=59, PETRI_TRANSITIONS=50} [2023-11-06 22:40:37,567 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 15 predicate places. [2023-11-06 22:40:37,568 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 50 transitions, 293 flow [2023-11-06 22:40:37,568 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 202.5) internal successors, (1620), 8 states have internal predecessors, (1620), 0 states have call successors, (0), 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-06 22:40:37,568 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:37,569 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:37,582 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (13)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:37,780 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:37,780 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr7REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:40:37,780 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:37,780 INFO L85 PathProgramCache]: Analyzing trace with hash 322244527, now seen corresponding path program 1 times [2023-11-06 22:40:37,781 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:37,781 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1519347372] [2023-11-06 22:40:37,781 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:40:37,781 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:37,781 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:37,782 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:40:37,786 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Waiting until timeout for monitored process [2023-11-06 22:40:37,861 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:40:37,864 INFO L262 TraceCheckSpWp]: Trace formula consists of 81 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-06 22:40:37,865 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:37,896 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:40:37,896 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:40:37,897 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:37,897 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1519347372] [2023-11-06 22:40:37,897 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1519347372] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:37,897 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:37,897 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:40:37,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [397236555] [2023-11-06 22:40:37,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:37,897 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:40:37,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:37,898 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:40:37,898 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=6, Invalid=6, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:40:38,067 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 209 out of 520 [2023-11-06 22:40:38,068 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 50 transitions, 293 flow. Second operand has 4 states, 4 states have (on average 210.75) internal successors, (843), 4 states have internal predecessors, (843), 0 states have call successors, (0), 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-06 22:40:38,068 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:38,068 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 209 of 520 [2023-11-06 22:40:38,069 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:38,370 INFO L124 PetriNetUnfolderBase]: 336/576 cut-off events. [2023-11-06 22:40:38,371 INFO L125 PetriNetUnfolderBase]: For 275/275 co-relation queries the response was YES. [2023-11-06 22:40:38,372 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1581 conditions, 576 events. 336/576 cut-off events. For 275/275 co-relation queries the response was YES. Maximal size of possible extension queue 62. Compared 2730 event pairs, 183 based on Foata normal form. 5/421 useless extension candidates. Maximal degree in co-relation 1562. Up to 561 conditions per place. [2023-11-06 22:40:38,376 INFO L140 encePairwiseOnDemand]: 517/520 looper letters, 41 selfloop transitions, 1 changer transitions 0/44 dead transitions. [2023-11-06 22:40:38,376 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 44 transitions, 329 flow [2023-11-06 22:40:38,377 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-06 22:40:38,377 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-06 22:40:38,379 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 651 transitions. [2023-11-06 22:40:38,379 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4173076923076923 [2023-11-06 22:40:38,379 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 651 transitions. [2023-11-06 22:40:38,380 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 651 transitions. [2023-11-06 22:40:38,380 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:38,380 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 651 transitions. [2023-11-06 22:40:38,382 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 217.0) internal successors, (651), 3 states have internal predecessors, (651), 0 states have call successors, (0), 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-06 22:40:38,385 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 520.0) internal successors, (2080), 4 states have internal predecessors, (2080), 0 states have call successors, (0), 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-06 22:40:38,385 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 520.0) internal successors, (2080), 4 states have internal predecessors, (2080), 0 states have call successors, (0), 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-06 22:40:38,386 INFO L175 Difference]: Start difference. First operand has 59 places, 50 transitions, 293 flow. Second operand 3 states and 651 transitions. [2023-11-06 22:40:38,386 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 44 transitions, 329 flow [2023-11-06 22:40:38,388 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 44 transitions, 310 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-06 22:40:38,389 INFO L231 Difference]: Finished difference. Result has 53 places, 44 transitions, 228 flow [2023-11-06 22:40:38,390 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=226, PETRI_DIFFERENCE_MINUEND_PLACES=51, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=44, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=43, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=228, PETRI_PLACES=53, PETRI_TRANSITIONS=44} [2023-11-06 22:40:38,390 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 9 predicate places. [2023-11-06 22:40:38,390 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 44 transitions, 228 flow [2023-11-06 22:40:38,391 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 210.75) internal successors, (843), 4 states have internal predecessors, (843), 0 states have call successors, (0), 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-06 22:40:38,391 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:38,391 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 1, 1, 1, 1, 1, 1] [2023-11-06 22:40:38,408 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (14)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:38,602 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:38,602 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:40:38,603 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:38,603 INFO L85 PathProgramCache]: Analyzing trace with hash -1062938238, now seen corresponding path program 2 times [2023-11-06 22:40:38,603 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:38,603 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1150166577] [2023-11-06 22:40:38,603 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:40:38,604 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:38,604 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:38,604 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:40:38,607 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Waiting until timeout for monitored process [2023-11-06 22:40:38,699 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:40:38,699 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:40:38,702 INFO L262 TraceCheckSpWp]: Trace formula consists of 59 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-06 22:40:38,704 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:38,713 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 7 [2023-11-06 22:40:38,725 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:38,726 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-06 22:40:38,758 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:38,759 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-06 22:40:38,767 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:38,768 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-06 22:40:38,775 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:38,775 INFO L351 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-06 22:40:38,783 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:38,784 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-06 22:40:38,907 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 11 trivial. 0 not checked. [2023-11-06 22:40:38,907 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:40:38,907 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:38,907 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1150166577] [2023-11-06 22:40:38,907 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1150166577] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:40:38,907 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:40:38,907 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-06 22:40:38,908 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1321102918] [2023-11-06 22:40:38,908 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:40:38,908 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-06 22:40:38,908 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:38,908 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-06 22:40:38,909 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-06 22:40:39,348 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 208 out of 520 [2023-11-06 22:40:39,349 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 44 transitions, 228 flow. Second operand has 4 states, 4 states have (on average 209.5) internal successors, (838), 4 states have internal predecessors, (838), 0 states have call successors, (0), 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-06 22:40:39,349 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:40:39,349 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 208 of 520 [2023-11-06 22:40:39,350 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:40:39,696 INFO L124 PetriNetUnfolderBase]: 179/341 cut-off events. [2023-11-06 22:40:39,696 INFO L125 PetriNetUnfolderBase]: For 190/190 co-relation queries the response was YES. [2023-11-06 22:40:39,697 INFO L83 FinitePrefix]: Finished finitePrefix Result has 791 conditions, 341 events. 179/341 cut-off events. For 190/190 co-relation queries the response was YES. Maximal size of possible extension queue 30. Compared 1444 event pairs, 90 based on Foata normal form. 27/308 useless extension candidates. Maximal degree in co-relation 773. Up to 313 conditions per place. [2023-11-06 22:40:39,699 INFO L140 encePairwiseOnDemand]: 512/520 looper letters, 25 selfloop transitions, 11 changer transitions 0/38 dead transitions. [2023-11-06 22:40:39,699 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 38 transitions, 262 flow [2023-11-06 22:40:39,700 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-06 22:40:39,700 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-06 22:40:39,702 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 854 transitions. [2023-11-06 22:40:39,703 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.41057692307692306 [2023-11-06 22:40:39,703 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 854 transitions. [2023-11-06 22:40:39,703 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 854 transitions. [2023-11-06 22:40:39,704 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:40:39,704 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 854 transitions. [2023-11-06 22:40:39,706 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 213.5) internal successors, (854), 4 states have internal predecessors, (854), 0 states have call successors, (0), 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-06 22:40:39,710 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 520.0) internal successors, (2600), 5 states have internal predecessors, (2600), 0 states have call successors, (0), 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-06 22:40:39,710 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 520.0) internal successors, (2600), 5 states have internal predecessors, (2600), 0 states have call successors, (0), 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-06 22:40:39,711 INFO L175 Difference]: Start difference. First operand has 53 places, 44 transitions, 228 flow. Second operand 4 states and 854 transitions. [2023-11-06 22:40:39,711 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 38 transitions, 262 flow [2023-11-06 22:40:39,712 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 47 places, 38 transitions, 258 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-06 22:40:39,713 INFO L231 Difference]: Finished difference. Result has 47 places, 38 transitions, 208 flow [2023-11-06 22:40:39,713 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=186, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=11, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=27, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=208, PETRI_PLACES=47, PETRI_TRANSITIONS=38} [2023-11-06 22:40:39,714 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 3 predicate places. [2023-11-06 22:40:39,714 INFO L495 AbstractCegarLoop]: Abstraction has has 47 places, 38 transitions, 208 flow [2023-11-06 22:40:39,714 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 209.5) internal successors, (838), 4 states have internal predecessors, (838), 0 states have call successors, (0), 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-06 22:40:39,715 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:40:39,715 INFO L208 CegarLoopForPetriNet]: trace histogram [10, 1, 1] [2023-11-06 22:40:39,737 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (15)] Forceful destruction successful, exit code 0 [2023-11-06 22:40:39,926 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:39,926 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:40:39,926 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:40:39,926 INFO L85 PathProgramCache]: Analyzing trace with hash 1363767171, now seen corresponding path program 3 times [2023-11-06 22:40:39,927 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:40:39,927 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1569231059] [2023-11-06 22:40:39,927 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:40:39,927 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:40:39,928 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:40:39,929 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:40:39,938 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Waiting until timeout for monitored process [2023-11-06 22:40:40,175 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 6 check-sat command(s) [2023-11-06 22:40:40,175 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:40:40,185 INFO L262 TraceCheckSpWp]: Trace formula consists of 149 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-06 22:40:40,187 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:40:40,207 INFO L351 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 13 treesize of output 7 [2023-11-06 22:40:40,219 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:40,219 INFO L351 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-06 22:40:40,226 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:40,226 INFO L351 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-06 22:40:40,236 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:40,237 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-06 22:40:40,249 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:40,250 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 1 [2023-11-06 22:40:40,269 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-06 22:40:40,270 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 4 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 18 treesize of output 1 [2023-11-06 22:40:40,793 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:40,793 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:40:43,801 INFO L134 CoverageAnalysis]: Checked inductivity of 55 backedges. 0 proven. 55 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-06 22:40:43,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:40:43,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1569231059] [2023-11-06 22:40:43,802 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1569231059] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:40:43,802 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:40:43,802 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 11] total 22 [2023-11-06 22:40:43,803 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1980883903] [2023-11-06 22:40:43,803 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:40:43,803 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-06 22:40:43,803 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:40:43,804 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-06 22:40:43,804 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=166, Invalid=386, Unknown=0, NotChecked=0, Total=552 [2023-11-06 22:41:09,923 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 206 out of 520 [2023-11-06 22:41:09,926 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 47 places, 38 transitions, 208 flow. Second operand has 24 states, 24 states have (on average 207.0) internal successors, (4968), 24 states have internal predecessors, (4968), 0 states have call successors, (0), 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-06 22:41:09,927 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:41:09,927 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 206 of 520 [2023-11-06 22:41:09,927 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:41:27,266 INFO L124 PetriNetUnfolderBase]: 191/365 cut-off events. [2023-11-06 22:41:27,266 INFO L125 PetriNetUnfolderBase]: For 234/234 co-relation queries the response was YES. [2023-11-06 22:41:27,267 INFO L83 FinitePrefix]: Finished finitePrefix Result has 920 conditions, 365 events. 191/365 cut-off events. For 234/234 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1516 event pairs, 90 based on Foata normal form. 12/317 useless extension candidates. Maximal degree in co-relation 903. Up to 329 conditions per place. [2023-11-06 22:41:27,269 INFO L140 encePairwiseOnDemand]: 516/520 looper letters, 16 selfloop transitions, 44 changer transitions 0/62 dead transitions. [2023-11-06 22:41:27,269 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 70 places, 62 transitions, 532 flow [2023-11-06 22:41:27,271 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 24 states. [2023-11-06 22:41:27,272 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 24 states. [2023-11-06 22:41:27,281 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 24 states to 24 states and 5015 transitions. [2023-11-06 22:41:27,283 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40184294871794873 [2023-11-06 22:41:27,283 INFO L72 ComplementDD]: Start complementDD. Operand 24 states and 5015 transitions. [2023-11-06 22:41:27,283 INFO L73 IsDeterministic]: Start isDeterministic. Operand 24 states and 5015 transitions. [2023-11-06 22:41:27,286 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:27,286 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 24 states and 5015 transitions. [2023-11-06 22:41:27,306 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 25 states, 24 states have (on average 208.95833333333334) internal successors, (5015), 24 states have internal predecessors, (5015), 0 states have call successors, (0), 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-06 22:41:27,318 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 25 states, 25 states have (on average 520.0) internal successors, (13000), 25 states have internal predecessors, (13000), 0 states have call successors, (0), 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-06 22:41:27,320 INFO L81 ComplementDD]: Finished complementDD. Result has 25 states, 25 states have (on average 520.0) internal successors, (13000), 25 states have internal predecessors, (13000), 0 states have call successors, (0), 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-06 22:41:27,320 INFO L175 Difference]: Start difference. First operand has 47 places, 38 transitions, 208 flow. Second operand 24 states and 5015 transitions. [2023-11-06 22:41:27,321 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 70 places, 62 transitions, 532 flow [2023-11-06 22:41:27,323 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 68 places, 62 transitions, 508 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-06 22:41:27,325 INFO L231 Difference]: Finished difference. Result has 80 places, 62 transitions, 540 flow [2023-11-06 22:41:27,326 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=196, PETRI_DIFFERENCE_MINUEND_PLACES=45, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=38, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=22, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=16, PETRI_DIFFERENCE_SUBTRAHEND_STATES=24, PETRI_FLOW=540, PETRI_PLACES=80, PETRI_TRANSITIONS=62} [2023-11-06 22:41:27,326 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 36 predicate places. [2023-11-06 22:41:27,327 INFO L495 AbstractCegarLoop]: Abstraction has has 80 places, 62 transitions, 540 flow [2023-11-06 22:41:27,328 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 207.0) internal successors, (4968), 24 states have internal predecessors, (4968), 0 states have call successors, (0), 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-06 22:41:27,328 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:41:27,328 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:27,342 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (16)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:27,541 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:41:27,542 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:41:27,542 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:27,542 INFO L85 PathProgramCache]: Analyzing trace with hash 748820278, now seen corresponding path program 1 times [2023-11-06 22:41:27,542 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:41:27,543 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [934746094] [2023-11-06 22:41:27,543 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:27,543 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:41:27,543 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:41:27,544 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:41:27,548 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Waiting until timeout for monitored process [2023-11-06 22:41:27,688 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:27,694 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:41:27,696 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:27,882 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:41:27,882 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:41:27,882 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:41:27,882 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [934746094] [2023-11-06 22:41:27,882 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [934746094] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:27,883 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:27,883 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:41:27,883 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [387105974] [2023-11-06 22:41:27,883 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:27,884 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:41:27,884 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:41:27,884 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:41:27,885 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:41:27,981 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 203 out of 520 [2023-11-06 22:41:27,982 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 80 places, 62 transitions, 540 flow. Second operand has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 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-06 22:41:27,983 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:41:27,983 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 203 of 520 [2023-11-06 22:41:27,983 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:41:28,558 INFO L124 PetriNetUnfolderBase]: 233/440 cut-off events. [2023-11-06 22:41:28,559 INFO L125 PetriNetUnfolderBase]: For 185/185 co-relation queries the response was YES. [2023-11-06 22:41:28,560 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1187 conditions, 440 events. 233/440 cut-off events. For 185/185 co-relation queries the response was YES. Maximal size of possible extension queue 28. Compared 1720 event pairs, 72 based on Foata normal form. 0/398 useless extension candidates. Maximal degree in co-relation 1158. Up to 264 conditions per place. [2023-11-06 22:41:28,563 INFO L140 encePairwiseOnDemand]: 514/520 looper letters, 78 selfloop transitions, 5 changer transitions 0/83 dead transitions. [2023-11-06 22:41:28,564 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 84 places, 83 transitions, 753 flow [2023-11-06 22:41:28,565 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:41:28,565 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:41:28,568 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1056 transitions. [2023-11-06 22:41:28,569 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40615384615384614 [2023-11-06 22:41:28,569 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1056 transitions. [2023-11-06 22:41:28,569 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1056 transitions. [2023-11-06 22:41:28,570 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:28,570 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1056 transitions. [2023-11-06 22:41:28,573 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 211.2) internal successors, (1056), 5 states have internal predecessors, (1056), 0 states have call successors, (0), 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-06 22:41:28,577 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 520.0) internal successors, (3120), 6 states have internal predecessors, (3120), 0 states have call successors, (0), 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-06 22:41:28,577 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 520.0) internal successors, (3120), 6 states have internal predecessors, (3120), 0 states have call successors, (0), 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-06 22:41:28,577 INFO L175 Difference]: Start difference. First operand has 80 places, 62 transitions, 540 flow. Second operand 5 states and 1056 transitions. [2023-11-06 22:41:28,578 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 84 places, 83 transitions, 753 flow [2023-11-06 22:41:28,583 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 83 transitions, 613 flow, removed 50 selfloop flow, removed 11 redundant places. [2023-11-06 22:41:28,596 INFO L231 Difference]: Finished difference. Result has 76 places, 65 transitions, 432 flow [2023-11-06 22:41:28,596 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=400, PETRI_DIFFERENCE_MINUEND_PLACES=69, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=432, PETRI_PLACES=76, PETRI_TRANSITIONS=65} [2023-11-06 22:41:28,598 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 32 predicate places. [2023-11-06 22:41:28,598 INFO L495 AbstractCegarLoop]: Abstraction has has 76 places, 65 transitions, 432 flow [2023-11-06 22:41:28,598 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 206.0) internal successors, (1030), 5 states have internal predecessors, (1030), 0 states have call successors, (0), 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-06 22:41:28,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:41:28,599 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:28,617 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (17)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:28,812 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:41:28,812 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:41:28,812 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:28,812 INFO L85 PathProgramCache]: Analyzing trace with hash -1287773664, now seen corresponding path program 2 times [2023-11-06 22:41:28,813 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:41:28,813 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2124885237] [2023-11-06 22:41:28,813 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-06 22:41:28,813 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:41:28,813 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:41:28,815 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:41:28,857 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Waiting until timeout for monitored process [2023-11-06 22:41:28,952 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-06 22:41:28,952 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:41:28,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:41:28,961 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:29,112 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:41:29,113 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 84 [2023-11-06 22:41:29,131 INFO L351 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 95 treesize of output 91 [2023-11-06 22:41:29,273 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:41:29,273 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:41:29,273 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:41:29,273 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2124885237] [2023-11-06 22:41:29,273 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2124885237] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:29,274 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:29,274 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:41:29,274 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [627452257] [2023-11-06 22:41:29,274 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:29,274 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:41:29,274 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:41:29,275 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:41:29,275 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:41:29,383 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 520 [2023-11-06 22:41:29,384 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 76 places, 65 transitions, 432 flow. Second operand has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 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-06 22:41:29,384 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:41:29,384 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 520 [2023-11-06 22:41:29,384 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:41:29,836 INFO L124 PetriNetUnfolderBase]: 350/659 cut-off events. [2023-11-06 22:41:29,836 INFO L125 PetriNetUnfolderBase]: For 688/688 co-relation queries the response was YES. [2023-11-06 22:41:29,838 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2062 conditions, 659 events. 350/659 cut-off events. For 688/688 co-relation queries the response was YES. Maximal size of possible extension queue 40. Compared 2919 event pairs, 126 based on Foata normal form. 6/581 useless extension candidates. Maximal degree in co-relation 2031. Up to 432 conditions per place. [2023-11-06 22:41:29,841 INFO L140 encePairwiseOnDemand]: 514/520 looper letters, 80 selfloop transitions, 7 changer transitions 0/87 dead transitions. [2023-11-06 22:41:29,841 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 80 places, 87 transitions, 694 flow [2023-11-06 22:41:29,841 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:41:29,842 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:41:29,844 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1057 transitions. [2023-11-06 22:41:29,845 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4065384615384615 [2023-11-06 22:41:29,845 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1057 transitions. [2023-11-06 22:41:29,845 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1057 transitions. [2023-11-06 22:41:29,846 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:29,846 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1057 transitions. [2023-11-06 22:41:29,847 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 211.4) internal successors, (1057), 5 states have internal predecessors, (1057), 0 states have call successors, (0), 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-06 22:41:29,849 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 520.0) internal successors, (3120), 6 states have internal predecessors, (3120), 0 states have call successors, (0), 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-06 22:41:29,850 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 520.0) internal successors, (3120), 6 states have internal predecessors, (3120), 0 states have call successors, (0), 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-06 22:41:29,850 INFO L175 Difference]: Start difference. First operand has 76 places, 65 transitions, 432 flow. Second operand 5 states and 1057 transitions. [2023-11-06 22:41:29,850 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 80 places, 87 transitions, 694 flow [2023-11-06 22:41:29,854 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 78 places, 87 transitions, 651 flow, removed 5 selfloop flow, removed 2 redundant places. [2023-11-06 22:41:29,855 INFO L231 Difference]: Finished difference. Result has 81 places, 69 transitions, 452 flow [2023-11-06 22:41:29,855 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=403, PETRI_DIFFERENCE_MINUEND_PLACES=74, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=65, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=452, PETRI_PLACES=81, PETRI_TRANSITIONS=69} [2023-11-06 22:41:29,855 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 37 predicate places. [2023-11-06 22:41:29,855 INFO L495 AbstractCegarLoop]: Abstraction has has 81 places, 69 transitions, 452 flow [2023-11-06 22:41:29,856 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 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-06 22:41:29,856 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:41:29,856 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:29,874 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (18)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:30,056 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:41:30,056 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:41:30,056 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:30,057 INFO L85 PathProgramCache]: Analyzing trace with hash 1767190200, now seen corresponding path program 3 times [2023-11-06 22:41:30,057 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:41:30,057 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1317277129] [2023-11-06 22:41:30,057 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-06 22:41:30,057 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:41:30,057 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:41:30,058 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:41:30,059 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Waiting until timeout for monitored process [2023-11-06 22:41:30,163 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-06 22:41:30,164 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:41:30,167 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:41:30,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:30,369 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:41:30,369 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:41:30,370 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:41:30,370 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1317277129] [2023-11-06 22:41:30,370 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1317277129] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:30,370 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:30,370 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:41:30,379 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [284065151] [2023-11-06 22:41:30,379 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:30,380 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:41:30,380 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:41:30,380 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:41:30,381 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:41:30,466 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 520 [2023-11-06 22:41:30,467 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 81 places, 69 transitions, 452 flow. Second operand has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 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-06 22:41:30,467 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:41:30,467 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 520 [2023-11-06 22:41:30,468 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:41:30,953 INFO L124 PetriNetUnfolderBase]: 380/707 cut-off events. [2023-11-06 22:41:30,953 INFO L125 PetriNetUnfolderBase]: For 1276/1276 co-relation queries the response was YES. [2023-11-06 22:41:30,956 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2589 conditions, 707 events. 380/707 cut-off events. For 1276/1276 co-relation queries the response was YES. Maximal size of possible extension queue 44. Compared 3138 event pairs, 132 based on Foata normal form. 12/677 useless extension candidates. Maximal degree in co-relation 2555. Up to 396 conditions per place. [2023-11-06 22:41:30,959 INFO L140 encePairwiseOnDemand]: 514/520 looper letters, 80 selfloop transitions, 12 changer transitions 0/92 dead transitions. [2023-11-06 22:41:30,959 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 85 places, 92 transitions, 736 flow [2023-11-06 22:41:30,960 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:41:30,960 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:41:30,961 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1052 transitions. [2023-11-06 22:41:30,961 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4046153846153846 [2023-11-06 22:41:30,961 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1052 transitions. [2023-11-06 22:41:30,961 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1052 transitions. [2023-11-06 22:41:30,962 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:30,962 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1052 transitions. [2023-11-06 22:41:30,963 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 210.4) internal successors, (1052), 5 states have internal predecessors, (1052), 0 states have call successors, (0), 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-06 22:41:30,965 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 520.0) internal successors, (3120), 6 states have internal predecessors, (3120), 0 states have call successors, (0), 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-06 22:41:30,966 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 520.0) internal successors, (3120), 6 states have internal predecessors, (3120), 0 states have call successors, (0), 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-06 22:41:30,966 INFO L175 Difference]: Start difference. First operand has 81 places, 69 transitions, 452 flow. Second operand 5 states and 1052 transitions. [2023-11-06 22:41:30,966 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 85 places, 92 transitions, 736 flow [2023-11-06 22:41:30,971 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 84 places, 92 transitions, 712 flow, removed 8 selfloop flow, removed 1 redundant places. [2023-11-06 22:41:30,973 INFO L231 Difference]: Finished difference. Result has 87 places, 75 transitions, 532 flow [2023-11-06 22:41:30,973 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=442, PETRI_DIFFERENCE_MINUEND_PLACES=80, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=69, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=532, PETRI_PLACES=87, PETRI_TRANSITIONS=75} [2023-11-06 22:41:30,974 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 43 predicate places. [2023-11-06 22:41:30,974 INFO L495 AbstractCegarLoop]: Abstraction has has 87 places, 75 transitions, 532 flow [2023-11-06 22:41:30,974 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 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-06 22:41:30,975 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:41:30,975 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:30,990 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (19)] Ended with exit code 0 [2023-11-06 22:41:31,175 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:41:31,175 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:41:31,176 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:31,176 INFO L85 PathProgramCache]: Analyzing trace with hash -851728518, now seen corresponding path program 4 times [2023-11-06 22:41:31,176 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:41:31,176 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1254114399] [2023-11-06 22:41:31,177 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-06 22:41:31,177 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:41:31,177 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:41:31,178 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:41:31,184 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Waiting until timeout for monitored process [2023-11-06 22:41:31,329 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-06 22:41:31,330 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:41:31,336 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:41:31,340 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:31,517 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:41:31,517 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:41:31,517 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:41:31,517 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1254114399] [2023-11-06 22:41:31,517 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1254114399] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:31,518 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:31,518 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:41:31,518 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [425520863] [2023-11-06 22:41:31,518 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:31,519 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:41:31,519 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:41:31,519 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:41:31,520 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:41:31,611 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 202 out of 520 [2023-11-06 22:41:31,612 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 87 places, 75 transitions, 532 flow. Second operand has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 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-06 22:41:31,612 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:41:31,612 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 202 of 520 [2023-11-06 22:41:31,612 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:41:32,117 INFO L124 PetriNetUnfolderBase]: 368/695 cut-off events. [2023-11-06 22:41:32,118 INFO L125 PetriNetUnfolderBase]: For 1960/1960 co-relation queries the response was YES. [2023-11-06 22:41:32,121 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2772 conditions, 695 events. 368/695 cut-off events. For 1960/1960 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 3112 event pairs, 150 based on Foata normal form. 12/665 useless extension candidates. Maximal degree in co-relation 2735. Up to 564 conditions per place. [2023-11-06 22:41:32,125 INFO L140 encePairwiseOnDemand]: 514/520 looper letters, 75 selfloop transitions, 15 changer transitions 0/90 dead transitions. [2023-11-06 22:41:32,126 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 91 places, 90 transitions, 791 flow [2023-11-06 22:41:32,127 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:41:32,127 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:41:32,128 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1046 transitions. [2023-11-06 22:41:32,129 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4023076923076923 [2023-11-06 22:41:32,129 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1046 transitions. [2023-11-06 22:41:32,129 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1046 transitions. [2023-11-06 22:41:32,130 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:32,130 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1046 transitions. [2023-11-06 22:41:32,131 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 209.2) internal successors, (1046), 5 states have internal predecessors, (1046), 0 states have call successors, (0), 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-06 22:41:32,134 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 520.0) internal successors, (3120), 6 states have internal predecessors, (3120), 0 states have call successors, (0), 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-06 22:41:32,135 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 520.0) internal successors, (3120), 6 states have internal predecessors, (3120), 0 states have call successors, (0), 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-06 22:41:32,135 INFO L175 Difference]: Start difference. First operand has 87 places, 75 transitions, 532 flow. Second operand 5 states and 1046 transitions. [2023-11-06 22:41:32,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 91 places, 90 transitions, 791 flow [2023-11-06 22:41:32,145 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 90 places, 90 transitions, 778 flow, removed 3 selfloop flow, removed 1 redundant places. [2023-11-06 22:41:32,147 INFO L231 Difference]: Finished difference. Result has 92 places, 81 transitions, 626 flow [2023-11-06 22:41:32,147 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=521, PETRI_DIFFERENCE_MINUEND_PLACES=86, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=75, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=63, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=626, PETRI_PLACES=92, PETRI_TRANSITIONS=81} [2023-11-06 22:41:32,148 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 48 predicate places. [2023-11-06 22:41:32,148 INFO L495 AbstractCegarLoop]: Abstraction has has 92 places, 81 transitions, 626 flow [2023-11-06 22:41:32,148 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 205.0) internal successors, (1025), 5 states have internal predecessors, (1025), 0 states have call successors, (0), 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-06 22:41:32,148 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:41:32,149 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:32,163 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (20)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:32,362 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:41:32,362 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:41:32,363 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:32,363 INFO L85 PathProgramCache]: Analyzing trace with hash 1819816420, now seen corresponding path program 5 times [2023-11-06 22:41:32,363 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:41:32,363 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [865432857] [2023-11-06 22:41:32,363 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-06 22:41:32,363 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:41:32,363 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:41:32,364 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:41:32,365 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Waiting until timeout for monitored process [2023-11-06 22:41:32,502 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-06 22:41:32,503 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:41:32,508 INFO L262 TraceCheckSpWp]: Trace formula consists of 100 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:41:32,511 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:32,700 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:41:32,700 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 84 [2023-11-06 22:41:32,717 INFO L351 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 95 treesize of output 91 [2023-11-06 22:41:32,843 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:41:32,844 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:41:32,844 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:41:32,844 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [865432857] [2023-11-06 22:41:32,844 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [865432857] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:32,845 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:32,845 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:41:32,845 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [28550123] [2023-11-06 22:41:32,845 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:32,846 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:41:32,846 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:41:32,846 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:41:32,847 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:41:32,956 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 520 [2023-11-06 22:41:32,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 92 places, 81 transitions, 626 flow. Second operand has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 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-06 22:41:32,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:41:32,957 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 520 [2023-11-06 22:41:32,957 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:41:33,417 INFO L124 PetriNetUnfolderBase]: 371/704 cut-off events. [2023-11-06 22:41:33,417 INFO L125 PetriNetUnfolderBase]: For 2416/2416 co-relation queries the response was YES. [2023-11-06 22:41:33,419 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3110 conditions, 704 events. 371/704 cut-off events. For 2416/2416 co-relation queries the response was YES. Maximal size of possible extension queue 45. Compared 3208 event pairs, 114 based on Foata normal form. 6/668 useless extension candidates. Maximal degree in co-relation 3071. Up to 402 conditions per place. [2023-11-06 22:41:33,424 INFO L140 encePairwiseOnDemand]: 514/520 looper letters, 81 selfloop transitions, 14 changer transitions 0/95 dead transitions. [2023-11-06 22:41:33,424 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 95 transitions, 859 flow [2023-11-06 22:41:33,425 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:41:33,425 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:41:33,426 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1060 transitions. [2023-11-06 22:41:33,426 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.4076923076923077 [2023-11-06 22:41:33,426 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1060 transitions. [2023-11-06 22:41:33,426 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1060 transitions. [2023-11-06 22:41:33,427 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:33,427 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1060 transitions. [2023-11-06 22:41:33,428 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 212.0) internal successors, (1060), 5 states have internal predecessors, (1060), 0 states have call successors, (0), 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-06 22:41:33,431 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 520.0) internal successors, (3120), 6 states have internal predecessors, (3120), 0 states have call successors, (0), 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-06 22:41:33,431 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 520.0) internal successors, (3120), 6 states have internal predecessors, (3120), 0 states have call successors, (0), 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-06 22:41:33,431 INFO L175 Difference]: Start difference. First operand has 92 places, 81 transitions, 626 flow. Second operand 5 states and 1060 transitions. [2023-11-06 22:41:33,431 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 95 transitions, 859 flow [2023-11-06 22:41:33,443 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 94 places, 95 transitions, 805 flow, removed 15 selfloop flow, removed 2 redundant places. [2023-11-06 22:41:33,445 INFO L231 Difference]: Finished difference. Result has 95 places, 82 transitions, 613 flow [2023-11-06 22:41:33,446 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=572, PETRI_DIFFERENCE_MINUEND_PLACES=90, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=81, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=13, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=68, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=613, PETRI_PLACES=95, PETRI_TRANSITIONS=82} [2023-11-06 22:41:33,446 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 51 predicate places. [2023-11-06 22:41:33,446 INFO L495 AbstractCegarLoop]: Abstraction has has 95 places, 82 transitions, 613 flow [2023-11-06 22:41:33,447 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 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-06 22:41:33,447 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:41:33,447 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:33,464 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (21)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:33,659 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:41:33,660 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:41:33,660 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:33,660 INFO L85 PathProgramCache]: Analyzing trace with hash -2099076514, now seen corresponding path program 6 times [2023-11-06 22:41:33,660 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:41:33,661 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508378009] [2023-11-06 22:41:33,661 INFO L93 rtionOrderModulation]: Changing assertion order to MIX_INSIDE_OUTSIDE [2023-11-06 22:41:33,661 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:41:33,661 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:41:33,662 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:41:33,663 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Waiting until timeout for monitored process [2023-11-06 22:41:33,769 INFO L228 tOrderPrioritization]: Assert order MIX_INSIDE_OUTSIDE issued 1 check-sat command(s) [2023-11-06 22:41:33,769 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-06 22:41:33,773 INFO L262 TraceCheckSpWp]: Trace formula consists of 89 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-06 22:41:33,775 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:33,919 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:41:33,920 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 111 treesize of output 76 [2023-11-06 22:41:33,926 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 76 treesize of output 74 [2023-11-06 22:41:33,933 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 72 [2023-11-06 22:41:33,973 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:41:33,973 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 119 treesize of output 84 [2023-11-06 22:41:33,994 INFO L351 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 95 treesize of output 91 [2023-11-06 22:41:34,132 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:41:34,132 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-06 22:41:34,132 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:41:34,132 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508378009] [2023-11-06 22:41:34,133 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508378009] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-06 22:41:34,133 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-06 22:41:34,133 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-06 22:41:34,133 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [176233210] [2023-11-06 22:41:34,133 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-06 22:41:34,133 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-06 22:41:34,134 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:41:34,134 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-06 22:41:34,134 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-06 22:41:34,254 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 204 out of 520 [2023-11-06 22:41:34,255 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 95 places, 82 transitions, 613 flow. Second operand has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 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-06 22:41:34,255 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:41:34,255 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 204 of 520 [2023-11-06 22:41:34,255 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:41:34,804 INFO L124 PetriNetUnfolderBase]: 368/683 cut-off events. [2023-11-06 22:41:34,805 INFO L125 PetriNetUnfolderBase]: For 2392/2392 co-relation queries the response was YES. [2023-11-06 22:41:34,807 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2919 conditions, 683 events. 368/683 cut-off events. For 2392/2392 co-relation queries the response was YES. Maximal size of possible extension queue 43. Compared 2981 event pairs, 147 based on Foata normal form. 6/647 useless extension candidates. Maximal degree in co-relation 2879. Up to 543 conditions per place. [2023-11-06 22:41:34,810 INFO L140 encePairwiseOnDemand]: 514/520 looper letters, 77 selfloop transitions, 15 changer transitions 0/92 dead transitions. [2023-11-06 22:41:34,810 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 99 places, 92 transitions, 832 flow [2023-11-06 22:41:34,811 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-06 22:41:34,811 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-06 22:41:34,813 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 1056 transitions. [2023-11-06 22:41:34,813 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.40615384615384614 [2023-11-06 22:41:34,813 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 1056 transitions. [2023-11-06 22:41:34,813 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 1056 transitions. [2023-11-06 22:41:34,814 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:34,814 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 1056 transitions. [2023-11-06 22:41:34,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 211.2) internal successors, (1056), 5 states have internal predecessors, (1056), 0 states have call successors, (0), 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-06 22:41:34,818 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 520.0) internal successors, (3120), 6 states have internal predecessors, (3120), 0 states have call successors, (0), 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-06 22:41:34,818 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 520.0) internal successors, (3120), 6 states have internal predecessors, (3120), 0 states have call successors, (0), 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-06 22:41:34,818 INFO L175 Difference]: Start difference. First operand has 95 places, 82 transitions, 613 flow. Second operand 5 states and 1056 transitions. [2023-11-06 22:41:34,819 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 99 places, 92 transitions, 832 flow [2023-11-06 22:41:34,829 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 96 places, 92 transitions, 798 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-06 22:41:34,832 INFO L231 Difference]: Finished difference. Result has 97 places, 83 transitions, 626 flow [2023-11-06 22:41:34,832 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=581, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=82, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=67, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=626, PETRI_PLACES=97, PETRI_TRANSITIONS=83} [2023-11-06 22:41:34,833 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 53 predicate places. [2023-11-06 22:41:34,833 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 83 transitions, 626 flow [2023-11-06 22:41:34,834 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 207.0) internal successors, (1035), 5 states have internal predecessors, (1035), 0 states have call successors, (0), 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-06 22:41:34,834 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:41:34,834 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:34,846 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (22)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:35,046 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:41:35,046 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:41:35,047 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:35,047 INFO L85 PathProgramCache]: Analyzing trace with hash 774695082, now seen corresponding path program 1 times [2023-11-06 22:41:35,047 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:41:35,047 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [78864515] [2023-11-06 22:41:35,047 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:35,048 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:41:35,048 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:41:35,049 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:41:35,050 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Waiting until timeout for monitored process [2023-11-06 22:41:35,188 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:35,195 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-06 22:41:35,197 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:35,362 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:41:35,362 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:41:35,486 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:41:35,487 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 133 treesize of output 98 [2023-11-06 22:41:35,511 INFO L351 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 110 treesize of output 106 [2023-11-06 22:41:36,643 INFO L322 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-06 22:41:36,643 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 0 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 139 treesize of output 104 [2023-11-06 22:41:36,655 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 104 treesize of output 102 [2023-11-06 22:41:36,666 INFO L351 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 102 treesize of output 100 [2023-11-06 22:41:36,962 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 1 trivial. 0 not checked. [2023-11-06 22:41:36,963 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-06 22:41:36,963 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [78864515] [2023-11-06 22:41:36,963 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [78864515] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-06 22:41:36,963 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-06 22:41:36,963 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [6, 6] total 10 [2023-11-06 22:41:36,964 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1279193038] [2023-11-06 22:41:36,964 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-06 22:41:36,964 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-06 22:41:36,965 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-06 22:41:36,965 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-06 22:41:36,965 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=30, Invalid=60, Unknown=0, NotChecked=0, Total=90 [2023-11-06 22:41:37,518 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 200 out of 520 [2023-11-06 22:41:37,520 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 83 transitions, 626 flow. Second operand has 10 states, 10 states have (on average 202.2) internal successors, (2022), 10 states have internal predecessors, (2022), 0 states have call successors, (0), 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-06 22:41:37,520 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-06 22:41:37,520 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 200 of 520 [2023-11-06 22:41:37,520 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-06 22:41:40,120 INFO L124 PetriNetUnfolderBase]: 1004/1751 cut-off events. [2023-11-06 22:41:40,120 INFO L125 PetriNetUnfolderBase]: For 4582/4582 co-relation queries the response was YES. [2023-11-06 22:41:40,127 INFO L83 FinitePrefix]: Finished finitePrefix Result has 6502 conditions, 1751 events. 1004/1751 cut-off events. For 4582/4582 co-relation queries the response was YES. Maximal size of possible extension queue 103. Compared 9280 event pairs, 102 based on Foata normal form. 0/1481 useless extension candidates. Maximal degree in co-relation 6461. Up to 733 conditions per place. [2023-11-06 22:41:40,135 INFO L140 encePairwiseOnDemand]: 514/520 looper letters, 123 selfloop transitions, 53 changer transitions 0/176 dead transitions. [2023-11-06 22:41:40,135 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 112 places, 176 transitions, 1428 flow [2023-11-06 22:41:40,137 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-06 22:41:40,137 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 16 states. [2023-11-06 22:41:40,140 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 16 states to 16 states and 3311 transitions. [2023-11-06 22:41:40,142 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.39795673076923077 [2023-11-06 22:41:40,142 INFO L72 ComplementDD]: Start complementDD. Operand 16 states and 3311 transitions. [2023-11-06 22:41:40,142 INFO L73 IsDeterministic]: Start isDeterministic. Operand 16 states and 3311 transitions. [2023-11-06 22:41:40,144 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-06 22:41:40,144 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 16 states and 3311 transitions. [2023-11-06 22:41:40,149 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 17 states, 16 states have (on average 206.9375) internal successors, (3311), 16 states have internal predecessors, (3311), 0 states have call successors, (0), 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-06 22:41:40,156 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 17 states, 17 states have (on average 520.0) internal successors, (8840), 17 states have internal predecessors, (8840), 0 states have call successors, (0), 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-06 22:41:40,158 INFO L81 ComplementDD]: Finished complementDD. Result has 17 states, 17 states have (on average 520.0) internal successors, (8840), 17 states have internal predecessors, (8840), 0 states have call successors, (0), 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-06 22:41:40,158 INFO L175 Difference]: Start difference. First operand has 97 places, 83 transitions, 626 flow. Second operand 16 states and 3311 transitions. [2023-11-06 22:41:40,158 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 112 places, 176 transitions, 1428 flow [2023-11-06 22:41:40,174 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 109 places, 176 transitions, 1396 flow, removed 2 selfloop flow, removed 3 redundant places. [2023-11-06 22:41:40,178 INFO L231 Difference]: Finished difference. Result has 113 places, 118 transitions, 1007 flow [2023-11-06 22:41:40,178 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=520, PETRI_DIFFERENCE_MINUEND_FLOW=594, PETRI_DIFFERENCE_MINUEND_PLACES=94, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=83, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=21, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=16, PETRI_FLOW=1007, PETRI_PLACES=113, PETRI_TRANSITIONS=118} [2023-11-06 22:41:40,179 INFO L281 CegarLoopForPetriNet]: 44 programPoint places, 69 predicate places. [2023-11-06 22:41:40,179 INFO L495 AbstractCegarLoop]: Abstraction has has 113 places, 118 transitions, 1007 flow [2023-11-06 22:41:40,180 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 202.2) internal successors, (2022), 10 states have internal predecessors, (2022), 0 states have call successors, (0), 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-06 22:41:40,180 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-06 22:41:40,180 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-06 22:41:40,198 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (23)] Forceful destruction successful, exit code 0 [2023-11-06 22:41:40,393 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:41:40,393 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 35 more)] === [2023-11-06 22:41:40,394 INFO L145 PredicateUnifier]: Initialized classic predicate unifier [2023-11-06 22:41:40,394 INFO L85 PathProgramCache]: Analyzing trace with hash 1885794949, now seen corresponding path program 1 times [2023-11-06 22:41:40,394 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-06 22:41:40,394 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1836482140] [2023-11-06 22:41:40,394 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-06 22:41:40,394 INFO L173 SolverBuilder]: Constructing external solver with command: mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 [2023-11-06 22:41:40,394 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat [2023-11-06 22:41:40,395 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (exit command is (exit), workingDir is null) [2023-11-06 22:41:40,397 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_612cb71d-4a62-47d2-bc5c-55453793923a/bin/uautomizer-verify-WvqO1wxjHP/mathsat -theory.fp.to_bv_overflow_mode=1 -theory.fp.minmax_zero_mode=4 -theory.bv.div_by_zero_mode=1 -unsat_core_generation=3 (24)] Waiting until timeout for monitored process [2023-11-06 22:41:40,536 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-06 22:41:40,543 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 17 conjunts are in the unsatisfiable core [2023-11-06 22:41:40,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-06 22:41:41,328 INFO L322 Elim1Store]: treesize reduction 172, result has 0.6 percent of original size [2023-11-06 22:41:41,328 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 8 select indices, 8 select index equivalence classes, 0 disjoint index pairs (out of 28 index pairs), introduced 8 new quantified variables, introduced 28 case distinctions, treesize of input 316 treesize of output 215 [2023-11-06 22:41:41,341 INFO L351 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 205 treesize of output 199 [2023-11-06 22:41:41,354 INFO L351 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 199 treesize of output 195 [2023-11-06 22:41:41,446 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-06 22:41:41,446 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-06 22:41:41,710 INFO L351 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 393 treesize of output 389 [2023-11-06 22:41:41,723 INFO L351 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 389 treesize of output 383 [2023-11-06 22:41:55,693 INFO L322 Elim1Store]: treesize reduction 566, result has 15.9 percent of original size [2023-11-06 22:41:55,694 INFO L351 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 12 select indices, 12 select index equivalence classes, 6 disjoint index pairs (out of 66 index pairs), introduced 16 new quantified variables, introduced 66 case distinctions, treesize of input 435 treesize of output 226 [2023-11-06 22:43:10,569 WARN L861 $PredicateComparison]: unable to prove that (or (let ((.cse0 (bvmul c_~x2~0 (_ bv4 32))) (.cse4 (bvmul (_ bv4 32) c_~x1~0))) (let ((.cse9 (= .cse0 .cse4))) (and (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse2 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse3 (bvmul (_ bv4 32) .cse2))) (or (not (let ((.cse1 (bvmul (_ bv4294967292 32) .cse2))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse1) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse1)))) (= .cse0 .cse3) (= .cse3 .cse4) (not (bvslt .cse2 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= .cse2 (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_61))) (not (bvsge .cse2 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse8 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse6 (concat (concat .cse8 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse7 (bvmul (_ bv4 32) .cse6))) (or (not (let ((.cse5 (bvmul (_ bv4294967292 32) .cse6))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse5) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse5)))) (= .cse0 .cse7) (forall ((v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse8 v_arrayElimCell_60) v_arrayElimCell_61) .cse6)) (= .cse7 .cse4) (not (bvslt .cse6 c_~size~0)) (not (bvsge .cse6 (_ bv0 32)))))))))) (or .cse9 (and (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse10 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse12 (concat (concat .cse10 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse13 (bvmul (_ bv4 32) .cse12))) (or (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse10 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_61))) (not (let ((.cse11 (bvmul (_ bv4294967292 32) .cse12))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse11) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse11)))) (= .cse0 .cse13) (= .cse13 .cse4) (not (bvslt .cse12 c_~size~0)) (not (bvsge .cse12 (_ bv0 32)))))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse17 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse15 (concat (concat .cse17 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse16 (bvmul (_ bv4 32) .cse15))) (or (not (let ((.cse14 (bvmul (_ bv4294967292 32) .cse15))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse14) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse14)))) (= .cse0 .cse16) (= .cse16 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse17 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_61))) (not (bvslt .cse15 c_~size~0)) (not (bvsge .cse15 (_ bv0 32)))))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse18 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse20 (concat (concat .cse18 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse21 (bvmul (_ bv4 32) .cse20))) (or (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse18 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat .cse18 v_arrayElimCell_60) v_arrayElimCell_61))) (not (let ((.cse19 (bvmul (_ bv4294967292 32) .cse20))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse19) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse19)))) (= .cse0 .cse21) (= .cse21 .cse4) (not (bvslt .cse20 c_~size~0)) (not (bvsge .cse20 (_ bv0 32)))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse22 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse24 (concat (concat .cse22 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse25 (bvmul (_ bv4 32) .cse24))) (or (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse22 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_60) v_arrayElimCell_61))) (not (let ((.cse23 (bvmul (_ bv4294967292 32) .cse24))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse23) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse23)))) (= .cse0 .cse25) (= .cse25 .cse4) (not (bvslt .cse24 c_~size~0)) (not (bvsge .cse24 (_ bv0 32)))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse27 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse28 (bvmul (_ bv4 32) .cse27))) (or (not (let ((.cse26 (bvmul (_ bv4294967292 32) .cse27))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse26) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse26)))) (= .cse0 .cse28) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_61) .cse27)) (= .cse28 .cse4) (not (bvslt .cse27 c_~size~0)) (not (bvsge .cse27 (_ bv0 32))))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse30 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse31 (bvmul (_ bv4 32) .cse30))) (or (not (let ((.cse29 (bvmul (_ bv4294967292 32) .cse30))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse29) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse29)))) (= .cse0 .cse31) (= .cse31 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50) .cse30)) (not (bvslt .cse30 c_~size~0)) (not (bvsge .cse30 (_ bv0 32))))))))) (or (and (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse35 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse33 (concat (concat .cse35 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse34 (bvmul (_ bv4 32) .cse33))) (or (not (let ((.cse32 (bvmul (_ bv4294967292 32) .cse33))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse32) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse32)))) (= .cse0 .cse34) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat .cse35 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50))) (= .cse34 .cse4) (not (bvslt .cse33 c_~size~0)) (not (bvsge .cse33 (_ bv0 32)))))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse37 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse36 (concat .cse37 v_arrayElimCell_59))) (let ((.cse39 (concat .cse36 v_arrayElimCell_61))) (let ((.cse40 (bvmul (_ bv4 32) .cse39))) (or (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat .cse36 v_arrayElimCell_50) (concat (concat .cse37 v_arrayElimCell_57) v_arrayElimCell_61))) (not (let ((.cse38 (bvmul (_ bv4294967292 32) .cse39))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse38) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse38)))) (= .cse0 .cse40) (= .cse40 .cse4) (not (bvslt .cse39 c_~size~0)) (not (bvsge .cse39 (_ bv0 32))))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse44 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse42 (concat (concat .cse44 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse43 (bvmul (_ bv4 32) .cse42))) (or (not (let ((.cse41 (bvmul (_ bv4294967292 32) .cse42))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse41) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse41)))) (= .cse0 .cse43) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat .cse44 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_50))) (= .cse43 .cse4) (not (bvslt .cse42 c_~size~0)) (not (bvsge .cse42 (_ bv0 32)))))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse48 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse46 (concat (concat .cse48 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse47 (bvmul (_ bv4 32) .cse46))) (or (not (let ((.cse45 (bvmul (_ bv4294967292 32) .cse46))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse45) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse45)))) (= .cse0 .cse47) (= .cse47 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat .cse48 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50))) (not (bvslt .cse46 c_~size~0)) (not (bvsge .cse46 (_ bv0 32))))))))))) .cse9) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse50 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse51 (bvmul (_ bv4 32) .cse50))) (or (not (let ((.cse49 (bvmul (_ bv4294967292 32) .cse50))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse49) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse49)))) (= .cse0 .cse51) (= .cse51 .cse4) (not (bvslt .cse50 c_~size~0)) (not (bvsge .cse50 (_ bv0 32))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= .cse50 (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_50))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse53 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse54 (bvmul (_ bv4 32) .cse53))) (or (not (let ((.cse52 (bvmul (_ bv4294967292 32) .cse53))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse52) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse52)))) (= .cse0 .cse54) (forall ((v_arrayElimCell_54 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_61) .cse53)) (= .cse54 .cse4) (not (bvslt .cse53 c_~size~0)) (not (bvsge .cse53 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (or .cse9 (and (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse58 (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59))) (let ((.cse55 (concat .cse58 v_arrayElimCell_58))) (let ((.cse57 (bvmul (_ bv4 32) .cse55))) (or (not (bvsge .cse55 (_ bv0 32))) (not (bvslt .cse55 c_~size~0)) (not (let ((.cse56 (bvmul (_ bv4294967292 32) .cse55))) (bvule (bvadd .cse56 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse56 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse57 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8))) (= (concat .cse58 v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_58))) (= .cse0 .cse57)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse62 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse59 (concat (concat .cse62 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse61 (bvmul (_ bv4 32) .cse59))) (or (not (bvsge .cse59 (_ bv0 32))) (not (bvslt .cse59 c_~size~0)) (not (let ((.cse60 (bvmul (_ bv4294967292 32) .cse59))) (bvule (bvadd .cse60 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse60 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse61 .cse4) (= .cse0 .cse61) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse62 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_58)))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse65 (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59))) (let ((.cse63 (concat .cse65 v_arrayElimCell_58))) (or (not (bvsge .cse63 (_ bv0 32))) (not (bvslt .cse63 c_~size~0)) (not (let ((.cse64 (bvmul (_ bv4294967292 32) .cse63))) (bvule (bvadd .cse64 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse64 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= (concat .cse65 v_arrayElimCell_61) .cse63) (= (bvmul (_ bv4 32) .cse63) .cse4))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse69 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse66 (concat (concat .cse69 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse68 (bvmul (_ bv4 32) .cse66))) (or (not (bvsge .cse66 (_ bv0 32))) (not (bvslt .cse66 c_~size~0)) (not (let ((.cse67 (bvmul (_ bv4294967292 32) .cse66))) (bvule (bvadd .cse67 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse67 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse68 .cse4) (= .cse0 .cse68) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_58) (concat (concat .cse69 v_arrayElimCell_57) v_arrayElimCell_61)))))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (let ((.cse73 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse70 (concat (concat .cse73 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse72 (bvmul (_ bv4 32) .cse70))) (or (not (bvsge .cse70 (_ bv0 32))) (not (bvslt .cse70 c_~size~0)) (not (let ((.cse71 (bvmul (_ bv4294967292 32) .cse70))) (bvule (bvadd .cse71 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse71 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse72 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse73 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50))) (= .cse0 .cse72)))))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse76 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse75 (concat .cse76 v_arrayElimCell_59))) (let ((.cse74 (concat .cse75 v_arrayElimCell_58))) (let ((.cse78 (bvmul (_ bv4 32) .cse74))) (or (not (bvsge .cse74 (_ bv0 32))) (not (bvslt .cse74 c_~size~0)) (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat .cse75 v_arrayElimCell_50) (concat (concat .cse76 v_arrayElimCell_57) v_arrayElimCell_61))) (not (let ((.cse77 (bvmul (_ bv4294967292 32) .cse74))) (bvule (bvadd .cse77 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse77 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse78 .cse4) (= .cse0 .cse78))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse81 (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59))) (let ((.cse79 (concat .cse81 v_arrayElimCell_58))) (let ((.cse82 (bvmul (_ bv4 32) .cse79))) (or (not (bvsge .cse79 (_ bv0 32))) (not (bvslt .cse79 c_~size~0)) (not (let ((.cse80 (bvmul (_ bv4294967292 32) .cse79))) (bvule (bvadd .cse80 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse80 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_58) (concat .cse81 v_arrayElimCell_61))) (= .cse82 .cse4) (= .cse0 .cse82)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse85 (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59))) (let ((.cse83 (concat .cse85 v_arrayElimCell_58))) (let ((.cse86 (bvmul (_ bv4 32) .cse83))) (or (not (bvsge .cse83 (_ bv0 32))) (not (bvslt .cse83 c_~size~0)) (not (let ((.cse84 (bvmul (_ bv4294967292 32) .cse83))) (bvule (bvadd .cse84 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse84 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat .cse85 v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_58))) (= .cse86 .cse4) (= .cse0 .cse86)))))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse90 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse87 (concat (concat .cse90 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse89 (bvmul (_ bv4 32) .cse87))) (or (not (bvsge .cse87 (_ bv0 32))) (not (bvslt .cse87 c_~size~0)) (not (let ((.cse88 (bvmul (_ bv4294967292 32) .cse87))) (bvule (bvadd .cse88 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse88 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse89 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_58) (concat (concat .cse90 v_arrayElimCell_57) v_arrayElimCell_61))) (= .cse0 .cse89)))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (let ((.cse94 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse91 (concat (concat .cse94 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse93 (bvmul (_ bv4 32) .cse91))) (or (not (bvsge .cse91 (_ bv0 32))) (not (bvslt .cse91 c_~size~0)) (not (let ((.cse92 (bvmul (_ bv4294967292 32) .cse91))) (bvule (bvadd .cse92 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse92 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse93 .cse4) (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse94 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat .cse94 v_arrayElimCell_60) v_arrayElimCell_50))) (= .cse0 .cse93)))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8))) (or (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (let ((.cse97 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse95 (concat (concat .cse97 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse98 (bvmul (_ bv4 32) .cse95))) (or (not (bvsge .cse95 (_ bv0 32))) (not (bvslt .cse95 c_~size~0)) (not (let ((.cse96 (bvmul (_ bv4294967292 32) .cse95))) (bvule (bvadd .cse96 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse96 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse97 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50))) (= .cse98 .cse4) (= .cse0 .cse98)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse102 (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59))) (let ((.cse99 (concat .cse102 v_arrayElimCell_58))) (let ((.cse101 (bvmul (_ bv4 32) .cse99))) (or (not (bvsge .cse99 (_ bv0 32))) (not (bvslt .cse99 c_~size~0)) (not (let ((.cse100 (bvmul (_ bv4294967292 32) .cse99))) (bvule (bvadd .cse100 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse100 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse101 .cse4) (= .cse0 .cse101) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_60) v_arrayElimCell_50) (concat .cse102 v_arrayElimCell_61)))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse103 (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59))) (let ((.cse104 (concat .cse103 v_arrayElimCell_58))) (let ((.cse106 (bvmul (_ bv4 32) .cse104))) (or (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50) (concat .cse103 v_arrayElimCell_61))) (not (bvsge .cse104 (_ bv0 32))) (not (bvslt .cse104 c_~size~0)) (not (let ((.cse105 (bvmul (_ bv4294967292 32) .cse104))) (bvule (bvadd .cse105 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse105 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse106 .cse4) (= .cse0 .cse106)))))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse109 (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59))) (let ((.cse107 (concat .cse109 v_arrayElimCell_58))) (let ((.cse110 (bvmul (_ bv4 32) .cse107))) (or (not (bvsge .cse107 (_ bv0 32))) (not (bvslt .cse107 c_~size~0)) (not (let ((.cse108 (bvmul (_ bv4294967292 32) .cse107))) (bvule (bvadd .cse108 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse108 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_58) (concat .cse109 v_arrayElimCell_61))) (= .cse110 .cse4) (= .cse0 .cse110)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse112 (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59))) (let ((.cse111 (concat .cse112 v_arrayElimCell_58))) (let ((.cse114 (bvmul (_ bv4 32) .cse111))) (or (not (bvsge .cse111 (_ bv0 32))) (not (bvslt .cse111 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50) (concat .cse112 v_arrayElimCell_61))) (not (let ((.cse113 (bvmul (_ bv4294967292 32) .cse111))) (bvule (bvadd .cse113 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse113 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse114 .cse4) (= .cse0 .cse114)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse118 (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59))) (let ((.cse115 (concat .cse118 v_arrayElimCell_58))) (let ((.cse117 (bvmul (_ bv4 32) .cse115))) (or (not (bvsge .cse115 (_ bv0 32))) (not (bvslt .cse115 c_~size~0)) (not (let ((.cse116 (bvmul (_ bv4294967292 32) .cse115))) (bvule (bvadd .cse116 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse116 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse117 .cse4) (= .cse0 .cse117) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat .cse118 v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_50)))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse121 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse119 (concat (concat .cse121 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse122 (bvmul (_ bv4 32) .cse119))) (or (not (bvsge .cse119 (_ bv0 32))) (not (bvslt .cse119 c_~size~0)) (not (let ((.cse120 (bvmul (_ bv4294967292 32) .cse119))) (bvule (bvadd .cse120 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse120 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat .cse121 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50))) (= .cse122 .cse4) (= .cse0 .cse122)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (let ((.cse125 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse123 (concat (concat .cse125 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse126 (bvmul (_ bv4 32) .cse123))) (or (not (bvsge .cse123 (_ bv0 32))) (not (bvslt .cse123 c_~size~0)) (not (let ((.cse124 (bvmul (_ bv4294967292 32) .cse123))) (bvule (bvadd .cse124 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse124 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse125 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_60) v_arrayElimCell_50))) (= .cse126 .cse4) (= .cse0 .cse126)))))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse130 (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59))) (let ((.cse127 (concat .cse130 v_arrayElimCell_58))) (let ((.cse129 (bvmul (_ bv4 32) .cse127))) (or (not (bvsge .cse127 (_ bv0 32))) (not (bvslt .cse127 c_~size~0)) (not (let ((.cse128 (bvmul (_ bv4294967292 32) .cse127))) (bvule (bvadd .cse128 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse128 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse129 .cse4) (forall ((v_arrayElimCell_50 (_ BitVec 8))) (= (concat .cse130 v_arrayElimCell_50) (concat .cse130 v_arrayElimCell_61))) (= .cse0 .cse129)))))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse133 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse131 (concat (concat .cse133 v_arrayElimCell_59) v_arrayElimCell_58))) (or (not (bvsge .cse131 (_ bv0 32))) (not (bvslt .cse131 c_~size~0)) (not (let ((.cse132 (bvmul (_ bv4294967292 32) .cse131))) (bvule (bvadd .cse132 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse132 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat .cse133 v_arrayElimCell_57) v_arrayElimCell_61) .cse131)) (= (bvmul (_ bv4 32) .cse131) .cse4))))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse136 (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59))) (let ((.cse134 (concat .cse136 v_arrayElimCell_58))) (let ((.cse137 (bvmul (_ bv4 32) .cse134))) (or (not (bvsge .cse134 (_ bv0 32))) (not (bvslt .cse134 c_~size~0)) (not (let ((.cse135 (bvmul (_ bv4294967292 32) .cse134))) (bvule (bvadd .cse135 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse135 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50) (concat .cse136 v_arrayElimCell_61))) (= .cse137 .cse4) (= .cse0 .cse137)))))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse141 (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59))) (let ((.cse138 (concat .cse141 v_arrayElimCell_58))) (let ((.cse140 (bvmul (_ bv4 32) .cse138))) (or (not (bvsge .cse138 (_ bv0 32))) (not (bvslt .cse138 c_~size~0)) (not (let ((.cse139 (bvmul (_ bv4294967292 32) .cse138))) (bvule (bvadd .cse139 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse139 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse140 .cse4) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat .cse141 v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_60) v_arrayElimCell_58))) (= .cse0 .cse140)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse145 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse142 (concat (concat .cse145 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse144 (bvmul (_ bv4 32) .cse142))) (or (not (bvsge .cse142 (_ bv0 32))) (not (bvslt .cse142 c_~size~0)) (not (let ((.cse143 (bvmul (_ bv4294967292 32) .cse142))) (bvule (bvadd .cse143 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse143 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse144 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat .cse145 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_58))) (= .cse0 .cse144)))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse146 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse147 (concat (concat .cse146 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse149 (bvmul (_ bv4 32) .cse147))) (or (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse146 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat .cse146 v_arrayElimCell_60) v_arrayElimCell_58))) (not (bvsge .cse147 (_ bv0 32))) (not (bvslt .cse147 c_~size~0)) (not (let ((.cse148 (bvmul (_ bv4294967292 32) .cse147))) (bvule (bvadd .cse148 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse148 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse149 .cse4) (= .cse0 .cse149)))))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse152 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse150 (concat (concat .cse152 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse153 (bvmul (_ bv4 32) .cse150))) (or (not (bvsge .cse150 (_ bv0 32))) (not (bvslt .cse150 c_~size~0)) (not (let ((.cse151 (bvmul (_ bv4294967292 32) .cse150))) (bvule (bvadd .cse151 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse151 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat .cse152 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_50))) (= .cse153 .cse4) (= .cse0 .cse153)))))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse157 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse154 (concat (concat .cse157 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse156 (bvmul (_ bv4 32) .cse154))) (or (not (bvsge .cse154 (_ bv0 32))) (not (bvslt .cse154 c_~size~0)) (not (let ((.cse155 (bvmul (_ bv4294967292 32) .cse154))) (bvule (bvadd .cse155 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse155 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse156 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat .cse157 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50))) (= .cse0 .cse156)))))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse160 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse161 (concat .cse160 v_arrayElimCell_59))) (let ((.cse158 (concat .cse161 v_arrayElimCell_58))) (let ((.cse162 (bvmul (_ bv4 32) .cse158))) (or (not (bvsge .cse158 (_ bv0 32))) (not (bvslt .cse158 c_~size~0)) (not (let ((.cse159 (bvmul (_ bv4294967292 32) .cse158))) (bvule (bvadd .cse159 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse159 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse160 v_arrayElimCell_60) v_arrayElimCell_50) (concat .cse161 v_arrayElimCell_61))) (= .cse162 .cse4) (= .cse0 .cse162))))))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse166 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse165 (concat .cse166 v_arrayElimCell_59))) (let ((.cse163 (concat .cse165 v_arrayElimCell_58))) (let ((.cse167 (bvmul (_ bv4 32) .cse163))) (or (not (bvsge .cse163 (_ bv0 32))) (not (bvslt .cse163 c_~size~0)) (not (let ((.cse164 (bvmul (_ bv4294967292 32) .cse163))) (bvule (bvadd .cse164 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse164 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_60 (_ BitVec 8))) (= (concat .cse165 v_arrayElimCell_61) (concat (concat .cse166 v_arrayElimCell_60) v_arrayElimCell_58))) (= .cse167 .cse4) (= .cse0 .cse167))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse168 (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59))) (let ((.cse169 (concat .cse168 v_arrayElimCell_58))) (let ((.cse171 (bvmul (_ bv4 32) .cse169))) (or (forall ((v_arrayElimCell_55 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58) (concat .cse168 v_arrayElimCell_61))) (not (bvsge .cse169 (_ bv0 32))) (not (bvslt .cse169 c_~size~0)) (not (let ((.cse170 (bvmul (_ bv4294967292 32) .cse169))) (bvule (bvadd .cse170 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse170 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse171 .cse4) (= .cse0 .cse171)))))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse175 (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59))) (let ((.cse172 (concat .cse175 v_arrayElimCell_58))) (let ((.cse174 (bvmul (_ bv4 32) .cse172))) (or (not (bvsge .cse172 (_ bv0 32))) (not (bvslt .cse172 c_~size~0)) (not (let ((.cse173 (bvmul (_ bv4294967292 32) .cse172))) (bvule (bvadd .cse173 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse173 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse174 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50) (concat .cse175 v_arrayElimCell_61))) (= .cse0 .cse174)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse178 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse176 (concat (concat .cse178 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse179 (bvmul (_ bv4 32) .cse176))) (or (not (bvsge .cse176 (_ bv0 32))) (not (bvslt .cse176 c_~size~0)) (not (let ((.cse177 (bvmul (_ bv4294967292 32) .cse176))) (bvule (bvadd .cse177 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse177 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse178 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_60) v_arrayElimCell_58))) (= .cse179 .cse4) (= .cse0 .cse179)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse183 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse180 (concat (concat .cse183 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse182 (bvmul (_ bv4 32) .cse180))) (or (not (bvsge .cse180 (_ bv0 32))) (not (bvslt .cse180 c_~size~0)) (not (let ((.cse181 (bvmul (_ bv4294967292 32) .cse180))) (bvule (bvadd .cse181 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse181 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse182 .cse4) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat .cse183 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (= .cse0 .cse182)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse185 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse186 (bvmul (_ bv4 32) .cse185))) (or (not (let ((.cse184 (bvmul (_ bv4294967292 32) .cse185))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse184) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse184)))) (= .cse0 .cse186) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50) .cse185)) (= .cse186 .cse4) (not (bvslt .cse185 c_~size~0)) (not (bvsge .cse185 (_ bv0 32))))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse187 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse189 (bvmul (_ bv4 32) .cse187))) (or (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50) .cse187)) (not (let ((.cse188 (bvmul (_ bv4294967292 32) .cse187))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse188) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse188)))) (= .cse0 .cse189) (= .cse189 .cse4) (not (bvslt .cse187 c_~size~0)) (not (bvsge .cse187 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse193 (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59))) (let ((.cse191 (concat .cse193 v_arrayElimCell_61))) (let ((.cse192 (bvmul (_ bv4 32) .cse191))) (or (not (let ((.cse190 (bvmul (_ bv4294967292 32) .cse191))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse190) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse190)))) (= .cse0 .cse192) (= .cse192 .cse4) (forall ((v_arrayElimCell_50 (_ BitVec 8))) (= (concat .cse193 v_arrayElimCell_50) .cse191)) (not (bvslt .cse191 c_~size~0)) (not (bvsge .cse191 (_ bv0 32)))))))))) (or .cse9 (and (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse195 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse194 (bvmul (_ bv4 32) .cse195))) (or (= .cse194 .cse4) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61))) (not (bvsge .cse195 (_ bv0 32))) (= .cse0 .cse194) (not (let ((.cse196 (bvmul (_ bv4294967292 32) .cse195))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse196 v_arrayElimIndex_4) (bvadd .cse0 .cse196 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse195 c_~size~0)))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8))) (or (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse198 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse197 (bvmul (_ bv4 32) .cse198))) (or (= .cse0 .cse197) (not (bvslt .cse198 c_~size~0)) (not (bvsge .cse198 (_ bv0 32))) (not (let ((.cse199 (bvmul (_ bv4294967292 32) .cse198))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse199 v_arrayElimIndex_4) (bvadd .cse0 .cse199 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50))) (= .cse197 .cse4))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse201 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse200 (bvmul (_ bv4 32) .cse201))) (or (= .cse0 .cse200) (not (bvslt .cse201 c_~size~0)) (not (bvsge .cse201 (_ bv0 32))) (not (let ((.cse202 (bvmul (_ bv4294967292 32) .cse201))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse202 v_arrayElimIndex_4) (bvadd .cse0 .cse202 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_58) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse200 .cse4))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse203 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (or (not (bvslt .cse203 c_~size~0)) (not (bvsge .cse203 (_ bv0 32))) (not (let ((.cse204 (bvmul (_ bv4294967292 32) .cse203))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse204 v_arrayElimIndex_4) (bvadd .cse0 .cse204 (_ bv3 32) v_arrayElimIndex_4)))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) .cse203) (= (bvmul (_ bv4 32) .cse203) .cse4)))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse205 (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59))) (let ((.cse207 (concat .cse205 v_arrayElimCell_58))) (let ((.cse206 (bvmul (_ bv4 32) .cse207))) (or (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat .cse205 v_arrayElimCell_50))) (= .cse0 .cse206) (not (bvslt .cse207 c_~size~0)) (not (bvsge .cse207 (_ bv0 32))) (not (let ((.cse208 (bvmul (_ bv4294967292 32) .cse207))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse208 v_arrayElimIndex_4) (bvadd .cse0 .cse208 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse206 .cse4)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse212 (concat v_arrayElimCell_51 v_arrayElimCell_56))) (let ((.cse210 (concat (concat .cse212 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse209 (bvmul (_ bv4 32) .cse210))) (or (= .cse209 .cse4) (= .cse0 .cse209) (not (bvslt .cse210 c_~size~0)) (not (let ((.cse211 (bvmul (_ bv4294967292 32) .cse210))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse211) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse211)))) (not (bvsge .cse210 (_ bv0 32))) (forall ((v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat .cse212 v_arrayElimCell_60) v_arrayElimCell_50)))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse214 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse213 (bvmul (_ bv4 32) .cse214))) (or (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_50))) (= .cse213 .cse4) (= .cse0 .cse213) (not (bvslt .cse214 c_~size~0)) (not (let ((.cse215 (bvmul (_ bv4294967292 32) .cse214))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse215) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse215)))) (not (bvsge .cse214 (_ bv0 32))))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse217 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse216 (bvmul (_ bv4 32) .cse217))) (or (= .cse216 .cse4) (= .cse0 .cse216) (not (bvslt .cse217 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_58) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61))) (not (let ((.cse218 (bvmul (_ bv4294967292 32) .cse217))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse218) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse218)))) (not (bvsge .cse217 (_ bv0 32))))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse220 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse219 (bvmul (_ bv4 32) .cse220))) (or (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse219 .cse4) (= .cse0 .cse219) (not (bvslt .cse220 c_~size~0)) (not (let ((.cse221 (bvmul (_ bv4294967292 32) .cse220))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse221) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse221)))) (not (bvsge .cse220 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse225 (concat v_arrayElimCell_53 v_arrayElimCell_56))) (let ((.cse223 (concat (concat .cse225 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse222 (bvmul (_ bv4 32) .cse223))) (or (= .cse0 .cse222) (not (bvslt .cse223 c_~size~0)) (not (bvsge .cse223 (_ bv0 32))) (not (let ((.cse224 (bvmul (_ bv4294967292 32) .cse223))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse224 v_arrayElimIndex_4) (bvadd .cse0 .cse224 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat .cse225 v_arrayElimCell_60) v_arrayElimCell_58))) (= .cse222 .cse4)))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse227 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse226 (bvmul (_ bv4 32) .cse227))) (or (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse226 .cse4) (not (bvsge .cse227 (_ bv0 32))) (= .cse0 .cse226) (not (let ((.cse228 (bvmul (_ bv4294967292 32) .cse227))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse228 v_arrayElimIndex_4) (bvadd .cse0 .cse228 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse227 c_~size~0)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse232 (concat v_arrayElimCell_53 v_arrayElimCell_56))) (let ((.cse230 (concat (concat .cse232 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse229 (bvmul (_ bv4 32) .cse230))) (or (= .cse0 .cse229) (not (bvslt .cse230 c_~size~0)) (not (bvsge .cse230 (_ bv0 32))) (not (let ((.cse231 (bvmul (_ bv4294967292 32) .cse230))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse231 v_arrayElimIndex_4) (bvadd .cse0 .cse231 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse229 .cse4) (forall ((v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat .cse232 v_arrayElimCell_60) v_arrayElimCell_50)))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse234 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse233 (bvmul (_ bv4 32) .cse234))) (or (= .cse233 .cse4) (= .cse0 .cse233) (not (bvslt .cse234 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (let ((.cse235 (bvmul (_ bv4294967292 32) .cse234))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse235) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse235)))) (not (bvsge .cse234 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse237 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse236 (bvmul (_ bv4 32) .cse237))) (or (= .cse0 .cse236) (not (bvslt .cse237 c_~size~0)) (not (bvsge .cse237 (_ bv0 32))) (not (let ((.cse238 (bvmul (_ bv4294967292 32) .cse237))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse238 v_arrayElimIndex_4) (bvadd .cse0 .cse238 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_58))) (= .cse236 .cse4))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse239 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse241 (bvmul .cse239 (_ bv4 32)))) (or (not (bvsge .cse239 (_ bv0 32))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50))) (not (let ((.cse240 (bvmul (_ bv4294967292 32) .cse239))) (bvule (bvadd .cse240 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse240 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse239 c_~size~0)) (= .cse0 .cse241) (= .cse241 .cse4))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse243 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse242 (bvmul (_ bv4 32) .cse243))) (or (= .cse242 .cse4) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvsge .cse243 (_ bv0 32))) (= .cse0 .cse242) (not (let ((.cse244 (bvmul (_ bv4294967292 32) .cse243))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse244 v_arrayElimIndex_4) (bvadd .cse0 .cse244 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse243 c_~size~0)))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse246 (concat v_arrayElimCell_53 v_arrayElimCell_56))) (let ((.cse247 (concat (concat .cse246 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse245 (bvmul (_ bv4 32) .cse247))) (or (= .cse0 .cse245) (forall ((v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat .cse246 v_arrayElimCell_60) v_arrayElimCell_58))) (not (bvslt .cse247 c_~size~0)) (not (bvsge .cse247 (_ bv0 32))) (not (let ((.cse248 (bvmul (_ bv4294967292 32) .cse247))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse248 v_arrayElimIndex_4) (bvadd .cse0 .cse248 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse245 .cse4)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse250 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse249 (bvmul (_ bv4 32) .cse250))) (or (= .cse0 .cse249) (not (bvslt .cse250 c_~size~0)) (not (bvsge .cse250 (_ bv0 32))) (not (let ((.cse251 (bvmul (_ bv4294967292 32) .cse250))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse251 v_arrayElimIndex_4) (bvadd .cse0 .cse251 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse249 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_58) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse253 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse252 (bvmul (_ bv4 32) .cse253))) (or (= .cse252 .cse4) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61))) (not (bvsge .cse253 (_ bv0 32))) (= .cse0 .cse252) (not (let ((.cse254 (bvmul (_ bv4294967292 32) .cse253))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse254 v_arrayElimIndex_4) (bvadd .cse0 .cse254 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse253 c_~size~0)))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse255 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (or (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) .cse255) (= (bvmul (_ bv4 32) .cse255) .cse4) (not (bvslt .cse255 c_~size~0)) (not (let ((.cse256 (bvmul (_ bv4294967292 32) .cse255))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse256) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse256)))) (not (bvsge .cse255 (_ bv0 32)))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse257 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse259 (bvmul .cse257 (_ bv4 32)))) (or (not (bvsge .cse257 (_ bv0 32))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50))) (not (let ((.cse258 (bvmul (_ bv4294967292 32) .cse257))) (bvule (bvadd .cse258 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse258 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse257 c_~size~0)) (= .cse0 .cse259) (= .cse259 .cse4))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse261 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse260 (bvmul (_ bv4 32) .cse261))) (or (= .cse260 .cse4) (not (bvsge .cse261 (_ bv0 32))) (= .cse0 .cse260) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_61))) (not (let ((.cse262 (bvmul (_ bv4294967292 32) .cse261))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse262 v_arrayElimIndex_4) (bvadd .cse0 .cse262 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse261 c_~size~0)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse264 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse263 (bvmul (_ bv4 32) .cse264))) (or (= .cse0 .cse263) (not (bvslt .cse264 c_~size~0)) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (not (bvsge .cse264 (_ bv0 32))) (not (let ((.cse265 (bvmul (_ bv4294967292 32) .cse264))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse265 v_arrayElimIndex_4) (bvadd .cse0 .cse265 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse263 .cse4))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse266 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse268 (bvmul .cse266 (_ bv4 32)))) (or (not (bvsge .cse266 (_ bv0 32))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_61))) (not (let ((.cse267 (bvmul (_ bv4294967292 32) .cse266))) (bvule (bvadd .cse267 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse267 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse266 c_~size~0)) (= .cse0 .cse268) (= .cse268 .cse4))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse270 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse269 (bvmul (_ bv4 32) .cse270))) (or (= .cse269 .cse4) (not (bvsge .cse270 (_ bv0 32))) (= .cse0 .cse269) (not (let ((.cse271 (bvmul (_ bv4294967292 32) .cse270))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse271 v_arrayElimIndex_4) (bvadd .cse0 .cse271 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse270 c_~size~0)) (forall ((v_arrayElimCell_55 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse273 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse272 (bvmul (_ bv4 32) .cse273))) (or (= .cse0 .cse272) (not (bvslt .cse273 c_~size~0)) (not (bvsge .cse273 (_ bv0 32))) (not (let ((.cse274 (bvmul (_ bv4294967292 32) .cse273))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse274 v_arrayElimIndex_4) (bvadd .cse0 .cse274 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse272 .cse4) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_60) v_arrayElimCell_58) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse275 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse277 (bvmul .cse275 (_ bv4 32)))) (or (not (bvsge .cse275 (_ bv0 32))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61))) (not (let ((.cse276 (bvmul (_ bv4294967292 32) .cse275))) (bvule (bvadd .cse276 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse276 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse275 c_~size~0)) (= .cse0 .cse277) (= .cse277 .cse4))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse278 (concat v_arrayElimCell_51 v_arrayElimCell_56))) (let ((.cse280 (concat (concat .cse278 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse279 (bvmul (_ bv4 32) .cse280))) (or (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat .cse278 v_arrayElimCell_60) v_arrayElimCell_58))) (= .cse279 .cse4) (= .cse0 .cse279) (not (bvslt .cse280 c_~size~0)) (not (let ((.cse281 (bvmul (_ bv4294967292 32) .cse280))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse281) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse281)))) (not (bvsge .cse280 (_ bv0 32)))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse283 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse282 (bvmul (_ bv4 32) .cse283))) (or (= .cse282 .cse4) (not (bvsge .cse283 (_ bv0 32))) (= .cse0 .cse282) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (let ((.cse284 (bvmul (_ bv4294967292 32) .cse283))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse284 v_arrayElimIndex_4) (bvadd .cse0 .cse284 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse283 c_~size~0)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse285 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse287 (bvmul .cse285 (_ bv4 32)))) (or (not (bvsge .cse285 (_ bv0 32))) (not (let ((.cse286 (bvmul (_ bv4294967292 32) .cse285))) (bvule (bvadd .cse286 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse286 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse285 c_~size~0)) (= .cse0 .cse287) (= .cse287 .cse4) (forall ((v_arrayElimCell_55 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse289 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse288 (bvmul (_ bv4 32) .cse289))) (or (= .cse288 .cse4) (= .cse0 .cse288) (not (bvslt .cse289 c_~size~0)) (not (let ((.cse290 (bvmul (_ bv4294967292 32) .cse289))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse290) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse290)))) (not (bvsge .cse289 (_ bv0 32))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50))))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse292 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse291 (bvmul (_ bv4 32) .cse292))) (or (= .cse291 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvsge .cse292 (_ bv0 32))) (= .cse0 .cse291) (not (let ((.cse293 (bvmul (_ bv4294967292 32) .cse292))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse293 v_arrayElimIndex_4) (bvadd .cse0 .cse293 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse292 c_~size~0)))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse295 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse294 (bvmul (_ bv4 32) .cse295))) (or (= .cse294 .cse4) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_60) v_arrayElimCell_61))) (not (bvsge .cse295 (_ bv0 32))) (= .cse0 .cse294) (not (let ((.cse296 (bvmul (_ bv4294967292 32) .cse295))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse296 v_arrayElimIndex_4) (bvadd .cse0 .cse296 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse295 c_~size~0)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse297 (concat v_arrayElimCell_53 v_arrayElimCell_56))) (let ((.cse298 (concat (concat .cse297 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse300 (bvmul .cse298 (_ bv4 32)))) (or (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat .cse297 v_arrayElimCell_60) v_arrayElimCell_61))) (not (bvsge .cse298 (_ bv0 32))) (not (let ((.cse299 (bvmul (_ bv4294967292 32) .cse298))) (bvule (bvadd .cse299 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse299 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse298 c_~size~0)) (= .cse0 .cse300) (= .cse300 .cse4)))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse302 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse301 (bvmul (_ bv4 32) .cse302))) (or (forall ((v_arrayElimCell_55 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (= .cse301 .cse4) (= .cse0 .cse301) (not (bvslt .cse302 c_~size~0)) (not (let ((.cse303 (bvmul (_ bv4294967292 32) .cse302))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse303) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse303)))) (not (bvsge .cse302 (_ bv0 32))))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse305 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse304 (bvmul (_ bv4 32) .cse305))) (or (= .cse304 .cse4) (not (bvsge .cse305 (_ bv0 32))) (= .cse0 .cse304) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_61))) (not (let ((.cse306 (bvmul (_ bv4294967292 32) .cse305))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse306 v_arrayElimIndex_4) (bvadd .cse0 .cse306 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse305 c_~size~0)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse308 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse307 (bvmul (_ bv4 32) .cse308))) (or (= .cse0 .cse307) (not (bvslt .cse308 c_~size~0)) (not (bvsge .cse308 (_ bv0 32))) (not (let ((.cse309 (bvmul (_ bv4294967292 32) .cse308))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse309 v_arrayElimIndex_4) (bvadd .cse0 .cse309 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_60) v_arrayElimCell_58) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse307 .cse4))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse311 (concat v_arrayElimCell_51 v_arrayElimCell_56))) (let ((.cse312 (concat (concat .cse311 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse310 (bvmul (_ bv4 32) .cse312))) (or (= .cse310 .cse4) (forall ((v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse311 v_arrayElimCell_60) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvsge .cse312 (_ bv0 32))) (= .cse0 .cse310) (not (let ((.cse313 (bvmul (_ bv4294967292 32) .cse312))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse313 v_arrayElimIndex_4) (bvadd .cse0 .cse313 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse312 c_~size~0))))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse315 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse314 (bvmul (_ bv4 32) .cse315))) (or (= .cse314 .cse4) (= .cse0 .cse314) (not (bvslt .cse315 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_58))) (not (let ((.cse316 (bvmul (_ bv4294967292 32) .cse315))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse316) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse316)))) (not (bvsge .cse315 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse318 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse317 (bvmul (_ bv4 32) .cse318))) (or (= .cse317 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50))) (not (bvsge .cse318 (_ bv0 32))) (= .cse0 .cse317) (not (let ((.cse319 (bvmul (_ bv4294967292 32) .cse318))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse319 v_arrayElimIndex_4) (bvadd .cse0 .cse319 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse318 c_~size~0)))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse321 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse320 (bvmul (_ bv4 32) .cse321))) (or (= .cse0 .cse320) (not (bvslt .cse321 c_~size~0)) (not (bvsge .cse321 (_ bv0 32))) (not (let ((.cse322 (bvmul (_ bv4294967292 32) .cse321))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse322 v_arrayElimIndex_4) (bvadd .cse0 .cse322 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse320 .cse4))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse325 (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59))) (let ((.cse324 (concat .cse325 v_arrayElimCell_58))) (let ((.cse323 (bvmul (_ bv4 32) .cse324))) (or (= .cse323 .cse4) (= .cse0 .cse323) (not (bvslt .cse324 c_~size~0)) (forall ((v_arrayElimCell_50 (_ BitVec 8))) (= (concat .cse325 v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (let ((.cse326 (bvmul (_ bv4294967292 32) .cse324))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse326) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse326)))) (not (bvsge .cse324 (_ bv0 32)))))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8))) (or (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32))) (let ((.cse328 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse327 (bvmul (_ bv4 32) .cse328))) (or (= .cse0 .cse327) (not (bvslt .cse328 c_~size~0)) (not (bvsge .cse328 (_ bv0 32))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (not (let ((.cse329 (bvmul (_ bv4294967292 32) .cse328))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse329 v_arrayElimIndex_4) (bvadd .cse0 .cse329 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse327 .cse4))))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8))) (or (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (let ((.cse331 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse330 (bvmul (_ bv4 32) .cse331))) (or (= .cse330 .cse4) (= .cse0 .cse330) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50))) (not (bvslt .cse331 c_~size~0)) (not (let ((.cse332 (bvmul (_ bv4294967292 32) .cse331))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse332) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse332)))) (not (bvsge .cse331 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse334 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse333 (bvmul (_ bv4 32) .cse334))) (or (= .cse333 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvsge .cse334 (_ bv0 32))) (= .cse0 .cse333) (not (let ((.cse335 (bvmul (_ bv4294967292 32) .cse334))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse335 v_arrayElimIndex_4) (bvadd .cse0 .cse335 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse334 c_~size~0)))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse339 (concat v_arrayElimCell_53 v_arrayElimCell_56))) (let ((.cse336 (concat (concat .cse339 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse338 (bvmul .cse336 (_ bv4 32)))) (or (not (bvsge .cse336 (_ bv0 32))) (not (let ((.cse337 (bvmul (_ bv4294967292 32) .cse336))) (bvule (bvadd .cse337 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse337 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse336 c_~size~0)) (= .cse0 .cse338) (forall ((v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat .cse339 v_arrayElimCell_60) v_arrayElimCell_61))) (= .cse338 .cse4)))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse341 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse340 (bvmul (_ bv4 32) .cse341))) (or (forall ((v_arrayElimCell_55 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (= .cse0 .cse340) (not (bvslt .cse341 c_~size~0)) (not (bvsge .cse341 (_ bv0 32))) (not (let ((.cse342 (bvmul (_ bv4294967292 32) .cse341))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse342 v_arrayElimIndex_4) (bvadd .cse0 .cse342 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse340 .cse4))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse343 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (or (= (bvmul (_ bv4 32) .cse343) .cse4) (not (bvsge .cse343 (_ bv0 32))) (not (let ((.cse344 (bvmul (_ bv4294967292 32) .cse343))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse344 v_arrayElimIndex_4) (bvadd .cse0 .cse344 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse343 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61)) (not (bvslt .cse343 c_~size~0))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse345 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse347 (bvmul .cse345 (_ bv4 32)))) (or (not (bvsge .cse345 (_ bv0 32))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_60) v_arrayElimCell_61))) (not (let ((.cse346 (bvmul (_ bv4294967292 32) .cse345))) (bvule (bvadd .cse346 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse346 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse345 c_~size~0)) (= .cse0 .cse347) (= .cse347 .cse4))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse349 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse348 (bvmul (_ bv4 32) .cse349))) (or (= .cse348 .cse4) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (= .cse0 .cse348) (not (bvslt .cse349 c_~size~0)) (not (let ((.cse350 (bvmul (_ bv4294967292 32) .cse349))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse350) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse350)))) (not (bvsge .cse349 (_ bv0 32))))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse352 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse351 (bvmul (_ bv4 32) .cse352))) (or (= .cse351 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50))) (not (bvsge .cse352 (_ bv0 32))) (= .cse0 .cse351) (not (let ((.cse353 (bvmul (_ bv4294967292 32) .cse352))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse353 v_arrayElimIndex_4) (bvadd .cse0 .cse353 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse352 c_~size~0)))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse355 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse354 (bvmul (_ bv4 32) .cse355))) (or (= .cse354 .cse4) (not (bvsge .cse355 (_ bv0 32))) (= .cse0 .cse354) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (let ((.cse356 (bvmul (_ bv4294967292 32) .cse355))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse356 v_arrayElimIndex_4) (bvadd .cse0 .cse356 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse355 c_~size~0)))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse357 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse359 (bvmul .cse357 (_ bv4 32)))) (or (not (bvsge .cse357 (_ bv0 32))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (let ((.cse358 (bvmul (_ bv4294967292 32) .cse357))) (bvule (bvadd .cse358 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse358 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse357 c_~size~0)) (= .cse0 .cse359) (= .cse359 .cse4))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse361 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse360 (bvmul (_ bv4 32) .cse361))) (or (= .cse360 .cse4) (= .cse0 .cse360) (not (bvslt .cse361 c_~size~0)) (not (let ((.cse362 (bvmul (_ bv4294967292 32) .cse361))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse362) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse362)))) (not (bvsge .cse361 (_ bv0 32))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_60) v_arrayElimCell_58) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse363 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse365 (bvmul .cse363 (_ bv4 32)))) (or (not (bvsge .cse363 (_ bv0 32))) (not (let ((.cse364 (bvmul (_ bv4294967292 32) .cse363))) (bvule (bvadd .cse364 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse364 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse363 c_~size~0)) (= .cse0 .cse365) (forall ((v_arrayElimCell_54 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse365 .cse4))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse367 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse366 (bvmul (_ bv4 32) .cse367))) (or (= .cse0 .cse366) (not (bvslt .cse367 c_~size~0)) (not (bvsge .cse367 (_ bv0 32))) (not (let ((.cse368 (bvmul (_ bv4294967292 32) .cse367))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse368 v_arrayElimIndex_4) (bvadd .cse0 .cse368 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_54 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_58) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse366 .cse4))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse369 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse371 (bvmul .cse369 (_ bv4 32)))) (or (not (bvsge .cse369 (_ bv0 32))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (let ((.cse370 (bvmul (_ bv4294967292 32) .cse369))) (bvule (bvadd .cse370 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse370 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse369 c_~size~0)) (= .cse0 .cse371) (= .cse371 .cse4))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse373 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse372 (bvmul (_ bv4 32) .cse373))) (or (= .cse372 .cse4) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_60) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvsge .cse373 (_ bv0 32))) (= .cse0 .cse372) (not (let ((.cse374 (bvmul (_ bv4294967292 32) .cse373))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse374 v_arrayElimIndex_4) (bvadd .cse0 .cse374 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse373 c_~size~0)))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse375 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse377 (bvmul .cse375 (_ bv4 32)))) (or (not (bvsge .cse375 (_ bv0 32))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (let ((.cse376 (bvmul (_ bv4294967292 32) .cse375))) (bvule (bvadd .cse376 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse376 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse375 c_~size~0)) (= .cse0 .cse377) (= .cse377 .cse4))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32))) (let ((.cse379 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse378 (bvmul (_ bv4 32) .cse379))) (or (= .cse0 .cse378) (not (bvslt .cse379 c_~size~0)) (not (bvsge .cse379 (_ bv0 32))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (not (let ((.cse380 (bvmul (_ bv4294967292 32) .cse379))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse380 v_arrayElimIndex_4) (bvadd .cse0 .cse380 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse378 .cse4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse382 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse381 (bvmul (_ bv4 32) .cse382))) (or (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse381 .cse4) (= .cse0 .cse381) (not (bvslt .cse382 c_~size~0)) (not (let ((.cse383 (bvmul (_ bv4294967292 32) .cse382))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse383) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse383)))) (not (bvsge .cse382 (_ bv0 32))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse384 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse386 (bvmul .cse384 (_ bv4 32)))) (or (not (bvsge .cse384 (_ bv0 32))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61))) (not (let ((.cse385 (bvmul (_ bv4294967292 32) .cse384))) (bvule (bvadd .cse385 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse385 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse384 c_~size~0)) (= .cse0 .cse386) (= .cse386 .cse4))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8))) (or (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (let ((.cse388 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse387 (bvmul (_ bv4 32) .cse388))) (or (= .cse387 .cse4) (= .cse0 .cse387) (not (bvslt .cse388 c_~size~0)) (not (let ((.cse389 (bvmul (_ bv4294967292 32) .cse388))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse389) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse389)))) (not (bvsge .cse388 (_ bv0 32))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse393 (concat v_arrayElimCell_53 v_arrayElimCell_56))) (let ((.cse390 (concat (concat .cse393 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse392 (bvmul .cse390 (_ bv4 32)))) (or (not (bvsge .cse390 (_ bv0 32))) (not (let ((.cse391 (bvmul (_ bv4294967292 32) .cse390))) (bvule (bvadd .cse391 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse391 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse390 c_~size~0)) (= .cse0 .cse392) (forall ((v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat .cse393 v_arrayElimCell_60) v_arrayElimCell_50))) (= .cse392 .cse4)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse395 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse394 (bvmul (_ bv4 32) .cse395))) (or (= .cse0 .cse394) (not (bvslt .cse395 c_~size~0)) (not (bvsge .cse395 (_ bv0 32))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_50))) (not (let ((.cse396 (bvmul (_ bv4294967292 32) .cse395))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse396 v_arrayElimIndex_4) (bvadd .cse0 .cse396 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse394 .cse4))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse397 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse399 (bvmul .cse397 (_ bv4 32)))) (or (not (bvsge .cse397 (_ bv0 32))) (not (let ((.cse398 (bvmul (_ bv4294967292 32) .cse397))) (bvule (bvadd .cse398 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse398 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse397 c_~size~0)) (= .cse0 .cse399) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse399 .cse4))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse401 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse400 (bvmul (_ bv4 32) .cse401))) (or (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50))) (= .cse0 .cse400) (not (bvslt .cse401 c_~size~0)) (not (bvsge .cse401 (_ bv0 32))) (not (let ((.cse402 (bvmul (_ bv4294967292 32) .cse401))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse402 v_arrayElimIndex_4) (bvadd .cse0 .cse402 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse400 .cse4))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse403 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse405 (bvmul .cse403 (_ bv4 32)))) (or (not (bvsge .cse403 (_ bv0 32))) (not (let ((.cse404 (bvmul (_ bv4294967292 32) .cse403))) (bvule (bvadd .cse404 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse404 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse403 c_~size~0)) (= .cse0 .cse405) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61))) (= .cse405 .cse4))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse406 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (or (= (bvmul (_ bv4 32) .cse406) .cse4) (forall ((v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) .cse406)) (not (bvslt .cse406 c_~size~0)) (not (let ((.cse407 (bvmul (_ bv4294967292 32) .cse406))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse407) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse407)))) (not (bvsge .cse406 (_ bv0 32)))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse409 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse408 (bvmul (_ bv4 32) .cse409))) (or (= .cse408 .cse4) (= .cse0 .cse408) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_60) v_arrayElimCell_58) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvslt .cse409 c_~size~0)) (not (let ((.cse410 (bvmul (_ bv4294967292 32) .cse409))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse410) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse410)))) (not (bvsge .cse409 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse412 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse411 (bvmul (_ bv4 32) .cse412))) (or (= .cse0 .cse411) (not (bvslt .cse412 c_~size~0)) (not (bvsge .cse412 (_ bv0 32))) (not (let ((.cse413 (bvmul (_ bv4294967292 32) .cse412))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse413 v_arrayElimIndex_4) (bvadd .cse0 .cse413 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse411 .cse4))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse415 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse414 (bvmul (_ bv4 32) .cse415))) (or (= .cse0 .cse414) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_50))) (not (bvslt .cse415 c_~size~0)) (not (bvsge .cse415 (_ bv0 32))) (not (let ((.cse416 (bvmul (_ bv4294967292 32) .cse415))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse416 v_arrayElimIndex_4) (bvadd .cse0 .cse416 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse414 .cse4))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse418 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse417 (bvmul (_ bv4 32) .cse418))) (or (= .cse417 .cse4) (= .cse0 .cse417) (not (bvslt .cse418 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_58))) (not (let ((.cse419 (bvmul (_ bv4294967292 32) .cse418))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse419) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse419)))) (not (bvsge .cse418 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse422 (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59))) (let ((.cse421 (concat .cse422 v_arrayElimCell_61))) (let ((.cse420 (bvmul (_ bv4 32) .cse421))) (or (= .cse420 .cse4) (not (bvsge .cse421 (_ bv0 32))) (forall ((v_arrayElimCell_50 (_ BitVec 8))) (= (concat .cse422 v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse0 .cse420) (not (let ((.cse423 (bvmul (_ bv4294967292 32) .cse421))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse423 v_arrayElimIndex_4) (bvadd .cse0 .cse423 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse421 c_~size~0))))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse425 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse424 (bvmul (_ bv4 32) .cse425))) (or (= .cse424 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvsge .cse425 (_ bv0 32))) (= .cse0 .cse424) (not (let ((.cse426 (bvmul (_ bv4294967292 32) .cse425))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse426 v_arrayElimIndex_4) (bvadd .cse0 .cse426 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse425 c_~size~0)))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse427 (concat v_arrayElimCell_51 v_arrayElimCell_56))) (let ((.cse429 (concat (concat .cse427 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse428 (bvmul (_ bv4 32) .cse429))) (or (forall ((v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse427 v_arrayElimCell_60) v_arrayElimCell_58) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse428 .cse4) (= .cse0 .cse428) (not (bvslt .cse429 c_~size~0)) (not (let ((.cse430 (bvmul (_ bv4294967292 32) .cse429))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse430) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse430)))) (not (bvsge .cse429 (_ bv0 32)))))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse432 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse431 (bvmul (_ bv4 32) .cse432))) (or (= .cse431 .cse4) (= .cse0 .cse431) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50))) (not (bvslt .cse432 c_~size~0)) (not (let ((.cse433 (bvmul (_ bv4294967292 32) .cse432))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse433) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse433)))) (not (bvsge .cse432 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse435 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse434 (bvmul (_ bv4 32) .cse435))) (or (= .cse434 .cse4) (= .cse0 .cse434) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_58) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvslt .cse435 c_~size~0)) (not (let ((.cse436 (bvmul (_ bv4294967292 32) .cse435))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse436) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse436)))) (not (bvsge .cse435 (_ bv0 32))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse440 (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59))) (let ((.cse438 (concat .cse440 v_arrayElimCell_58))) (let ((.cse437 (bvmul (_ bv4 32) .cse438))) (or (= .cse0 .cse437) (not (bvslt .cse438 c_~size~0)) (not (bvsge .cse438 (_ bv0 32))) (not (let ((.cse439 (bvmul (_ bv4294967292 32) .cse438))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse439 v_arrayElimIndex_4) (bvadd .cse0 .cse439 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_50 (_ BitVec 8))) (= (concat .cse440 v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse437 .cse4)))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse441 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse443 (bvmul .cse441 (_ bv4 32)))) (or (not (bvsge .cse441 (_ bv0 32))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (let ((.cse442 (bvmul (_ bv4294967292 32) .cse441))) (bvule (bvadd .cse442 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse442 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse441 c_~size~0)) (= .cse0 .cse443) (= .cse443 .cse4))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse447 (concat v_arrayElimCell_53 v_arrayElimCell_56))) (let ((.cse445 (concat (concat .cse447 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse444 (bvmul (_ bv4 32) .cse445))) (or (= .cse0 .cse444) (not (bvslt .cse445 c_~size~0)) (not (bvsge .cse445 (_ bv0 32))) (not (let ((.cse446 (bvmul (_ bv4294967292 32) .cse445))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse446 v_arrayElimIndex_4) (bvadd .cse0 .cse446 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat .cse447 v_arrayElimCell_60) v_arrayElimCell_50))) (= .cse444 .cse4)))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse449 (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59))) (let ((.cse450 (concat .cse449 v_arrayElimCell_61))) (let ((.cse448 (bvmul (_ bv4 32) .cse450))) (or (= .cse448 .cse4) (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat .cse449 v_arrayElimCell_50))) (not (bvsge .cse450 (_ bv0 32))) (= .cse0 .cse448) (not (let ((.cse451 (bvmul (_ bv4294967292 32) .cse450))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse451 v_arrayElimIndex_4) (bvadd .cse0 .cse451 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse450 c_~size~0))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse453 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse452 (bvmul (_ bv4 32) .cse453))) (or (= .cse0 .cse452) (not (bvslt .cse453 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_58))) (not (bvsge .cse453 (_ bv0 32))) (not (let ((.cse454 (bvmul (_ bv4294967292 32) .cse453))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse454 v_arrayElimIndex_4) (bvadd .cse0 .cse454 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse452 .cse4))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse455 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse457 (bvmul .cse455 (_ bv4 32)))) (or (not (bvsge .cse455 (_ bv0 32))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_61))) (not (let ((.cse456 (bvmul (_ bv4294967292 32) .cse455))) (bvule (bvadd .cse456 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse456 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse455 c_~size~0)) (= .cse0 .cse457) (= .cse457 .cse4))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse459 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse458 (bvmul (_ bv4 32) .cse459))) (or (= .cse0 .cse458) (not (bvslt .cse459 c_~size~0)) (not (bvsge .cse459 (_ bv0 32))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (let ((.cse460 (bvmul (_ bv4294967292 32) .cse459))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse460 v_arrayElimIndex_4) (bvadd .cse0 .cse460 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse458 .cse4))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse461 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (or (not (bvsge .cse461 (_ bv0 32))) (not (let ((.cse462 (bvmul (_ bv4294967292 32) .cse461))) (bvule (bvadd .cse462 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse462 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse461 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61)) (not (bvslt .cse461 c_~size~0)) (= (bvmul .cse461 (_ bv4 32)) .cse4)))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse463 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse465 (bvmul .cse463 (_ bv4 32)))) (or (not (bvsge .cse463 (_ bv0 32))) (not (let ((.cse464 (bvmul (_ bv4294967292 32) .cse463))) (bvule (bvadd .cse464 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse464 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse463 c_~size~0)) (= .cse0 .cse465) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse465 .cse4))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse467 (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59))) (let ((.cse466 (concat .cse467 v_arrayElimCell_61))) (let ((.cse469 (bvmul .cse466 (_ bv4 32)))) (or (not (bvsge .cse466 (_ bv0 32))) (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat .cse467 v_arrayElimCell_50))) (not (let ((.cse468 (bvmul (_ bv4294967292 32) .cse466))) (bvule (bvadd .cse468 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse468 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse466 c_~size~0)) (= .cse0 .cse469) (= .cse469 .cse4)))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse471 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse470 (bvmul (_ bv4 32) .cse471))) (or (= .cse470 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_61))) (not (bvsge .cse471 (_ bv0 32))) (= .cse0 .cse470) (not (let ((.cse472 (bvmul (_ bv4294967292 32) .cse471))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse472 v_arrayElimIndex_4) (bvadd .cse0 .cse472 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse471 c_~size~0)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse474 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse473 (bvmul (_ bv4 32) .cse474))) (or (= .cse0 .cse473) (not (bvslt .cse474 c_~size~0)) (not (bvsge .cse474 (_ bv0 32))) (not (let ((.cse475 (bvmul (_ bv4294967292 32) .cse474))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse475 v_arrayElimIndex_4) (bvadd .cse0 .cse475 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse473 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8))) (or (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (let ((.cse477 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse476 (bvmul (_ bv4 32) .cse477))) (or (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61))) (= .cse476 .cse4) (= .cse0 .cse476) (not (bvslt .cse477 c_~size~0)) (not (let ((.cse478 (bvmul (_ bv4294967292 32) .cse477))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse478) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse478)))) (not (bvsge .cse477 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse482 (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59))) (let ((.cse479 (concat .cse482 v_arrayElimCell_61))) (let ((.cse481 (bvmul .cse479 (_ bv4 32)))) (or (not (bvsge .cse479 (_ bv0 32))) (not (let ((.cse480 (bvmul (_ bv4294967292 32) .cse479))) (bvule (bvadd .cse480 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse480 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse479 c_~size~0)) (= .cse0 .cse481) (forall ((v_arrayElimCell_50 (_ BitVec 8))) (= (concat .cse482 v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse481 .cse4)))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse483 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse485 (bvmul .cse483 (_ bv4 32)))) (or (not (bvsge .cse483 (_ bv0 32))) (not (let ((.cse484 (bvmul (_ bv4294967292 32) .cse483))) (bvule (bvadd .cse484 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse484 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse483 c_~size~0)) (= .cse0 .cse485) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50))) (= .cse485 .cse4))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse487 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse486 (bvmul (_ bv4 32) .cse487))) (or (= .cse486 .cse4) (= .cse0 .cse486) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_50))) (not (bvslt .cse487 c_~size~0)) (not (let ((.cse488 (bvmul (_ bv4294967292 32) .cse487))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse488) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse488)))) (not (bvsge .cse487 (_ bv0 32))))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse490 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse489 (bvmul (_ bv4 32) .cse490))) (or (= .cse489 .cse4) (not (bvsge .cse490 (_ bv0 32))) (= .cse0 .cse489) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_61))) (not (let ((.cse491 (bvmul (_ bv4294967292 32) .cse490))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse491 v_arrayElimIndex_4) (bvadd .cse0 .cse491 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse490 c_~size~0)))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse492 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (or (not (bvslt .cse492 c_~size~0)) (not (bvsge .cse492 (_ bv0 32))) (not (let ((.cse493 (bvmul (_ bv4294967292 32) .cse492))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse493 v_arrayElimIndex_4) (bvadd .cse0 .cse493 (_ bv3 32) v_arrayElimIndex_4)))) (= (bvmul (_ bv4 32) .cse492) .cse4) (forall ((v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) .cse492))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse494 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (or (= (bvmul (_ bv4 32) .cse494) .cse4) (forall ((v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) .cse494)) (not (bvsge .cse494 (_ bv0 32))) (not (let ((.cse495 (bvmul (_ bv4294967292 32) .cse494))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse495 v_arrayElimIndex_4) (bvadd .cse0 .cse495 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse494 c_~size~0))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse497 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse496 (bvmul (_ bv4 32) .cse497))) (or (= .cse496 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvsge .cse497 (_ bv0 32))) (= .cse0 .cse496) (not (let ((.cse498 (bvmul (_ bv4294967292 32) .cse497))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse498 v_arrayElimIndex_4) (bvadd .cse0 .cse498 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse497 c_~size~0)))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse499 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse501 (bvmul .cse499 (_ bv4 32)))) (or (not (bvsge .cse499 (_ bv0 32))) (not (let ((.cse500 (bvmul (_ bv4294967292 32) .cse499))) (bvule (bvadd .cse500 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse500 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse499 c_~size~0)) (= .cse0 .cse501) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_61))) (= .cse501 .cse4))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse503 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse502 (bvmul (_ bv4 32) .cse503))) (or (= .cse502 .cse4) (not (bvsge .cse503 (_ bv0 32))) (= .cse0 .cse502) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50))) (not (let ((.cse504 (bvmul (_ bv4294967292 32) .cse503))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse504 v_arrayElimIndex_4) (bvadd .cse0 .cse504 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse503 c_~size~0)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse506 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse505 (bvmul (_ bv4 32) .cse506))) (or (= .cse505 .cse4) (not (bvsge .cse506 (_ bv0 32))) (= .cse0 .cse505) (not (let ((.cse507 (bvmul (_ bv4294967292 32) .cse506))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse507 v_arrayElimIndex_4) (bvadd .cse0 .cse507 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse506 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50))))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (let ((.cse510 (concat v_arrayElimCell_51 v_arrayElimCell_56))) (let ((.cse509 (concat (concat .cse510 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse508 (bvmul (_ bv4 32) .cse509))) (or (= .cse508 .cse4) (= .cse0 .cse508) (not (bvslt .cse509 c_~size~0)) (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat .cse510 v_arrayElimCell_60) v_arrayElimCell_50))) (not (let ((.cse511 (bvmul (_ bv4294967292 32) .cse509))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse511) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse511)))) (not (bvsge .cse509 (_ bv0 32)))))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse513 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse512 (bvmul (_ bv4 32) .cse513))) (or (= .cse512 .cse4) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_50))) (not (bvsge .cse513 (_ bv0 32))) (= .cse0 .cse512) (not (let ((.cse514 (bvmul (_ bv4294967292 32) .cse513))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse514 v_arrayElimIndex_4) (bvadd .cse0 .cse514 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse513 c_~size~0)))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse516 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse515 (bvmul (_ bv4 32) .cse516))) (or (= .cse515 .cse4) (= .cse0 .cse515) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvslt .cse516 c_~size~0)) (not (let ((.cse517 (bvmul (_ bv4294967292 32) .cse516))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse517) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse517)))) (not (bvsge .cse516 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse519 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse518 (bvmul (_ bv4 32) .cse519))) (or (= .cse518 .cse4) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_50))) (not (bvsge .cse519 (_ bv0 32))) (= .cse0 .cse518) (not (let ((.cse520 (bvmul (_ bv4294967292 32) .cse519))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse520 v_arrayElimIndex_4) (bvadd .cse0 .cse520 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse519 c_~size~0)))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse523 (concat v_arrayElimCell_51 v_arrayElimCell_56))) (let ((.cse522 (concat (concat .cse523 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse521 (bvmul (_ bv4 32) .cse522))) (or (= .cse521 .cse4) (not (bvsge .cse522 (_ bv0 32))) (= .cse0 .cse521) (forall ((v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat .cse523 v_arrayElimCell_60) v_arrayElimCell_50))) (not (let ((.cse524 (bvmul (_ bv4294967292 32) .cse522))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse524 v_arrayElimIndex_4) (bvadd .cse0 .cse524 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse522 c_~size~0))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse526 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse525 (bvmul (_ bv4 32) .cse526))) (or (= .cse0 .cse525) (not (bvslt .cse526 c_~size~0)) (not (bvsge .cse526 (_ bv0 32))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50))) (not (let ((.cse527 (bvmul (_ bv4294967292 32) .cse526))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse527 v_arrayElimIndex_4) (bvadd .cse0 .cse527 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse525 .cse4))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse529 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse528 (bvmul (_ bv4 32) .cse529))) (or (= .cse528 .cse4) (= .cse0 .cse528) (not (bvslt .cse529 c_~size~0)) (not (let ((.cse530 (bvmul (_ bv4294967292 32) .cse529))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse530) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse530)))) (not (bvsge .cse529 (_ bv0 32))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_58) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse532 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse531 (bvmul (_ bv4 32) .cse532))) (or (= .cse0 .cse531) (not (bvslt .cse532 c_~size~0)) (not (bvsge .cse532 (_ bv0 32))) (not (let ((.cse533 (bvmul (_ bv4294967292 32) .cse532))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse533 v_arrayElimIndex_4) (bvadd .cse0 .cse533 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_58))) (= .cse531 .cse4))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse534 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse536 (bvmul .cse534 (_ bv4 32)))) (or (not (bvsge .cse534 (_ bv0 32))) (not (let ((.cse535 (bvmul (_ bv4294967292 32) .cse534))) (bvule (bvadd .cse535 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse535 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse534 c_~size~0)) (= .cse0 .cse536) (= .cse536 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50))))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse538 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse537 (bvmul (_ bv4 32) .cse538))) (or (= .cse537 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61))) (not (bvsge .cse538 (_ bv0 32))) (= .cse0 .cse537) (not (let ((.cse539 (bvmul (_ bv4294967292 32) .cse538))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse539 v_arrayElimIndex_4) (bvadd .cse0 .cse539 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse538 c_~size~0)))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse541 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse540 (bvmul (_ bv4 32) .cse541))) (or (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_58) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse540 .cse4) (= .cse0 .cse540) (not (bvslt .cse541 c_~size~0)) (not (let ((.cse542 (bvmul (_ bv4294967292 32) .cse541))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse542) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse542)))) (not (bvsge .cse541 (_ bv0 32))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse543 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse545 (bvmul .cse543 (_ bv4 32)))) (or (not (bvsge .cse543 (_ bv0 32))) (not (let ((.cse544 (bvmul (_ bv4294967292 32) .cse543))) (bvule (bvadd .cse544 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse544 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse543 c_~size~0)) (= .cse0 .cse545) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse545 .cse4))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse547 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse546 (bvmul (_ bv4 32) .cse547))) (or (= .cse0 .cse546) (not (bvslt .cse547 c_~size~0)) (not (bvsge .cse547 (_ bv0 32))) (not (let ((.cse548 (bvmul (_ bv4294967292 32) .cse547))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse548 v_arrayElimIndex_4) (bvadd .cse0 .cse548 (_ bv3 32) v_arrayElimIndex_4)))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_58) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61))) (= .cse546 .cse4))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse549 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse551 (bvmul .cse549 (_ bv4 32)))) (or (not (bvsge .cse549 (_ bv0 32))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_60) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (let ((.cse550 (bvmul (_ bv4294967292 32) .cse549))) (bvule (bvadd .cse550 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse550 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse549 c_~size~0)) (= .cse0 .cse551) (= .cse551 .cse4))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse552 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse554 (bvmul .cse552 (_ bv4 32)))) (or (not (bvsge .cse552 (_ bv0 32))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_50))) (not (let ((.cse553 (bvmul (_ bv4294967292 32) .cse552))) (bvule (bvadd .cse553 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse553 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse552 c_~size~0)) (= .cse0 .cse554) (= .cse554 .cse4))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse556 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse555 (bvmul (_ bv4 32) .cse556))) (or (= .cse555 .cse4) (= .cse0 .cse555) (not (bvslt .cse556 c_~size~0)) (not (let ((.cse557 (bvmul (_ bv4294967292 32) .cse556))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse557) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse557)))) (forall ((v_arrayElimCell_54 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_58))) (not (bvsge .cse556 (_ bv0 32))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse558 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse560 (bvmul .cse558 (_ bv4 32)))) (or (not (bvsge .cse558 (_ bv0 32))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_50))) (not (let ((.cse559 (bvmul (_ bv4294967292 32) .cse558))) (bvule (bvadd .cse559 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse559 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse558 c_~size~0)) (= .cse0 .cse560) (= .cse560 .cse4))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse562 (concat v_arrayElimCell_51 v_arrayElimCell_56))) (let ((.cse563 (concat (concat .cse562 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse561 (bvmul (_ bv4 32) .cse563))) (or (= .cse561 .cse4) (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat .cse562 v_arrayElimCell_60) v_arrayElimCell_50))) (not (bvsge .cse563 (_ bv0 32))) (= .cse0 .cse561) (not (let ((.cse564 (bvmul (_ bv4294967292 32) .cse563))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse564 v_arrayElimIndex_4) (bvadd .cse0 .cse564 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse563 c_~size~0))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse566 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse565 (bvmul (_ bv4 32) .cse566))) (or (= .cse565 .cse4) (= .cse0 .cse565) (not (bvslt .cse566 c_~size~0)) (not (let ((.cse567 (bvmul (_ bv4294967292 32) .cse566))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse567) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse567)))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvsge .cse566 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse568 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse570 (bvmul .cse568 (_ bv4 32)))) (or (not (bvsge .cse568 (_ bv0 32))) (not (let ((.cse569 (bvmul (_ bv4294967292 32) .cse568))) (bvule (bvadd .cse569 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse569 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse568 c_~size~0)) (= .cse0 .cse570) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse570 .cse4))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse572 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse571 (bvmul (_ bv4 32) .cse572))) (or (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse0 .cse571) (not (bvslt .cse572 c_~size~0)) (not (bvsge .cse572 (_ bv0 32))) (not (let ((.cse573 (bvmul (_ bv4294967292 32) .cse572))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse573 v_arrayElimIndex_4) (bvadd .cse0 .cse573 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse571 .cse4))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse577 (concat v_arrayElimCell_53 v_arrayElimCell_56))) (let ((.cse574 (concat (concat .cse577 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse576 (bvmul .cse574 (_ bv4 32)))) (or (not (bvsge .cse574 (_ bv0 32))) (not (let ((.cse575 (bvmul (_ bv4294967292 32) .cse574))) (bvule (bvadd .cse575 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse575 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse574 c_~size~0)) (= .cse0 .cse576) (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat .cse577 v_arrayElimCell_60) v_arrayElimCell_50))) (= .cse576 .cse4)))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse580 (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59))) (let ((.cse579 (concat .cse580 v_arrayElimCell_58))) (let ((.cse578 (bvmul (_ bv4 32) .cse579))) (or (= .cse578 .cse4) (= .cse0 .cse578) (not (bvslt .cse579 c_~size~0)) (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat .cse580 v_arrayElimCell_50))) (not (let ((.cse581 (bvmul (_ bv4294967292 32) .cse579))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse581) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse581)))) (not (bvsge .cse579 (_ bv0 32)))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse583 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse582 (bvmul (_ bv4 32) .cse583))) (or (= .cse0 .cse582) (not (bvslt .cse583 c_~size~0)) (not (bvsge .cse583 (_ bv0 32))) (not (let ((.cse584 (bvmul (_ bv4294967292 32) .cse583))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse584 v_arrayElimIndex_4) (bvadd .cse0 .cse584 (_ bv3 32) v_arrayElimIndex_4)))) (= .cse582 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_58))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse586 (concat v_arrayElimCell_51 v_arrayElimCell_56))) (let ((.cse587 (concat (concat .cse586 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse585 (bvmul (_ bv4 32) .cse587))) (or (= .cse585 .cse4) (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse586 v_arrayElimCell_60) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61))) (not (bvsge .cse587 (_ bv0 32))) (= .cse0 .cse585) (not (let ((.cse588 (bvmul (_ bv4294967292 32) .cse587))) (bvule (bvadd (_ bv4294967295 32) .cse0 .cse588 v_arrayElimIndex_4) (bvadd .cse0 .cse588 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse587 c_~size~0))))))))) (forall ((v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse590 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse589 (bvmul (_ bv4 32) .cse590))) (or (= .cse589 .cse4) (= .cse0 .cse589) (not (bvslt .cse590 c_~size~0)) (not (let ((.cse591 (bvmul (_ bv4294967292 32) .cse590))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse591) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse591)))) (not (bvsge .cse590 (_ bv0 32))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_58))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_56 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse592 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_56) v_arrayElimCell_59) v_arrayElimCell_61))) (or (not (bvsge .cse592 (_ bv0 32))) (forall ((v_arrayElimCell_57 (_ BitVec 8))) (= .cse592 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61))) (not (let ((.cse593 (bvmul (_ bv4294967292 32) .cse592))) (bvule (bvadd .cse593 (_ bv4294967295 32) .cse0 v_arrayElimIndex_4) (bvadd .cse593 .cse0 (_ bv3 32) v_arrayElimIndex_4)))) (not (bvslt .cse592 c_~size~0)) (= (bvmul .cse592 (_ bv4 32)) .cse4)))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse595 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse596 (bvmul (_ bv4 32) .cse595))) (or (not (let ((.cse594 (bvmul (_ bv4294967292 32) .cse595))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse594) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse594)))) (= .cse0 .cse596) (= .cse596 .cse4) (not (bvslt .cse595 c_~size~0)) (not (bvsge .cse595 (_ bv0 32))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_60) v_arrayElimCell_50) .cse595)))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse600 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse598 (concat (concat .cse600 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse599 (bvmul (_ bv4 32) .cse598))) (or (not (let ((.cse597 (bvmul (_ bv4294967292 32) .cse598))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse597) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse597)))) (= .cse0 .cse599) (forall ((v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse600 v_arrayElimCell_60) v_arrayElimCell_50) .cse598)) (= .cse599 .cse4) (not (bvslt .cse598 c_~size~0)) (not (bvsge .cse598 (_ bv0 32)))))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse602 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse603 (bvmul (_ bv4 32) .cse602))) (or (not (let ((.cse601 (bvmul (_ bv4294967292 32) .cse602))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse601) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse601)))) (= .cse0 .cse603) (= .cse603 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_61) .cse602)) (not (bvslt .cse602 c_~size~0)) (not (bvsge .cse602 (_ bv0 32))))))))) (or .cse9 (and (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse607 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse605 (concat (concat .cse607 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse606 (bvmul (_ bv4 32) .cse605))) (or (not (let ((.cse604 (bvmul (_ bv4294967292 32) .cse605))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse604) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse604)))) (= .cse0 .cse606) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse607 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50))) (= .cse606 .cse4) (not (bvslt .cse605 c_~size~0)) (not (bvsge .cse605 (_ bv0 32)))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse608 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse610 (concat (concat .cse608 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse611 (bvmul (_ bv4 32) .cse610))) (or (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse608 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat .cse608 v_arrayElimCell_60) v_arrayElimCell_50))) (not (let ((.cse609 (bvmul (_ bv4294967292 32) .cse610))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse609) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse609)))) (= .cse0 .cse611) (= .cse611 .cse4) (not (bvslt .cse610 c_~size~0)) (not (bvsge .cse610 (_ bv0 32)))))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse615 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse613 (concat (concat .cse615 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse614 (bvmul (_ bv4 32) .cse613))) (or (not (let ((.cse612 (bvmul (_ bv4294967292 32) .cse613))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse612) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse612)))) (= .cse0 .cse614) (= .cse614 .cse4) (not (bvslt .cse613 c_~size~0)) (not (bvsge .cse613 (_ bv0 32))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse615 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50)))))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse619 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse617 (concat (concat .cse619 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse618 (bvmul (_ bv4 32) .cse617))) (or (not (let ((.cse616 (bvmul (_ bv4294967292 32) .cse617))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse616) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse616)))) (= .cse0 .cse618) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse619 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_60) v_arrayElimCell_50))) (= .cse618 .cse4) (not (bvslt .cse617 c_~size~0)) (not (bvsge .cse617 (_ bv0 32)))))))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse620 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse622 (bvmul (_ bv4 32) .cse620))) (or (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50) .cse620)) (not (let ((.cse621 (bvmul (_ bv4294967292 32) .cse620))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse621) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse621)))) (= .cse0 .cse622) (= .cse622 .cse4) (not (bvslt .cse620 c_~size~0)) (not (bvsge .cse620 (_ bv0 32))))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse623 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse625 (bvmul (_ bv4 32) .cse623))) (or (forall ((v_arrayElimCell_55 (_ BitVec 8))) (= .cse623 (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (let ((.cse624 (bvmul (_ bv4294967292 32) .cse623))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse624) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse624)))) (= .cse0 .cse625) (= .cse625 .cse4) (not (bvslt .cse623 c_~size~0)) (not (bvsge .cse623 (_ bv0 32))))))))) (or (and (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse628 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse627 (concat (concat .cse628 v_arrayElimCell_59) v_arrayElimCell_61))) (or (not (let ((.cse626 (bvmul (_ bv4294967292 32) .cse627))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse626) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse626)))) (forall ((v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat .cse628 v_arrayElimCell_57) v_arrayElimCell_61) .cse627)) (= (bvmul (_ bv4 32) .cse627) .cse4) (not (bvslt .cse627 c_~size~0)) (not (bvsge .cse627 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse632 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse630 (concat (concat .cse632 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse631 (bvmul (_ bv4 32) .cse630))) (or (not (let ((.cse629 (bvmul (_ bv4294967292 32) .cse630))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse629) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse629)))) (= .cse0 .cse631) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat .cse632 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse631 .cse4) (not (bvslt .cse630 c_~size~0)) (not (bvsge .cse630 (_ bv0 32)))))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse636 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse634 (concat (concat .cse636 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse635 (bvmul (_ bv4 32) .cse634))) (or (not (let ((.cse633 (bvmul (_ bv4294967292 32) .cse634))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse633) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse633)))) (= .cse0 .cse635) (= .cse635 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat .cse636 v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvslt .cse634 c_~size~0)) (not (bvsge .cse634 (_ bv0 32)))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse637 (concat v_arrayElimCell_51 v_arrayElimCell_52))) (let ((.cse639 (concat (concat .cse637 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse640 (bvmul (_ bv4 32) .cse639))) (or (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat .cse637 v_arrayElimCell_57) v_arrayElimCell_61))) (not (let ((.cse638 (bvmul (_ bv4294967292 32) .cse639))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse638) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse638)))) (= .cse0 .cse640) (= .cse640 .cse4) (not (bvslt .cse639 c_~size~0)) (not (bvsge .cse639 (_ bv0 32))))))))))) .cse9) (or .cse9 (and (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse643 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse641 (bvmul (_ bv4 32) .cse643))) (or (= .cse641 .cse4) (not (let ((.cse642 (bvmul (_ bv4294967292 32) .cse643))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse642) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse642)))) (= .cse0 .cse641) (not (bvslt .cse643 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61))) (not (bvsge .cse643 (_ bv0 32))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse646 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse644 (bvmul (_ bv4 32) .cse646))) (or (= .cse644 .cse4) (not (let ((.cse645 (bvmul (_ bv4294967292 32) .cse646))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse645) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse645)))) (= .cse0 .cse644) (not (bvslt .cse646 c_~size~0)) (not (bvsge .cse646 (_ bv0 32))) (forall ((v_arrayElimCell_54 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_61))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse650 (concat v_arrayElimCell_53 v_arrayElimCell_52))) (let ((.cse649 (concat (concat .cse650 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse647 (bvmul (_ bv4 32) .cse649))) (or (= .cse647 .cse4) (not (let ((.cse648 (bvmul (_ bv4294967292 32) .cse649))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse648) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse648)))) (= .cse0 .cse647) (forall ((v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat .cse650 v_arrayElimCell_60) v_arrayElimCell_50))) (not (bvslt .cse649 c_~size~0)) (not (bvsge .cse649 (_ bv0 32)))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse653 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse651 (bvmul (_ bv4 32) .cse653))) (or (= .cse651 .cse4) (not (let ((.cse652 (bvmul (_ bv4294967292 32) .cse653))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse652) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse652)))) (= .cse0 .cse651) (not (bvslt .cse653 c_~size~0)) (not (bvsge .cse653 (_ bv0 32))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse656 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse654 (bvmul (_ bv4 32) .cse656))) (or (= .cse654 .cse4) (not (let ((.cse655 (bvmul (_ bv4294967292 32) .cse656))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse655) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse655)))) (= .cse0 .cse654) (not (bvslt .cse656 c_~size~0)) (not (bvsge .cse656 (_ bv0 32))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_50))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse660 (concat v_arrayElimCell_53 v_arrayElimCell_52))) (let ((.cse659 (concat (concat .cse660 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse657 (bvmul (_ bv4 32) .cse659))) (or (= .cse657 .cse4) (not (let ((.cse658 (bvmul (_ bv4294967292 32) .cse659))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse658) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse658)))) (= .cse0 .cse657) (not (bvslt .cse659 c_~size~0)) (not (bvsge .cse659 (_ bv0 32))) (forall ((v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat .cse660 v_arrayElimCell_60) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61)))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse663 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse661 (bvmul (_ bv4 32) .cse663))) (or (= .cse661 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (let ((.cse662 (bvmul (_ bv4294967292 32) .cse663))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse662) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse662)))) (= .cse0 .cse661) (not (bvslt .cse663 c_~size~0)) (not (bvsge .cse663 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse666 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse664 (bvmul (_ bv4 32) .cse666))) (or (= .cse664 .cse4) (not (let ((.cse665 (bvmul (_ bv4294967292 32) .cse666))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse665) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse665)))) (= .cse0 .cse664) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvslt .cse666 c_~size~0)) (not (bvsge .cse666 (_ bv0 32))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse667 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse668 (bvmul (_ bv4 32) .cse667))) (or (not (bvsge .cse667 (_ bv0 32))) (= .cse668 .cse4) (= .cse0 .cse668) (not (bvslt .cse667 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_58) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (let ((.cse669 (bvmul (_ bv4294967292 32) .cse667))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse669) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse669)))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse670 (concat v_arrayElimCell_53 v_arrayElimCell_52))) (let ((.cse673 (concat (concat .cse670 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse671 (bvmul (_ bv4 32) .cse673))) (or (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat .cse670 v_arrayElimCell_60) v_arrayElimCell_61))) (= .cse671 .cse4) (not (let ((.cse672 (bvmul (_ bv4294967292 32) .cse673))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse672) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse672)))) (= .cse0 .cse671) (not (bvslt .cse673 c_~size~0)) (not (bvsge .cse673 (_ bv0 32)))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse676 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse674 (bvmul (_ bv4 32) .cse676))) (or (= .cse674 .cse4) (not (let ((.cse675 (bvmul (_ bv4294967292 32) .cse676))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse675) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse675)))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_60) v_arrayElimCell_61))) (= .cse0 .cse674) (not (bvslt .cse676 c_~size~0)) (not (bvsge .cse676 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse677 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse678 (bvmul (_ bv4 32) .cse677))) (or (not (bvsge .cse677 (_ bv0 32))) (= .cse678 .cse4) (= .cse0 .cse678) (not (bvslt .cse677 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_58) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61))) (not (let ((.cse679 (bvmul (_ bv4294967292 32) .cse677))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse679) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse679)))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse680 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (or (not (bvsge .cse680 (_ bv0 32))) (= (bvmul (_ bv4 32) .cse680) .cse4) (not (bvslt .cse680 c_~size~0)) (not (let ((.cse681 (bvmul (_ bv4294967292 32) .cse680))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse681) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse681)))) (= .cse680 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse682 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse683 (bvmul (_ bv4 32) .cse682))) (or (not (bvsge .cse682 (_ bv0 32))) (= .cse683 .cse4) (= .cse0 .cse683) (not (bvslt .cse682 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_58) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (let ((.cse684 (bvmul (_ bv4294967292 32) .cse682))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse684) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse684)))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse685 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse686 (bvmul (_ bv4 32) .cse685))) (or (not (bvsge .cse685 (_ bv0 32))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (= .cse686 .cse4) (= .cse0 .cse686) (not (bvslt .cse685 c_~size~0)) (not (let ((.cse687 (bvmul (_ bv4294967292 32) .cse685))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse687) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse687)))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse690 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse688 (bvmul (_ bv4 32) .cse690))) (or (= .cse688 .cse4) (not (let ((.cse689 (bvmul (_ bv4294967292 32) .cse690))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse689) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse689)))) (= .cse0 .cse688) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50))) (not (bvslt .cse690 c_~size~0)) (not (bvsge .cse690 (_ bv0 32))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse691 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse692 (bvmul (_ bv4 32) .cse691))) (or (not (bvsge .cse691 (_ bv0 32))) (= .cse692 .cse4) (= .cse0 .cse692) (not (bvslt .cse691 c_~size~0)) (not (let ((.cse693 (bvmul (_ bv4294967292 32) .cse691))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse693) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse693)))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse696 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse694 (bvmul (_ bv4 32) .cse696))) (or (= .cse694 .cse4) (not (let ((.cse695 (bvmul (_ bv4294967292 32) .cse696))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse695) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse695)))) (= .cse0 .cse694) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvslt .cse696 c_~size~0)) (not (bvsge .cse696 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse697 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse698 (bvmul (_ bv4 32) .cse697))) (or (not (bvsge .cse697 (_ bv0 32))) (= .cse698 .cse4) (= .cse0 .cse698) (not (bvslt .cse697 c_~size~0)) (not (let ((.cse699 (bvmul (_ bv4294967292 32) .cse697))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse699) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse699)))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse700 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse701 (bvmul (_ bv4 32) .cse700))) (or (not (bvsge .cse700 (_ bv0 32))) (= .cse701 .cse4) (= .cse0 .cse701) (not (bvslt .cse700 c_~size~0)) (not (let ((.cse702 (bvmul (_ bv4294967292 32) .cse700))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse702) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse702)))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_50))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse703 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse704 (bvmul (_ bv4 32) .cse703))) (or (not (bvsge .cse703 (_ bv0 32))) (= .cse704 .cse4) (= .cse0 .cse704) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_58))) (not (bvslt .cse703 c_~size~0)) (not (let ((.cse705 (bvmul (_ bv4294967292 32) .cse703))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse705) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse705)))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse706 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse707 (bvmul (_ bv4 32) .cse706))) (or (not (bvsge .cse706 (_ bv0 32))) (= .cse707 .cse4) (= .cse0 .cse707) (not (bvslt .cse706 c_~size~0)) (not (let ((.cse708 (bvmul (_ bv4294967292 32) .cse706))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse708) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse708)))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_58))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse711 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse709 (bvmul (_ bv4 32) .cse711))) (or (= .cse709 .cse4) (not (let ((.cse710 (bvmul (_ bv4294967292 32) .cse711))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse710) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse710)))) (= .cse0 .cse709) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_50))) (not (bvslt .cse711 c_~size~0)) (not (bvsge .cse711 (_ bv0 32))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse712 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse713 (bvmul (_ bv4 32) .cse712))) (or (not (bvsge .cse712 (_ bv0 32))) (= .cse713 .cse4) (= .cse0 .cse713) (not (bvslt .cse712 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_58))) (not (let ((.cse714 (bvmul (_ bv4294967292 32) .cse712))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse714) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse714)))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse716 (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59))) (let ((.cse715 (concat .cse716 v_arrayElimCell_58))) (let ((.cse717 (bvmul (_ bv4 32) .cse715))) (or (not (bvsge .cse715 (_ bv0 32))) (forall ((v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat .cse716 v_arrayElimCell_50))) (= .cse717 .cse4) (= .cse0 .cse717) (not (bvslt .cse715 c_~size~0)) (not (let ((.cse718 (bvmul (_ bv4294967292 32) .cse715))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse718) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse718))))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse721 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse719 (bvmul (_ bv4 32) .cse721))) (or (= .cse719 .cse4) (not (let ((.cse720 (bvmul (_ bv4294967292 32) .cse721))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse720) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse720)))) (= .cse0 .cse719) (not (bvslt .cse721 c_~size~0)) (not (bvsge .cse721 (_ bv0 32))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse724 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse722 (bvmul (_ bv4 32) .cse724))) (or (= .cse722 .cse4) (not (let ((.cse723 (bvmul (_ bv4294967292 32) .cse724))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse723) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse723)))) (= .cse0 .cse722) (not (bvslt .cse724 c_~size~0)) (not (bvsge .cse724 (_ bv0 32))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse727 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse725 (bvmul (_ bv4 32) .cse727))) (or (= .cse725 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_61))) (not (let ((.cse726 (bvmul (_ bv4294967292 32) .cse727))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse726) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse726)))) (= .cse0 .cse725) (not (bvslt .cse727 c_~size~0)) (not (bvsge .cse727 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse728 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse729 (bvmul (_ bv4 32) .cse728))) (or (not (bvsge .cse728 (_ bv0 32))) (= .cse729 .cse4) (= .cse0 .cse729) (not (bvslt .cse728 c_~size~0)) (not (let ((.cse730 (bvmul (_ bv4294967292 32) .cse728))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse730) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse730)))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse731 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (or (= (bvmul (_ bv4 32) .cse731) .cse4) (not (let ((.cse732 (bvmul (_ bv4294967292 32) .cse731))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse732) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse732)))) (forall ((v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) .cse731)) (not (bvslt .cse731 c_~size~0)) (not (bvsge .cse731 (_ bv0 32)))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse735 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse733 (bvmul (_ bv4 32) .cse735))) (or (= .cse733 .cse4) (not (let ((.cse734 (bvmul (_ bv4294967292 32) .cse735))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse734) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse734)))) (= .cse0 .cse733) (not (bvslt .cse735 c_~size~0)) (not (bvsge .cse735 (_ bv0 32))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_61))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse736 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse737 (bvmul (_ bv4 32) .cse736))) (or (not (bvsge .cse736 (_ bv0 32))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50))) (= .cse737 .cse4) (= .cse0 .cse737) (not (bvslt .cse736 c_~size~0)) (not (let ((.cse738 (bvmul (_ bv4294967292 32) .cse736))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse738) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse738)))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse739 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse740 (bvmul (_ bv4 32) .cse739))) (or (not (bvsge .cse739 (_ bv0 32))) (= .cse740 .cse4) (= .cse0 .cse740) (not (bvslt .cse739 c_~size~0)) (not (let ((.cse741 (bvmul (_ bv4294967292 32) .cse739))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse741) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse741)))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8))) (or (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse742 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse743 (bvmul (_ bv4 32) .cse742))) (or (not (bvsge .cse742 (_ bv0 32))) (= .cse743 .cse4) (= .cse0 .cse743) (not (bvslt .cse742 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50))) (not (let ((.cse744 (bvmul (_ bv4294967292 32) .cse742))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse744) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse744)))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_52 (_ BitVec 8))) (or (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_60) v_arrayElimCell_50))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32))) (let ((.cse745 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse746 (bvmul (_ bv4 32) .cse745))) (or (not (bvsge .cse745 (_ bv0 32))) (= .cse746 .cse4) (= .cse0 .cse746) (not (bvslt .cse745 c_~size~0)) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (not (let ((.cse747 (bvmul (_ bv4294967292 32) .cse745))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse747) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse747)))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse748 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (or (= (bvmul (_ bv4 32) .cse748) .cse4) (not (let ((.cse749 (bvmul (_ bv4294967292 32) .cse748))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse749) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse749)))) (not (bvslt .cse748 c_~size~0)) (not (bvsge .cse748 (_ bv0 32))) (= .cse748 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse752 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse750 (bvmul (_ bv4 32) .cse752))) (or (= .cse750 .cse4) (not (let ((.cse751 (bvmul (_ bv4294967292 32) .cse752))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse751) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse751)))) (= .cse0 .cse750) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvslt .cse752 c_~size~0)) (not (bvsge .cse752 (_ bv0 32))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse755 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse753 (bvmul (_ bv4 32) .cse755))) (or (= .cse753 .cse4) (not (let ((.cse754 (bvmul (_ bv4294967292 32) .cse755))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse754) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse754)))) (= .cse0 .cse753) (not (bvslt .cse755 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvsge .cse755 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse756 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse757 (bvmul (_ bv4 32) .cse756))) (or (not (bvsge .cse756 (_ bv0 32))) (= .cse757 .cse4) (= .cse0 .cse757) (not (bvslt .cse756 c_~size~0)) (not (let ((.cse758 (bvmul (_ bv4294967292 32) .cse756))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse758) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse758)))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_60) v_arrayElimCell_58))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse761 (concat v_arrayElimCell_53 v_arrayElimCell_52))) (let ((.cse759 (concat (concat .cse761 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse760 (bvmul (_ bv4 32) .cse759))) (or (not (bvsge .cse759 (_ bv0 32))) (= .cse760 .cse4) (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat .cse761 v_arrayElimCell_60) v_arrayElimCell_58))) (= .cse0 .cse760) (not (bvslt .cse759 c_~size~0)) (not (let ((.cse762 (bvmul (_ bv4294967292 32) .cse759))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse762) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse762))))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse763 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse764 (bvmul (_ bv4 32) .cse763))) (or (not (bvsge .cse763 (_ bv0 32))) (= .cse764 .cse4) (= .cse0 .cse764) (not (bvslt .cse763 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50))) (not (let ((.cse765 (bvmul (_ bv4294967292 32) .cse763))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse765) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse765)))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse769 (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59))) (let ((.cse768 (concat .cse769 v_arrayElimCell_61))) (let ((.cse766 (bvmul (_ bv4 32) .cse768))) (or (= .cse766 .cse4) (not (let ((.cse767 (bvmul (_ bv4294967292 32) .cse768))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse767) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse767)))) (= .cse0 .cse766) (not (bvslt .cse768 c_~size~0)) (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat .cse769 v_arrayElimCell_50))) (not (bvsge .cse768 (_ bv0 32)))))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8))) (or (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse773 (concat v_arrayElimCell_53 v_arrayElimCell_52))) (let ((.cse770 (concat (concat .cse773 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse771 (bvmul (_ bv4 32) .cse770))) (or (not (bvsge .cse770 (_ bv0 32))) (= .cse771 .cse4) (= .cse0 .cse771) (not (bvslt .cse770 c_~size~0)) (not (let ((.cse772 (bvmul (_ bv4294967292 32) .cse770))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse772) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse772)))) (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat .cse773 v_arrayElimCell_60) v_arrayElimCell_50)))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse776 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse774 (bvmul (_ bv4 32) .cse776))) (or (= .cse774 .cse4) (not (let ((.cse775 (bvmul (_ bv4294967292 32) .cse776))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse775) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse775)))) (= .cse0 .cse774) (not (bvslt .cse776 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvsge .cse776 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse779 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse777 (bvmul (_ bv4 32) .cse779))) (or (= .cse777 .cse4) (not (let ((.cse778 (bvmul (_ bv4294967292 32) .cse779))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse778) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse778)))) (= .cse0 .cse777) (not (bvslt .cse779 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50))) (not (bvsge .cse779 (_ bv0 32))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse780 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse781 (bvmul (_ bv4 32) .cse780))) (or (not (bvsge .cse780 (_ bv0 32))) (= .cse781 .cse4) (= .cse0 .cse781) (not (bvslt .cse780 c_~size~0)) (not (let ((.cse782 (bvmul (_ bv4294967292 32) .cse780))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse782) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse782)))) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_58) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse785 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse783 (bvmul (_ bv4 32) .cse785))) (or (= .cse783 .cse4) (not (let ((.cse784 (bvmul (_ bv4294967292 32) .cse785))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse784) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse784)))) (= .cse0 .cse783) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_60) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvslt .cse785 c_~size~0)) (not (bvsge .cse785 (_ bv0 32))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse786 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse787 (bvmul (_ bv4 32) .cse786))) (or (not (bvsge .cse786 (_ bv0 32))) (= .cse787 .cse4) (= .cse0 .cse787) (not (bvslt .cse786 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_58))) (not (let ((.cse788 (bvmul (_ bv4294967292 32) .cse786))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse788) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse788)))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse791 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse789 (bvmul (_ bv4 32) .cse791))) (or (= .cse789 .cse4) (forall ((v_arrayElimCell_55 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (let ((.cse790 (bvmul (_ bv4294967292 32) .cse791))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse790) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse790)))) (= .cse0 .cse789) (not (bvslt .cse791 c_~size~0)) (not (bvsge .cse791 (_ bv0 32))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse794 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse792 (bvmul (_ bv4 32) .cse794))) (or (= .cse792 .cse4) (not (let ((.cse793 (bvmul (_ bv4294967292 32) .cse794))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse793) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse793)))) (= .cse0 .cse792) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvslt .cse794 c_~size~0)) (not (bvsge .cse794 (_ bv0 32))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse795 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse796 (bvmul (_ bv4 32) .cse795))) (or (forall ((v_arrayElimCell_55 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (bvsge .cse795 (_ bv0 32))) (= .cse796 .cse4) (= .cse0 .cse796) (not (bvslt .cse795 c_~size~0)) (not (let ((.cse797 (bvmul (_ bv4294967292 32) .cse795))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse797) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse797)))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse798 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse799 (bvmul (_ bv4 32) .cse798))) (or (not (bvsge .cse798 (_ bv0 32))) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_60) v_arrayElimCell_58))) (= .cse799 .cse4) (= .cse0 .cse799) (not (bvslt .cse798 c_~size~0)) (not (let ((.cse800 (bvmul (_ bv4294967292 32) .cse798))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse800) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse800)))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse801 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse802 (bvmul (_ bv4 32) .cse801))) (or (not (bvsge .cse801 (_ bv0 32))) (= .cse802 .cse4) (= .cse0 .cse802) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_50))) (not (bvslt .cse801 c_~size~0)) (not (let ((.cse803 (bvmul (_ bv4294967292 32) .cse801))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse803) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse803)))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse807 (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59))) (let ((.cse804 (concat .cse807 v_arrayElimCell_58))) (let ((.cse805 (bvmul (_ bv4 32) .cse804))) (or (not (bvsge .cse804 (_ bv0 32))) (= .cse805 .cse4) (= .cse0 .cse805) (not (bvslt .cse804 c_~size~0)) (not (let ((.cse806 (bvmul (_ bv4294967292 32) .cse804))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse806) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse806)))) (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat .cse807 v_arrayElimCell_50)))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse808 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (or (not (bvsge .cse808 (_ bv0 32))) (= (bvmul (_ bv4 32) .cse808) .cse4) (not (bvslt .cse808 c_~size~0)) (not (let ((.cse809 (bvmul (_ bv4294967292 32) .cse808))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse809) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse809)))) (forall ((v_arrayElimCell_57 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) .cse808))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse813 (concat v_arrayElimCell_53 v_arrayElimCell_52))) (let ((.cse812 (concat (concat .cse813 v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse810 (bvmul (_ bv4 32) .cse812))) (or (= .cse810 .cse4) (not (let ((.cse811 (bvmul (_ bv4294967292 32) .cse812))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse811) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse811)))) (forall ((v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat .cse813 v_arrayElimCell_60) v_arrayElimCell_50))) (= .cse0 .cse810) (not (bvslt .cse812 c_~size~0)) (not (bvsge .cse812 (_ bv0 32)))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse816 (concat v_arrayElimCell_53 v_arrayElimCell_52))) (let ((.cse814 (concat (concat .cse816 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse815 (bvmul (_ bv4 32) .cse814))) (or (not (bvsge .cse814 (_ bv0 32))) (= .cse815 .cse4) (= .cse0 .cse815) (not (bvslt .cse814 c_~size~0)) (forall ((v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat .cse816 v_arrayElimCell_60) v_arrayElimCell_58))) (not (let ((.cse817 (bvmul (_ bv4294967292 32) .cse814))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse817) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse817))))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse820 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse818 (bvmul (_ bv4 32) .cse820))) (or (= .cse818 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50))) (not (let ((.cse819 (bvmul (_ bv4294967292 32) .cse820))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse819) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse819)))) (= .cse0 .cse818) (not (bvslt .cse820 c_~size~0)) (not (bvsge .cse820 (_ bv0 32))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse823 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse821 (bvmul (_ bv4 32) .cse823))) (or (= .cse821 .cse4) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (let ((.cse822 (bvmul (_ bv4294967292 32) .cse823))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse822) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse822)))) (= .cse0 .cse821) (not (bvslt .cse823 c_~size~0)) (not (bvsge .cse823 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8))) (let ((.cse826 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse824 (bvmul (_ bv4 32) .cse826))) (or (= .cse824 .cse4) (not (let ((.cse825 (bvmul (_ bv4294967292 32) .cse826))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse825) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse825)))) (= .cse0 .cse824) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_60) v_arrayElimCell_50))) (not (bvslt .cse826 c_~size~0)) (not (bvsge .cse826 (_ bv0 32))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse829 (concat v_arrayElimCell_53 v_arrayElimCell_52))) (let ((.cse827 (concat (concat .cse829 v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse828 (bvmul (_ bv4 32) .cse827))) (or (not (bvsge .cse827 (_ bv0 32))) (= .cse828 .cse4) (= .cse0 .cse828) (forall ((v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat (concat .cse829 v_arrayElimCell_60) v_arrayElimCell_50))) (not (bvslt .cse827 c_~size~0)) (not (let ((.cse830 (bvmul (_ bv4294967292 32) .cse827))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse830) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse830))))))))) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))))) (forall ((v_arrayElimCell_52 (_ BitVec 8))) (or (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_57 (_ BitVec 8)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_57) v_arrayElimCell_61) (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_54) v_arrayElimCell_60) v_arrayElimCell_50))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimCell_59 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32))) (let ((.cse831 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse832 (bvmul (_ bv4 32) .cse831))) (or (not (bvsge .cse831 (_ bv0 32))) (= .cse832 .cse4) (= .cse0 .cse832) (not (bvslt .cse831 c_~size~0)) (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (not (let ((.cse833 (bvmul (_ bv4294967292 32) .cse831))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse833) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse833)))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse835 (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59))) (let ((.cse837 (concat .cse835 v_arrayElimCell_61))) (let ((.cse834 (bvmul (_ bv4 32) .cse837))) (or (= .cse834 .cse4) (forall ((v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61) (concat .cse835 v_arrayElimCell_50))) (not (let ((.cse836 (bvmul (_ bv4294967292 32) .cse837))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse836) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse836)))) (= .cse0 .cse834) (not (bvslt .cse837 c_~size~0)) (not (bvsge .cse837 (_ bv0 32)))))))))) (forall ((v_arrayElimCell_53 (_ BitVec 8)) (v_arrayElimCell_58 (_ BitVec 8)) (v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse838 (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_58))) (let ((.cse839 (bvmul (_ bv4 32) .cse838))) (or (not (bvsge .cse838 (_ bv0 32))) (= .cse839 .cse4) (= .cse0 .cse839) (not (bvslt .cse838 c_~size~0)) (forall ((v_arrayElimCell_54 (_ BitVec 8)) (v_arrayElimCell_50 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_53 v_arrayElimCell_54) v_arrayElimCell_59) v_arrayElimCell_50) (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (not (let ((.cse840 (bvmul (_ bv4294967292 32) .cse838))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse840) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse840)))))))))))) (forall ((v_arrayElimIndex_4 (_ BitVec 32)) (v_arrayElimCell_61 (_ BitVec 8)) (v_arrayElimCell_52 (_ BitVec 8)) (v_arrayElimCell_51 (_ BitVec 8))) (or (not (bvule (bvadd (_ bv4294967295 32) v_arrayElimIndex_4) (bvadd (_ bv3 32) v_arrayElimIndex_4))) (forall ((v_arrayElimCell_59 (_ BitVec 8))) (let ((.cse842 (concat (concat (concat v_arrayElimCell_51 v_arrayElimCell_52) v_arrayElimCell_59) v_arrayElimCell_61))) (let ((.cse843 (bvmul (_ bv4 32) .cse842))) (or (not (let ((.cse841 (bvmul (_ bv4294967292 32) .cse842))) (bvule (bvadd (_ bv4294967295 32) .cse0 v_arrayElimIndex_4 .cse841) (bvadd .cse0 (_ bv3 32) v_arrayElimIndex_4 .cse841)))) (= .cse0 .cse843) (= .cse843 .cse4) (forall ((v_arrayElimCell_55 (_ BitVec 8)) (v_arrayElimCell_60 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_55 v_arrayElimCell_52) v_arrayElimCell_60) v_arrayElimCell_61) .cse842)) (not (bvslt .cse842 c_~size~0)) (not (bvsge .cse842 (_ bv0 32)))))))))))) (not (bvsge c_~x2~0 (_ bv0 32))) (not (bvslt c_~x2~0 c_~size~0)) (forall ((~n~0 (_ BitVec 32))) (or (bvult (_ bv0 32) (bvadd ~n~0 (_ bv4294967294 32))) (bvult (bvadd |c_thread1Thread1of1ForFork0_~i~0#1| (_ bv1 32)) ~n~0) (not (bvult |c_thread1Thread1of1ForFork0_~i~0#1| ~n~0))))) is different from true