./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:18:43,798 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:18:43,858 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 04:18:43,862 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:18:43,862 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:18:43,886 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:18:43,886 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:18:43,887 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:18:43,887 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:18:43,888 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:18:43,888 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:18:43,889 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:18:43,890 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:18:43,890 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:18:43,891 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:18:43,891 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:18:43,892 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:18:43,892 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:18:43,893 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:18:43,893 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:18:43,894 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:18:43,895 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:18:43,895 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:18:43,895 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:18:43,896 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:18:43,896 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:18:43,897 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:18:43,897 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:18:43,898 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:18:43,898 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:18:43,898 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:18:43,899 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:18:43,899 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:18:43,899 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:18:43,900 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:18:43,900 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 04:18:43,900 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 04:18:43,900 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:18:43,900 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:18:43,901 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:18:43,901 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:18:43,901 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_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc [2023-11-29 04:18:44,111 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:18:44,132 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:18:44,135 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:18:44,136 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:18:44,137 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:18:44,138 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2023-11-29 04:18:46,969 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:18:47,122 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:18:47,123 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2023-11-29 04:18:47,132 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/data/c372def49/dcd82cda8d534557bb4c844d4d8b4df9/FLAG62c5667ff [2023-11-29 04:18:47,147 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/data/c372def49/dcd82cda8d534557bb4c844d4d8b4df9 [2023-11-29 04:18:47,150 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:18:47,151 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:18:47,153 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:18:47,153 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:18:47,158 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:18:47,159 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:18:47" (1/1) ... [2023-11-29 04:18:47,160 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@fbb73b and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:18:47, skipping insertion in model container [2023-11-29 04:18:47,160 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:18:47" (1/1) ... [2023-11-29 04:18:47,191 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:18:47,371 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:18:47,383 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-29 04:18:47,383 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@2a72c866 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:18:47, skipping insertion in model container [2023-11-29 04:18:47,384 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:18:47,384 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 04:18:47,386 INFO L158 Benchmark]: Toolchain (without parser) took 233.74ms. Allocated memory is still 155.2MB. Free memory was 113.9MB in the beginning and 103.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 04:18:47,386 INFO L158 Benchmark]: CDTParser took 0.19ms. Allocated memory is still 155.2MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 04:18:47,387 INFO L158 Benchmark]: CACSL2BoogieTranslator took 231.32ms. Allocated memory is still 155.2MB. Free memory was 113.9MB in the beginning and 103.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. [2023-11-29 04:18:47,389 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.19ms. Allocated memory is still 155.2MB. Free memory is still 126.6MB. There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 231.32ms. Allocated memory is still 155.2MB. Free memory was 113.9MB in the beginning and 103.4MB in the end (delta: 10.5MB). Peak memory consumption was 10.5MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 122]: 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-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/plugins/org.eclipse.equinox.launcher_1.5.800.v20200727-1323.jar -data @noDefault -ultimatedata /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf --cacsl2boogietranslator.entry.function main --witnessprinter.witness.directory /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya --witnessprinter.witness.filename witness --witnessprinter.write.witness.besides.input.file false --witnessprinter.graph.data.specification CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) --witnessprinter.graph.data.producer Automizer --witnessprinter.graph.data.architecture 32bit --witnessprinter.graph.data.programhash e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 04:18:49,125 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 04:18:49,194 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 04:18:49,214 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 04:18:49,215 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 04:18:49,243 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 04:18:49,243 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 04:18:49,244 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 04:18:49,245 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 04:18:49,245 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 04:18:49,246 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 04:18:49,246 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 04:18:49,247 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 04:18:49,248 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 04:18:49,248 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 04:18:49,249 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 04:18:49,249 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 04:18:49,250 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 04:18:49,250 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 04:18:49,251 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 04:18:49,251 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 04:18:49,252 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 04:18:49,252 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 04:18:49,252 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 04:18:49,253 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 04:18:49,253 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 04:18:49,254 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 04:18:49,254 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 04:18:49,254 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 04:18:49,255 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 04:18:49,255 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 04:18:49,256 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 04:18:49,256 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 04:18:49,256 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 04:18:49,256 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:18:49,257 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 04:18:49,257 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 04:18:49,257 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 04:18:49,257 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 04:18:49,258 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 04:18:49,258 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 04:18:49,258 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 04:18:49,258 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 04:18:49,259 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 04:18:49,259 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_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/plugins/com.sun.xml.bind_2.2.0.v201505121915.jar) to method java.lang.ClassLoader.defineClass(java.lang.String,byte[],int,int) WARNING: Please consider reporting this to the maintainers of com.sun.xml.bind.v2.runtime.reflect.opt.Injector$1 WARNING: Use --illegal-access=warn to enable warnings of further illegal reflective access operations WARNING: All illegal access operations will be denied in a future release Applying setting for plugin de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: Entry function -> main Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness directory -> /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Witness filename -> witness Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Write witness besides input file -> false Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data specification -> CHECK( init(main()), LTL(G valid-free) ) CHECK( init(main()), LTL(G valid-deref) ) CHECK( init(main()), LTL(G valid-memtrack) ) Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data producer -> Automizer Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data architecture -> 32bit Applying setting for plugin de.uni_freiburg.informatik.ultimate.witnessprinter: Graph data programhash -> e3298e0ac573b72ea1dd21021e341a1c4e9f42cf513c1ea24a79ab2c37c412bc [2023-11-29 04:18:49,558 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 04:18:49,580 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 04:18:49,582 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 04:18:49,584 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 04:18:49,584 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 04:18:49,586 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2023-11-29 04:18:52,391 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 04:18:52,604 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 04:18:52,605 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/sv-benchmarks/c/weaver/chl-name-comparator-symm.wvr.c [2023-11-29 04:18:52,616 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/data/4989d564b/ff2ee229339c40ca94eec694726946de/FLAG3d97b4199 [2023-11-29 04:18:52,632 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/data/4989d564b/ff2ee229339c40ca94eec694726946de [2023-11-29 04:18:52,635 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 04:18:52,637 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 04:18:52,638 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 04:18:52,639 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 04:18:52,644 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 04:18:52,645 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:18:52" (1/1) ... [2023-11-29 04:18:52,646 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@16ceb9 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:18:52, skipping insertion in model container [2023-11-29 04:18:52,646 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 04:18:52" (1/1) ... [2023-11-29 04:18:52,677 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:18:52,885 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:18:52,901 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 04:18:52,908 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 04:18:52,933 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:18:52,938 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 04:18:52,970 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 04:18:52,989 INFO L206 MainTranslator]: Completed translation [2023-11-29 04:18:52,990 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:18:52 WrapperNode [2023-11-29 04:18:52,990 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 04:18:52,991 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 04:18:52,992 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 04:18:52,992 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 04:18:53,000 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:18:52" (1/1) ... [2023-11-29 04:18:53,012 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:18:52" (1/1) ... [2023-11-29 04:18:53,043 INFO L138 Inliner]: procedures = 27, calls = 35, calls flagged for inlining = 15, calls inlined = 17, statements flattened = 218 [2023-11-29 04:18:53,043 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 04:18:53,044 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 04:18:53,044 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 04:18:53,045 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 04:18:53,057 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:18:52" (1/1) ... [2023-11-29 04:18:53,057 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:18:52" (1/1) ... [2023-11-29 04:18:53,063 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:18:52" (1/1) ... [2023-11-29 04:18:53,082 INFO L175 MemorySlicer]: Split 9 memory accesses to 4 slices as follows [2, 2, 3, 2]. 33 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0, 0]. The 3 writes are split as follows [0, 1, 1, 1]. [2023-11-29 04:18:53,082 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:18:52" (1/1) ... [2023-11-29 04:18:53,082 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:18:52" (1/1) ... [2023-11-29 04:18:53,096 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:18:52" (1/1) ... [2023-11-29 04:18:53,101 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:18:52" (1/1) ... [2023-11-29 04:18:53,104 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:18:52" (1/1) ... [2023-11-29 04:18:53,106 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:18:52" (1/1) ... [2023-11-29 04:18:53,111 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 04:18:53,112 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 04:18:53,112 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 04:18:53,113 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 04:18:53,113 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:18:52" (1/1) ... [2023-11-29 04:18:53,120 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 04:18:53,131 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 04:18:53,143 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 04:18:53,166 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 04:18:53,203 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 04:18:53,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 04:18:53,203 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 04:18:53,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 04:18:53,204 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#3 [2023-11-29 04:18:53,204 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 04:18:53,205 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#0 [2023-11-29 04:18:53,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#1 [2023-11-29 04:18:53,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#2 [2023-11-29 04:18:53,206 INFO L130 BoogieDeclarations]: Found specification of procedure read~intINTTYPE4#3 [2023-11-29 04:18:53,207 INFO L130 BoogieDeclarations]: Found specification of procedure thread1 [2023-11-29 04:18:53,207 INFO L138 BoogieDeclarations]: Found implementation of procedure thread1 [2023-11-29 04:18:53,207 INFO L130 BoogieDeclarations]: Found specification of procedure thread2 [2023-11-29 04:18:53,207 INFO L138 BoogieDeclarations]: Found implementation of procedure thread2 [2023-11-29 04:18:53,208 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 04:18:53,208 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 04:18:53,208 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 04:18:53,209 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 04:18:53,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#0 [2023-11-29 04:18:53,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#1 [2023-11-29 04:18:53,209 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#2 [2023-11-29 04:18:53,210 INFO L130 BoogieDeclarations]: Found specification of procedure write~intINTTYPE4#3 [2023-11-29 04:18:53,212 WARN L213 CfgBuilder]: User set CodeBlockSize to SequenceOfStatements but program contains fork statements. Overwriting the user preferences and setting CodeBlockSize to OneNontrivialStatement [2023-11-29 04:18:53,336 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 04:18:53,338 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 04:18:53,805 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 04:18:54,132 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 04:18:54,133 INFO L309 CfgBuilder]: Removed 3 assume(true) statements. [2023-11-29 04:18:54,133 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:18:54 BoogieIcfgContainer [2023-11-29 04:18:54,133 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 04:18:54,135 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 04:18:54,136 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 04:18:54,139 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 04:18:54,139 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 04:18:52" (1/3) ... [2023-11-29 04:18:54,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b45ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:18:54, skipping insertion in model container [2023-11-29 04:18:54,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 04:18:52" (2/3) ... [2023-11-29 04:18:54,140 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@55b45ab and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 04:18:54, skipping insertion in model container [2023-11-29 04:18:54,140 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 04:18:54" (3/3) ... [2023-11-29 04:18:54,142 INFO L112 eAbstractionObserver]: Analyzing ICFG chl-name-comparator-symm.wvr.c [2023-11-29 04:18:54,162 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 04:18:54,162 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 16 error locations. [2023-11-29 04:18:54,162 INFO L514 ceAbstractionStarter]: Constructing petrified ICFG for 1 thread instances. [2023-11-29 04:18:54,283 INFO L144 ThreadInstanceAdder]: Constructed 2 joinOtherThreadTransitions. [2023-11-29 04:18:54,319 INFO L73 FinitePrefix]: Start finitePrefix. Operand has 52 places, 50 transitions, 114 flow [2023-11-29 04:18:54,352 INFO L124 PetriNetUnfolderBase]: 5/48 cut-off events. [2023-11-29 04:18:54,352 INFO L125 PetriNetUnfolderBase]: For 2/2 co-relation queries the response was YES. [2023-11-29 04:18:54,356 INFO L83 FinitePrefix]: Finished finitePrefix Result has 57 conditions, 48 events. 5/48 cut-off events. For 2/2 co-relation queries the response was YES. Maximal size of possible extension queue 5. Compared 87 event pairs, 0 based on Foata normal form. 0/27 useless extension candidates. Maximal degree in co-relation 29. Up to 2 conditions per place. [2023-11-29 04:18:54,356 INFO L82 GeneralOperation]: Start removeDead. Operand has 52 places, 50 transitions, 114 flow [2023-11-29 04:18:54,361 INFO L88 GeneralOperation]: Finished RemoveDead, result has has 49 places, 47 transitions, 106 flow [2023-11-29 04:18:54,372 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 04:18:54,379 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;@7930ed2f, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 04:18:54,379 INFO L358 AbstractCegarLoop]: Starting to check reachability of 22 error locations. [2023-11-29 04:18:54,383 INFO L185 PetriNetUnfolderBase]: Found word, exiting Unfolder. [2023-11-29 04:18:54,383 INFO L124 PetriNetUnfolderBase]: 1/4 cut-off events. [2023-11-29 04:18:54,384 INFO L125 PetriNetUnfolderBase]: For 0/0 co-relation queries the response was YES. [2023-11-29 04:18:54,384 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:18:54,384 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-29 04:18:54,385 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:18:54,390 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:54,391 INFO L85 PathProgramCache]: Analyzing trace with hash 684985, now seen corresponding path program 1 times [2023-11-29 04:18:54,403 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:54,404 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [77635087] [2023-11-29 04:18:54,404 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:54,405 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-29 04:18:54,405 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:54,422 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:54,424 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:54,512 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:54,515 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 04:18:54,520 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:54,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:18:54,613 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:54,614 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 04:18:54,629 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:54,630 INFO L378 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-29 04:18:54,647 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:54,648 INFO L378 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-29 04:18:54,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:54,657 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 04:18:54,665 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:54,666 INFO L378 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-29 04:18:54,675 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:18:54,676 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:18:54,676 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:54,677 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [77635087] [2023-11-29 04:18:54,677 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [77635087] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:54,678 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:54,678 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:18:54,679 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [11926936] [2023-11-29 04:18:54,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:54,688 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:18:54,693 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:54,719 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:18:54,719 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:18:54,777 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2023-11-29 04:18:54,779 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 49 places, 47 transitions, 106 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:54,780 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:18:54,780 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2023-11-29 04:18:54,781 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:18:54,960 INFO L124 PetriNetUnfolderBase]: 92/234 cut-off events. [2023-11-29 04:18:54,960 INFO L125 PetriNetUnfolderBase]: For 22/22 co-relation queries the response was YES. [2023-11-29 04:18:54,962 INFO L83 FinitePrefix]: Finished finitePrefix Result has 418 conditions, 234 events. 92/234 cut-off events. For 22/22 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1033 event pairs, 68 based on Foata normal form. 24/198 useless extension candidates. Maximal degree in co-relation 360. Up to 160 conditions per place. [2023-11-29 04:18:54,965 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 19 selfloop transitions, 2 changer transitions 0/42 dead transitions. [2023-11-29 04:18:54,965 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 48 places, 42 transitions, 138 flow [2023-11-29 04:18:54,967 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:18:54,969 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:18:54,976 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 97 transitions. [2023-11-29 04:18:54,978 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6466666666666666 [2023-11-29 04:18:54,979 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 97 transitions. [2023-11-29 04:18:54,980 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 97 transitions. [2023-11-29 04:18:54,981 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:18:54,983 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 97 transitions. [2023-11-29 04:18:54,985 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.333333333333336) internal successors, (97), 3 states have internal predecessors, (97), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:54,989 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:54,989 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:54,991 INFO L175 Difference]: Start difference. First operand has 49 places, 47 transitions, 106 flow. Second operand 3 states and 97 transitions. [2023-11-29 04:18:54,992 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 48 places, 42 transitions, 138 flow [2023-11-29 04:18:54,995 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 42 transitions, 130 flow, removed 0 selfloop flow, removed 4 redundant places. [2023-11-29 04:18:54,997 INFO L231 Difference]: Finished difference. Result has 44 places, 42 transitions, 92 flow [2023-11-29 04:18:54,999 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=92, PETRI_PLACES=44, PETRI_TRANSITIONS=42} [2023-11-29 04:18:55,003 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2023-11-29 04:18:55,003 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 42 transitions, 92 flow [2023-11-29 04:18:55,004 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:55,004 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:18:55,004 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-29 04:18:55,007 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:55,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:55,205 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:18:55,206 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:55,206 INFO L85 PathProgramCache]: Analyzing trace with hash 684986, now seen corresponding path program 1 times [2023-11-29 04:18:55,206 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:55,207 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [265296800] [2023-11-29 04:18:55,207 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:55,207 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-29 04:18:55,207 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:55,208 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:55,209 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:55,269 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:55,271 INFO L262 TraceCheckSpWp]: Trace formula consists of 40 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 04:18:55,273 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:55,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 04:18:55,307 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:55,308 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 04:18:55,319 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:55,320 INFO L378 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-29 04:18:55,326 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:55,327 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 04:18:55,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:55,342 INFO L378 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-29 04:18:55,359 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:55,360 INFO L378 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-29 04:18:55,389 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:18:55,389 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:18:55,389 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:55,389 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [265296800] [2023-11-29 04:18:55,390 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [265296800] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:55,390 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:55,390 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:18:55,390 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1124125522] [2023-11-29 04:18:55,390 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:55,391 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:18:55,392 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:55,392 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:18:55,392 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:18:55,487 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2023-11-29 04:18:55,488 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 42 transitions, 92 flow. Second operand has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:55,488 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:18:55,488 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2023-11-29 04:18:55,488 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:18:55,668 INFO L124 PetriNetUnfolderBase]: 93/237 cut-off events. [2023-11-29 04:18:55,668 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-29 04:18:55,669 INFO L83 FinitePrefix]: Finished finitePrefix Result has 415 conditions, 237 events. 93/237 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1024 event pairs, 68 based on Foata normal form. 0/177 useless extension candidates. Maximal degree in co-relation 393. Up to 165 conditions per place. [2023-11-29 04:18:55,672 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 22 selfloop transitions, 3 changer transitions 0/45 dead transitions. [2023-11-29 04:18:55,672 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 45 transitions, 150 flow [2023-11-29 04:18:55,672 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:18:55,672 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:18:55,673 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 98 transitions. [2023-11-29 04:18:55,674 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6533333333333333 [2023-11-29 04:18:55,674 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 98 transitions. [2023-11-29 04:18:55,674 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 98 transitions. [2023-11-29 04:18:55,675 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:18:55,675 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 98 transitions. [2023-11-29 04:18:55,676 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 32.666666666666664) internal successors, (98), 3 states have internal predecessors, (98), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:55,677 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:55,677 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:55,677 INFO L175 Difference]: Start difference. First operand has 44 places, 42 transitions, 92 flow. Second operand 3 states and 98 transitions. [2023-11-29 04:18:55,677 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 45 transitions, 150 flow [2023-11-29 04:18:55,678 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 45 transitions, 144 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:18:55,680 INFO L231 Difference]: Finished difference. Result has 45 places, 44 transitions, 107 flow [2023-11-29 04:18:55,680 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=88, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=107, PETRI_PLACES=45, PETRI_TRANSITIONS=44} [2023-11-29 04:18:55,681 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2023-11-29 04:18:55,681 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 44 transitions, 107 flow [2023-11-29 04:18:55,681 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.0) internal successors, (75), 3 states have internal predecessors, (75), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:55,681 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:18:55,682 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1] [2023-11-29 04:18:55,683 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:18:55,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:55,882 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:18:55,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:55,883 INFO L85 PathProgramCache]: Analyzing trace with hash 685051, now seen corresponding path program 1 times [2023-11-29 04:18:55,884 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:55,884 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [978356225] [2023-11-29 04:18:55,884 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:55,884 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-29 04:18:55,885 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:55,886 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:55,887 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:55,951 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:55,953 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:18:55,954 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:55,971 INFO L134 CoverageAnalysis]: Checked inductivity of 0 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:18:55,972 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:18:55,972 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:55,972 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [978356225] [2023-11-29 04:18:55,972 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [978356225] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:18:55,972 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:18:55,973 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:18:55,973 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2065357990] [2023-11-29 04:18:55,973 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:18:55,973 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:18:55,974 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:55,974 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:18:55,974 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:18:55,987 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 04:18:55,987 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 44 transitions, 107 flow. Second operand has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:55,988 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:18:55,988 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 04:18:55,988 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:18:56,154 INFO L124 PetriNetUnfolderBase]: 92/236 cut-off events. [2023-11-29 04:18:56,154 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-29 04:18:56,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 416 conditions, 236 events. 92/236 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1018 event pairs, 68 based on Foata normal form. 1/178 useless extension candidates. Maximal degree in co-relation 403. Up to 163 conditions per place. [2023-11-29 04:18:56,157 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 21 selfloop transitions, 2 changer transitions 0/44 dead transitions. [2023-11-29 04:18:56,157 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 44 transitions, 150 flow [2023-11-29 04:18:56,158 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:18:56,158 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:18:56,159 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 99 transitions. [2023-11-29 04:18:56,160 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.66 [2023-11-29 04:18:56,160 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 99 transitions. [2023-11-29 04:18:56,160 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 99 transitions. [2023-11-29 04:18:56,161 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:18:56,161 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 99 transitions. [2023-11-29 04:18:56,162 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 33.0) internal successors, (99), 3 states have internal predecessors, (99), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:56,163 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:56,163 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:56,163 INFO L175 Difference]: Start difference. First operand has 45 places, 44 transitions, 107 flow. Second operand 3 states and 99 transitions. [2023-11-29 04:18:56,163 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 44 transitions, 150 flow [2023-11-29 04:18:56,164 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 44 transitions, 148 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:18:56,166 INFO L231 Difference]: Finished difference. Result has 46 places, 43 transitions, 104 flow [2023-11-29 04:18:56,166 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=104, PETRI_PLACES=46, PETRI_TRANSITIONS=43} [2023-11-29 04:18:56,167 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2023-11-29 04:18:56,167 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 43 transitions, 104 flow [2023-11-29 04:18:56,168 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.666666666666668) internal successors, (77), 3 states have internal predecessors, (77), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:56,168 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:18:56,168 INFO L208 CegarLoopForPetriNet]: trace histogram [1, 1, 1, 1, 1] [2023-11-29 04:18:56,170 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:56,368 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:56,369 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:18:56,369 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:56,369 INFO L85 PathProgramCache]: Analyzing trace with hash 658292546, now seen corresponding path program 1 times [2023-11-29 04:18:56,370 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:56,370 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1169409589] [2023-11-29 04:18:56,370 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:56,370 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-29 04:18:56,370 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:56,371 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:56,372 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:56,440 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:56,442 INFO L262 TraceCheckSpWp]: Trace formula consists of 58 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:18:56,443 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:56,481 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:18:56,481 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:18:56,524 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 0 proven. 1 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:18:56,524 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:56,524 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1169409589] [2023-11-29 04:18:56,524 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1169409589] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:18:56,524 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:18:56,525 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [3, 3] total 5 [2023-11-29 04:18:56,525 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [477598571] [2023-11-29 04:18:56,525 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:18:56,525 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:18:56,526 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:56,526 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:18:56,527 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:18:56,544 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 04:18:56,544 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 43 transitions, 104 flow. Second operand has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:56,544 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:18:56,545 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 04:18:56,545 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:18:56,775 INFO L124 PetriNetUnfolderBase]: 92/240 cut-off events. [2023-11-29 04:18:56,775 INFO L125 PetriNetUnfolderBase]: For 6/6 co-relation queries the response was YES. [2023-11-29 04:18:56,776 INFO L83 FinitePrefix]: Finished finitePrefix Result has 426 conditions, 240 events. 92/240 cut-off events. For 6/6 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1011 event pairs, 68 based on Foata normal form. 2/183 useless extension candidates. Maximal degree in co-relation 412. Up to 161 conditions per place. [2023-11-29 04:18:56,778 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 21 selfloop transitions, 5 changer transitions 0/47 dead transitions. [2023-11-29 04:18:56,778 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 50 places, 47 transitions, 166 flow [2023-11-29 04:18:56,779 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:18:56,779 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:18:56,781 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 153 transitions. [2023-11-29 04:18:56,781 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.612 [2023-11-29 04:18:56,782 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 153 transitions. [2023-11-29 04:18:56,782 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 153 transitions. [2023-11-29 04:18:56,782 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:18:56,782 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 153 transitions. [2023-11-29 04:18:56,783 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 30.6) internal successors, (153), 5 states have internal predecessors, (153), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:56,785 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:56,785 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:56,786 INFO L175 Difference]: Start difference. First operand has 46 places, 43 transitions, 104 flow. Second operand 5 states and 153 transitions. [2023-11-29 04:18:56,786 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 50 places, 47 transitions, 166 flow [2023-11-29 04:18:56,787 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 48 places, 47 transitions, 162 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:18:56,788 INFO L231 Difference]: Finished difference. Result has 51 places, 45 transitions, 130 flow [2023-11-29 04:18:56,789 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=100, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=39, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=130, PETRI_PLACES=51, PETRI_TRANSITIONS=45} [2023-11-29 04:18:56,790 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2023-11-29 04:18:56,790 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 45 transitions, 130 flow [2023-11-29 04:18:56,790 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 26.333333333333332) internal successors, (158), 6 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:56,790 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:18:56,790 INFO L208 CegarLoopForPetriNet]: trace histogram [2, 1, 1, 1] [2023-11-29 04:18:56,792 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:18:56,991 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:56,991 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:18:56,992 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:56,992 INFO L85 PathProgramCache]: Analyzing trace with hash 658292481, now seen corresponding path program 1 times [2023-11-29 04:18:56,992 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:56,993 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1109280692] [2023-11-29 04:18:56,993 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:18:56,993 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-29 04:18:56,993 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:56,994 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:56,996 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:57,060 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:18:57,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 52 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 04:18:57,063 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:57,081 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 04:18:57,090 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:57,091 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 04:18:57,103 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:57,103 INFO L378 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-29 04:18:57,118 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:57,119 INFO L378 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-29 04:18:57,129 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:57,130 INFO L378 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-29 04:18:57,135 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:57,136 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 04:18:57,187 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:18:57,187 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:18:57,325 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:18:57,325 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:57,325 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1109280692] [2023-11-29 04:18:57,325 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1109280692] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:18:57,325 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:18:57,325 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [2, 2] total 4 [2023-11-29 04:18:57,326 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [995871006] [2023-11-29 04:18:57,326 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:18:57,326 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:18:57,326 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:57,327 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:18:57,327 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=13, Invalid=17, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:18:57,746 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2023-11-29 04:18:57,746 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 45 transitions, 130 flow. Second operand has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:57,746 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:18:57,746 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2023-11-29 04:18:57,746 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:18:58,000 INFO L124 PetriNetUnfolderBase]: 92/240 cut-off events. [2023-11-29 04:18:58,000 INFO L125 PetriNetUnfolderBase]: For 12/12 co-relation queries the response was YES. [2023-11-29 04:18:58,001 INFO L83 FinitePrefix]: Finished finitePrefix Result has 444 conditions, 240 events. 92/240 cut-off events. For 12/12 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1016 event pairs, 68 based on Foata normal form. 2/183 useless extension candidates. Maximal degree in co-relation 398. Up to 164 conditions per place. [2023-11-29 04:18:58,002 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 24 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2023-11-29 04:18:58,002 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 48 transitions, 202 flow [2023-11-29 04:18:58,003 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:18:58,004 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:18:58,004 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 150 transitions. [2023-11-29 04:18:58,005 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6 [2023-11-29 04:18:58,005 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 150 transitions. [2023-11-29 04:18:58,005 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 150 transitions. [2023-11-29 04:18:58,005 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:18:58,005 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 150 transitions. [2023-11-29 04:18:58,006 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 30.0) internal successors, (150), 5 states have internal predecessors, (150), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:58,008 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:58,008 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:58,008 INFO L175 Difference]: Start difference. First operand has 51 places, 45 transitions, 130 flow. Second operand 5 states and 150 transitions. [2023-11-29 04:18:58,008 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 48 transitions, 202 flow [2023-11-29 04:18:58,010 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 48 transitions, 198 flow, removed 1 selfloop flow, removed 1 redundant places. [2023-11-29 04:18:58,011 INFO L231 Difference]: Finished difference. Result has 56 places, 46 transitions, 152 flow [2023-11-29 04:18:58,011 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=45, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=41, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=152, PETRI_PLACES=56, PETRI_TRANSITIONS=46} [2023-11-29 04:18:58,012 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2023-11-29 04:18:58,012 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 46 transitions, 152 flow [2023-11-29 04:18:58,013 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 25.666666666666668) internal successors, (154), 6 states have internal predecessors, (154), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:18:58,013 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:18:58,013 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 3, 1, 1] [2023-11-29 04:18:58,015 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:58,213 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:58,214 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:18:58,214 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:18:58,214 INFO L85 PathProgramCache]: Analyzing trace with hash -1375296433, now seen corresponding path program 2 times [2023-11-29 04:18:58,214 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:18:58,215 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1561531302] [2023-11-29 04:18:58,215 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:18:58,215 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-29 04:18:58,215 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:18:58,216 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:58,217 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:18:58,294 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:18:58,294 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:18:58,297 INFO L262 TraceCheckSpWp]: Trace formula consists of 76 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 04:18:58,299 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:18:58,318 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 04:18:58,328 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:58,329 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 04:18:58,341 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:58,342 INFO L378 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-29 04:18:58,357 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:58,358 INFO L378 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-29 04:18:58,369 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:58,372 INFO L378 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-29 04:18:58,386 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:18:58,386 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 04:18:58,539 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 3 proven. 9 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:18:58,539 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:18:59,146 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 12 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 04:18:59,147 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:18:59,147 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1561531302] [2023-11-29 04:18:59,147 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1561531302] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:18:59,147 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:18:59,147 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 10 [2023-11-29 04:18:59,147 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1454647600] [2023-11-29 04:18:59,147 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:18:59,148 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 04:18:59,148 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:18:59,149 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 04:18:59,149 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=39, Invalid=71, Unknown=0, NotChecked=0, Total=110 [2023-11-29 04:19:00,401 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2023-11-29 04:19:00,401 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 46 transitions, 152 flow. Second operand has 11 states, 11 states have (on average 25.636363636363637) internal successors, (282), 11 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:00,401 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:00,402 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2023-11-29 04:19:00,402 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:00,810 INFO L124 PetriNetUnfolderBase]: 91/237 cut-off events. [2023-11-29 04:19:00,811 INFO L125 PetriNetUnfolderBase]: For 20/20 co-relation queries the response was YES. [2023-11-29 04:19:00,811 INFO L83 FinitePrefix]: Finished finitePrefix Result has 439 conditions, 237 events. 91/237 cut-off events. For 20/20 co-relation queries the response was YES. Maximal size of possible extension queue 27. Compared 1010 event pairs, 68 based on Foata normal form. 1/179 useless extension candidates. Maximal degree in co-relation 408. Up to 160 conditions per place. [2023-11-29 04:19:00,813 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 20 selfloop transitions, 5 changer transitions 0/45 dead transitions. [2023-11-29 04:19:00,813 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 60 places, 45 transitions, 186 flow [2023-11-29 04:19:00,814 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:19:00,814 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:19:00,814 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 170 transitions. [2023-11-29 04:19:00,815 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5666666666666667 [2023-11-29 04:19:00,815 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 170 transitions. [2023-11-29 04:19:00,815 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 170 transitions. [2023-11-29 04:19:00,815 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:00,815 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 170 transitions. [2023-11-29 04:19:00,816 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 28.333333333333332) internal successors, (170), 6 states have internal predecessors, (170), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:00,817 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:00,817 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:00,817 INFO L175 Difference]: Start difference. First operand has 56 places, 46 transitions, 152 flow. Second operand 6 states and 170 transitions. [2023-11-29 04:19:00,818 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 60 places, 45 transitions, 186 flow [2023-11-29 04:19:00,819 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 45 transitions, 170 flow, removed 1 selfloop flow, removed 7 redundant places. [2023-11-29 04:19:00,820 INFO L231 Difference]: Finished difference. Result has 53 places, 43 transitions, 122 flow [2023-11-29 04:19:00,821 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=112, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=43, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=122, PETRI_PLACES=53, PETRI_TRANSITIONS=43} [2023-11-29 04:19:00,822 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2023-11-29 04:19:00,822 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 43 transitions, 122 flow [2023-11-29 04:19:00,822 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 25.636363636363637) internal successors, (282), 11 states have internal predecessors, (282), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:00,822 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:00,822 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1] [2023-11-29 04:19:00,825 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:01,023 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:01,023 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:01,023 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:01,024 INFO L85 PathProgramCache]: Analyzing trace with hash -1375296368, now seen corresponding path program 2 times [2023-11-29 04:19:01,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:01,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1266466317] [2023-11-29 04:19:01,024 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:19:01,024 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-29 04:19:01,024 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:01,025 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:01,026 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:01,077 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 04:19:01,077 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:19:01,078 INFO L262 TraceCheckSpWp]: Trace formula consists of 46 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:19:01,079 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:01,104 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 04:19:01,104 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 19 treesize of output 22 [2023-11-29 04:19:01,139 INFO L349 Elim1Store]: treesize reduction 37, result has 15.9 percent of original size [2023-11-29 04:19:01,139 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 22 [2023-11-29 04:19:01,323 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:01,323 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:19:01,323 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:01,324 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1266466317] [2023-11-29 04:19:01,324 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1266466317] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:19:01,324 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:19:01,324 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:19:01,324 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1870480561] [2023-11-29 04:19:01,324 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:01,325 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:19:01,325 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:01,325 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:19:01,325 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:19:01,390 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2023-11-29 04:19:01,390 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 43 transitions, 122 flow. Second operand has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:01,390 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:01,390 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2023-11-29 04:19:01,390 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:01,530 INFO L124 PetriNetUnfolderBase]: 141/314 cut-off events. [2023-11-29 04:19:01,530 INFO L125 PetriNetUnfolderBase]: For 10/10 co-relation queries the response was YES. [2023-11-29 04:19:01,531 INFO L83 FinitePrefix]: Finished finitePrefix Result has 586 conditions, 314 events. 141/314 cut-off events. For 10/10 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1313 event pairs, 108 based on Foata normal form. 0/246 useless extension candidates. Maximal degree in co-relation 546. Up to 242 conditions per place. [2023-11-29 04:19:01,532 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 24 selfloop transitions, 1 changer transitions 0/41 dead transitions. [2023-11-29 04:19:01,532 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 53 places, 41 transitions, 168 flow [2023-11-29 04:19:01,533 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:19:01,533 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:19:01,534 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2023-11-29 04:19:01,534 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2023-11-29 04:19:01,534 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 88 transitions. [2023-11-29 04:19:01,534 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 88 transitions. [2023-11-29 04:19:01,534 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:01,534 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 88 transitions. [2023-11-29 04:19:01,535 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:01,535 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:01,536 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:01,536 INFO L175 Difference]: Start difference. First operand has 53 places, 43 transitions, 122 flow. Second operand 3 states and 88 transitions. [2023-11-29 04:19:01,536 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 53 places, 41 transitions, 168 flow [2023-11-29 04:19:01,537 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 46 places, 41 transitions, 148 flow, removed 3 selfloop flow, removed 7 redundant places. [2023-11-29 04:19:01,538 INFO L231 Difference]: Finished difference. Result has 46 places, 41 transitions, 100 flow [2023-11-29 04:19:01,538 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=98, PETRI_DIFFERENCE_MINUEND_PLACES=44, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=40, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=100, PETRI_PLACES=46, PETRI_TRANSITIONS=41} [2023-11-29 04:19:01,538 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2023-11-29 04:19:01,539 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 41 transitions, 100 flow [2023-11-29 04:19:01,539 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 22.666666666666668) internal successors, (68), 3 states have internal predecessors, (68), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:01,539 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:01,539 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1] [2023-11-29 04:19:01,541 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:19:01,739 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:01,740 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr3REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:01,740 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:01,740 INFO L85 PathProgramCache]: Analyzing trace with hash -1375296367, now seen corresponding path program 1 times [2023-11-29 04:19:01,740 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:01,740 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [770064864] [2023-11-29 04:19:01,741 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:19:01,741 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-29 04:19:01,741 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:01,742 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:01,743 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:01,820 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:01,823 INFO L262 TraceCheckSpWp]: Trace formula consists of 82 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 04:19:01,825 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:01,847 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:01,848 INFO L378 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 9 treesize of output 11 [2023-11-29 04:19:01,854 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:01,856 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 5 treesize of output 3 [2023-11-29 04:19:01,865 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:01,884 INFO L349 Elim1Store]: treesize reduction 11, result has 45.0 percent of original size [2023-11-29 04:19:01,885 INFO L378 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 1 case distinctions, treesize of input 14 treesize of output 15 [2023-11-29 04:19:01,893 INFO L378 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-29 04:19:02,119 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:02,119 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:19:02,119 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:02,119 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [770064864] [2023-11-29 04:19:02,119 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [770064864] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:19:02,119 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:19:02,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:19:02,120 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [488627005] [2023-11-29 04:19:02,120 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:02,120 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:19:02,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:02,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:19:02,121 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:19:02,228 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2023-11-29 04:19:02,228 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 41 transitions, 100 flow. Second operand has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:02,228 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:02,228 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2023-11-29 04:19:02,228 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:02,360 INFO L124 PetriNetUnfolderBase]: 91/225 cut-off events. [2023-11-29 04:19:02,361 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-29 04:19:02,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 409 conditions, 225 events. 91/225 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 923 event pairs, 68 based on Foata normal form. 26/204 useless extension candidates. Maximal degree in co-relation 401. Up to 166 conditions per place. [2023-11-29 04:19:02,362 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 22 selfloop transitions, 1 changer transitions 0/39 dead transitions. [2023-11-29 04:19:02,362 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 46 places, 39 transitions, 142 flow [2023-11-29 04:19:02,363 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:19:02,363 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:19:02,363 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2023-11-29 04:19:02,363 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2023-11-29 04:19:02,363 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 92 transitions. [2023-11-29 04:19:02,363 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 92 transitions. [2023-11-29 04:19:02,364 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:02,364 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 92 transitions. [2023-11-29 04:19:02,364 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:02,365 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:02,365 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:02,365 INFO L175 Difference]: Start difference. First operand has 46 places, 41 transitions, 100 flow. Second operand 3 states and 92 transitions. [2023-11-29 04:19:02,365 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 46 places, 39 transitions, 142 flow [2023-11-29 04:19:02,366 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 39 transitions, 141 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:19:02,367 INFO L231 Difference]: Finished difference. Result has 45 places, 39 transitions, 97 flow [2023-11-29 04:19:02,367 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=95, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=39, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=38, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=97, PETRI_PLACES=45, PETRI_TRANSITIONS=39} [2023-11-29 04:19:02,368 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -4 predicate places. [2023-11-29 04:19:02,368 INFO L495 AbstractCegarLoop]: Abstraction has has 45 places, 39 transitions, 97 flow [2023-11-29 04:19:02,369 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 24.666666666666668) internal successors, (74), 3 states have internal predecessors, (74), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:02,369 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:02,369 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:02,371 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:19:02,570 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:02,570 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:02,571 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:02,571 INFO L85 PathProgramCache]: Analyzing trace with hash -1760413030, now seen corresponding path program 1 times [2023-11-29 04:19:02,571 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:02,571 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1242900130] [2023-11-29 04:19:02,571 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:19:02,571 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-29 04:19:02,571 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:02,572 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:02,573 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:02,669 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:02,672 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 04:19:02,674 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:02,688 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 04:19:02,688 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-29 04:19:02,710 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 04:19:02,711 INFO L378 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-29 04:19:02,727 INFO L349 Elim1Store]: treesize reduction 17, result has 29.2 percent of original size [2023-11-29 04:19:02,727 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 1 case distinctions, treesize of input 9 treesize of output 15 [2023-11-29 04:19:02,893 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:02,893 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:19:02,893 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:02,893 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1242900130] [2023-11-29 04:19:02,894 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1242900130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:19:02,894 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:19:02,894 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:19:02,894 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1315598257] [2023-11-29 04:19:02,894 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:02,894 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:19:02,895 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:02,895 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:19:02,895 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:19:02,957 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2023-11-29 04:19:02,957 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 45 places, 39 transitions, 97 flow. Second operand has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:02,957 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:02,958 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2023-11-29 04:19:02,958 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:03,084 INFO L124 PetriNetUnfolderBase]: 101/238 cut-off events. [2023-11-29 04:19:03,084 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-29 04:19:03,085 INFO L83 FinitePrefix]: Finished finitePrefix Result has 443 conditions, 238 events. 101/238 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 937 event pairs, 76 based on Foata normal form. 0/197 useless extension candidates. Maximal degree in co-relation 434. Up to 186 conditions per place. [2023-11-29 04:19:03,086 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 24 selfloop transitions, 1 changer transitions 0/37 dead transitions. [2023-11-29 04:19:03,087 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 45 places, 37 transitions, 143 flow [2023-11-29 04:19:03,087 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:19:03,087 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:19:03,088 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 88 transitions. [2023-11-29 04:19:03,088 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5866666666666667 [2023-11-29 04:19:03,088 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 88 transitions. [2023-11-29 04:19:03,089 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 88 transitions. [2023-11-29 04:19:03,089 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:03,089 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 88 transitions. [2023-11-29 04:19:03,089 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 29.333333333333332) internal successors, (88), 3 states have internal predecessors, (88), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:03,090 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:03,090 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:03,091 INFO L175 Difference]: Start difference. First operand has 45 places, 39 transitions, 97 flow. Second operand 3 states and 88 transitions. [2023-11-29 04:19:03,091 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 45 places, 37 transitions, 143 flow [2023-11-29 04:19:03,091 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 44 places, 37 transitions, 142 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:19:03,092 INFO L231 Difference]: Finished difference. Result has 44 places, 37 transitions, 94 flow [2023-11-29 04:19:03,093 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=92, PETRI_DIFFERENCE_MINUEND_PLACES=42, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=36, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=94, PETRI_PLACES=44, PETRI_TRANSITIONS=37} [2023-11-29 04:19:03,093 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -5 predicate places. [2023-11-29 04:19:03,094 INFO L495 AbstractCegarLoop]: Abstraction has has 44 places, 37 transitions, 94 flow [2023-11-29 04:19:03,094 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 23.333333333333332) internal successors, (70), 3 states have internal predecessors, (70), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:03,094 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:03,094 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:03,097 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:19:03,297 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:03,298 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:03,298 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:03,298 INFO L85 PathProgramCache]: Analyzing trace with hash -1760413029, now seen corresponding path program 1 times [2023-11-29 04:19:03,298 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:03,298 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1115282683] [2023-11-29 04:19:03,298 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:19:03,299 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-29 04:19:03,299 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:03,299 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:03,300 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:03,402 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:03,406 INFO L262 TraceCheckSpWp]: Trace formula consists of 98 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 04:19:03,408 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:03,425 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:03,427 INFO L378 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 5 [2023-11-29 04:19:03,431 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:03,435 INFO L378 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-29 04:19:03,445 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:03,447 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:03,449 INFO L378 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-29 04:19:03,453 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 04:19:03,510 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:03,510 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:19:03,510 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:03,510 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1115282683] [2023-11-29 04:19:03,510 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1115282683] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:19:03,510 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:19:03,510 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 04:19:03,511 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1108284632] [2023-11-29 04:19:03,511 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:03,511 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 04:19:03,511 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:03,512 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 04:19:03,512 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 04:19:03,588 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 23 out of 50 [2023-11-29 04:19:03,588 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 44 places, 37 transitions, 94 flow. Second operand has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:03,589 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:03,589 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 23 of 50 [2023-11-29 04:19:03,589 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:03,673 INFO L124 PetriNetUnfolderBase]: 91/215 cut-off events. [2023-11-29 04:19:03,674 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-29 04:19:03,674 INFO L83 FinitePrefix]: Finished finitePrefix Result has 401 conditions, 215 events. 91/215 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 23. Compared 844 event pairs, 68 based on Foata normal form. 9/187 useless extension candidates. Maximal degree in co-relation 391. Up to 166 conditions per place. [2023-11-29 04:19:03,675 INFO L140 encePairwiseOnDemand]: 47/50 looper letters, 22 selfloop transitions, 1 changer transitions 0/35 dead transitions. [2023-11-29 04:19:03,676 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 35 transitions, 136 flow [2023-11-29 04:19:03,676 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 04:19:03,676 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 3 states. [2023-11-29 04:19:03,677 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 3 states to 3 states and 92 transitions. [2023-11-29 04:19:03,677 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6133333333333333 [2023-11-29 04:19:03,677 INFO L72 ComplementDD]: Start complementDD. Operand 3 states and 92 transitions. [2023-11-29 04:19:03,677 INFO L73 IsDeterministic]: Start isDeterministic. Operand 3 states and 92 transitions. [2023-11-29 04:19:03,677 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:03,677 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 3 states and 92 transitions. [2023-11-29 04:19:03,678 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 4 states, 3 states have (on average 30.666666666666668) internal successors, (92), 3 states have internal predecessors, (92), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:03,678 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:03,679 INFO L81 ComplementDD]: Finished complementDD. Result has 4 states, 4 states have (on average 50.0) internal successors, (200), 4 states have internal predecessors, (200), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:03,679 INFO L175 Difference]: Start difference. First operand has 44 places, 37 transitions, 94 flow. Second operand 3 states and 92 transitions. [2023-11-29 04:19:03,679 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 35 transitions, 136 flow [2023-11-29 04:19:03,680 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 35 transitions, 135 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:19:03,680 INFO L231 Difference]: Finished difference. Result has 43 places, 35 transitions, 91 flow [2023-11-29 04:19:03,681 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=89, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=1, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=34, PETRI_DIFFERENCE_SUBTRAHEND_STATES=3, PETRI_FLOW=91, PETRI_PLACES=43, PETRI_TRANSITIONS=35} [2023-11-29 04:19:03,681 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -6 predicate places. [2023-11-29 04:19:03,681 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 35 transitions, 91 flow [2023-11-29 04:19:03,682 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 25.333333333333332) internal successors, (76), 3 states have internal predecessors, (76), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:03,682 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:03,682 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:03,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:19:03,882 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:03,882 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:03,883 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:03,883 INFO L85 PathProgramCache]: Analyzing trace with hash 461450114, now seen corresponding path program 1 times [2023-11-29 04:19:03,883 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:03,883 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [982038631] [2023-11-29 04:19:03,883 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:19:03,883 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-29 04:19:03,883 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:03,884 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:03,885 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:03,966 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:03,970 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:19:03,972 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:03,978 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 04:19:03,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:03,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 04:19:03,993 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:03,994 INFO L378 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-29 04:19:04,006 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:04,007 INFO L378 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-29 04:19:04,012 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:04,012 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 04:19:04,018 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:04,019 INFO L378 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-29 04:19:04,052 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:04,052 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:19:04,053 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:04,053 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [982038631] [2023-11-29 04:19:04,053 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [982038631] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:19:04,053 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:19:04,053 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 04:19:04,053 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1620797065] [2023-11-29 04:19:04,053 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:04,054 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 04:19:04,054 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:04,054 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 04:19:04,054 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 04:19:04,144 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 22 out of 50 [2023-11-29 04:19:04,145 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 35 transitions, 91 flow. Second operand has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:04,145 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:04,145 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 22 of 50 [2023-11-29 04:19:04,145 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:04,341 INFO L124 PetriNetUnfolderBase]: 91/203 cut-off events. [2023-11-29 04:19:04,342 INFO L125 PetriNetUnfolderBase]: For 5/5 co-relation queries the response was YES. [2023-11-29 04:19:04,342 INFO L83 FinitePrefix]: Finished finitePrefix Result has 390 conditions, 203 events. 91/203 cut-off events. For 5/5 co-relation queries the response was YES. Maximal size of possible extension queue 20. Compared 736 event pairs, 68 based on Foata normal form. 0/178 useless extension candidates. Maximal degree in co-relation 379. Up to 159 conditions per place. [2023-11-29 04:19:04,344 INFO L140 encePairwiseOnDemand]: 46/50 looper letters, 21 selfloop transitions, 2 changer transitions 0/33 dead transitions. [2023-11-29 04:19:04,344 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 44 places, 33 transitions, 133 flow [2023-11-29 04:19:04,344 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 04:19:04,344 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 4 states. [2023-11-29 04:19:04,345 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 4 states to 4 states and 111 transitions. [2023-11-29 04:19:04,345 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.555 [2023-11-29 04:19:04,345 INFO L72 ComplementDD]: Start complementDD. Operand 4 states and 111 transitions. [2023-11-29 04:19:04,345 INFO L73 IsDeterministic]: Start isDeterministic. Operand 4 states and 111 transitions. [2023-11-29 04:19:04,346 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:04,346 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 4 states and 111 transitions. [2023-11-29 04:19:04,346 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 5 states, 4 states have (on average 27.75) internal successors, (111), 4 states have internal predecessors, (111), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:04,347 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:04,347 INFO L81 ComplementDD]: Finished complementDD. Result has 5 states, 5 states have (on average 50.0) internal successors, (250), 5 states have internal predecessors, (250), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:04,347 INFO L175 Difference]: Start difference. First operand has 43 places, 35 transitions, 91 flow. Second operand 4 states and 111 transitions. [2023-11-29 04:19:04,347 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 44 places, 33 transitions, 133 flow [2023-11-29 04:19:04,348 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 43 places, 33 transitions, 132 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:19:04,349 INFO L231 Difference]: Finished difference. Result has 43 places, 33 transitions, 90 flow [2023-11-29 04:19:04,349 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=86, PETRI_DIFFERENCE_MINUEND_PLACES=40, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=4, PETRI_FLOW=90, PETRI_PLACES=43, PETRI_TRANSITIONS=33} [2023-11-29 04:19:04,350 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -6 predicate places. [2023-11-29 04:19:04,350 INFO L495 AbstractCegarLoop]: Abstraction has has 43 places, 33 transitions, 90 flow [2023-11-29 04:19:04,350 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 24.0) internal successors, (96), 4 states have internal predecessors, (96), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:04,350 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:04,350 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:04,353 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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)] Forceful destruction successful, exit code 0 [2023-11-29 04:19:04,551 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:04,551 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:04,551 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:04,551 INFO L85 PathProgramCache]: Analyzing trace with hash 461450115, now seen corresponding path program 1 times [2023-11-29 04:19:04,552 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:04,552 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [350433459] [2023-11-29 04:19:04,552 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:19:04,552 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-29 04:19:04,552 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:04,553 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:04,554 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:04,634 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:04,638 INFO L262 TraceCheckSpWp]: Trace formula consists of 104 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 04:19:04,640 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:04,647 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:19:04,656 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:04,656 INFO L378 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-29 04:19:04,664 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:04,665 INFO L378 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-29 04:19:04,678 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:04,678 INFO L378 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-29 04:19:04,685 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:04,686 INFO L378 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-29 04:19:04,690 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:04,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 04:19:04,776 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:04,776 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:19:04,776 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:04,776 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [350433459] [2023-11-29 04:19:04,776 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [350433459] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:19:04,777 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:19:04,777 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:19:04,777 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [749097623] [2023-11-29 04:19:04,777 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:04,777 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:19:04,777 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:04,778 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:19:04,778 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:19:04,908 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2023-11-29 04:19:04,909 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 43 places, 33 transitions, 90 flow. Second operand has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:04,909 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:04,909 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2023-11-29 04:19:04,909 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:05,129 INFO L124 PetriNetUnfolderBase]: 181/388 cut-off events. [2023-11-29 04:19:05,129 INFO L125 PetriNetUnfolderBase]: For 7/7 co-relation queries the response was YES. [2023-11-29 04:19:05,129 INFO L83 FinitePrefix]: Finished finitePrefix Result has 739 conditions, 388 events. 181/388 cut-off events. For 7/7 co-relation queries the response was YES. Maximal size of possible extension queue 31. Compared 1738 event pairs, 119 based on Foata normal form. 0/328 useless extension candidates. Maximal degree in co-relation 727. Up to 188 conditions per place. [2023-11-29 04:19:05,131 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 35 selfloop transitions, 4 changer transitions 0/48 dead transitions. [2023-11-29 04:19:05,131 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 47 places, 48 transitions, 201 flow [2023-11-29 04:19:05,132 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:19:05,132 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:19:05,132 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 158 transitions. [2023-11-29 04:19:05,133 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.632 [2023-11-29 04:19:05,133 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 158 transitions. [2023-11-29 04:19:05,133 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 158 transitions. [2023-11-29 04:19:05,133 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:05,133 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 158 transitions. [2023-11-29 04:19:05,134 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 31.6) internal successors, (158), 5 states have internal predecessors, (158), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:05,135 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:05,135 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:05,135 INFO L175 Difference]: Start difference. First operand has 43 places, 33 transitions, 90 flow. Second operand 5 states and 158 transitions. [2023-11-29 04:19:05,135 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 47 places, 48 transitions, 201 flow [2023-11-29 04:19:05,136 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 45 places, 48 transitions, 198 flow, removed 0 selfloop flow, removed 2 redundant places. [2023-11-29 04:19:05,137 INFO L231 Difference]: Finished difference. Result has 46 places, 34 transitions, 103 flow [2023-11-29 04:19:05,137 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=87, PETRI_DIFFERENCE_MINUEND_PLACES=41, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=33, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=103, PETRI_PLACES=46, PETRI_TRANSITIONS=34} [2023-11-29 04:19:05,138 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, -3 predicate places. [2023-11-29 04:19:05,138 INFO L495 AbstractCegarLoop]: Abstraction has has 46 places, 34 transitions, 103 flow [2023-11-29 04:19:05,138 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 25.6) internal successors, (128), 5 states have internal predecessors, (128), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:05,138 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:05,138 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:05,141 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:19:05,339 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:05,339 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:05,339 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:05,339 INFO L85 PathProgramCache]: Analyzing trace with hash -1129245317, now seen corresponding path program 1 times [2023-11-29 04:19:05,340 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:05,340 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [17681061] [2023-11-29 04:19:05,340 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:19:05,340 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-29 04:19:05,340 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:05,341 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:05,342 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:05,435 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:05,438 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 04:19:05,440 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:05,446 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:19:05,455 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:05,456 INFO L378 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-29 04:19:05,463 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:05,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 04:19:05,470 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:05,471 INFO L378 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-29 04:19:05,487 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:05,487 INFO L378 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-29 04:19:05,494 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:05,495 INFO L378 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-29 04:19:05,622 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:05,622 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:19:05,954 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:05,954 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:05,954 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [17681061] [2023-11-29 04:19:05,954 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [17681061] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:19:05,954 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:19:05,954 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2023-11-29 04:19:05,954 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1662238580] [2023-11-29 04:19:05,954 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:19:05,955 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:19:05,955 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:05,955 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:19:05,955 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:19:06,968 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2023-11-29 04:19:06,968 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 46 places, 34 transitions, 103 flow. Second operand has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:06,968 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:06,968 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2023-11-29 04:19:06,968 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:07,621 INFO L124 PetriNetUnfolderBase]: 327/684 cut-off events. [2023-11-29 04:19:07,622 INFO L125 PetriNetUnfolderBase]: For 47/47 co-relation queries the response was YES. [2023-11-29 04:19:07,622 INFO L83 FinitePrefix]: Finished finitePrefix Result has 1385 conditions, 684 events. 327/684 cut-off events. For 47/47 co-relation queries the response was YES. Maximal size of possible extension queue 38. Compared 3407 event pairs, 83 based on Foata normal form. 0/584 useless extension candidates. Maximal degree in co-relation 1372. Up to 188 conditions per place. [2023-11-29 04:19:07,625 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 63 selfloop transitions, 6 changer transitions 0/78 dead transitions. [2023-11-29 04:19:07,625 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 52 places, 78 transitions, 342 flow [2023-11-29 04:19:07,626 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:19:07,626 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:19:07,627 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 237 transitions. [2023-11-29 04:19:07,627 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6771428571428572 [2023-11-29 04:19:07,627 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 237 transitions. [2023-11-29 04:19:07,627 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 237 transitions. [2023-11-29 04:19:07,628 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:07,628 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 237 transitions. [2023-11-29 04:19:07,641 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.857142857142854) internal successors, (237), 7 states have internal predecessors, (237), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:07,642 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:07,642 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:07,642 INFO L175 Difference]: Start difference. First operand has 46 places, 34 transitions, 103 flow. Second operand 7 states and 237 transitions. [2023-11-29 04:19:07,642 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 52 places, 78 transitions, 342 flow [2023-11-29 04:19:07,643 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 49 places, 78 transitions, 336 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 04:19:07,645 INFO L231 Difference]: Finished difference. Result has 51 places, 36 transitions, 127 flow [2023-11-29 04:19:07,645 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=97, PETRI_DIFFERENCE_MINUEND_PLACES=43, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=34, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=127, PETRI_PLACES=51, PETRI_TRANSITIONS=36} [2023-11-29 04:19:07,646 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 2 predicate places. [2023-11-29 04:19:07,646 INFO L495 AbstractCegarLoop]: Abstraction has has 51 places, 36 transitions, 127 flow [2023-11-29 04:19:07,646 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.0) internal successors, (260), 10 states have internal predecessors, (260), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:07,646 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:07,646 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:07,650 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:19:07,847 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:07,847 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:07,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:07,847 INFO L85 PathProgramCache]: Analyzing trace with hash 695481595, now seen corresponding path program 1 times [2023-11-29 04:19:07,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:07,848 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [177620670] [2023-11-29 04:19:07,848 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:19:07,848 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-29 04:19:07,848 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:07,849 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:07,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:07,936 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:07,940 INFO L262 TraceCheckSpWp]: Trace formula consists of 121 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 04:19:07,942 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:07,948 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 5 [2023-11-29 04:19:07,954 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:07,954 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 04:19:07,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:07,961 INFO L378 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-29 04:19:07,972 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:07,972 INFO L378 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-29 04:19:07,977 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:07,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 04:19:07,983 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:07,984 INFO L378 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-29 04:19:08,082 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:08,082 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:19:08,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:08,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [177620670] [2023-11-29 04:19:08,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [177620670] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:19:08,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:19:08,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 04:19:08,083 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1081617317] [2023-11-29 04:19:08,083 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:08,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:19:08,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:08,084 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:19:08,084 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=8, Invalid=12, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:19:08,240 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2023-11-29 04:19:08,240 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 51 places, 36 transitions, 127 flow. Second operand has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:08,241 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:08,241 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2023-11-29 04:19:08,241 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:08,580 INFO L124 PetriNetUnfolderBase]: 585/1157 cut-off events. [2023-11-29 04:19:08,581 INFO L125 PetriNetUnfolderBase]: For 472/480 co-relation queries the response was YES. [2023-11-29 04:19:08,583 INFO L83 FinitePrefix]: Finished finitePrefix Result has 2513 conditions, 1157 events. 585/1157 cut-off events. For 472/480 co-relation queries the response was YES. Maximal size of possible extension queue 59. Compared 6406 event pairs, 313 based on Foata normal form. 0/954 useless extension candidates. Maximal degree in co-relation 2498. Up to 636 conditions per place. [2023-11-29 04:19:08,589 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 39 selfloop transitions, 4 changer transitions 0/52 dead transitions. [2023-11-29 04:19:08,590 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 55 places, 52 transitions, 271 flow [2023-11-29 04:19:08,590 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:19:08,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:19:08,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 156 transitions. [2023-11-29 04:19:08,591 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.624 [2023-11-29 04:19:08,591 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 156 transitions. [2023-11-29 04:19:08,592 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 156 transitions. [2023-11-29 04:19:08,592 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:08,592 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 156 transitions. [2023-11-29 04:19:08,593 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 31.2) internal successors, (156), 5 states have internal predecessors, (156), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:08,593 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:08,594 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:08,594 INFO L175 Difference]: Start difference. First operand has 51 places, 36 transitions, 127 flow. Second operand 5 states and 156 transitions. [2023-11-29 04:19:08,594 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 55 places, 52 transitions, 271 flow [2023-11-29 04:19:08,595 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 52 places, 52 transitions, 256 flow, removed 4 selfloop flow, removed 3 redundant places. [2023-11-29 04:19:08,596 INFO L231 Difference]: Finished difference. Result has 53 places, 37 transitions, 134 flow [2023-11-29 04:19:08,597 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=118, PETRI_DIFFERENCE_MINUEND_PLACES=48, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=3, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=134, PETRI_PLACES=53, PETRI_TRANSITIONS=37} [2023-11-29 04:19:08,597 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 4 predicate places. [2023-11-29 04:19:08,597 INFO L495 AbstractCegarLoop]: Abstraction has has 53 places, 37 transitions, 134 flow [2023-11-29 04:19:08,597 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 26.0) internal successors, (130), 5 states have internal predecessors, (130), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:08,598 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:08,598 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:08,600 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:19:08,798 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:08,798 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:08,799 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:08,799 INFO L85 PathProgramCache]: Analyzing trace with hash 170662892, now seen corresponding path program 1 times [2023-11-29 04:19:08,799 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:08,799 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1473668216] [2023-11-29 04:19:08,799 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:19:08,800 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-29 04:19:08,800 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:08,801 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:08,802 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:08,921 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:08,925 INFO L262 TraceCheckSpWp]: Trace formula consists of 132 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 04:19:08,927 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:08,944 INFO L378 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 5 [2023-11-29 04:19:08,955 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:08,956 INFO L378 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-29 04:19:08,961 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:08,962 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 04:19:08,969 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:08,970 INFO L378 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-29 04:19:08,976 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:08,977 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 04:19:08,984 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:08,985 INFO L378 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-29 04:19:09,135 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:09,135 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:19:09,496 INFO L134 CoverageAnalysis]: Checked inductivity of 12 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:09,496 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:09,496 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1473668216] [2023-11-29 04:19:09,496 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1473668216] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:19:09,496 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:19:09,496 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 8 [2023-11-29 04:19:09,496 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [73137596] [2023-11-29 04:19:09,496 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:19:09,497 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 10 states [2023-11-29 04:19:09,497 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:09,497 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 10 interpolants. [2023-11-29 04:19:09,498 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=27, Invalid=63, Unknown=0, NotChecked=0, Total=90 [2023-11-29 04:19:10,669 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2023-11-29 04:19:10,670 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 53 places, 37 transitions, 134 flow. Second operand has 10 states, 10 states have (on average 26.4) internal successors, (264), 10 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:10,670 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:10,670 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2023-11-29 04:19:10,670 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:11,533 INFO L124 PetriNetUnfolderBase]: 1025/2019 cut-off events. [2023-11-29 04:19:11,533 INFO L125 PetriNetUnfolderBase]: For 678/704 co-relation queries the response was YES. [2023-11-29 04:19:11,536 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4481 conditions, 2019 events. 1025/2019 cut-off events. For 678/704 co-relation queries the response was YES. Maximal size of possible extension queue 96. Compared 12335 event pairs, 305 based on Foata normal form. 0/1676 useless extension candidates. Maximal degree in co-relation 4465. Up to 636 conditions per place. [2023-11-29 04:19:11,547 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 69 selfloop transitions, 6 changer transitions 0/84 dead transitions. [2023-11-29 04:19:11,547 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 84 transitions, 442 flow [2023-11-29 04:19:11,548 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:19:11,548 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:19:11,549 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 231 transitions. [2023-11-29 04:19:11,549 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.66 [2023-11-29 04:19:11,550 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 231 transitions. [2023-11-29 04:19:11,550 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 231 transitions. [2023-11-29 04:19:11,550 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:11,550 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 231 transitions. [2023-11-29 04:19:11,551 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:11,552 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:11,552 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:11,552 INFO L175 Difference]: Start difference. First operand has 53 places, 37 transitions, 134 flow. Second operand 7 states and 231 transitions. [2023-11-29 04:19:11,553 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 84 transitions, 442 flow [2023-11-29 04:19:11,554 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 84 transitions, 436 flow, removed 0 selfloop flow, removed 3 redundant places. [2023-11-29 04:19:11,556 INFO L231 Difference]: Finished difference. Result has 58 places, 39 transitions, 158 flow [2023-11-29 04:19:11,556 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=128, PETRI_DIFFERENCE_MINUEND_PLACES=50, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=37, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=158, PETRI_PLACES=58, PETRI_TRANSITIONS=39} [2023-11-29 04:19:11,557 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2023-11-29 04:19:11,557 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 39 transitions, 158 flow [2023-11-29 04:19:11,557 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 10 states, 10 states have (on average 26.4) internal successors, (264), 10 states have internal predecessors, (264), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:11,557 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:11,557 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:11,561 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:19:11,758 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:11,758 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:11,758 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:11,758 INFO L85 PathProgramCache]: Analyzing trace with hash -798762885, now seen corresponding path program 2 times [2023-11-29 04:19:11,758 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:11,758 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1544947041] [2023-11-29 04:19:11,759 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:19:11,759 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-29 04:19:11,759 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:11,759 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:11,760 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:11,874 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:19:11,874 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:19:11,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 137 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 04:19:11,882 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:11,890 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:19:11,899 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:11,899 INFO L378 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-29 04:19:11,907 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:11,907 INFO L378 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-29 04:19:11,921 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:11,921 INFO L378 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-29 04:19:11,926 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:11,926 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 04:19:11,932 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:11,933 INFO L378 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-29 04:19:12,110 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:12,110 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:19:12,616 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:12,616 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:12,616 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1544947041] [2023-11-29 04:19:12,616 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1544947041] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:19:12,616 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:19:12,616 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2023-11-29 04:19:12,617 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [580392918] [2023-11-29 04:19:12,617 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:19:12,617 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 04:19:12,617 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:12,617 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 04:19:12,618 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:19:14,037 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2023-11-29 04:19:14,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 39 transitions, 158 flow. Second operand has 13 states, 13 states have (on average 26.153846153846153) internal successors, (340), 13 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:14,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:14,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2023-11-29 04:19:14,038 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:14,925 INFO L124 PetriNetUnfolderBase]: 881/1857 cut-off events. [2023-11-29 04:19:14,925 INFO L125 PetriNetUnfolderBase]: For 946/969 co-relation queries the response was YES. [2023-11-29 04:19:14,929 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4181 conditions, 1857 events. 881/1857 cut-off events. For 946/969 co-relation queries the response was YES. Maximal size of possible extension queue 90. Compared 11738 event pairs, 198 based on Foata normal form. 0/1604 useless extension candidates. Maximal degree in co-relation 4163. Up to 398 conditions per place. [2023-11-29 04:19:14,939 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 83 selfloop transitions, 6 changer transitions 0/98 dead transitions. [2023-11-29 04:19:14,940 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 98 transitions, 550 flow [2023-11-29 04:19:14,940 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:19:14,940 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:19:14,941 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 265 transitions. [2023-11-29 04:19:14,942 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6625 [2023-11-29 04:19:14,942 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 265 transitions. [2023-11-29 04:19:14,942 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 265 transitions. [2023-11-29 04:19:14,942 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:14,942 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 265 transitions. [2023-11-29 04:19:14,943 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 33.125) internal successors, (265), 8 states have internal predecessors, (265), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:14,945 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:14,945 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:14,945 INFO L175 Difference]: Start difference. First operand has 58 places, 39 transitions, 158 flow. Second operand 8 states and 265 transitions. [2023-11-29 04:19:14,945 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 98 transitions, 550 flow [2023-11-29 04:19:14,948 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 57 places, 98 transitions, 508 flow, removed 10 selfloop flow, removed 7 redundant places. [2023-11-29 04:19:14,949 INFO L231 Difference]: Finished difference. Result has 58 places, 37 transitions, 141 flow [2023-11-29 04:19:14,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=126, PETRI_DIFFERENCE_MINUEND_PLACES=50, 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=8, PETRI_FLOW=141, PETRI_PLACES=58, PETRI_TRANSITIONS=37} [2023-11-29 04:19:14,950 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 9 predicate places. [2023-11-29 04:19:14,950 INFO L495 AbstractCegarLoop]: Abstraction has has 58 places, 37 transitions, 141 flow [2023-11-29 04:19:14,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 26.153846153846153) internal successors, (340), 13 states have internal predecessors, (340), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:14,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:14,951 INFO L208 CegarLoopForPetriNet]: trace histogram [4, 4, 3, 3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:14,955 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:19:15,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:15,152 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting thread2Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:15,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:15,152 INFO L85 PathProgramCache]: Analyzing trace with hash -1535037044, now seen corresponding path program 2 times [2023-11-29 04:19:15,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:15,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [361691286] [2023-11-29 04:19:15,152 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:19:15,152 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-29 04:19:15,152 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:15,153 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:15,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:15,288 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:19:15,288 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:19:15,294 INFO L262 TraceCheckSpWp]: Trace formula consists of 154 conjuncts, 15 conjunts are in the unsatisfiable core [2023-11-29 04:19:15,296 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:15,301 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 5 [2023-11-29 04:19:15,309 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:15,310 INFO L378 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-29 04:19:15,317 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:15,317 INFO L378 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-29 04:19:15,330 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:15,331 INFO L378 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-29 04:19:15,337 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:15,338 INFO L378 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-29 04:19:15,342 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 04:19:15,342 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 1 [2023-11-29 04:19:15,528 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 3 proven. 15 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:15,529 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:19:16,058 INFO L134 CoverageAnalysis]: Checked inductivity of 27 backedges. 0 proven. 18 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:16,059 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:16,059 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [361691286] [2023-11-29 04:19:16,059 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [361691286] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:19:16,059 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:19:16,059 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 6] total 13 [2023-11-29 04:19:16,059 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [963703217] [2023-11-29 04:19:16,059 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:19:16,060 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 13 states [2023-11-29 04:19:16,060 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:16,061 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 13 interpolants. [2023-11-29 04:19:16,061 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=47, Invalid=109, Unknown=0, NotChecked=0, Total=156 [2023-11-29 04:19:17,654 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 24 out of 50 [2023-11-29 04:19:17,654 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 58 places, 37 transitions, 141 flow. Second operand has 13 states, 13 states have (on average 26.46153846153846) internal successors, (344), 13 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:17,654 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:17,654 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 24 of 50 [2023-11-29 04:19:17,654 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:18,506 INFO L124 PetriNetUnfolderBase]: 795/1637 cut-off events. [2023-11-29 04:19:18,506 INFO L125 PetriNetUnfolderBase]: For 749/749 co-relation queries the response was YES. [2023-11-29 04:19:18,508 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3712 conditions, 1637 events. 795/1637 cut-off events. For 749/749 co-relation queries the response was YES. Maximal size of possible extension queue 80. Compared 9854 event pairs, 45 based on Foata normal form. 0/1527 useless extension candidates. Maximal degree in co-relation 3696. Up to 352 conditions per place. [2023-11-29 04:19:18,515 INFO L140 encePairwiseOnDemand]: 45/50 looper letters, 71 selfloop transitions, 6 changer transitions 0/85 dead transitions. [2023-11-29 04:19:18,515 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 64 places, 85 transitions, 456 flow [2023-11-29 04:19:18,516 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 04:19:18,516 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 8 states. [2023-11-29 04:19:18,517 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 8 states to 8 states and 258 transitions. [2023-11-29 04:19:18,517 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.645 [2023-11-29 04:19:18,517 INFO L72 ComplementDD]: Start complementDD. Operand 8 states and 258 transitions. [2023-11-29 04:19:18,518 INFO L73 IsDeterministic]: Start isDeterministic. Operand 8 states and 258 transitions. [2023-11-29 04:19:18,518 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:18,518 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 8 states and 258 transitions. [2023-11-29 04:19:18,519 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 9 states, 8 states have (on average 32.25) internal successors, (258), 8 states have internal predecessors, (258), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:18,520 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:18,520 INFO L81 ComplementDD]: Finished complementDD. Result has 9 states, 9 states have (on average 50.0) internal successors, (450), 9 states have internal predecessors, (450), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:18,520 INFO L175 Difference]: Start difference. First operand has 58 places, 37 transitions, 141 flow. Second operand 8 states and 258 transitions. [2023-11-29 04:19:18,521 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 64 places, 85 transitions, 456 flow [2023-11-29 04:19:18,523 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 54 places, 85 transitions, 408 flow, removed 0 selfloop flow, removed 10 redundant places. [2023-11-29 04:19:18,524 INFO L231 Difference]: Finished difference. Result has 55 places, 35 transitions, 122 flow [2023-11-29 04:19:18,524 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=107, PETRI_DIFFERENCE_MINUEND_PLACES=47, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=6, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=29, PETRI_DIFFERENCE_SUBTRAHEND_STATES=8, PETRI_FLOW=122, PETRI_PLACES=55, PETRI_TRANSITIONS=35} [2023-11-29 04:19:18,525 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 6 predicate places. [2023-11-29 04:19:18,525 INFO L495 AbstractCegarLoop]: Abstraction has has 55 places, 35 transitions, 122 flow [2023-11-29 04:19:18,525 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 13 states, 13 states have (on average 26.46153846153846) internal successors, (344), 13 states have internal predecessors, (344), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:18,525 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:18,526 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:18,529 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:19:18,726 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:18,726 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:18,726 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:18,727 INFO L85 PathProgramCache]: Analyzing trace with hash -66329587, now seen corresponding path program 1 times [2023-11-29 04:19:18,727 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:18,727 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [440818653] [2023-11-29 04:19:18,727 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:19:18,727 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-29 04:19:18,727 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:18,728 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:18,729 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:18,841 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:18,846 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 04:19:18,849 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:19,110 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:19,111 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:19:19,111 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:19,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [440818653] [2023-11-29 04:19:19,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [440818653] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:19:19,111 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:19:19,112 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:19:19,112 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1284676562] [2023-11-29 04:19:19,112 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:19,112 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:19:19,113 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:19,113 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:19:19,113 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:19:19,124 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 04:19:19,124 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 55 places, 35 transitions, 122 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:19,124 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:19,124 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 04:19:19,124 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:19,597 INFO L124 PetriNetUnfolderBase]: 798/1732 cut-off events. [2023-11-29 04:19:19,597 INFO L125 PetriNetUnfolderBase]: For 635/637 co-relation queries the response was YES. [2023-11-29 04:19:19,599 INFO L83 FinitePrefix]: Finished finitePrefix Result has 3823 conditions, 1732 events. 798/1732 cut-off events. For 635/637 co-relation queries the response was YES. Maximal size of possible extension queue 86. Compared 11151 event pairs, 655 based on Foata normal form. 5/1735 useless extension candidates. Maximal degree in co-relation 3809. Up to 1077 conditions per place. [2023-11-29 04:19:19,608 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 47 selfloop transitions, 3 changer transitions 8/66 dead transitions. [2023-11-29 04:19:19,608 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 66 transitions, 342 flow [2023-11-29 04:19:19,609 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:19:19,609 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:19:19,609 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2023-11-29 04:19:19,610 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.704 [2023-11-29 04:19:19,610 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 176 transitions. [2023-11-29 04:19:19,610 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 176 transitions. [2023-11-29 04:19:19,610 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:19,610 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 176 transitions. [2023-11-29 04:19:19,611 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:19,612 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:19,612 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:19,612 INFO L175 Difference]: Start difference. First operand has 55 places, 35 transitions, 122 flow. Second operand 5 states and 176 transitions. [2023-11-29 04:19:19,612 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 66 transitions, 342 flow [2023-11-29 04:19:19,614 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 53 places, 66 transitions, 317 flow, removed 0 selfloop flow, removed 6 redundant places. [2023-11-29 04:19:19,615 INFO L231 Difference]: Finished difference. Result has 56 places, 36 transitions, 131 flow [2023-11-29 04:19:19,615 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=111, PETRI_DIFFERENCE_MINUEND_PLACES=49, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=35, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=32, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=131, PETRI_PLACES=56, PETRI_TRANSITIONS=36} [2023-11-29 04:19:19,615 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 7 predicate places. [2023-11-29 04:19:19,616 INFO L495 AbstractCegarLoop]: Abstraction has has 56 places, 36 transitions, 131 flow [2023-11-29 04:19:19,616 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:19,616 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:19,616 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:19,620 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:19,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:19,817 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:19,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:19,817 INFO L85 PathProgramCache]: Analyzing trace with hash -1509560097, now seen corresponding path program 2 times [2023-11-29 04:19:19,817 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:19,817 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1490207998] [2023-11-29 04:19:19,817 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:19:19,817 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-29 04:19:19,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:19,818 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:19,819 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:19,925 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 1 check-sat command(s) [2023-11-29 04:19:19,925 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:19:19,929 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 04:19:19,932 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:20,351 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:20,352 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:19:20,352 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:20,352 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1490207998] [2023-11-29 04:19:20,352 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1490207998] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:19:20,352 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:19:20,352 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:19:20,352 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2006756573] [2023-11-29 04:19:20,353 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:20,353 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:19:20,353 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:20,354 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:19:20,354 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:19:20,374 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 04:19:20,374 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 56 places, 36 transitions, 131 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:20,374 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:20,374 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 04:19:20,374 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:20,981 INFO L124 PetriNetUnfolderBase]: 842/1817 cut-off events. [2023-11-29 04:19:20,982 INFO L125 PetriNetUnfolderBase]: For 974/975 co-relation queries the response was YES. [2023-11-29 04:19:20,984 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4371 conditions, 1817 events. 842/1817 cut-off events. For 974/975 co-relation queries the response was YES. Maximal size of possible extension queue 84. Compared 11818 event pairs, 594 based on Foata normal form. 4/1821 useless extension candidates. Maximal degree in co-relation 4355. Up to 1085 conditions per place. [2023-11-29 04:19:20,991 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 48 selfloop transitions, 7 changer transitions 4/67 dead transitions. [2023-11-29 04:19:20,991 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 59 places, 67 transitions, 361 flow [2023-11-29 04:19:20,991 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:19:20,991 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:19:20,992 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 179 transitions. [2023-11-29 04:19:20,992 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.716 [2023-11-29 04:19:20,992 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 179 transitions. [2023-11-29 04:19:20,992 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 179 transitions. [2023-11-29 04:19:20,992 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:20,993 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 179 transitions. [2023-11-29 04:19:20,993 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.8) internal successors, (179), 5 states have internal predecessors, (179), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:20,994 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:20,994 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:20,994 INFO L175 Difference]: Start difference. First operand has 56 places, 36 transitions, 131 flow. Second operand 5 states and 179 transitions. [2023-11-29 04:19:20,994 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 59 places, 67 transitions, 361 flow [2023-11-29 04:19:20,997 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 56 places, 67 transitions, 343 flow, removed 5 selfloop flow, removed 3 redundant places. [2023-11-29 04:19:20,998 INFO L231 Difference]: Finished difference. Result has 59 places, 41 transitions, 178 flow [2023-11-29 04:19:20,998 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=123, PETRI_DIFFERENCE_MINUEND_PLACES=52, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=36, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=2, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=178, PETRI_PLACES=59, PETRI_TRANSITIONS=41} [2023-11-29 04:19:20,998 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 10 predicate places. [2023-11-29 04:19:20,999 INFO L495 AbstractCegarLoop]: Abstraction has has 59 places, 41 transitions, 178 flow [2023-11-29 04:19:20,999 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:20,999 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:20,999 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:21,003 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:21,199 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:21,200 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:21,200 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:21,200 INFO L85 PathProgramCache]: Analyzing trace with hash 1245444153, now seen corresponding path program 3 times [2023-11-29 04:19:21,200 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:21,200 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1049878588] [2023-11-29 04:19:21,200 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:19:21,200 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-29 04:19:21,200 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:21,201 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:21,202 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:21,307 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 1 check-sat command(s) [2023-11-29 04:19:21,308 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:19:21,312 INFO L262 TraceCheckSpWp]: Trace formula consists of 117 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 04:19:21,315 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:21,491 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:21,491 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:19:21,491 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:21,491 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1049878588] [2023-11-29 04:19:21,492 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1049878588] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:19:21,492 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:19:21,492 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:19:21,492 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [474827416] [2023-11-29 04:19:21,492 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:21,492 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:19:21,493 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:21,493 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:19:21,493 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:19:21,511 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 04:19:21,511 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 59 places, 41 transitions, 178 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:21,512 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:21,512 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 04:19:21,512 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:22,037 INFO L124 PetriNetUnfolderBase]: 843/1771 cut-off events. [2023-11-29 04:19:22,038 INFO L125 PetriNetUnfolderBase]: For 1350/1357 co-relation queries the response was YES. [2023-11-29 04:19:22,040 INFO L83 FinitePrefix]: Finished finitePrefix Result has 4628 conditions, 1771 events. 843/1771 cut-off events. For 1350/1357 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 11273 event pairs, 610 based on Foata normal form. 6/1772 useless extension candidates. Maximal degree in co-relation 4610. Up to 1101 conditions per place. [2023-11-29 04:19:22,047 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 51 selfloop transitions, 6 changer transitions 6/71 dead transitions. [2023-11-29 04:19:22,048 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 63 places, 71 transitions, 431 flow [2023-11-29 04:19:22,048 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:19:22,048 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:19:22,049 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2023-11-29 04:19:22,049 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.692 [2023-11-29 04:19:22,049 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 173 transitions. [2023-11-29 04:19:22,049 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 173 transitions. [2023-11-29 04:19:22,049 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:22,050 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 173 transitions. [2023-11-29 04:19:22,050 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:22,051 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:22,051 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:22,051 INFO L175 Difference]: Start difference. First operand has 59 places, 41 transitions, 178 flow. Second operand 5 states and 173 transitions. [2023-11-29 04:19:22,051 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 63 places, 71 transitions, 431 flow [2023-11-29 04:19:22,053 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 62 places, 71 transitions, 423 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:19:22,054 INFO L231 Difference]: Finished difference. Result has 65 places, 42 transitions, 206 flow [2023-11-29 04:19:22,054 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=174, PETRI_DIFFERENCE_MINUEND_PLACES=58, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=41, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=5, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=206, PETRI_PLACES=65, PETRI_TRANSITIONS=42} [2023-11-29 04:19:22,055 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 16 predicate places. [2023-11-29 04:19:22,055 INFO L495 AbstractCegarLoop]: Abstraction has has 65 places, 42 transitions, 206 flow [2023-11-29 04:19:22,055 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:22,055 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:22,055 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:22,059 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:19:22,255 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:22,256 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:22,256 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:22,256 INFO L85 PathProgramCache]: Analyzing trace with hash 1839628099, now seen corresponding path program 4 times [2023-11-29 04:19:22,256 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:22,256 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1319327693] [2023-11-29 04:19:22,256 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:19:22,257 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-29 04:19:22,257 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:22,258 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:22,258 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:22,369 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:19:22,369 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:19:22,374 INFO L262 TraceCheckSpWp]: Trace formula consists of 153 conjuncts, 9 conjunts are in the unsatisfiable core [2023-11-29 04:19:22,377 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:22,730 INFO L134 CoverageAnalysis]: Checked inductivity of 9 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:22,730 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:19:22,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:22,731 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1319327693] [2023-11-29 04:19:22,731 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1319327693] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:19:22,731 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:19:22,731 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 04:19:22,731 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [105408612] [2023-11-29 04:19:22,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:22,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 04:19:22,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:22,732 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 04:19:22,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=18, Unknown=0, NotChecked=0, Total=30 [2023-11-29 04:19:22,747 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 04:19:22,748 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 65 places, 42 transitions, 206 flow. Second operand has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:22,748 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:22,748 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 04:19:22,748 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:23,359 INFO L124 PetriNetUnfolderBase]: 837/1746 cut-off events. [2023-11-29 04:19:23,359 INFO L125 PetriNetUnfolderBase]: For 2311/2315 co-relation queries the response was YES. [2023-11-29 04:19:23,361 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5013 conditions, 1746 events. 837/1746 cut-off events. For 2311/2315 co-relation queries the response was YES. Maximal size of possible extension queue 83. Compared 10997 event pairs, 599 based on Foata normal form. 4/1744 useless extension candidates. Maximal degree in co-relation 4992. Up to 1101 conditions per place. [2023-11-29 04:19:23,368 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 50 selfloop transitions, 9 changer transitions 3/70 dead transitions. [2023-11-29 04:19:23,368 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 68 places, 70 transitions, 462 flow [2023-11-29 04:19:23,369 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:19:23,369 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:19:23,369 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 176 transitions. [2023-11-29 04:19:23,369 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.704 [2023-11-29 04:19:23,369 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 176 transitions. [2023-11-29 04:19:23,369 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 176 transitions. [2023-11-29 04:19:23,370 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:23,370 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 176 transitions. [2023-11-29 04:19:23,370 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.2) internal successors, (176), 5 states have internal predecessors, (176), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:23,371 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:23,371 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:23,371 INFO L175 Difference]: Start difference. First operand has 65 places, 42 transitions, 206 flow. Second operand 5 states and 176 transitions. [2023-11-29 04:19:23,371 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 68 places, 70 transitions, 462 flow [2023-11-29 04:19:23,377 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 65 places, 70 transitions, 438 flow, removed 6 selfloop flow, removed 3 redundant places. [2023-11-29 04:19:23,378 INFO L231 Difference]: Finished difference. Result has 68 places, 47 transitions, 267 flow [2023-11-29 04:19:23,378 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=192, PETRI_DIFFERENCE_MINUEND_PLACES=61, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=42, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=4, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=267, PETRI_PLACES=68, PETRI_TRANSITIONS=47} [2023-11-29 04:19:23,379 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 19 predicate places. [2023-11-29 04:19:23,379 INFO L495 AbstractCegarLoop]: Abstraction has has 68 places, 47 transitions, 267 flow [2023-11-29 04:19:23,379 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 6 states have (on average 27.833333333333332) internal successors, (167), 6 states have internal predecessors, (167), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:23,379 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:23,379 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:23,383 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:19:23,580 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:23,580 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:23,580 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:23,580 INFO L85 PathProgramCache]: Analyzing trace with hash -676238563, now seen corresponding path program 1 times [2023-11-29 04:19:23,580 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:23,581 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1175024309] [2023-11-29 04:19:23,581 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:19:23,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-29 04:19:23,581 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:23,582 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:23,583 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:23,719 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:23,726 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:19:23,727 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:23,806 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:23,806 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:19:23,875 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:23,875 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:23,876 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1175024309] [2023-11-29 04:19:23,876 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1175024309] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 04:19:23,876 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:19:23,876 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-29 04:19:23,876 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [206977410] [2023-11-29 04:19:23,876 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:23,876 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:19:23,877 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:23,877 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:19:23,877 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:19:23,889 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 04:19:23,890 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 68 places, 47 transitions, 267 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:23,890 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:23,890 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 04:19:23,891 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:24,483 INFO L124 PetriNetUnfolderBase]: 911/1924 cut-off events. [2023-11-29 04:19:24,483 INFO L125 PetriNetUnfolderBase]: For 2693/2693 co-relation queries the response was YES. [2023-11-29 04:19:24,486 INFO L83 FinitePrefix]: Finished finitePrefix Result has 5496 conditions, 1924 events. 911/1924 cut-off events. For 2693/2693 co-relation queries the response was YES. Maximal size of possible extension queue 94. Compared 12338 event pairs, 52 based on Foata normal form. 27/1947 useless extension candidates. Maximal degree in co-relation 5473. Up to 895 conditions per place. [2023-11-29 04:19:24,490 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 61 selfloop transitions, 24 changer transitions 4/97 dead transitions. [2023-11-29 04:19:24,490 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 74 places, 97 transitions, 719 flow [2023-11-29 04:19:24,491 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:19:24,491 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:19:24,492 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 234 transitions. [2023-11-29 04:19:24,492 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6685714285714286 [2023-11-29 04:19:24,492 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 234 transitions. [2023-11-29 04:19:24,492 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 234 transitions. [2023-11-29 04:19:24,492 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:24,492 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 234 transitions. [2023-11-29 04:19:24,493 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.42857142857143) internal successors, (234), 7 states have internal predecessors, (234), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:24,493 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:24,494 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:24,494 INFO L175 Difference]: Start difference. First operand has 68 places, 47 transitions, 267 flow. Second operand 7 states and 234 transitions. [2023-11-29 04:19:24,494 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 74 places, 97 transitions, 719 flow [2023-11-29 04:19:24,498 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 73 places, 97 transitions, 708 flow, removed 0 selfloop flow, removed 1 redundant places. [2023-11-29 04:19:24,499 INFO L231 Difference]: Finished difference. Result has 77 places, 63 transitions, 480 flow [2023-11-29 04:19:24,499 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=261, PETRI_DIFFERENCE_MINUEND_PLACES=67, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=47, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=9, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=35, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=480, PETRI_PLACES=77, PETRI_TRANSITIONS=63} [2023-11-29 04:19:24,500 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 28 predicate places. [2023-11-29 04:19:24,500 INFO L495 AbstractCegarLoop]: Abstraction has has 77 places, 63 transitions, 480 flow [2023-11-29 04:19:24,500 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:24,500 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:24,500 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:24,504 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:24,700 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:24,701 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:24,701 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:24,701 INFO L85 PathProgramCache]: Analyzing trace with hash -1971327015, now seen corresponding path program 2 times [2023-11-29 04:19:24,701 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:24,701 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1360818146] [2023-11-29 04:19:24,701 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:19:24,701 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-29 04:19:24,702 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:24,702 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:24,703 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:24,893 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:19:24,894 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:19:24,901 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:19:24,902 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:25,026 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:25,026 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:19:25,110 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 1 proven. 1 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:25,110 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:25,111 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1360818146] [2023-11-29 04:19:25,111 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1360818146] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:19:25,111 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:19:25,111 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 8 [2023-11-29 04:19:25,111 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2024014926] [2023-11-29 04:19:25,111 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:19:25,111 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 04:19:25,112 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:25,112 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 04:19:25,112 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:19:25,136 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 04:19:25,136 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 77 places, 63 transitions, 480 flow. Second operand has 8 states, 8 states have (on average 28.375) internal successors, (227), 8 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:25,136 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:25,136 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 04:19:25,137 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:25,924 INFO L124 PetriNetUnfolderBase]: 1058/2235 cut-off events. [2023-11-29 04:19:25,924 INFO L125 PetriNetUnfolderBase]: For 6133/6136 co-relation queries the response was YES. [2023-11-29 04:19:25,928 INFO L83 FinitePrefix]: Finished finitePrefix Result has 7266 conditions, 2235 events. 1058/2235 cut-off events. For 6133/6136 co-relation queries the response was YES. Maximal size of possible extension queue 124. Compared 14968 event pairs, 171 based on Foata normal form. 27/2252 useless extension candidates. Maximal degree in co-relation 7239. Up to 702 conditions per place. [2023-11-29 04:19:25,934 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 68 selfloop transitions, 52 changer transitions 10/138 dead transitions. [2023-11-29 04:19:25,934 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 87 places, 138 transitions, 1136 flow [2023-11-29 04:19:25,934 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 04:19:25,934 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 11 states. [2023-11-29 04:19:25,935 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 11 states to 11 states and 371 transitions. [2023-11-29 04:19:25,936 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6745454545454546 [2023-11-29 04:19:25,936 INFO L72 ComplementDD]: Start complementDD. Operand 11 states and 371 transitions. [2023-11-29 04:19:25,936 INFO L73 IsDeterministic]: Start isDeterministic. Operand 11 states and 371 transitions. [2023-11-29 04:19:25,936 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:25,936 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 11 states and 371 transitions. [2023-11-29 04:19:25,937 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 12 states, 11 states have (on average 33.72727272727273) internal successors, (371), 11 states have internal predecessors, (371), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:25,938 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 12 states, 12 states have (on average 50.0) internal successors, (600), 12 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:25,938 INFO L81 ComplementDD]: Finished complementDD. Result has 12 states, 12 states have (on average 50.0) internal successors, (600), 12 states have internal predecessors, (600), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:25,938 INFO L175 Difference]: Start difference. First operand has 77 places, 63 transitions, 480 flow. Second operand 11 states and 371 transitions. [2023-11-29 04:19:25,938 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 87 places, 138 transitions, 1136 flow [2023-11-29 04:19:25,949 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 87 places, 138 transitions, 1094 flow, removed 21 selfloop flow, removed 0 redundant places. [2023-11-29 04:19:25,950 INFO L231 Difference]: Finished difference. Result has 93 places, 85 transitions, 819 flow [2023-11-29 04:19:25,950 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=451, PETRI_DIFFERENCE_MINUEND_PLACES=77, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=62, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=28, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=31, PETRI_DIFFERENCE_SUBTRAHEND_STATES=11, PETRI_FLOW=819, PETRI_PLACES=93, PETRI_TRANSITIONS=85} [2023-11-29 04:19:25,951 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 44 predicate places. [2023-11-29 04:19:25,951 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 85 transitions, 819 flow [2023-11-29 04:19:25,951 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 28.375) internal successors, (227), 8 states have internal predecessors, (227), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:25,951 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:25,951 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:25,954 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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)] Ended with exit code 0 [2023-11-29 04:19:26,151 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:26,152 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:26,152 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:26,152 INFO L85 PathProgramCache]: Analyzing trace with hash 787285772, now seen corresponding path program 1 times [2023-11-29 04:19:26,152 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:26,152 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [250991875] [2023-11-29 04:19:26,152 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:19:26,153 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-29 04:19:26,153 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:26,153 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:26,154 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (25)] Waiting until timeout for monitored process [2023-11-29 04:19:26,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:26,301 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:19:26,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:26,458 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:26,458 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:19:26,553 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:26,553 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:26,553 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [250991875] [2023-11-29 04:19:26,553 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [250991875] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 04:19:26,554 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:19:26,554 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-11-29 04:19:26,554 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1730348234] [2023-11-29 04:19:26,554 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:26,554 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:19:26,554 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:26,555 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:19:26,555 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:19:26,567 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 04:19:26,567 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 85 transitions, 819 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:26,567 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:26,567 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 04:19:26,567 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:27,150 INFO L124 PetriNetUnfolderBase]: 1129/2421 cut-off events. [2023-11-29 04:19:27,151 INFO L125 PetriNetUnfolderBase]: For 9758/9774 co-relation queries the response was YES. [2023-11-29 04:19:27,155 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8788 conditions, 2421 events. 1129/2421 cut-off events. For 9758/9774 co-relation queries the response was YES. Maximal size of possible extension queue 142. Compared 16935 event pairs, 503 based on Foata normal form. 40/2456 useless extension candidates. Maximal degree in co-relation 8754. Up to 1236 conditions per place. [2023-11-29 04:19:27,162 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 80 selfloop transitions, 27 changer transitions 2/117 dead transitions. [2023-11-29 04:19:27,162 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 96 places, 117 transitions, 1210 flow [2023-11-29 04:19:27,162 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:19:27,163 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:19:27,163 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 181 transitions. [2023-11-29 04:19:27,163 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.724 [2023-11-29 04:19:27,163 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 181 transitions. [2023-11-29 04:19:27,163 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 181 transitions. [2023-11-29 04:19:27,163 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:27,163 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 181 transitions. [2023-11-29 04:19:27,164 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 36.2) internal successors, (181), 5 states have internal predecessors, (181), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:27,164 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:27,164 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:27,164 INFO L175 Difference]: Start difference. First operand has 93 places, 85 transitions, 819 flow. Second operand 5 states and 181 transitions. [2023-11-29 04:19:27,164 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 96 places, 117 transitions, 1210 flow [2023-11-29 04:19:27,185 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 91 places, 117 transitions, 1113 flow, removed 28 selfloop flow, removed 5 redundant places. [2023-11-29 04:19:27,186 INFO L231 Difference]: Finished difference. Result has 93 places, 87 transitions, 837 flow [2023-11-29 04:19:27,187 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=736, PETRI_DIFFERENCE_MINUEND_PLACES=87, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=85, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=25, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=58, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=837, PETRI_PLACES=93, PETRI_TRANSITIONS=87} [2023-11-29 04:19:27,187 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 44 predicate places. [2023-11-29 04:19:27,187 INFO L495 AbstractCegarLoop]: Abstraction has has 93 places, 87 transitions, 837 flow [2023-11-29 04:19:27,187 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:27,187 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:27,188 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:27,192 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (25)] Ended with exit code 0 [2023-11-29 04:19:27,388 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:27,388 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:27,388 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:27,388 INFO L85 PathProgramCache]: Analyzing trace with hash -449756110, now seen corresponding path program 2 times [2023-11-29 04:19:27,389 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:27,389 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [938203950] [2023-11-29 04:19:27,389 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:19:27,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-29 04:19:27,389 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:27,390 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:27,391 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (26)] Waiting until timeout for monitored process [2023-11-29 04:19:27,538 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:19:27,539 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:19:27,545 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:19:27,546 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:27,721 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:27,721 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:19:27,721 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:27,721 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [938203950] [2023-11-29 04:19:27,722 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [938203950] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:19:27,722 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:19:27,722 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:19:27,722 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1267823624] [2023-11-29 04:19:27,722 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:27,722 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:19:27,723 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:27,723 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:19:27,723 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:19:27,739 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 04:19:27,739 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 93 places, 87 transitions, 837 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:27,739 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:27,739 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 04:19:27,739 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:28,313 INFO L124 PetriNetUnfolderBase]: 1105/2339 cut-off events. [2023-11-29 04:19:28,313 INFO L125 PetriNetUnfolderBase]: For 8743/8751 co-relation queries the response was YES. [2023-11-29 04:19:28,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8478 conditions, 2339 events. 1105/2339 cut-off events. For 8743/8751 co-relation queries the response was YES. Maximal size of possible extension queue 135. Compared 16056 event pairs, 641 based on Foata normal form. 11/2348 useless extension candidates. Maximal degree in co-relation 8445. Up to 1466 conditions per place. [2023-11-29 04:19:28,325 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 82 selfloop transitions, 14 changer transitions 6/110 dead transitions. [2023-11-29 04:19:28,325 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 97 places, 110 transitions, 1168 flow [2023-11-29 04:19:28,325 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:19:28,326 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:19:28,326 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2023-11-29 04:19:28,326 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.692 [2023-11-29 04:19:28,326 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 173 transitions. [2023-11-29 04:19:28,327 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 173 transitions. [2023-11-29 04:19:28,327 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:28,327 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 173 transitions. [2023-11-29 04:19:28,327 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:28,328 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:28,328 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:28,328 INFO L175 Difference]: Start difference. First operand has 93 places, 87 transitions, 837 flow. Second operand 5 states and 173 transitions. [2023-11-29 04:19:28,328 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 97 places, 110 transitions, 1168 flow [2023-11-29 04:19:28,354 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 95 places, 110 transitions, 1120 flow, removed 2 selfloop flow, removed 2 redundant places. [2023-11-29 04:19:28,357 INFO L231 Difference]: Finished difference. Result has 97 places, 87 transitions, 827 flow [2023-11-29 04:19:28,357 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=789, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=14, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=73, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=827, PETRI_PLACES=97, PETRI_TRANSITIONS=87} [2023-11-29 04:19:28,357 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 48 predicate places. [2023-11-29 04:19:28,357 INFO L495 AbstractCegarLoop]: Abstraction has has 97 places, 87 transitions, 827 flow [2023-11-29 04:19:28,358 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:28,358 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:28,358 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:28,361 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (26)] Forceful destruction successful, exit code 0 [2023-11-29 04:19:28,558 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:28,558 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:28,558 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:28,559 INFO L85 PathProgramCache]: Analyzing trace with hash 472714364, now seen corresponding path program 3 times [2023-11-29 04:19:28,559 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:28,559 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1475644191] [2023-11-29 04:19:28,559 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:19:28,559 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-29 04:19:28,559 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:28,560 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:28,561 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (27)] Waiting until timeout for monitored process [2023-11-29 04:19:28,706 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 04:19:28,706 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:19:28,711 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:19:28,713 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:28,767 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:28,768 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:19:28,814 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:28,814 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:28,814 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1475644191] [2023-11-29 04:19:28,814 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1475644191] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 04:19:28,814 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:19:28,814 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 7 [2023-11-29 04:19:28,815 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1304918552] [2023-11-29 04:19:28,815 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:28,815 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:19:28,815 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:28,815 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:19:28,815 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=28, Unknown=0, NotChecked=0, Total=42 [2023-11-29 04:19:28,830 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 04:19:28,831 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 97 places, 87 transitions, 827 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:28,831 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:28,831 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 04:19:28,831 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:29,470 INFO L124 PetriNetUnfolderBase]: 1168/2414 cut-off events. [2023-11-29 04:19:29,471 INFO L125 PetriNetUnfolderBase]: For 9088/9088 co-relation queries the response was YES. [2023-11-29 04:19:29,477 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8616 conditions, 2414 events. 1168/2414 cut-off events. For 9088/9088 co-relation queries the response was YES. Maximal size of possible extension queue 143. Compared 16455 event pairs, 159 based on Foata normal form. 24/2431 useless extension candidates. Maximal degree in co-relation 8581. Up to 1052 conditions per place. [2023-11-29 04:19:29,485 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 70 selfloop transitions, 58 changer transitions 3/139 dead transitions. [2023-11-29 04:19:29,485 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 102 places, 139 transitions, 1471 flow [2023-11-29 04:19:29,486 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 04:19:29,486 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 7 states. [2023-11-29 04:19:29,487 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 7 states to 7 states and 231 transitions. [2023-11-29 04:19:29,487 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.66 [2023-11-29 04:19:29,487 INFO L72 ComplementDD]: Start complementDD. Operand 7 states and 231 transitions. [2023-11-29 04:19:29,487 INFO L73 IsDeterministic]: Start isDeterministic. Operand 7 states and 231 transitions. [2023-11-29 04:19:29,487 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:29,487 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 7 states and 231 transitions. [2023-11-29 04:19:29,488 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 8 states, 7 states have (on average 33.0) internal successors, (231), 7 states have internal predecessors, (231), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:29,489 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:29,489 INFO L81 ComplementDD]: Finished complementDD. Result has 8 states, 8 states have (on average 50.0) internal successors, (400), 8 states have internal predecessors, (400), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:29,489 INFO L175 Difference]: Start difference. First operand has 97 places, 87 transitions, 827 flow. Second operand 7 states and 231 transitions. [2023-11-29 04:19:29,489 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 102 places, 139 transitions, 1471 flow [2023-11-29 04:19:29,512 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 98 places, 139 transitions, 1433 flow, removed 2 selfloop flow, removed 4 redundant places. [2023-11-29 04:19:29,514 INFO L231 Difference]: Finished difference. Result has 102 places, 112 transitions, 1276 flow [2023-11-29 04:19:29,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=795, PETRI_DIFFERENCE_MINUEND_PLACES=92, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=87, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=34, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=47, PETRI_DIFFERENCE_SUBTRAHEND_STATES=7, PETRI_FLOW=1276, PETRI_PLACES=102, PETRI_TRANSITIONS=112} [2023-11-29 04:19:29,515 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 53 predicate places. [2023-11-29 04:19:29,515 INFO L495 AbstractCegarLoop]: Abstraction has has 102 places, 112 transitions, 1276 flow [2023-11-29 04:19:29,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:29,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:29,515 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:29,519 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (27)] Forceful destruction successful, exit code 0 [2023-11-29 04:19:29,715 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:29,716 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:29,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:29,716 INFO L85 PathProgramCache]: Analyzing trace with hash 949085531, now seen corresponding path program 3 times [2023-11-29 04:19:29,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:29,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1438424271] [2023-11-29 04:19:29,716 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:19:29,716 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-29 04:19:29,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:29,717 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:29,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (28)] Waiting until timeout for monitored process [2023-11-29 04:19:29,875 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 04:19:29,875 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:19:29,880 INFO L262 TraceCheckSpWp]: Trace formula consists of 140 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:19:29,881 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:29,994 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:29,994 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:19:30,082 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:30,082 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:30,082 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1438424271] [2023-11-29 04:19:30,082 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1438424271] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 04:19:30,082 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:19:30,082 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-11-29 04:19:30,082 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1121160] [2023-11-29 04:19:30,082 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:30,083 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:19:30,083 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:30,083 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:19:30,083 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=20, Invalid=36, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:19:30,099 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 04:19:30,099 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 102 places, 112 transitions, 1276 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:30,099 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:30,100 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 04:19:30,100 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:30,713 INFO L124 PetriNetUnfolderBase]: 1141/2392 cut-off events. [2023-11-29 04:19:30,713 INFO L125 PetriNetUnfolderBase]: For 12831/12845 co-relation queries the response was YES. [2023-11-29 04:19:30,718 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9327 conditions, 2392 events. 1141/2392 cut-off events. For 12831/12845 co-relation queries the response was YES. Maximal size of possible extension queue 139. Compared 16192 event pairs, 484 based on Foata normal form. 28/2419 useless extension candidates. Maximal degree in co-relation 9289. Up to 1127 conditions per place. [2023-11-29 04:19:30,725 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 81 selfloop transitions, 38 changer transitions 5/132 dead transitions. [2023-11-29 04:19:30,725 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 106 places, 132 transitions, 1609 flow [2023-11-29 04:19:30,725 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:19:30,726 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:19:30,726 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 177 transitions. [2023-11-29 04:19:30,726 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.708 [2023-11-29 04:19:30,726 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 177 transitions. [2023-11-29 04:19:30,726 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 177 transitions. [2023-11-29 04:19:30,726 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:30,726 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 177 transitions. [2023-11-29 04:19:30,727 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 35.4) internal successors, (177), 5 states have internal predecessors, (177), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:30,727 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:30,727 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:30,728 INFO L175 Difference]: Start difference. First operand has 102 places, 112 transitions, 1276 flow. Second operand 5 states and 177 transitions. [2023-11-29 04:19:30,728 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 106 places, 132 transitions, 1609 flow [2023-11-29 04:19:30,759 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 132 transitions, 1583 flow, removed 13 selfloop flow, removed 0 redundant places. [2023-11-29 04:19:30,761 INFO L231 Difference]: Finished difference. Result has 107 places, 112 transitions, 1360 flow [2023-11-29 04:19:30,762 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1250, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=38, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=74, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1360, PETRI_PLACES=107, PETRI_TRANSITIONS=112} [2023-11-29 04:19:30,762 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 58 predicate places. [2023-11-29 04:19:30,762 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 112 transitions, 1360 flow [2023-11-29 04:19:30,762 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:30,762 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:30,762 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:30,766 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (28)] Forceful destruction successful, exit code 0 [2023-11-29 04:19:30,963 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:30,963 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:30,963 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:30,963 INFO L85 PathProgramCache]: Analyzing trace with hash -1620861573, now seen corresponding path program 4 times [2023-11-29 04:19:30,964 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:30,964 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [36360479] [2023-11-29 04:19:30,964 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:19:30,964 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-29 04:19:30,964 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:30,965 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:30,966 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (29)] Waiting until timeout for monitored process [2023-11-29 04:19:31,113 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:19:31,113 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:19:31,120 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:19:31,121 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:31,204 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:31,204 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 04:19:31,205 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:31,205 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [36360479] [2023-11-29 04:19:31,205 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [36360479] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 04:19:31,205 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 04:19:31,205 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 04:19:31,205 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1428442238] [2023-11-29 04:19:31,205 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:31,205 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:19:31,206 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:31,206 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:19:31,206 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 04:19:31,219 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 04:19:31,219 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 112 transitions, 1360 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:31,219 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:31,219 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 04:19:31,220 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:31,930 INFO L124 PetriNetUnfolderBase]: 1129/2324 cut-off events. [2023-11-29 04:19:31,930 INFO L125 PetriNetUnfolderBase]: For 14513/14524 co-relation queries the response was YES. [2023-11-29 04:19:31,936 INFO L83 FinitePrefix]: Finished finitePrefix Result has 9551 conditions, 2324 events. 1129/2324 cut-off events. For 14513/14524 co-relation queries the response was YES. Maximal size of possible extension queue 137. Compared 15521 event pairs, 576 based on Foata normal form. 8/2331 useless extension candidates. Maximal degree in co-relation 9511. Up to 1339 conditions per place. [2023-11-29 04:19:31,944 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 98 selfloop transitions, 19 changer transitions 9/134 dead transitions. [2023-11-29 04:19:31,944 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 111 places, 134 transitions, 1752 flow [2023-11-29 04:19:31,945 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 04:19:31,945 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 5 states. [2023-11-29 04:19:31,946 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 5 states to 5 states and 173 transitions. [2023-11-29 04:19:31,946 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.692 [2023-11-29 04:19:31,946 INFO L72 ComplementDD]: Start complementDD. Operand 5 states and 173 transitions. [2023-11-29 04:19:31,946 INFO L73 IsDeterministic]: Start isDeterministic. Operand 5 states and 173 transitions. [2023-11-29 04:19:31,946 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:31,946 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 5 states and 173 transitions. [2023-11-29 04:19:31,947 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 6 states, 5 states have (on average 34.6) internal successors, (173), 5 states have internal predecessors, (173), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:31,948 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:31,948 INFO L81 ComplementDD]: Finished complementDD. Result has 6 states, 6 states have (on average 50.0) internal successors, (300), 6 states have internal predecessors, (300), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:31,948 INFO L175 Difference]: Start difference. First operand has 107 places, 112 transitions, 1360 flow. Second operand 5 states and 173 transitions. [2023-11-29 04:19:31,948 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 111 places, 134 transitions, 1752 flow [2023-11-29 04:19:32,000 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 106 places, 134 transitions, 1600 flow, removed 8 selfloop flow, removed 5 redundant places. [2023-11-29 04:19:32,002 INFO L231 Difference]: Finished difference. Result has 107 places, 111 transitions, 1234 flow [2023-11-29 04:19:32,003 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1210, PETRI_DIFFERENCE_MINUEND_PLACES=102, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=112, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=19, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=93, PETRI_DIFFERENCE_SUBTRAHEND_STATES=5, PETRI_FLOW=1234, PETRI_PLACES=107, PETRI_TRANSITIONS=111} [2023-11-29 04:19:32,003 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 58 predicate places. [2023-11-29 04:19:32,003 INFO L495 AbstractCegarLoop]: Abstraction has has 107 places, 111 transitions, 1234 flow [2023-11-29 04:19:32,003 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:32,003 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:32,003 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:32,007 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (29)] Ended with exit code 0 [2023-11-29 04:19:32,204 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:32,204 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:32,204 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:32,205 INFO L85 PathProgramCache]: Analyzing trace with hash -90712104, now seen corresponding path program 4 times [2023-11-29 04:19:32,205 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:32,205 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1570477961] [2023-11-29 04:19:32,205 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:19:32,205 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-29 04:19:32,205 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:32,206 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:32,207 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (30)] Waiting until timeout for monitored process [2023-11-29 04:19:32,339 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:19:32,339 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:19:32,345 INFO L262 TraceCheckSpWp]: Trace formula consists of 164 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 04:19:32,346 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:32,493 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 0 proven. 2 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:32,493 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:19:32,583 INFO L134 CoverageAnalysis]: Checked inductivity of 11 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:32,583 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:19:32,584 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1570477961] [2023-11-29 04:19:32,584 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1570477961] provided 1 perfect and 1 imperfect interpolant sequences [2023-11-29 04:19:32,584 INFO L185 FreeRefinementEngine]: Found 1 perfect and 1 imperfect interpolant sequences. [2023-11-29 04:19:32,584 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [5] total 8 [2023-11-29 04:19:32,584 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [618565578] [2023-11-29 04:19:32,584 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 04:19:32,585 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 04:19:32,585 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:19:32,585 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 04:19:32,585 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=18, Invalid=38, Unknown=0, NotChecked=0, Total=56 [2023-11-29 04:19:32,594 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 04:19:32,594 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 107 places, 111 transitions, 1234 flow. Second operand has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:32,594 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:19:32,595 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 04:19:32,595 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:19:33,236 INFO L124 PetriNetUnfolderBase]: 1119/2291 cut-off events. [2023-11-29 04:19:33,236 INFO L125 PetriNetUnfolderBase]: For 11863/11863 co-relation queries the response was YES. [2023-11-29 04:19:33,244 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8617 conditions, 2291 events. 1119/2291 cut-off events. For 11863/11863 co-relation queries the response was YES. Maximal size of possible extension queue 140. Compared 15381 event pairs, 94 based on Foata normal form. 24/2308 useless extension candidates. Maximal degree in co-relation 8579. Up to 1209 conditions per place. [2023-11-29 04:19:33,251 INFO L140 encePairwiseOnDemand]: 44/50 looper letters, 72 selfloop transitions, 50 changer transitions 5/135 dead transitions. [2023-11-29 04:19:33,252 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 110 places, 135 transitions, 1615 flow [2023-11-29 04:19:33,252 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 04:19:33,252 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 6 states. [2023-11-29 04:19:33,253 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 6 states to 6 states and 199 transitions. [2023-11-29 04:19:33,253 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6633333333333333 [2023-11-29 04:19:33,253 INFO L72 ComplementDD]: Start complementDD. Operand 6 states and 199 transitions. [2023-11-29 04:19:33,253 INFO L73 IsDeterministic]: Start isDeterministic. Operand 6 states and 199 transitions. [2023-11-29 04:19:33,253 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:19:33,253 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 6 states and 199 transitions. [2023-11-29 04:19:33,254 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 7 states, 6 states have (on average 33.166666666666664) internal successors, (199), 6 states have internal predecessors, (199), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:33,254 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:33,254 INFO L81 ComplementDD]: Finished complementDD. Result has 7 states, 7 states have (on average 50.0) internal successors, (350), 7 states have internal predecessors, (350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:33,254 INFO L175 Difference]: Start difference. First operand has 107 places, 111 transitions, 1234 flow. Second operand 6 states and 199 transitions. [2023-11-29 04:19:33,254 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 110 places, 135 transitions, 1615 flow [2023-11-29 04:19:33,286 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 135 transitions, 1470 flow, removed 4 selfloop flow, removed 10 redundant places. [2023-11-29 04:19:33,288 INFO L231 Difference]: Finished difference. Result has 101 places, 111 transitions, 1204 flow [2023-11-29 04:19:33,288 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1085, PETRI_DIFFERENCE_MINUEND_PLACES=95, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=110, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=47, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=60, PETRI_DIFFERENCE_SUBTRAHEND_STATES=6, PETRI_FLOW=1204, PETRI_PLACES=101, PETRI_TRANSITIONS=111} [2023-11-29 04:19:33,288 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 52 predicate places. [2023-11-29 04:19:33,288 INFO L495 AbstractCegarLoop]: Abstraction has has 101 places, 111 transitions, 1204 flow [2023-11-29 04:19:33,289 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 28.8) internal successors, (144), 5 states have internal predecessors, (144), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:19:33,289 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:19:33,289 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:19:33,293 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (30)] Ended with exit code 0 [2023-11-29 04:19:33,489 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:33,489 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:19:33,490 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:19:33,490 INFO L85 PathProgramCache]: Analyzing trace with hash -1433793000, now seen corresponding path program 1 times [2023-11-29 04:19:33,490 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:19:33,490 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [494931247] [2023-11-29 04:19:33,490 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 04:19:33,490 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-29 04:19:33,490 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:19:33,491 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:19:33,492 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (31)] Waiting until timeout for monitored process [2023-11-29 04:19:33,637 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 04:19:33,644 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 04:19:33,647 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:19:34,940 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:19:34,941 INFO L378 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 246 treesize of output 92 [2023-11-29 04:19:35,211 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:19:35,212 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:19:39,267 INFO L349 Elim1Store]: treesize reduction 132, result has 23.7 percent of original size [2023-11-29 04:19:39,267 INFO L378 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 800 treesize of output 332 [2023-11-29 04:20:03,475 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:20:03,475 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:20:03,475 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [494931247] [2023-11-29 04:20:03,475 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [494931247] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:20:03,476 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:20:03,476 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-11-29 04:20:03,476 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1811017067] [2023-11-29 04:20:03,476 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:20:03,476 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 04:20:03,476 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:20:03,476 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 04:20:03,477 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=44, Invalid=194, Unknown=2, NotChecked=0, Total=240 [2023-11-29 04:20:07,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:20:12,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:20:16,669 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:20:21,036 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:20:21,036 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2023-11-29 04:20:21,037 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 101 places, 111 transitions, 1204 flow. Second operand has 16 states, 16 states have (on average 23.3125) internal successors, (373), 16 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:21,037 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:20:21,037 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2023-11-29 04:20:21,037 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:20:27,078 INFO L124 PetriNetUnfolderBase]: 1125/2350 cut-off events. [2023-11-29 04:20:27,078 INFO L125 PetriNetUnfolderBase]: For 10381/10381 co-relation queries the response was YES. [2023-11-29 04:20:27,083 INFO L83 FinitePrefix]: Finished finitePrefix Result has 8637 conditions, 2350 events. 1125/2350 cut-off events. For 10381/10381 co-relation queries the response was YES. Maximal size of possible extension queue 147. Compared 15996 event pairs, 306 based on Foata normal form. 1/2351 useless extension candidates. Maximal degree in co-relation 8604. Up to 503 conditions per place. [2023-11-29 04:20:27,089 INFO L140 encePairwiseOnDemand]: 43/50 looper letters, 144 selfloop transitions, 53 changer transitions 5/210 dead transitions. [2023-11-29 04:20:27,089 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 108 places, 210 transitions, 2355 flow [2023-11-29 04:20:27,091 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 10 states. [2023-11-29 04:20:27,091 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 10 states. [2023-11-29 04:20:27,091 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 10 states to 10 states and 302 transitions. [2023-11-29 04:20:27,092 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.604 [2023-11-29 04:20:27,092 INFO L72 ComplementDD]: Start complementDD. Operand 10 states and 302 transitions. [2023-11-29 04:20:27,092 INFO L73 IsDeterministic]: Start isDeterministic. Operand 10 states and 302 transitions. [2023-11-29 04:20:27,092 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:20:27,092 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 10 states and 302 transitions. [2023-11-29 04:20:27,092 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 11 states, 10 states have (on average 30.2) internal successors, (302), 10 states have internal predecessors, (302), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:27,093 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 11 states, 11 states have (on average 50.0) internal successors, (550), 11 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:27,093 INFO L81 ComplementDD]: Finished complementDD. Result has 11 states, 11 states have (on average 50.0) internal successors, (550), 11 states have internal predecessors, (550), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:27,093 INFO L175 Difference]: Start difference. First operand has 101 places, 111 transitions, 1204 flow. Second operand 10 states and 302 transitions. [2023-11-29 04:20:27,093 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 108 places, 210 transitions, 2355 flow [2023-11-29 04:20:27,117 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 100 places, 210 transitions, 2191 flow, removed 19 selfloop flow, removed 8 redundant places. [2023-11-29 04:20:27,120 INFO L231 Difference]: Finished difference. Result has 104 places, 122 transitions, 1358 flow [2023-11-29 04:20:27,120 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1077, PETRI_DIFFERENCE_MINUEND_PLACES=91, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=111, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=42, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=59, PETRI_DIFFERENCE_SUBTRAHEND_STATES=10, PETRI_FLOW=1358, PETRI_PLACES=104, PETRI_TRANSITIONS=122} [2023-11-29 04:20:27,120 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 55 predicate places. [2023-11-29 04:20:27,120 INFO L495 AbstractCegarLoop]: Abstraction has has 104 places, 122 transitions, 1358 flow [2023-11-29 04:20:27,120 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 23.3125) internal successors, (373), 16 states have internal predecessors, (373), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:20:27,121 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:20:27,121 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:20:27,124 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (31)] Forceful destruction successful, exit code 0 [2023-11-29 04:20:27,321 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:20:27,321 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:20:27,321 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:20:27,322 INFO L85 PathProgramCache]: Analyzing trace with hash -1937698496, now seen corresponding path program 2 times [2023-11-29 04:20:27,322 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:20:27,322 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1269849111] [2023-11-29 04:20:27,322 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 04:20:27,322 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-29 04:20:27,322 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:20:27,323 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:20:27,324 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (32)] Waiting until timeout for monitored process [2023-11-29 04:20:27,493 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 04:20:27,493 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:20:27,500 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 21 conjunts are in the unsatisfiable core [2023-11-29 04:20:27,504 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:20:28,498 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:20:28,498 INFO L378 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 566 treesize of output 214 [2023-11-29 04:20:29,229 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:20:29,229 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:20:37,256 INFO L349 Elim1Store]: treesize reduction 132, result has 23.7 percent of original size [2023-11-29 04:20:37,257 INFO L378 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 584 treesize of output 278 [2023-11-29 04:21:12,356 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:21:12,357 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:21:12,357 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1269849111] [2023-11-29 04:21:12,357 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1269849111] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:21:12,357 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:21:12,357 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-11-29 04:21:12,357 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2022739823] [2023-11-29 04:21:12,357 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:21:12,358 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 04:21:12,358 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:21:12,358 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 04:21:12,359 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=50, Invalid=190, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:21:14,307 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 04:21:14,307 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 104 places, 122 transitions, 1358 flow. Second operand has 16 states, 16 states have (on average 27.25) internal successors, (436), 16 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:21:14,307 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:21:14,308 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 04:21:14,308 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:21:40,668 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:21:44,674 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:21:48,725 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:22:11,536 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:22:15,543 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:22:19,552 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:22:25,786 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:22:29,789 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:22:33,839 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:22:40,198 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:22:44,202 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:22:48,352 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:22:52,417 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:22:56,422 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:23:00,426 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:23:04,441 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:23:08,446 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:23:12,449 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:23:16,546 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:23:20,549 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:23:24,554 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:23:28,558 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:23:32,594 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse62 (select |c_#memory_int#2| c_~nondet_0~0.base))) (let ((.cse57 ((_ sign_extend 32) c_~name_1~0)) (.cse56 ((_ sign_extend 32) c_~name_2~0)) (.cse107 (bvadd c_~name_1~0 (bvneg c_~name_2~0))) (.cse14 (= c_~break_6~0 (_ bv0 32))) (.cse4 (= c_~name_2~0 c_~name_1~0)) (.cse108 (concat (concat (concat (select .cse62 (bvadd (_ bv3 32) c_~nondet_0~0.offset)) (select .cse62 (bvadd (_ bv2 32) c_~nondet_0~0.offset))) (select .cse62 (bvadd (_ bv1 32) c_~nondet_0~0.offset))) (select .cse62 c_~nondet_0~0.offset)))) (let ((.cse101 (= c_~name_2~0 .cse108)) (.cse103 (= .cse108 c_~name_1~0)) (.cse1 (not .cse4)) (.cse28 (not .cse14)) (.cse2 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))) (.cse26 (bvslt .cse107 (_ bv0 32))) (.cse27 (not (bvsge .cse57 (bvadd (_ bv18446744071562067968 64) .cse56)))) (.cse32 (bvsgt .cse107 (_ bv0 32))) (.cse33 (and (not (bvsge c_~name_2~0 (_ bv0 32))) (not (bvsle c_~name_1~0 (bvadd c_~name_2~0 (_ bv2147483647 32)))))) (.cse31 (bvslt (bvadd c_~i_4~0 (_ bv1 32)) (_ bv3 32)))) (let ((.cse7 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse106 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse106 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29))) (= c_~name_2~0 .cse106))))) (.cse16 (= c_~break_10~0 (_ bv0 32))) (.cse50 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))))) (.cse6 (and .cse14 (or .cse32 .cse33 .cse31))) (.cse8 (and (or .cse26 .cse27 .cse31) .cse14)) (.cse0 (and .cse14 .cse31)) (.cse21 (or .cse28 .cse2 .cse31)) (.cse18 (or .cse1 .cse2)) (.cse3 (= (bvmul (_ bv4 32) c_~i_4~0) (_ bv0 32))) (.cse11 (= c_~break_6~0 (_ bv1 32))) (.cse96 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))) (.cse104 (not .cse103)) (.cse102 (not .cse101)) (.cse10 (= (_ bv0 32) (bvadd c_~result_3~0 (_ bv1 32)))) (.cse13 (= c_~result_3~0 (_ bv1 32)))) (and (or .cse0 .cse1 .cse2) (or .cse3 .cse4 (and (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse5 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse5 c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)) (= c_~name_2~0 .cse5)))) .cse6) (or .cse7 .cse8))) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))) .cse3) (let ((.cse12 (and .cse14 (exists ((v_arrayElimCell_21 (_ BitVec 8)) (v_arrayElimCell_20 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8)) (v_arrayElimCell_19 (_ BitVec 8))) (let ((.cse15 (concat (concat (concat v_arrayElimCell_21 v_arrayElimCell_18) v_arrayElimCell_20) v_arrayElimCell_19))) (and (not (= .cse15 c_~name_1~0)) (not (= c_~name_2~0 .cse15))))) .cse16)) (.cse9 (= c_~break_10~0 (_ bv1 32)))) (or (and .cse9 .cse10 .cse11 (exists ((v_arrayElimCell_21 (_ BitVec 8)) (v_arrayElimCell_20 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8)) (v_arrayElimCell_19 (_ BitVec 8))) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_21 v_arrayElimCell_18) v_arrayElimCell_20) v_arrayElimCell_19))) (= (_ bv1 32) c_~result_7~0)) .cse12 (and (= (bvadd (_ bv1 32) c_~result_7~0) (_ bv0 32)) (or .cse12 (and (or .cse12 (and .cse9 .cse11 (exists ((v_arrayElimCell_21 (_ BitVec 8)) (v_arrayElimCell_20 (_ BitVec 8)) (v_arrayElimCell_18 (_ BitVec 8)) (v_arrayElimCell_19 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_21 v_arrayElimCell_18) v_arrayElimCell_20) v_arrayElimCell_19) c_~name_1~0)))) .cse13))))) (or .cse3 (let ((.cse19 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse48 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29))) (= .cse48 c_~name_1~0) (= c_~name_2~0 .cse48))))) (.cse22 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse47 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse47 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24))) (= c_~name_2~0 .cse47)))))) (and (or .cse14 (and (or .cse4 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse17 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (not (= c_~name_2~0 (concat (concat .cse17 v_arrayElimCell_26) v_arrayElimCell_29))) (= (concat (concat .cse17 v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29)))))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (forall ((v_arrayElimCell_22 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0))) (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))) .cse18)) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))) (or (and (or .cse19 .cse8) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse20 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse20 c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0)) (= c_~name_2~0 .cse20)))) .cse6)) .cse4) (or .cse1 (and (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24)))) .cse14) .cse21)) (or .cse4 (and (or .cse22 .cse8) (or .cse6 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse23 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse23 c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24) c_~name_1~0)) (= c_~name_2~0 .cse23))))))) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse24 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (= (concat (concat .cse24 v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat .cse24 v_arrayElimCell_26) v_arrayElimCell_29))))) .cse0 .cse1) (or (let ((.cse25 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse35 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (= (concat (concat .cse35 v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat .cse35 v_arrayElimCell_26) v_arrayElimCell_24) c_~name_1~0))))))) (and (or .cse14 .cse25) (or .cse26 .cse27 .cse28 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse30 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (let ((.cse29 (concat (concat .cse30 v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse29 c_~name_1~0) (not (= c_~name_2~0 (concat (concat .cse30 v_arrayElimCell_26) v_arrayElimCell_24))) (= c_~name_2~0 .cse29))))) .cse31) (or .cse32 .cse25 .cse33 .cse31) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse34 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (not (= c_~name_2~0 (concat (concat .cse34 v_arrayElimCell_23) v_arrayElimCell_29))) (not (= (concat (concat .cse34 v_arrayElimCell_26) v_arrayElimCell_24) c_~name_1~0))))))) .cse4) (or .cse14 (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24) c_~name_1~0))))) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse36 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (= (concat (concat .cse36 v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= c_~name_2~0 (concat (concat .cse36 v_arrayElimCell_26) v_arrayElimCell_24)))))) .cse4) .cse18 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24)))))))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse37 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (not (= c_~name_2~0 (concat (concat .cse37 v_arrayElimCell_26) v_arrayElimCell_24))) (not (= (concat (concat .cse37 v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse38 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (not (= c_~name_2~0 (concat (concat .cse38 v_arrayElimCell_26) v_arrayElimCell_29))) (not (= (concat (concat .cse38 v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) (or .cse4 (let ((.cse39 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0)))))) (and (or .cse14 .cse39) (or .cse26 .cse27 .cse28 .cse19 .cse31) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (forall ((v_arrayElimCell_25 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29)))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0)))) (or .cse32 .cse39 .cse33 .cse31)))) (or .cse4 (let ((.cse42 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse44 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (= (concat (concat .cse44 v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat .cse44 v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0))))))) (and (or .cse26 .cse27 .cse28 .cse31 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse40 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (let ((.cse41 (concat (concat .cse40 v_arrayElimCell_23) v_arrayElimCell_29))) (or (not (= c_~name_2~0 (concat (concat .cse40 v_arrayElimCell_26) v_arrayElimCell_29))) (= .cse41 c_~name_1~0) (= c_~name_2~0 .cse41)))))) (or .cse32 .cse33 .cse42 .cse31) (or .cse14 .cse42) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse43 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (not (= c_~name_2~0 (concat (concat .cse43 v_arrayElimCell_23) v_arrayElimCell_29))) (not (= (concat (concat .cse43 v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0)))))))) (or (let ((.cse45 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24) c_~name_1~0)))))) (and (or .cse26 .cse27 .cse22 .cse28 .cse31) (or .cse45 .cse14) (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8))) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29)))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24) c_~name_1~0)))) (or .cse32 .cse45 .cse33 .cse31))) .cse4) (forall ((v_arrayElimCell_27 (_ BitVec 8))) (or (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24)))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse46 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (= (concat (concat .cse46 v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat .cse46 v_arrayElimCell_26) v_arrayElimCell_24))))) .cse0 .cse1) (or .cse1 (and .cse21 (or .cse14 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29)))))))))) (or .cse3 (and (or (and (or .cse14 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29))))) .cse21) .cse1) (or (let ((.cse49 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))))) (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (forall ((v_arrayElimCell_25 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29)))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))) (or .cse32 .cse49 .cse33 .cse31) (or .cse26 .cse27 .cse7 .cse28 .cse31) (or .cse14 .cse49))) .cse4))) (or (and (or .cse50 .cse4) (or .cse3 (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29)))))) .cse18))) .cse14) (= c_~i_4~0 (_ bv1 32)) .cse1 (or (and .cse14 (bvslt c_~i_4~0 (_ bv3 32))) (let ((.cse61 (let ((.cse63 (bvmul (_ bv4 32) c_~i_8~0))) (concat (concat (concat (select .cse62 (bvadd (_ bv3 32) .cse63 c_~nondet_0~0.offset)) (select .cse62 (bvadd (_ bv2 32) .cse63 c_~nondet_0~0.offset))) (select .cse62 (bvadd .cse63 (_ bv1 32) c_~nondet_0~0.offset))) (select .cse62 (bvadd .cse63 c_~nondet_0~0.offset)))))) (let ((.cse54 (= c_~name_2~0 .cse61))) (let ((.cse55 (= .cse61 c_~name_1~0)) (.cse53 (bvsgt c_~result_3~0 (_ bv0 32))) (.cse51 (bvslt c_~result_3~0 (_ bv0 32))) (.cse52 (not .cse54))) (and (or (and (or (and .cse28 .cse51) .cse52) (or (and (or .cse32 .cse28 .cse33) (or .cse14 .cse53)) .cse54)) (not .cse55)) (or (and .cse55 .cse16) (and (or (and (or (and .cse14 (or .cse27 .cse33)) .cse16) (let ((.cse60 (bvadd c_~name_2~0 (bvneg c_~name_1~0)))) (let ((.cse58 (bvslt .cse60 (_ bv0 32)))) (or (not (bvsge .cse56 (bvadd (_ bv18446744071562067968 64) .cse57))) .cse14 (and .cse53 .cse58) (bvslt (bvadd (_ bv1 32) c_~i_8~0) (_ bv3 32)) (and (not (bvsle c_~name_2~0 (bvadd (_ bv2147483647 32) c_~name_1~0))) (not (bvsge c_~name_1~0 (_ bv0 32)))) (and (let ((.cse59 (bvsgt .cse60 (_ bv0 32)))) (or (and .cse51 .cse59) (and (not .cse59) (not .cse51) (not .cse53)))) (not .cse58)))))) .cse54) (or (and (or .cse14 .cse51) (or .cse26 .cse27 .cse28)) .cse52)))))))) (or .cse3 (let ((.cse73 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse75 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse75 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24))) (= c_~name_2~0 .cse75)))))) (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse64 (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23))) (or (not (= c_~name_2~0 (concat .cse64 v_arrayElimCell_24))) (not (= (concat .cse64 v_arrayElimCell_29) c_~name_1~0))))) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse65 (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23))) (or (= (concat .cse65 v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat .cse65 v_arrayElimCell_24))))) .cse0 .cse1) (or (let ((.cse69 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse70 (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23))) (or (= (concat .cse70 v_arrayElimCell_29) c_~name_1~0) (not (= (concat .cse70 v_arrayElimCell_24) c_~name_1~0))))))) (and (or .cse26 .cse27 .cse28 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse67 (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23))) (let ((.cse66 (concat .cse67 v_arrayElimCell_29))) (or (= .cse66 c_~name_1~0) (not (= c_~name_2~0 (concat .cse67 v_arrayElimCell_24))) (= c_~name_2~0 .cse66))))) .cse31) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse68 (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23))) (or (not (= c_~name_2~0 (concat .cse68 v_arrayElimCell_29))) (not (= (concat .cse68 v_arrayElimCell_24) c_~name_1~0))))) (or .cse32 .cse69 .cse33 .cse31) (or .cse14 .cse69))) .cse4) (or .cse14 (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0))))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24)))))) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse71 (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23))) (or (= (concat .cse71 v_arrayElimCell_29) c_~name_1~0) (not (= c_~name_2~0 (concat .cse71 v_arrayElimCell_24)))))) .cse4) .cse18)) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8))) (or (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24)))) (forall ((v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) (or (let ((.cse72 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0)))))) (and (or .cse32 .cse33 .cse31 .cse72) (or .cse26 .cse27 .cse28 .cse73 .cse31) (or .cse14 .cse72) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0)) (forall ((v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29)))))))) .cse4) (or (and (or .cse14 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24))))) .cse21) .cse1) (or .cse4 (and (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse74 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse74 c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0)) (= c_~name_2~0 .cse74)))) .cse6) (or .cse73 .cse8)))))) (= (_ bv1 32) c_~i_8~0) (or (let ((.cse79 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse100 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse100 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29))) (= c_~name_2~0 .cse100))))) (.cse86 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse99 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse99 c_~name_1~0) (= c_~name_2~0 .cse99))))) (.cse84 (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24) c_~name_1~0)))) (.cse76 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse98 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse98 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29))) (= c_~name_2~0 .cse98))))) (.cse81 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse97 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse97 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24))) (= c_~name_2~0 .cse97))))) (.cse85 (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24)))))) (and (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29)))) .cse0 .cse1) (or .cse4 (and (or .cse76 .cse8) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse77 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse77 c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0)) (= c_~name_2~0 .cse77)))) .cse6))) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_29)))) .cse0 .cse1) (or (and (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse78 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)) (= .cse78 c_~name_1~0) (= c_~name_2~0 .cse78)))) .cse6) (or .cse79 .cse8)) .cse4) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24)))) (forall ((v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) (or (and (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse80 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse80 c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0)) (= c_~name_2~0 .cse80)))) .cse6) (or .cse81 .cse8)) .cse4) (or (and (or .cse28 .cse31) (or .cse14 (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24))))) .cse1 .cse2) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))))) (or .cse4 (let ((.cse82 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0)))))) (and (or .cse14 .cse82) (or .cse32 .cse82 .cse33 .cse31) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0)))) (or .cse26 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse83 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_2~0)) (= .cse83 c_~name_1~0) (= c_~name_2~0 .cse83)))) .cse27 .cse28 .cse31)))) (or .cse1 (and .cse21 (or .cse14 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24))))))) (or (and (or (and .cse50 (or .cse14 .cse2) (or .cse32 .cse33 .cse2 .cse31)) .cse84) (or .cse85 .cse86 .cse26 .cse27 .cse28 .cse31)) .cse4) (or .cse1 (and .cse21 (or .cse14 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29))))))) (or .cse14 (and (or (and .cse85 .cse1 .cse84) .cse2) (or .cse4 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_24)))))))) (or .cse14 (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29)))))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0))))) (or .cse4 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_29)))))) .cse18)) (or .cse0 .cse1 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_24))))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_29))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))) (or .cse4 (let ((.cse87 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)) (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)) (forall ((v_arrayElimCell_25 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29)))))) (or .cse87 .cse14) (or .cse26 .cse27 .cse79 .cse28 .cse31) (or .cse87 .cse32 .cse33 .cse31)))) (or .cse86 .cse4 (and (or .cse6 .cse84) (or .cse85 .cse8))) (or .cse0 .cse1 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_2~0)))) (or .cse4 (let ((.cse89 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0)))))) (and (or .cse26 .cse27 .cse28 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse88 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse88 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_29))) (= c_~name_2~0 .cse88)))) .cse31) (or .cse14 .cse89) (or .cse32 .cse33 .cse89 .cse31) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0)) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29)))))))) (or (let ((.cse90 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0)))))) (and (or .cse14 .cse90) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (forall ((v_arrayElimCell_25 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29)))) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0)))) (or .cse26 .cse27 .cse76 .cse28 .cse31) (or .cse32 .cse90 .cse33 .cse31))) .cse4) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_2~0)) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))) (or .cse4 (let ((.cse91 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0)))))) (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0)) (forall ((v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29)))))) (or .cse91 .cse32 .cse33 .cse31) (or .cse81 .cse26 .cse27 .cse28 .cse31) (or .cse91 .cse14)))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_24))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))) (or (let ((.cse93 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))))) (and (or .cse26 .cse27 .cse28 .cse31 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse92 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse92 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (= c_~name_2~0 .cse92))))) (or .cse32 .cse93 .cse33 .cse31) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))) (or .cse14 .cse93))) .cse4) (or (let ((.cse94 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_24) c_~name_1~0)))))) (and (or .cse14 .cse94) (or .cse26 .cse27 .cse28 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse95 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse95 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_24))) (= c_~name_2~0 .cse95)))) .cse31) (or .cse32 .cse94 .cse33 .cse31) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_24) c_~name_1~0)))))) .cse4) (or (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29)))))) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))))) .cse4) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) .cse18) .cse14) (or (and .cse21 (or .cse14 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29)) (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) .cse1) (or .cse85 .cse96) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))) (or (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24)))))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0))))) .cse18 (or .cse4 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_2~0)) (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) .cse14) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))))) .cse3) (or (and .cse101 .cse11) (and .cse102 (or (and .cse11 .cse103) (and .cse14 .cse104)))) (or .cse96 .cse1) (or (and .cse104 (or .cse102 .cse10)) (and .cse13 .cse103)) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse105 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (not (= c_~name_2~0 .cse105)) (not (= .cse105 c_~name_1~0)))))))))) is different from false [2023-11-29 04:23:48,686 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:23:52,696 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:23:56,752 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:24:00,758 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:24:04,764 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:24:08,773 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0] [2023-11-29 04:24:25,824 WARN L293 SmtUtils]: Spent 15.60s on a formula simplification. DAG size of input: 673 DAG size of output: 655 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:24:30,753 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:24:46,811 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.02s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:24:50,914 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:24:58,629 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:25:02,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:25:06,849 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:25:10,854 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:25:15,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:25:19,220 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:25:23,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:25:27,227 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:25:31,231 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:25:35,266 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse57 (select |c_#memory_int#2| c_~nondet_0~0.base))) (let ((.cse114 (bvadd c_~name_1~0 (bvneg c_~name_2~0))) (.cse1 (= c_~break_6~0 (_ bv0 32))) (.cse108 ((_ sign_extend 32) c_~name_1~0)) (.cse107 ((_ sign_extend 32) c_~name_2~0)) (.cse53 (bvsgt c_~result_3~0 (_ bv0 32))) (.cse51 (bvslt c_~result_3~0 (_ bv0 32))) (.cse105 (bvadd c_~name_2~0 (bvneg c_~name_1~0))) (.cse12 (= c_~name_2~0 c_~name_1~0)) (.cse115 (concat (concat (concat (select .cse57 (bvadd (_ bv3 32) c_~nondet_0~0.offset)) (select .cse57 (bvadd (_ bv2 32) c_~nondet_0~0.offset))) (select .cse57 (bvadd (_ bv1 32) c_~nondet_0~0.offset))) (select .cse57 c_~nondet_0~0.offset)))) (let ((.cse96 (= c_~name_2~0 .cse115)) (.cse99 (= .cse115 c_~name_1~0)) (.cse9 (not .cse12)) (.cse10 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))) (.cse31 (bvslt (bvadd c_~i_4~0 (_ bv1 32)) (_ bv3 32))) (.cse106 (bvslt .cse105 (_ bv0 32))) (.cse103 (not .cse51)) (.cse104 (not .cse53)) (.cse27 (not (bvsge .cse108 (bvadd (_ bv18446744071562067968 64) .cse107)))) (.cse28 (not .cse1)) (.cse26 (bvslt .cse114 (_ bv0 32))) (.cse33 (and (not (bvsge c_~name_2~0 (_ bv0 32))) (not (bvsle c_~name_1~0 (bvadd c_~name_2~0 (_ bv2147483647 32)))))) (.cse32 (bvsgt .cse114 (_ bv0 32)))) (let ((.cse6 (let ((.cse113 (bvslt c_~result_7~0 (_ bv0 32))) (.cse111 (bvsgt c_~result_7~0 (_ bv0 32)))) (let ((.cse112 (not .cse111)) (.cse110 (not .cse113))) (and (or (and .cse110 (or (and .cse111 .cse51) (and .cse112 .cse103 .cse104))) .cse1 (and .cse53 .cse113)) (or .cse27 .cse28 (and (or (and .cse26 .cse111) (and (not .cse32) .cse112 (not .cse26))) .cse110) .cse33 (and .cse32 .cse113)))))) (.cse15 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse109 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse109 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29))) (= c_~name_2~0 .cse109))))) (.cse7 (and .cse1 (bvslt c_~i_4~0 (_ bv3 32)))) (.cse5 (= c_~break_10~0 (_ bv0 32))) (.cse0 (not (bvsge .cse107 (bvadd (_ bv18446744071562067968 64) .cse108)))) (.cse2 (and .cse53 .cse106)) (.cse3 (and (not (bvsle c_~name_2~0 (bvadd (_ bv2147483647 32) c_~name_1~0))) (not (bvsge c_~name_1~0 (_ bv0 32))))) (.cse4 (and (let ((.cse102 (bvsgt .cse105 (_ bv0 32)))) (or (and .cse51 .cse102) (and (not .cse102) .cse103 .cse104))) (not .cse106))) (.cse50 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))))) (.cse14 (and .cse1 (or .cse32 .cse33 .cse31))) (.cse16 (and (or .cse26 .cse27 .cse31) .cse1)) (.cse8 (and .cse1 .cse31)) (.cse21 (or .cse28 .cse10 .cse31)) (.cse18 (or .cse9 .cse10)) (.cse11 (= (bvmul (_ bv4 32) c_~i_4~0) (_ bv0 32))) (.cse91 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))) (.cse100 (not .cse99)) (.cse98 (not .cse96))) (and (or (and (or .cse0 .cse1 .cse2 .cse3 .cse4 (not .cse5)) (or .cse5 .cse6)) (and (bvslt c_~i_8~0 (_ bv3 32)) .cse5) .cse7) (or .cse8 .cse9 .cse10) (or .cse11 .cse12 (and (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse13 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse13 c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)) (= c_~name_2~0 .cse13)))) .cse14) (or .cse15 .cse16))) (or .cse7 .cse6) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))) .cse11) (or .cse11 (let ((.cse19 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse48 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29))) (= .cse48 c_~name_1~0) (= c_~name_2~0 .cse48))))) (.cse22 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse47 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse47 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24))) (= c_~name_2~0 .cse47)))))) (and (or .cse1 (and (or .cse12 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse17 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (not (= c_~name_2~0 (concat (concat .cse17 v_arrayElimCell_26) v_arrayElimCell_29))) (= (concat (concat .cse17 v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29)))))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (forall ((v_arrayElimCell_22 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0))) (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))) .cse18)) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))) (or (and (or .cse19 .cse16) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse20 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse20 c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0)) (= c_~name_2~0 .cse20)))) .cse14)) .cse12) (or .cse9 (and (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24)))) .cse1) .cse21)) (or .cse12 (and (or .cse22 .cse16) (or .cse14 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse23 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse23 c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24) c_~name_1~0)) (= c_~name_2~0 .cse23))))))) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse24 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (= (concat (concat .cse24 v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat .cse24 v_arrayElimCell_26) v_arrayElimCell_29))))) .cse8 .cse9) (or (let ((.cse25 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse35 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (= (concat (concat .cse35 v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat .cse35 v_arrayElimCell_26) v_arrayElimCell_24) c_~name_1~0))))))) (and (or .cse1 .cse25) (or .cse26 .cse27 .cse28 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse30 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (let ((.cse29 (concat (concat .cse30 v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse29 c_~name_1~0) (not (= c_~name_2~0 (concat (concat .cse30 v_arrayElimCell_26) v_arrayElimCell_24))) (= c_~name_2~0 .cse29))))) .cse31) (or .cse32 .cse25 .cse33 .cse31) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse34 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (not (= c_~name_2~0 (concat (concat .cse34 v_arrayElimCell_23) v_arrayElimCell_29))) (not (= (concat (concat .cse34 v_arrayElimCell_26) v_arrayElimCell_24) c_~name_1~0))))))) .cse12) (or .cse1 (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24) c_~name_1~0))))) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse36 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (= (concat (concat .cse36 v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= c_~name_2~0 (concat (concat .cse36 v_arrayElimCell_26) v_arrayElimCell_24)))))) .cse12) .cse18 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24)))))))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse37 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (not (= c_~name_2~0 (concat (concat .cse37 v_arrayElimCell_26) v_arrayElimCell_24))) (not (= (concat (concat .cse37 v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse38 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (not (= c_~name_2~0 (concat (concat .cse38 v_arrayElimCell_26) v_arrayElimCell_29))) (not (= (concat (concat .cse38 v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) (or .cse12 (let ((.cse39 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0)))))) (and (or .cse1 .cse39) (or .cse26 .cse27 .cse28 .cse19 .cse31) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (forall ((v_arrayElimCell_25 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29)))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0)))) (or .cse32 .cse39 .cse33 .cse31)))) (or .cse12 (let ((.cse42 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse44 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (= (concat (concat .cse44 v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat .cse44 v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0))))))) (and (or .cse26 .cse27 .cse28 .cse31 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse40 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (let ((.cse41 (concat (concat .cse40 v_arrayElimCell_23) v_arrayElimCell_29))) (or (not (= c_~name_2~0 (concat (concat .cse40 v_arrayElimCell_26) v_arrayElimCell_29))) (= .cse41 c_~name_1~0) (= c_~name_2~0 .cse41)))))) (or .cse32 .cse33 .cse42 .cse31) (or .cse1 .cse42) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse43 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (not (= c_~name_2~0 (concat (concat .cse43 v_arrayElimCell_23) v_arrayElimCell_29))) (not (= (concat (concat .cse43 v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0)))))))) (or (let ((.cse45 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24) c_~name_1~0)))))) (and (or .cse26 .cse27 .cse22 .cse28 .cse31) (or .cse45 .cse1) (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8))) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29)))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24) c_~name_1~0)))) (or .cse32 .cse45 .cse33 .cse31))) .cse12) (forall ((v_arrayElimCell_27 (_ BitVec 8))) (or (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24)))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse46 (concat v_arrayElimCell_27 v_arrayElimCell_25))) (or (= (concat (concat .cse46 v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat .cse46 v_arrayElimCell_26) v_arrayElimCell_24))))) .cse8 .cse9) (or .cse9 (and .cse21 (or .cse1 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29)))))))))) (or .cse11 (and (or (and (or .cse1 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29))))) .cse21) .cse9) (or (let ((.cse49 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))))) (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (forall ((v_arrayElimCell_25 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29)))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))) (or .cse32 .cse49 .cse33 .cse31) (or .cse26 .cse27 .cse15 .cse28 .cse31) (or .cse1 .cse49))) .cse12))) (or (and (or .cse50 .cse12) (or .cse11 (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29)))))) .cse18))) .cse1) (= c_~i_4~0 (_ bv1 32)) .cse9 (or .cse7 (let ((.cse56 (let ((.cse58 (bvmul (_ bv4 32) c_~i_8~0))) (concat (concat (concat (select .cse57 (bvadd (_ bv3 32) .cse58 c_~nondet_0~0.offset)) (select .cse57 (bvadd (_ bv2 32) .cse58 c_~nondet_0~0.offset))) (select .cse57 (bvadd .cse58 (_ bv1 32) c_~nondet_0~0.offset))) (select .cse57 (bvadd .cse58 c_~nondet_0~0.offset)))))) (let ((.cse54 (= c_~name_2~0 .cse56))) (let ((.cse55 (= .cse56 c_~name_1~0)) (.cse52 (not .cse54))) (and (or (and (or (and .cse28 .cse51) .cse52) (or (and (or .cse32 .cse28 .cse33) (or .cse1 .cse53)) .cse54)) (not .cse55)) (or (and .cse55 .cse5) (and (or (and (or (and .cse1 (or .cse27 .cse33)) .cse5) (or .cse0 .cse1 .cse2 (bvslt (bvadd (_ bv1 32) c_~i_8~0) (_ bv3 32)) .cse3 .cse4)) .cse54) (or (and (or .cse1 .cse51) (or .cse26 .cse27 .cse28)) .cse52)))))))) (or .cse11 (let ((.cse68 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse70 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse70 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24))) (= c_~name_2~0 .cse70)))))) (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse59 (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23))) (or (not (= c_~name_2~0 (concat .cse59 v_arrayElimCell_24))) (not (= (concat .cse59 v_arrayElimCell_29) c_~name_1~0))))) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse60 (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23))) (or (= (concat .cse60 v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat .cse60 v_arrayElimCell_24))))) .cse8 .cse9) (or (let ((.cse64 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse65 (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23))) (or (= (concat .cse65 v_arrayElimCell_29) c_~name_1~0) (not (= (concat .cse65 v_arrayElimCell_24) c_~name_1~0))))))) (and (or .cse26 .cse27 .cse28 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse62 (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23))) (let ((.cse61 (concat .cse62 v_arrayElimCell_29))) (or (= .cse61 c_~name_1~0) (not (= c_~name_2~0 (concat .cse62 v_arrayElimCell_24))) (= c_~name_2~0 .cse61))))) .cse31) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse63 (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23))) (or (not (= c_~name_2~0 (concat .cse63 v_arrayElimCell_29))) (not (= (concat .cse63 v_arrayElimCell_24) c_~name_1~0))))) (or .cse32 .cse64 .cse33 .cse31) (or .cse1 .cse64))) .cse12) (or .cse1 (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0))))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24)))))) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse66 (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23))) (or (= (concat .cse66 v_arrayElimCell_29) c_~name_1~0) (not (= c_~name_2~0 (concat .cse66 v_arrayElimCell_24)))))) .cse12) .cse18)) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8))) (or (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24)))) (forall ((v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) (or (let ((.cse67 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0)))))) (and (or .cse32 .cse33 .cse31 .cse67) (or .cse26 .cse27 .cse28 .cse68 .cse31) (or .cse1 .cse67) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0)) (forall ((v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29)))))))) .cse12) (or (and (or .cse1 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24))))) .cse21) .cse9) (or .cse12 (and (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse69 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse69 c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0)) (= c_~name_2~0 .cse69)))) .cse14) (or .cse68 .cse16)))))) (or (let ((.cse74 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse95 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse95 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29))) (= c_~name_2~0 .cse95))))) (.cse81 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse94 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse94 c_~name_1~0) (= c_~name_2~0 .cse94))))) (.cse79 (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24) c_~name_1~0)))) (.cse71 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse93 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse93 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29))) (= c_~name_2~0 .cse93))))) (.cse76 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse92 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse92 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24))) (= c_~name_2~0 .cse92))))) (.cse80 (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24)))))) (and (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29)))) .cse8 .cse9) (or .cse12 (and (or .cse71 .cse16) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse72 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse72 c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0)) (= c_~name_2~0 .cse72)))) .cse14))) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_29)))) .cse8 .cse9) (or (and (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse73 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)) (= .cse73 c_~name_1~0) (= c_~name_2~0 .cse73)))) .cse14) (or .cse74 .cse16)) .cse12) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24)))) (forall ((v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) (or (and (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse75 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse75 c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0)) (= c_~name_2~0 .cse75)))) .cse14) (or .cse76 .cse16)) .cse12) (or (and (or .cse28 .cse31) (or .cse1 (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_24))))) .cse9 .cse10) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))))) (or .cse12 (let ((.cse77 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0)))))) (and (or .cse1 .cse77) (or .cse32 .cse77 .cse33 .cse31) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0)))) (or .cse26 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse78 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_2~0)) (= .cse78 c_~name_1~0) (= c_~name_2~0 .cse78)))) .cse27 .cse28 .cse31)))) (or .cse9 (and .cse21 (or .cse1 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24))))))) (or (and (or (and .cse50 (or .cse1 .cse10) (or .cse32 .cse33 .cse10 .cse31)) .cse79) (or .cse80 .cse81 .cse26 .cse27 .cse28 .cse31)) .cse12) (or .cse9 (and .cse21 (or .cse1 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29))))))) (or .cse1 (and (or (and .cse80 .cse9 .cse79) .cse10) (or .cse12 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_24)))))))) (or .cse1 (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29)))))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0))))) (or .cse12 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_29)))))) .cse18)) (or .cse8 .cse9 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_24))))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_29))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))) (or .cse12 (let ((.cse82 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)) (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)) (forall ((v_arrayElimCell_25 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29)))))) (or .cse82 .cse1) (or .cse26 .cse27 .cse74 .cse28 .cse31) (or .cse82 .cse32 .cse33 .cse31)))) (or .cse81 .cse12 (and (or .cse14 .cse79) (or .cse80 .cse16))) (or .cse8 .cse9 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_2~0)))) (or .cse12 (let ((.cse84 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0)))))) (and (or .cse26 .cse27 .cse28 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse83 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse83 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_29))) (= c_~name_2~0 .cse83)))) .cse31) (or .cse1 .cse84) (or .cse32 .cse33 .cse84 .cse31) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0)) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29)))))))) (or (let ((.cse85 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0)))))) (and (or .cse1 .cse85) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (forall ((v_arrayElimCell_25 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29)))) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29) c_~name_1~0)))) (or .cse26 .cse27 .cse71 .cse28 .cse31) (or .cse32 .cse85 .cse33 .cse31))) .cse12) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_2~0)) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))) (or .cse12 (let ((.cse86 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0)))))) (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0)) (forall ((v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29)))))) (or .cse86 .cse32 .cse33 .cse31) (or .cse76 .cse26 .cse27 .cse28 .cse31) (or .cse86 .cse1)))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_24))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))) (or (let ((.cse88 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))))) (and (or .cse26 .cse27 .cse28 .cse31 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse87 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse87 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (= c_~name_2~0 .cse87))))) (or .cse32 .cse88 .cse33 .cse31) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))) (or .cse1 .cse88))) .cse12) (or (let ((.cse89 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_24) c_~name_1~0)))))) (and (or .cse1 .cse89) (or .cse26 .cse27 .cse28 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (let ((.cse90 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (= .cse90 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_24))) (= c_~name_2~0 .cse90)))) .cse31) (or .cse32 .cse89 .cse33 .cse31) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_26) v_arrayElimCell_24) c_~name_1~0)))))) .cse12) (or (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29)))))) (or (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))))) .cse12) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) .cse18) .cse1) (or (and .cse21 (or .cse1 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29)) (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) .cse9) (or .cse80 .cse91) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_29))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))) (or (and (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24)))))) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0) (forall ((v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_1~0))))) .cse18 (or .cse12 (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_24 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_24) c_~name_2~0)) (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0))))) .cse1) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_22 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_26 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8)) (v_arrayElimCell_28 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_28 v_arrayElimCell_22) v_arrayElimCell_26) v_arrayElimCell_29))) (not (= (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29) c_~name_1~0)))))) .cse11) (let ((.cse97 (= c_~break_6~0 (_ bv1 32)))) (or (and .cse96 .cse97) (and .cse98 (or (and .cse97 .cse99) (and .cse1 .cse100))))) (or .cse91 .cse9) (or (and .cse100 (or .cse98 (= (_ bv0 32) (bvadd c_~result_3~0 (_ bv1 32))))) (and (= c_~result_3~0 (_ bv1 32)) .cse99)) (forall ((v_arrayElimCell_23 (_ BitVec 8)) (v_arrayElimCell_25 (_ BitVec 8)) (v_arrayElimCell_27 (_ BitVec 8)) (v_arrayElimCell_29 (_ BitVec 8))) (let ((.cse101 (concat (concat (concat v_arrayElimCell_27 v_arrayElimCell_25) v_arrayElimCell_23) v_arrayElimCell_29))) (or (not (= c_~name_2~0 .cse101)) (not (= .cse101 c_~name_1~0)))))))))) is different from false [2023-11-29 04:25:35,385 INFO L124 PetriNetUnfolderBase]: 1570/3315 cut-off events. [2023-11-29 04:25:35,385 INFO L125 PetriNetUnfolderBase]: For 14503/14505 co-relation queries the response was YES. [2023-11-29 04:25:35,392 INFO L83 FinitePrefix]: Finished finitePrefix Result has 12699 conditions, 3315 events. 1570/3315 cut-off events. For 14503/14505 co-relation queries the response was YES. Maximal size of possible extension queue 194. Compared 24416 event pairs, 266 based on Foata normal form. 8/3319 useless extension candidates. Maximal degree in co-relation 12668. Up to 589 conditions per place. [2023-11-29 04:25:35,399 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 178 selfloop transitions, 188 changer transitions 19/393 dead transitions. [2023-11-29 04:25:35,400 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 139 places, 393 transitions, 4119 flow [2023-11-29 04:25:35,401 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 36 states. [2023-11-29 04:25:35,402 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 36 states. [2023-11-29 04:25:35,403 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 36 states to 36 states and 1142 transitions. [2023-11-29 04:25:35,403 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.6344444444444445 [2023-11-29 04:25:35,403 INFO L72 ComplementDD]: Start complementDD. Operand 36 states and 1142 transitions. [2023-11-29 04:25:35,403 INFO L73 IsDeterministic]: Start isDeterministic. Operand 36 states and 1142 transitions. [2023-11-29 04:25:35,404 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:25:35,404 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 36 states and 1142 transitions. [2023-11-29 04:25:35,405 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 37 states, 36 states have (on average 31.72222222222222) internal successors, (1142), 36 states have internal predecessors, (1142), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:35,407 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 37 states, 37 states have (on average 50.0) internal successors, (1850), 37 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:35,408 INFO L81 ComplementDD]: Finished complementDD. Result has 37 states, 37 states have (on average 50.0) internal successors, (1850), 37 states have internal predecessors, (1850), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:35,408 INFO L175 Difference]: Start difference. First operand has 104 places, 122 transitions, 1358 flow. Second operand 36 states and 1142 transitions. [2023-11-29 04:25:35,408 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 139 places, 393 transitions, 4119 flow [2023-11-29 04:25:35,435 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 135 places, 393 transitions, 4005 flow, removed 11 selfloop flow, removed 4 redundant places. [2023-11-29 04:25:35,443 INFO L231 Difference]: Finished difference. Result has 155 places, 250 transitions, 3409 flow [2023-11-29 04:25:35,443 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=1293, PETRI_DIFFERENCE_MINUEND_PLACES=100, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=122, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=80, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=28, PETRI_DIFFERENCE_SUBTRAHEND_STATES=36, PETRI_FLOW=3409, PETRI_PLACES=155, PETRI_TRANSITIONS=250} [2023-11-29 04:25:35,443 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 106 predicate places. [2023-11-29 04:25:35,443 INFO L495 AbstractCegarLoop]: Abstraction has has 155 places, 250 transitions, 3409 flow [2023-11-29 04:25:35,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 27.25) internal successors, (436), 16 states have internal predecessors, (436), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:25:35,444 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:25:35,444 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:25:35,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (32)] Ended with exit code 0 [2023-11-29 04:25:35,644 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:25:35,645 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:25:35,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:25:35,645 INFO L85 PathProgramCache]: Analyzing trace with hash -354226466, now seen corresponding path program 3 times [2023-11-29 04:25:35,645 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:25:35,645 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1763234708] [2023-11-29 04:25:35,645 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 04:25:35,645 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-29 04:25:35,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:25:35,646 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:25:35,647 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (33)] Waiting until timeout for monitored process [2023-11-29 04:25:35,810 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 2 check-sat command(s) [2023-11-29 04:25:35,810 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:25:35,816 INFO L262 TraceCheckSpWp]: Trace formula consists of 151 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 04:25:35,819 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:25:36,696 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:25:36,696 INFO L378 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 566 treesize of output 214 [2023-11-29 04:25:37,246 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:25:37,246 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:25:44,388 INFO L349 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2023-11-29 04:25:44,388 INFO L378 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 856 treesize of output 414 [2023-11-29 04:26:33,720 WARN L293 SmtUtils]: Spent 5.93s on a formula simplification. DAG size of input: 691 DAG size of output: 692 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:27:14,788 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:27:14,789 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:27:14,789 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1763234708] [2023-11-29 04:27:14,789 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1763234708] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:27:14,789 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:27:14,789 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-11-29 04:27:14,789 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1582120435] [2023-11-29 04:27:14,789 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:27:14,789 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 04:27:14,790 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:27:14,790 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 04:27:14,790 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=54, Invalid=185, Unknown=1, NotChecked=0, Total=240 [2023-11-29 04:27:19,159 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:27:24,728 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:27:26,630 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.89s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:27:30,832 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:27:35,578 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:27:35,578 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 21 out of 50 [2023-11-29 04:27:35,579 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 155 places, 250 transitions, 3409 flow. Second operand has 16 states, 16 states have (on average 23.25) internal successors, (372), 16 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:27:35,579 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:27:35,579 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 21 of 50 [2023-11-29 04:27:35,579 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:27:58,285 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:28:02,404 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:28:06,409 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 04:28:29,573 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:28:33,576 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:28:37,581 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:28:41,976 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:28:45,980 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:28:49,983 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:28:54,215 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:28:58,218 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:29:02,223 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:29:06,236 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.01s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:29:10,241 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:29:14,386 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:29:18,391 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:29:22,396 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:29:26,400 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:29:30,403 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:29:34,408 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.00s for a HTC check with result UNKNOWN. Formula has sorts [Bool, BitVec], hasArrays=false, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 04:29:38,479 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse318 ((_ sign_extend 32) c_~name_1~0)) (.cse317 ((_ sign_extend 32) c_~name_2~0)) (.cse355 (bvadd c_~name_1~0 (bvneg c_~name_2~0)))) (let ((.cse289 (bvslt .cse355 (_ bv0 32))) (.cse254 (not (bvsge .cse318 (bvadd (_ bv18446744071562067968 64) .cse317)))) (.cse93 (bvslt (bvadd c_~i_4~0 (_ bv1 32)) (_ bv3 32))) (.cse41 (= c_~break_6~0 (_ bv0 32))) (.cse314 (bvmul (_ bv4 32) c_~i_4~0))) (let ((.cse295 (bvmul (_ bv4 32) c_~i_8~0)) (.cse316 (bvadd c_~name_2~0 (bvneg c_~name_1~0))) (.cse315 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse360 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (let ((.cse359 (concat (concat .cse360 v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse359 c_~name_1~0) (not (= (concat (concat .cse360 v_arrayElimCell_34) v_arrayElimCell_40) c_~name_2~0)) (= c_~name_2~0 .cse359)))))) (.cse152 (= c_~name_2~0 c_~name_1~0)) (.cse282 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse358 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (or (not (= (concat (concat .cse358 v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat .cse358 v_arrayElimCell_34) v_arrayElimCell_37)))))))) (.cse284 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)) (forall ((v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37))))))) (.cse285 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37)))) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))))) (.cse287 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse357 (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36))) (or (forall ((v_arrayElimCell_37 (_ BitVec 8))) (not (= c_~name_2~0 (concat .cse357 v_arrayElimCell_37)))) (not (= (concat .cse357 v_arrayElimCell_40) c_~name_1~0)))))) (.cse302 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (forall ((v_arrayElimCell_35 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40)))) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))))) (.cse303 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_2~0))) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))))) (.cse153 (= .cse314 (_ bv0 32))) (.cse280 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse356 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (or (not (= (concat (concat .cse356 v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)) (forall ((v_arrayElimCell_34 (_ BitVec 8))) (not (= (concat (concat .cse356 v_arrayElimCell_34) v_arrayElimCell_40) c_~name_2~0))))))) (.cse91 (bvsgt .cse355 (_ bv0 32))) (.cse92 (and (not (bvsge c_~name_2~0 (_ bv0 32))) (not (bvsle c_~name_1~0 (bvadd c_~name_2~0 (_ bv2147483647 32)))))) (.cse199 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))))) (.cse150 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)))) (.cse59 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))) (.cse320 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse354 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse354 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40))) (= c_~name_2~0 .cse354))))) (.cse321 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse353 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse353 c_~name_1~0) (= c_~name_2~0 .cse353) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_2~0)))))) (.cse335 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse352 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (let ((.cse351 (concat (concat .cse352 v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse351 c_~name_1~0) (not (= c_~name_2~0 (concat (concat .cse352 v_arrayElimCell_34) v_arrayElimCell_37))) (= c_~name_2~0 .cse351)))))) (.cse338 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse350 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse350 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37))) (= c_~name_2~0 .cse350))))) (.cse337 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse348 (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36))) (let ((.cse349 (concat .cse348 v_arrayElimCell_40))) (or (not (= c_~name_2~0 (concat .cse348 v_arrayElimCell_37))) (= .cse349 c_~name_1~0) (= c_~name_2~0 .cse349)))))) (.cse336 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse347 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse347 c_~name_1~0) (= c_~name_2~0 .cse347) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37))))))) (.cse255 (not .cse41)) (.cse328 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse346 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_37))) (= .cse346 c_~name_1~0) (= c_~name_2~0 .cse346))))) (.cse258 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37))))) (.cse18 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse345 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse345 c_~name_1~0) (= c_~name_2~0 .cse345))))) (.cse334 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse344 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse344 c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (= c_~name_2~0 .cse344))))) (.cse332 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse343 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse343 c_~name_1~0) (= c_~name_2~0 .cse343) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_40))))))) (.cse333 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse342 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse342 c_~name_1~0) (= c_~name_2~0 .cse342) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37))))))) (.cse327 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse341 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40))) (= .cse341 c_~name_1~0) (= c_~name_2~0 .cse341))))) (.cse325 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse340 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse340 c_~name_1~0) (= c_~name_2~0 .cse340) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_2~0)))))) (.cse330 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse339 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse339 c_~name_1~0) (= c_~name_2~0 .cse339) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_2~0)))))) (.cse319 (and (or .cse289 .cse254 .cse93) .cse41))) (let ((.cse0 (or .cse330 .cse319)) (.cse1 (or .cse325 .cse319)) (.cse2 (or .cse327 .cse319)) (.cse6 (or .cse333 .cse319)) (.cse11 (or .cse319 .cse332)) (.cse14 (or .cse334 .cse319)) (.cse15 (or .cse258 .cse18 .cse319)) (.cse20 (or .cse328 .cse319)) (.cse101 (or .cse336 .cse289 .cse254 .cse255 .cse93)) (.cse105 (or .cse337 .cse289 .cse254 .cse255 .cse93)) (.cse114 (or .cse338 .cse289 .cse254 .cse255 .cse93)) (.cse121 (or .cse335 .cse289 .cse254 .cse255 .cse93)) (.cse136 (or .cse321 .cse289 .cse254 .cse255 .cse93)) (.cse138 (or .cse320 .cse289 .cse254 .cse255 .cse93)) (.cse68 (or .cse59 .cse258)) (.cse32 (or .cse338 .cse319)) (.cse33 (or .cse337 .cse319)) (.cse39 (or .cse336 .cse319)) (.cse40 (or .cse335 .cse319)) (.cse147 (or .cse150 .cse258)) (.cse159 (or .cse334 .cse289 .cse254 .cse255 .cse93)) (.cse160 (or .cse289 .cse254 .cse333 .cse255 .cse93)) (.cse161 (or .cse289 .cse254 .cse255 .cse93 .cse332)) (.cse65 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (let ((.cse331 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37))) (or (= c_~name_2~0 .cse331) (= .cse331 c_~name_1~0))))) (.cse167 (or .cse330 .cse289 .cse254 .cse255 .cse93)) (.cse61 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse329 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse329 c_~name_1~0) (not (= c_~name_2~0 .cse329)))))) (.cse170 (or .cse289 .cse254 .cse328 .cse255 .cse93)) (.cse171 (or .cse289 .cse254 .cse255 .cse327 .cse93)) (.cse165 (and (or .cse59 .cse91 .cse92 .cse93) (or .cse59 .cse41) .cse199)) (.cse19 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (let ((.cse326 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37))) (or (= c_~name_2~0 .cse326) (not (= .cse326 c_~name_1~0)))))) (.cse172 (or .cse289 .cse258 .cse254 .cse255 .cse18 .cse93)) (.cse174 (or .cse289 .cse254 .cse255 .cse325 .cse93)) (.cse182 (or .cse153 .cse280)) (.cse143 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_37))))))) (.cse144 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_40))))))) (.cse145 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (forall ((v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_2~0))) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))))) (.cse146 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)) (forall ((v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37))))))) (.cse148 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40))))))) (.cse149 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)) (forall ((v_arrayElimCell_41 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))))))) (.cse151 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)) (forall ((v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_2~0)))))) (.cse194 (or (and .cse302 .cse303) .cse153)) (.cse211 (or (and .cse282 .cse284 .cse285 .cse287) .cse153)) (.cse49 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37))))))) (.cse53 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse324 (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36))) (or (= (concat .cse324 v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_37 (_ BitVec 8))) (not (= c_~name_2~0 (concat .cse324 v_arrayElimCell_37)))))))) (.cse54 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37))))))) (.cse56 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse323 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (or (= (concat (concat .cse323 v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat .cse323 v_arrayElimCell_34) v_arrayElimCell_37)))))))) (.cse46 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse322 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (or (= (concat (concat .cse322 v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_34 (_ BitVec 8))) (not (= (concat (concat .cse322 v_arrayElimCell_34) v_arrayElimCell_40) c_~name_2~0))))))) (.cse72 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_2~0)))))) (.cse76 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_2~0)))))) (.cse78 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_41 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))))))) (.cse81 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40))))))) (.cse82 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_37))))))) (.cse84 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37))))))) (.cse86 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_40))))))) (.cse42 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_2~0)))))) (.cse44 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (forall ((v_arrayElimCell_35 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40)))) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)))) (.cse208 (or .cse321 .cse319)) (.cse209 (or .cse320 .cse319)) (.cse275 (not .cse152)) (.cse183 (or .cse315 .cse319)) (.cse5 (and .cse41 (or .cse91 .cse92 .cse93))) (.cse62 (not (bvsge .cse317 (bvadd (_ bv18446744071562067968 64) .cse318)))) (.cse142 (bvslt .cse316 (_ bv0 32))) (.cse60 (= c_~break_10~0 (_ bv0 32))) (.cse63 (bvslt (bvadd (_ bv1 32) c_~i_8~0) (_ bv3 32))) (.cse64 (and (not (bvsle c_~name_2~0 (bvadd (_ bv2147483647 32) c_~name_1~0))) (not (bvsge c_~name_1~0 (_ bv0 32))))) (.cse97 (bvsgt .cse316 (_ bv0 32))) (.cse156 (or .cse289 .cse315 .cse254 .cse255 .cse93)) (.cse25 (= .cse295 .cse314))) (and (or (and .cse0 .cse1 .cse2 (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse3 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)) (.cse4 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse3 c_~name_1~0) (not (= .cse4 c_~name_1~0)) (= c_~name_2~0 .cse3) (= c_~name_2~0 .cse4)))) .cse5) .cse6 (or .cse5 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse7 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37)) (.cse8 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (not (= .cse7 c_~name_1~0)) (= c_~name_2~0 .cse7) (= .cse8 c_~name_1~0) (= c_~name_2~0 .cse8))))) (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse9 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)) (.cse10 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_40))) (or (= .cse9 c_~name_1~0) (= c_~name_2~0 .cse10) (= c_~name_2~0 .cse9) (not (= .cse10 c_~name_1~0))))) .cse5) .cse11 (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse12 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)) (.cse13 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse12 c_~name_1~0) (= c_~name_2~0 .cse12) (not (= .cse13 c_~name_1~0)) (= .cse13 c_~name_2~0)))) .cse5) .cse14 .cse15 (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse17 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)) (.cse16 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_37))) (or (not (= .cse16 c_~name_1~0)) (= .cse17 c_~name_1~0) (= c_~name_2~0 .cse17) (= c_~name_2~0 .cse16)))) .cse5) (or .cse18 .cse5 .cse19) .cse20 (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse21 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_37)) (.cse22 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse21 c_~name_2~0) (not (= .cse21 c_~name_1~0)) (= .cse22 c_~name_1~0) (= c_~name_2~0 .cse22)))) .cse5) (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse23 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)) (.cse24 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40))) (or (= .cse23 c_~name_1~0) (= c_~name_2~0 .cse23) (not (= .cse24 c_~name_1~0)) (= c_~name_2~0 .cse24)))) .cse5)) .cse25) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse26 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (not (= .cse26 c_~name_1~0)) (not (= c_~name_2~0 .cse26))))) (or .cse25 (and (or .cse5 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse29 (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36))) (let ((.cse28 (concat .cse29 v_arrayElimCell_40)) (.cse27 (concat .cse29 v_arrayElimCell_37))) (or (not (= .cse27 c_~name_1~0)) (= .cse28 c_~name_1~0) (= c_~name_2~0 .cse28) (= c_~name_2~0 .cse27)))))) (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse31 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37)) (.cse30 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse30 c_~name_1~0) (= c_~name_2~0 .cse31) (not (= .cse31 c_~name_1~0)) (= c_~name_2~0 .cse30)))) .cse5) .cse32 .cse33 (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse36 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (let ((.cse35 (concat (concat .cse36 v_arrayElimCell_36) v_arrayElimCell_40)) (.cse34 (concat (concat .cse36 v_arrayElimCell_34) v_arrayElimCell_37))) (or (= c_~name_2~0 .cse34) (= .cse35 c_~name_1~0) (= c_~name_2~0 .cse35) (not (= .cse34 c_~name_1~0)))))) .cse5) (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse37 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)) (.cse38 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37))) (or (= .cse37 c_~name_1~0) (= c_~name_2~0 .cse37) (not (= .cse38 c_~name_1~0)) (= c_~name_2~0 .cse38)))) .cse5) .cse39 .cse40)) (or .cse41 (and (or (and .cse42 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse43 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40))) (or (not (= .cse43 c_~name_1~0)) (= c_~name_2~0 .cse43)))))) .cse44 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8))) (let ((.cse45 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40))) (or (not (= .cse45 c_~name_1~0)) (= .cse45 c_~name_2~0))))))) .cse25) (or (and .cse46 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse47 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (or (= (concat (concat .cse47 v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_34 (_ BitVec 8))) (let ((.cse48 (concat (concat .cse47 v_arrayElimCell_34) v_arrayElimCell_40))) (or (= .cse48 c_~name_2~0) (not (= .cse48 c_~name_1~0))))))))) .cse25) (or (and .cse49 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse50 (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36))) (or (= (concat .cse50 v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_37 (_ BitVec 8))) (let ((.cse51 (concat .cse50 v_arrayElimCell_37))) (or (not (= .cse51 c_~name_1~0)) (= c_~name_2~0 .cse51))))))) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8))) (let ((.cse52 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37))) (or (not (= .cse52 c_~name_1~0)) (= c_~name_2~0 .cse52)))))) .cse53 .cse54 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8))) (let ((.cse55 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37))) (or (= c_~name_2~0 .cse55) (not (= .cse55 c_~name_1~0))))))) .cse56 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse57 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (or (= (concat (concat .cse57 v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8))) (let ((.cse58 (concat (concat .cse57 v_arrayElimCell_34) v_arrayElimCell_37))) (or (= c_~name_2~0 .cse58) (not (= .cse58 c_~name_1~0))))))))) .cse25) (or .cse59 .cse60) .cse61 (or .cse59 .cse62 .cse63 .cse64) (or (and (or .cse59 .cse65 .cse62 .cse63 .cse64) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (forall ((v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (let ((.cse66 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_37))) (or (= .cse66 c_~name_2~0) (not (= .cse66 c_~name_1~0))))) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))) (or .cse62 .cse63 .cse64 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse67 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (= .cse67 c_~name_1~0) (= c_~name_2~0 .cse67))))) .cse68 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (forall ((v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (let ((.cse69 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40))) (or (not (= .cse69 c_~name_1~0)) (= .cse69 c_~name_2~0)))) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (let ((.cse70 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40))) (or (not (= .cse70 c_~name_1~0)) (= c_~name_2~0 .cse70)))))) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_41 (_ BitVec 8))) (let ((.cse71 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (not (= .cse71 c_~name_1~0)) (= c_~name_2~0 .cse71)))))) (or .cse59 .cse19) .cse72 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (let ((.cse73 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37))) (or (not (= .cse73 c_~name_1~0)) (= c_~name_2~0 .cse73)))))) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (let ((.cse74 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_40))) (or (= c_~name_2~0 .cse74) (not (= .cse74 c_~name_1~0))))) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))) (or .cse62 .cse63 .cse64 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse75 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37))) (or (= c_~name_2~0 .cse75) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (= .cse75 c_~name_1~0))))) .cse76 (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse77 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (= c_~name_2~0 .cse77) (= .cse77 c_~name_1~0)))) .cse62 .cse63 .cse64) .cse78 (or .cse62 .cse63 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse79 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_37))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (= .cse79 c_~name_1~0) (= c_~name_2~0 .cse79)))) .cse64) (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse80 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse80 c_~name_1~0) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (= .cse80 c_~name_2~0)))) .cse62 .cse63 .cse64) .cse81 .cse82 (or .cse62 .cse63 .cse64 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse83 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_37))) (or (= .cse83 c_~name_2~0) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (= .cse83 c_~name_1~0))))) .cse84 (or .cse62 .cse63 .cse64 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse85 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_40))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (= c_~name_2~0 .cse85) (= .cse85 c_~name_1~0))))) .cse86 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (let ((.cse87 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_37))) (or (not (= .cse87 c_~name_1~0)) (= c_~name_2~0 .cse87))))))) .cse25))) (or .cse25 (let ((.cse89 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse127 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (let ((.cse126 (concat (concat .cse127 v_arrayElimCell_34) v_arrayElimCell_37))) (or (= c_~name_2~0 .cse126) (= (concat (concat .cse127 v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= .cse126 c_~name_1~0))))))) (.cse107 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse125 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (= c_~name_2~0 .cse125) (not (= .cse125 c_~name_1~0)))))) (.cse106 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse124 (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36))) (let ((.cse123 (concat .cse124 v_arrayElimCell_37))) (or (not (= .cse123 c_~name_1~0)) (= (concat .cse124 v_arrayElimCell_40) c_~name_1~0) (= c_~name_2~0 .cse123)))))) (.cse94 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse122 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= .cse122 c_~name_1~0)) (= c_~name_2~0 .cse122)))))) (and (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse88 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse88 c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37)) (not (= c_~name_2~0 .cse88))))) .cse60) (or .cse89 .cse41) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8))) (let ((.cse90 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37))) (or (not (= .cse90 c_~name_1~0)) (forall ((v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)))) (= c_~name_2~0 .cse90)))) (or .cse91 .cse89 .cse92 .cse93) (or .cse41 .cse94) (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse95 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (let ((.cse96 (concat (concat .cse95 v_arrayElimCell_36) v_arrayElimCell_40))) (or (= c_~name_2~0 (concat (concat .cse95 v_arrayElimCell_34) v_arrayElimCell_37)) (= .cse96 c_~name_1~0) (not (= c_~name_2~0 .cse96)))))) .cse60) (or .cse63 .cse64 .cse97 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse100 (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36))) (let ((.cse99 (concat .cse100 v_arrayElimCell_37)) (.cse98 (concat .cse100 v_arrayElimCell_40))) (or (= .cse98 c_~name_1~0) (= .cse99 c_~name_1~0) (= c_~name_2~0 .cse99) (not (= c_~name_2~0 .cse98))))))) .cse101 (or .cse63 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse104 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (let ((.cse102 (concat (concat .cse104 v_arrayElimCell_34) v_arrayElimCell_37)) (.cse103 (concat (concat .cse104 v_arrayElimCell_36) v_arrayElimCell_40))) (or (= c_~name_2~0 .cse102) (= .cse103 c_~name_1~0) (= .cse102 c_~name_1~0) (not (= c_~name_2~0 .cse103)))))) .cse64 .cse97) .cse105 (or .cse41 .cse106) (or .cse41 .cse107) (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse108 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse108 c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37)) (not (= c_~name_2~0 .cse108))))) .cse60) (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse110 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37)) (.cse109 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse109 c_~name_1~0) (= c_~name_2~0 .cse110) (= .cse110 c_~name_1~0) (not (= c_~name_2~0 .cse109))))) .cse63 .cse64 .cse97) (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse112 (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36))) (let ((.cse111 (concat .cse112 v_arrayElimCell_40))) (or (= .cse111 c_~name_1~0) (= c_~name_2~0 (concat .cse112 v_arrayElimCell_37)) (not (= c_~name_2~0 .cse111)))))) .cse60) (or .cse91 .cse92 .cse107 .cse93) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8))) (let ((.cse113 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37))) (or (= c_~name_2~0 .cse113) (not (= .cse113 c_~name_1~0)) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))))))) .cse114 (or .cse91 .cse106 .cse92 .cse93) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8))) (let ((.cse116 (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36))) (let ((.cse115 (concat .cse116 v_arrayElimCell_37))) (or (not (= .cse115 c_~name_1~0)) (= c_~name_2~0 .cse115) (forall ((v_arrayElimCell_40 (_ BitVec 8))) (not (= c_~name_2~0 (concat .cse116 v_arrayElimCell_40)))))))) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8))) (let ((.cse118 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (let ((.cse117 (concat (concat .cse118 v_arrayElimCell_34) v_arrayElimCell_37))) (or (= c_~name_2~0 .cse117) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat .cse118 v_arrayElimCell_36) v_arrayElimCell_40)))) (not (= .cse117 c_~name_1~0)))))) (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse119 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37)) (.cse120 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse119 c_~name_1~0) (= .cse120 c_~name_1~0) (= c_~name_2~0 .cse119) (not (= c_~name_2~0 .cse120))))) .cse63 .cse64 .cse97) .cse121 (or .cse91 .cse94 .cse92 .cse93)))) (or (let ((.cse128 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse141 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= .cse141 c_~name_1~0)) (= .cse141 c_~name_2~0))))) (.cse132 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse140 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40))) (or (not (= .cse140 c_~name_1~0)) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (= c_~name_2~0 .cse140)))))) (and (or .cse91 .cse128 .cse92 .cse93) (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse129 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)) (.cse130 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40))) (or (= .cse129 c_~name_1~0) (= .cse130 c_~name_1~0) (not (= c_~name_2~0 .cse129)) (= .cse130 c_~name_2~0)))) .cse63 .cse64 .cse97) (or .cse128 .cse41) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse131 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40))) (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)))) (not (= .cse131 c_~name_1~0)) (= .cse131 c_~name_2~0)))) (or .cse91 .cse132 .cse92 .cse93) (or .cse60 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse133 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse133 c_~name_1~0) (not (= c_~name_2~0 .cse133)) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_2~0))))) (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse134 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40)) (.cse135 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse134 c_~name_1~0) (= .cse135 c_~name_1~0) (= c_~name_2~0 .cse134) (not (= c_~name_2~0 .cse135))))) .cse63 .cse64 .cse97) .cse136 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse137 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40))) (or (not (= .cse137 c_~name_1~0)) (forall ((v_arrayElimCell_38 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)))) (= c_~name_2~0 .cse137)))) .cse138 (or .cse60 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse139 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse139 c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40)) (not (= c_~name_2~0 .cse139)))))) (or .cse41 .cse132))) .cse25) (or (and (or .cse62 .cse63 .cse142 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_37) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))))) .cse143 .cse144 .cse145 (or .cse62 .cse63 .cse142 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))))) .cse146 .cse147 (or .cse62 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)) (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_1~0))) .cse63 .cse142) (or .cse62 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)) (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0))) .cse63 .cse142) .cse148 .cse149 (or .cse62 .cse63 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)) (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0))) .cse142) (or .cse150 .cse62 .cse63 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37) c_~name_1~0)) .cse142) .cse151 (or .cse62 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)))) .cse63 .cse142) (or .cse62 .cse63 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)))) .cse142)) .cse25) (or .cse152 (let ((.cse166 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37) c_~name_1~0))))) (and (or .cse153 (let ((.cse154 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse157 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (or (= (concat (concat .cse157 v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= (concat (concat .cse157 v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0))))))) (and (or .cse91 .cse154 .cse92 .cse93) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse155 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (or (forall ((v_arrayElimCell_36 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat .cse155 v_arrayElimCell_36) v_arrayElimCell_40)))) (not (= (concat (concat .cse155 v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0))))) (or .cse41 .cse154) .cse156))) (or (let ((.cse164 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0))))) (.cse162 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_1~0)) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)))) (.cse168 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))))) (.cse163 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_37) c_~name_1~0)) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)))) (.cse169 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_1~0)) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)))) (.cse158 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))))) (.cse173 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0)))))) (and (or .cse91 .cse158 .cse92 .cse93) .cse159 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (forall ((v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)))) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)))) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_1~0)) (forall ((v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)))))) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (forall ((v_arrayElimCell_39 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)))) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)))) .cse160 .cse161 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_1~0)) (forall ((v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)))))) (or .cse91 .cse162 .cse92 .cse93) (or .cse91 .cse163 .cse92 .cse93) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0)) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)))))) (or .cse164 .cse41) (or .cse165 .cse166) (or .cse91 .cse164 .cse92 .cse93) .cse167 (or .cse41 .cse162) (or .cse91 .cse168 .cse92 .cse93) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_37) c_~name_1~0)) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)))))) (or .cse91 .cse169 .cse92 .cse93) (or .cse41 .cse168) .cse170 (or .cse163 .cse41) .cse171 .cse172 (or .cse169 .cse41) (or .cse41 .cse173) (or .cse158 .cse41) .cse174 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)))) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0)))) (or .cse91 .cse173 .cse92 .cse93))) .cse153) (or .cse153 (and .cse0 (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse175 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse175 c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)) (= c_~name_2~0 .cse175)))) .cse5) .cse1 (or .cse166 .cse18 .cse5) (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse176 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_1~0)) (= .cse176 c_~name_1~0) (= c_~name_2~0 .cse176)))) .cse5) .cse2 .cse6 (or .cse5 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse177 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_1~0)) (= .cse177 c_~name_1~0) (= c_~name_2~0 .cse177))))) (or .cse5 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse178 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse178 c_~name_1~0) (= c_~name_2~0 .cse178) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)))))) (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse179 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse179 c_~name_1~0) (= c_~name_2~0 .cse179) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0))))) .cse5) .cse11 .cse14 .cse15 (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse180 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_37) c_~name_1~0)) (= .cse180 c_~name_1~0) (= c_~name_2~0 .cse180)))) .cse5) (or .cse5 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse181 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse181 c_~name_1~0) (= c_~name_2~0 .cse181) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0)))))) .cse20)) .cse182 (or (and .cse183 (or .cse5 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse185 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (let ((.cse184 (concat (concat .cse185 v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse184 c_~name_1~0) (= c_~name_2~0 .cse184) (not (= (concat (concat .cse185 v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0)))))))) .cse153) (or (let ((.cse186 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse193 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (or (= (concat (concat .cse193 v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= (concat (concat .cse193 v_arrayElimCell_34) v_arrayElimCell_37) c_~name_1~0)))))) (.cse189 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37) c_~name_1~0))))) (.cse187 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_1~0))))) (.cse188 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse192 (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36))) (or (not (= (concat .cse192 v_arrayElimCell_37) c_~name_1~0)) (= (concat .cse192 v_arrayElimCell_40) c_~name_1~0)))))) (and (or .cse91 .cse186 .cse92 .cse93) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37) c_~name_1~0)) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)))))) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_1~0)) (forall ((v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)))))) (or .cse41 .cse187) .cse101 (or .cse91 .cse92 .cse188 .cse93) (or .cse41 .cse189) (or .cse41 .cse186) .cse105 (or .cse91 .cse189 .cse92 .cse93) (or .cse91 .cse92 .cse187 .cse93) .cse114 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8))) (let ((.cse190 (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36))) (or (not (= (concat .cse190 v_arrayElimCell_37) c_~name_1~0)) (forall ((v_arrayElimCell_40 (_ BitVec 8))) (not (= c_~name_2~0 (concat .cse190 v_arrayElimCell_40))))))) (or .cse41 .cse188) .cse121 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8))) (let ((.cse191 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat .cse191 v_arrayElimCell_36) v_arrayElimCell_40)))) (not (= (concat (concat .cse191 v_arrayElimCell_34) v_arrayElimCell_37) c_~name_1~0))))))) .cse153) .cse194 (or (let ((.cse196 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)))) (.cse195 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0)))))) (and (or .cse195 .cse41) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)))) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0)))) (or .cse91 .cse196 .cse92 .cse93) (or .cse41 .cse196) .cse136 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)) (forall ((v_arrayElimCell_38 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)))))) .cse138 (or .cse195 .cse91 .cse92 .cse93))) .cse153) (or (and (or (and (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (forall ((v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_1~0))) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0))))) .cse68 .cse72 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0))) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))) .cse76 (or .cse59 .cse166) .cse78 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_1~0))))) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_37) c_~name_1~0))))) .cse81 .cse82 .cse84 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))))) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_41 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))))) .cse86) .cse153) (or (and (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse197 (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36))) (or (= (concat .cse197 v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_37 (_ BitVec 8))) (not (= (concat .cse197 v_arrayElimCell_37) c_~name_1~0)))))) .cse49 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37) c_~name_1~0))))) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse198 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (or (= (concat (concat .cse198 v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8))) (not (= (concat (concat .cse198 v_arrayElimCell_34) v_arrayElimCell_37) c_~name_1~0)))))) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_1~0))))) .cse53 .cse54 .cse56) .cse153) (or (and (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_35 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))))) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8))) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0))))) .cse42 .cse44) .cse153) .cse199 (or .cse153 (and .cse46 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse200 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (or (= (concat (concat .cse200 v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (forall ((v_arrayElimCell_34 (_ BitVec 8))) (not (= (concat (concat .cse200 v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0))))))))) .cse41) (or .cse153 (and .cse32 .cse33 (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse201 (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36))) (let ((.cse202 (concat .cse201 v_arrayElimCell_40))) (or (not (= (concat .cse201 v_arrayElimCell_37) c_~name_1~0)) (= .cse202 c_~name_1~0) (= c_~name_2~0 .cse202))))) .cse5) .cse39 (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse204 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (let ((.cse203 (concat (concat .cse204 v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse203 c_~name_1~0) (= c_~name_2~0 .cse203) (not (= (concat (concat .cse204 v_arrayElimCell_34) v_arrayElimCell_37) c_~name_1~0)))))) .cse5) (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse205 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse205 c_~name_1~0) (= c_~name_2~0 .cse205) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_1~0))))) .cse5) .cse40 (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse206 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse206 c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37) c_~name_1~0)) (= c_~name_2~0 .cse206)))) .cse5))) (or (and (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse207 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)) (= .cse207 c_~name_1~0) (= c_~name_2~0 .cse207)))) .cse5) .cse208 .cse209 (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse210 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse210 c_~name_1~0) (= c_~name_2~0 .cse210) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0))))) .cse5)) .cse153) .cse211 (or (and .cse143 .cse144 .cse145 .cse146 .cse147 .cse148 .cse149 .cse151) .cse153)))) (or (let ((.cse220 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse253 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_37))) (or (= .cse253 c_~name_2~0) (not (= .cse253 c_~name_1~0)) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))))) (.cse227 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse252 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= .cse252 c_~name_1~0)) (= .cse252 c_~name_2~0))))) (.cse217 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse251 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_37))) (or (not (= .cse251 c_~name_1~0)) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (= c_~name_2~0 .cse251))))) (.cse228 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse250 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_40))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (= c_~name_2~0 .cse250) (not (= .cse250 c_~name_1~0)))))) (.cse224 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse249 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= .cse249 c_~name_1~0)) (= c_~name_2~0 .cse249))))) (.cse215 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse248 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37))) (or (not (= .cse248 c_~name_1~0)) (= c_~name_2~0 .cse248) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))))) (.cse212 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse247 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= .cse247 c_~name_1~0)) (= c_~name_2~0 .cse247)))))) (and (or .cse91 .cse212 .cse92 .cse93) .cse159 (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse214 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_40)) (.cse213 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse213 c_~name_1~0) (= c_~name_2~0 .cse214) (= .cse214 c_~name_1~0) (not (= c_~name_2~0 .cse213))))) .cse63 .cse64 .cse97) (or .cse91 .cse92 .cse93 .cse215) (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse216 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_2~0) (= .cse216 c_~name_1~0) (not (= c_~name_2~0 .cse216))))) .cse60) (or .cse91 .cse92 .cse93 .cse217) .cse160 .cse161 (or .cse63 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse219 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)) (.cse218 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse218 c_~name_1~0) (= .cse219 c_~name_1~0) (= c_~name_2~0 .cse219) (not (= c_~name_2~0 .cse218))))) .cse64 .cse97) (or .cse41 .cse220) (or .cse63 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse222 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_37)) (.cse221 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse221 c_~name_1~0) (= .cse222 c_~name_1~0) (= c_~name_2~0 .cse222) (not (= c_~name_2~0 .cse221))))) .cse64 .cse97) (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse223 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse223 c_~name_1~0) (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_2~0) (not (= c_~name_2~0 .cse223))))) .cse60) (or .cse91 .cse224 .cse92 .cse93) (or .cse65 .cse61 .cse63 .cse64 .cse97) (or .cse91 .cse220 .cse92 .cse93) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (let ((.cse225 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_37))) (or (not (= .cse225 c_~name_1~0)) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)))) (= c_~name_2~0 .cse225)))) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (let ((.cse226 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_37))) (or (= .cse226 c_~name_2~0) (not (= .cse226 c_~name_1~0)) (forall ((v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))))))) (or .cse41 .cse227) (or .cse91 .cse227 .cse92 .cse93) (or .cse91 .cse228 .cse92 .cse93) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (let ((.cse229 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37))) (or (not (= .cse229 c_~name_1~0)) (= c_~name_2~0 .cse229) (forall ((v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))))))) (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse230 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37)) (= .cse230 c_~name_1~0) (not (= c_~name_2~0 .cse230))))) .cse60) (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse231 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40)) (.cse232 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse231 c_~name_1~0) (= .cse232 c_~name_1~0) (= .cse231 c_~name_2~0) (not (= c_~name_2~0 .cse232))))) .cse63 .cse64 .cse97) .cse167 (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8))) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37))) .cse61 .cse60) (or .cse41 .cse217) (or .cse41 .cse228) (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse233 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse233 c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_40)) (not (= c_~name_2~0 .cse233))))) .cse60) (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse234 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_37)) (.cse235 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse234 c_~name_2~0) (= .cse235 c_~name_1~0) (= .cse234 c_~name_1~0) (not (= c_~name_2~0 .cse235))))) .cse63 .cse64 .cse97) (or .cse41 .cse224) (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse236 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37)) (.cse237 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= c_~name_2~0 .cse236) (= .cse237 c_~name_1~0) (= .cse236 c_~name_1~0) (not (= c_~name_2~0 .cse237))))) .cse63 .cse64 .cse97) (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse238 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse238 c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_37)) (not (= c_~name_2~0 .cse238))))) .cse60) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse239 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40))) (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)))) (not (= .cse239 c_~name_1~0)) (= c_~name_2~0 .cse239)))) (or .cse41 .cse215) (or .cse63 .cse64 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse241 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40)) (.cse240 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse240 c_~name_1~0) (= c_~name_2~0 .cse241) (= .cse241 c_~name_1~0) (not (= c_~name_2~0 .cse240))))) .cse97) .cse170 .cse171 (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse242 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse242 c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40)) (not (= c_~name_2~0 .cse242))))) .cse60) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse243 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (forall ((v_arrayElimCell_39 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)))) (not (= .cse243 c_~name_1~0)) (= c_~name_2~0 .cse243)))) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse244 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40))) (or (forall ((v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)))) (not (= .cse244 c_~name_1~0)) (= .cse244 c_~name_2~0)))) (or .cse165 .cse19) (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse245 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_40))) (or (= c_~name_2~0 .cse245) (not (= .cse245 c_~name_1~0)) (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))))))) .cse172 .cse174 (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse246 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse246 c_~name_1~0) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)) (not (= c_~name_2~0 .cse246))))) .cse60) (or .cse41 .cse212))) .cse25) (or .cse254 .cse18 .cse92 .cse93 .cse60) (or (let ((.cse256 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse274 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (or (= (concat (concat .cse274 v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= (concat (concat .cse274 v_arrayElimCell_34) v_arrayElimCell_40) c_~name_2~0)))))) (.cse266 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40)))))) (.cse267 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_2~0))))) (.cse260 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)))))) (.cse262 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40))) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)))) (.cse261 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37)))))) (.cse257 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_2~0))))) (.cse264 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_2~0))))) (.cse263 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_40)))))) (.cse259 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_41 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_41 v_arrayElimCell_38) v_arrayElimCell_34) v_arrayElimCell_37))) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)))) (.cse265 (and .cse41 .cse93)) (.cse270 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37)))))) (.cse269 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37)))))) (.cse268 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse273 (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36))) (or (not (= c_~name_2~0 (concat .cse273 v_arrayElimCell_37))) (= (concat .cse273 v_arrayElimCell_40) c_~name_1~0))))) (.cse271 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse272 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (or (= (concat (concat .cse272 v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= c_~name_2~0 (concat (concat .cse272 v_arrayElimCell_34) v_arrayElimCell_37)))))))) (and .cse150 (or .cse153 .cse255 .cse256 .cse93) (or (and (or .cse255 .cse257 .cse93) (or .cse59 .cse258 .cse255 .cse93) (or .cse259 .cse255 .cse93) (or .cse260 .cse255 .cse93) (or .cse261 .cse255 .cse93) (or .cse262 .cse255 .cse93) (or .cse255 .cse93 .cse263) (or .cse255 .cse93 .cse264)) .cse153) (or .cse153 (and (or .cse265 .cse266) (or .cse267 .cse265))) .cse182 (or .cse153 (and .cse143 .cse144 .cse145 .cse146 .cse148 .cse149 .cse151)) (or .cse153 .cse265 .cse256) .cse194 (or .cse153 (and (or .cse268 .cse265) (or .cse265 .cse269) (or .cse270 .cse265) (or .cse271 .cse265))) (or .cse59 .cse93) .cse211 (or .cse153 (and (or .cse255 .cse93 .cse266) (or .cse267 .cse255 .cse93))) (or .cse41 (and .cse59 (or .cse153 (and .cse49 .cse53 .cse54 .cse56)) (or .cse46 .cse153) (or .cse153 (and .cse72 .cse76 .cse78 .cse81 .cse82 .cse84 .cse86)) (or .cse153 (and .cse42 .cse44)))) (or .cse153 (and (or .cse260 .cse265) (or .cse262 .cse265) (or .cse59 .cse258 .cse265) (or .cse261 .cse265) (or .cse265 .cse257) (or .cse265 .cse264) (or .cse265 .cse263) (or .cse259 .cse265))) (or (and (or .cse255 .cse270 .cse93) (or .cse255 .cse269 .cse93) (or .cse268 .cse255 .cse93) (or .cse271 .cse255 .cse93)) .cse153))) .cse275) (or (and (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse277 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)) (.cse276 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40))) (or (not (= .cse276 c_~name_1~0)) (= .cse277 c_~name_1~0) (= c_~name_2~0 .cse277) (= c_~name_2~0 .cse276)))) .cse5) (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse278 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40)) (.cse279 (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40))) (or (= .cse278 c_~name_1~0) (= c_~name_2~0 .cse278) (not (= .cse279 c_~name_1~0)) (= .cse279 c_~name_2~0)))) .cse5) .cse208 .cse209) .cse25) (= c_~i_4~0 (_ bv1 32)) (or (and .cse280 (or .cse62 .cse63 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse281 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (or (= (concat (concat .cse281 v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0) (not (= (concat (concat .cse281 v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))))) .cse142)) .cse25) (or (and .cse282 (or .cse62 .cse63 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse283 (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36))) (or (= (concat .cse283 v_arrayElimCell_37) c_~name_1~0) (not (= (concat .cse283 v_arrayElimCell_40) c_~name_1~0))))) .cse142) (or .cse62 .cse63 .cse142 (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_37) c_~name_1~0)))) .cse284 .cse285 (or .cse62 .cse63 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse286 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (or (= (concat (concat .cse286 v_arrayElimCell_34) v_arrayElimCell_37) c_~name_1~0) (not (= (concat (concat .cse286 v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0))))) .cse142) .cse287 (or .cse62 .cse63 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_37 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_37) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)))) .cse142)) .cse25) (or (let ((.cse293 (let ((.cse294 (select |c_#memory_int#2| c_~nondet_0~0.base))) (concat (concat (concat (select .cse294 (bvadd (_ bv3 32) .cse295 c_~nondet_0~0.offset)) (select .cse294 (bvadd (_ bv2 32) .cse295 c_~nondet_0~0.offset))) (select .cse294 (bvadd .cse295 (_ bv1 32) c_~nondet_0~0.offset))) (select .cse294 (bvadd .cse295 c_~nondet_0~0.offset)))))) (let ((.cse288 (bvslt c_~result_3~0 (_ bv0 32))) (.cse290 (= c_~name_2~0 .cse293))) (and (or (and (or .cse41 .cse288) (or .cse289 .cse254 .cse255)) (not .cse290)) (or (let ((.cse292 (= .cse293 c_~name_1~0)) (.cse291 (bvsgt c_~result_3~0 (_ bv0 32)))) (and (or (and .cse41 (or .cse254 .cse92)) .cse60) (or (and (or .cse91 .cse255 .cse92) (or .cse41 .cse291)) (not .cse292)) (or .cse62 .cse41 (and .cse291 .cse142) .cse63 .cse64 .cse292 (and (or (and .cse288 .cse97) (and (not .cse97) (not .cse288) (not .cse291))) (not .cse142))))) .cse290)))) (and .cse41 (bvslt c_~i_4~0 (_ bv3 32)))) .cse275 (= (_ bv1 32) c_~i_8~0) (or .cse150 .cse60) (let ((.cse296 (= c_~break_10~0 (_ bv1 32))) (.cse297 (= c_~break_6~0 (_ bv1 32)))) (or (and (exists ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (= (concat (concat (concat v_arrayElimCell_33 v_arrayElimCell_30) v_arrayElimCell_32) v_arrayElimCell_31) c_~name_1~0)) (= (bvadd (_ bv1 32) c_~result_7~0) (_ bv0 32)) .cse296 .cse297 (= c_~result_3~0 (_ bv1 32))) (and .cse41 .cse60 (exists ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (let ((.cse298 (concat (concat (concat v_arrayElimCell_33 v_arrayElimCell_30) v_arrayElimCell_32) v_arrayElimCell_31))) (and (not (= .cse298 c_~name_1~0)) (not (= c_~name_2~0 .cse298)))))) (and .cse296 (exists ((v_arrayElimCell_32 (_ BitVec 8)) (v_arrayElimCell_31 (_ BitVec 8)) (v_arrayElimCell_33 (_ BitVec 8)) (v_arrayElimCell_30 (_ BitVec 8))) (= c_~name_2~0 (concat (concat (concat v_arrayElimCell_33 v_arrayElimCell_30) v_arrayElimCell_32) v_arrayElimCell_31))) (= (_ bv0 32) (bvadd c_~result_3~0 (_ bv1 32))) .cse297 (= (_ bv1 32) c_~result_7~0)))) (or (and .cse183 (or .cse5 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse301 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (let ((.cse299 (concat (concat .cse301 v_arrayElimCell_36) v_arrayElimCell_40)) (.cse300 (concat (concat .cse301 v_arrayElimCell_34) v_arrayElimCell_40))) (or (= .cse299 c_~name_1~0) (= .cse300 c_~name_2~0) (= c_~name_2~0 .cse299) (not (= .cse300 c_~name_1~0)))))))) .cse25) (or (and (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)) (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_34) v_arrayElimCell_40) c_~name_1~0))) .cse62 .cse63 .cse142) .cse302 (or (forall ((v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_35 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (or (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_35) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (not (= (concat (concat (concat v_arrayElimCell_39 v_arrayElimCell_38) v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0)))) .cse62 .cse63 .cse142) .cse303) .cse25) (or (let ((.cse308 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse312 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (let ((.cse313 (concat (concat .cse312 v_arrayElimCell_34) v_arrayElimCell_40))) (or (= (concat (concat .cse312 v_arrayElimCell_36) v_arrayElimCell_40) c_~name_1~0) (= .cse313 c_~name_2~0) (not (= .cse313 c_~name_1~0)))))))) (and (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse305 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (let ((.cse304 (concat (concat .cse305 v_arrayElimCell_34) v_arrayElimCell_40))) (or (= .cse304 c_~name_2~0) (forall ((v_arrayElimCell_36 (_ BitVec 8))) (not (= c_~name_2~0 (concat (concat .cse305 v_arrayElimCell_36) v_arrayElimCell_40)))) (not (= .cse304 c_~name_1~0)))))) (or (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse307 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (let ((.cse306 (concat (concat .cse307 v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse306 c_~name_1~0) (= (concat (concat .cse307 v_arrayElimCell_34) v_arrayElimCell_40) c_~name_2~0) (not (= c_~name_2~0 .cse306)))))) .cse60) (or .cse91 .cse308 .cse92 .cse93) (or .cse308 .cse41) (or .cse63 .cse64 .cse97 (forall ((v_arrayElimCell_34 (_ BitVec 8)) (v_arrayElimCell_36 (_ BitVec 8)) (v_arrayElimCell_38 (_ BitVec 8)) (v_arrayElimCell_39 (_ BitVec 8)) (v_arrayElimCell_40 (_ BitVec 8))) (let ((.cse311 (concat v_arrayElimCell_39 v_arrayElimCell_38))) (let ((.cse309 (concat (concat .cse311 v_arrayElimCell_34) v_arrayElimCell_40)) (.cse310 (concat (concat .cse311 v_arrayElimCell_36) v_arrayElimCell_40))) (or (= .cse309 c_~name_1~0) (= .cse310 c_~name_1~0) (= .cse309 c_~name_2~0) (not (= c_~name_2~0 .cse310))))))) .cse156)) .cse25)))))) is different from false [2023-11-29 04:29:46,264 WARN L293 SmtUtils]: Spent 6.79s on a formula simplification. DAG size of input: 521 DAG size of output: 506 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:29:54,449 WARN L293 SmtUtils]: Spent 7.19s on a formula simplification. DAG size of input: 523 DAG size of output: 516 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:30:16,464 WARN L293 SmtUtils]: Spent 12.09s on a formula simplification. DAG size of input: 680 DAG size of output: 676 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:30:25,454 WARN L293 SmtUtils]: Spent 7.10s on a formula simplification. DAG size of input: 522 DAG size of output: 518 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:30:37,010 WARN L293 SmtUtils]: Spent 6.59s on a formula simplification. DAG size of input: 484 DAG size of output: 476 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:30:45,224 WARN L293 SmtUtils]: Spent 6.22s on a formula simplification. DAG size of input: 483 DAG size of output: 479 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:30:47,304 INFO L124 PetriNetUnfolderBase]: 1902/4079 cut-off events. [2023-11-29 04:30:47,304 INFO L125 PetriNetUnfolderBase]: For 32969/32979 co-relation queries the response was YES. [2023-11-29 04:30:47,318 INFO L83 FinitePrefix]: Finished finitePrefix Result has 20282 conditions, 4079 events. 1902/4079 cut-off events. For 32969/32979 co-relation queries the response was YES. Maximal size of possible extension queue 239. Compared 31754 event pairs, 390 based on Foata normal form. 18/4082 useless extension candidates. Maximal degree in co-relation 20232. Up to 1026 conditions per place. [2023-11-29 04:30:47,332 INFO L140 encePairwiseOnDemand]: 39/50 looper letters, 174 selfloop transitions, 271 changer transitions 19/472 dead transitions. [2023-11-29 04:30:47,333 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 180 places, 472 transitions, 6660 flow [2023-11-29 04:30:47,335 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 26 states. [2023-11-29 04:30:47,335 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 26 states. [2023-11-29 04:30:47,337 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 26 states to 26 states and 743 transitions. [2023-11-29 04:30:47,337 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.5715384615384616 [2023-11-29 04:30:47,337 INFO L72 ComplementDD]: Start complementDD. Operand 26 states and 743 transitions. [2023-11-29 04:30:47,337 INFO L73 IsDeterministic]: Start isDeterministic. Operand 26 states and 743 transitions. [2023-11-29 04:30:47,338 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:30:47,338 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 26 states and 743 transitions. [2023-11-29 04:30:47,340 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 27 states, 26 states have (on average 28.576923076923077) internal successors, (743), 26 states have internal predecessors, (743), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:30:47,342 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 27 states, 27 states have (on average 50.0) internal successors, (1350), 27 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:30:47,343 INFO L81 ComplementDD]: Finished complementDD. Result has 27 states, 27 states have (on average 50.0) internal successors, (1350), 27 states have internal predecessors, (1350), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:30:47,343 INFO L175 Difference]: Start difference. First operand has 155 places, 250 transitions, 3409 flow. Second operand 26 states and 743 transitions. [2023-11-29 04:30:47,343 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 180 places, 472 transitions, 6660 flow [2023-11-29 04:30:47,501 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 174 places, 472 transitions, 6276 flow, removed 109 selfloop flow, removed 6 redundant places. [2023-11-29 04:30:47,514 INFO L231 Difference]: Finished difference. Result has 190 places, 363 transitions, 5771 flow [2023-11-29 04:30:47,514 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=3155, PETRI_DIFFERENCE_MINUEND_PLACES=149, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=250, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=170, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=57, PETRI_DIFFERENCE_SUBTRAHEND_STATES=26, PETRI_FLOW=5771, PETRI_PLACES=190, PETRI_TRANSITIONS=363} [2023-11-29 04:30:47,515 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 141 predicate places. [2023-11-29 04:30:47,515 INFO L495 AbstractCegarLoop]: Abstraction has has 190 places, 363 transitions, 5771 flow [2023-11-29 04:30:47,515 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 23.25) internal successors, (372), 16 states have internal predecessors, (372), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:30:47,515 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:30:47,515 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:30:47,519 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (33)] Ended with exit code 0 [2023-11-29 04:30:47,716 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:30:47,716 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:30:47,716 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:30:47,716 INFO L85 PathProgramCache]: Analyzing trace with hash 331747354, now seen corresponding path program 4 times [2023-11-29 04:30:47,717 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:30:47,717 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [168177648] [2023-11-29 04:30:47,717 INFO L93 rtionOrderModulation]: Changing assertion order to TERMS_WITH_SMALL_CONSTANTS_FIRST [2023-11-29 04:30:47,717 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-29 04:30:47,717 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:30:47,718 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:30:47,719 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (34)] Waiting until timeout for monitored process [2023-11-29 04:30:47,866 INFO L228 tOrderPrioritization]: Assert order TERMS_WITH_SMALL_CONSTANTS_FIRST issued 0 check-sat command(s) [2023-11-29 04:30:47,866 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:30:47,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 20 conjunts are in the unsatisfiable core [2023-11-29 04:30:47,877 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:30:48,342 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:30:48,343 INFO L378 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 356 treesize of output 136 [2023-11-29 04:30:49,612 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:30:49,612 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:30:56,141 INFO L349 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2023-11-29 04:30:56,142 INFO L378 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 798 treesize of output 391 [2023-11-29 04:31:47,625 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:31:47,625 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 04:31:47,625 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [168177648] [2023-11-29 04:31:47,626 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [168177648] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 04:31:47,626 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 04:31:47,626 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 9] total 16 [2023-11-29 04:31:47,626 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [814536395] [2023-11-29 04:31:47,626 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 04:31:47,626 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 16 states [2023-11-29 04:31:47,626 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 04:31:47,627 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 16 interpolants. [2023-11-29 04:31:47,627 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=52, Invalid=188, Unknown=0, NotChecked=0, Total=240 [2023-11-29 04:31:49,519 INFO L471 CegarLoopForPetriNet]: Number of universal loopers: 25 out of 50 [2023-11-29 04:31:49,519 INFO L103 encePairwiseOnDemand]: Start differencePairwiseOnDemand. First operand has 190 places, 363 transitions, 5771 flow. Second operand has 16 states, 16 states have (on average 27.1875) internal successors, (435), 16 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:31:49,519 INFO L112 encePairwiseOnDemand]: Universal subtrahend loopers provided by user. [2023-11-29 04:31:49,519 INFO L113 encePairwiseOnDemand]: Number of universal subtrahend loopers: 25 of 50 [2023-11-29 04:31:49,519 INFO L73 FinitePrefix]: Start finitePrefix. Operand will be constructed on-demand [2023-11-29 04:32:03,431 WARN L293 SmtUtils]: Spent 5.43s on a formula simplification. DAG size of input: 397 DAG size of output: 382 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 04:32:31,985 INFO L124 PetriNetUnfolderBase]: 2131/4527 cut-off events. [2023-11-29 04:32:31,986 INFO L125 PetriNetUnfolderBase]: For 66790/66802 co-relation queries the response was YES. [2023-11-29 04:32:32,007 INFO L83 FinitePrefix]: Finished finitePrefix Result has 27279 conditions, 4527 events. 2131/4527 cut-off events. For 66790/66802 co-relation queries the response was YES. Maximal size of possible extension queue 275. Compared 35518 event pairs, 567 based on Foata normal form. 2/4510 useless extension candidates. Maximal degree in co-relation 27215. Up to 1538 conditions per place. [2023-11-29 04:32:32,028 INFO L140 encePairwiseOnDemand]: 41/50 looper letters, 202 selfloop transitions, 276 changer transitions 14/500 dead transitions. [2023-11-29 04:32:32,028 INFO L145 encePairwiseOnDemand]: Finished differencePairwiseOnDemand. Result has 209 places, 500 transitions, 8459 flow [2023-11-29 04:32:32,031 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 20 states. [2023-11-29 04:32:32,031 INFO L82 GeneralOperation]: Start removeUnreachable. Operand 20 states. [2023-11-29 04:32:32,032 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 20 states to 20 states and 630 transitions. [2023-11-29 04:32:32,032 INFO L516 CegarLoopForPetriNet]: DFA transition density 0.63 [2023-11-29 04:32:32,032 INFO L72 ComplementDD]: Start complementDD. Operand 20 states and 630 transitions. [2023-11-29 04:32:32,033 INFO L73 IsDeterministic]: Start isDeterministic. Operand 20 states and 630 transitions. [2023-11-29 04:32:32,033 INFO L80 IsDeterministic]: Finished isDeterministic. Operand is deterministic. [2023-11-29 04:32:32,033 INFO L117 ReachableStatesCopy]: Start reachableStatesCopy. Operand 20 states and 630 transitions. [2023-11-29 04:32:32,034 INFO L343 DoubleDeckerVisitor]: Before removal of dead ends has 21 states, 20 states have (on average 31.5) internal successors, (630), 20 states have internal predecessors, (630), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:32:32,036 INFO L131 ReachableStatesCopy]: Finished reachableStatesCopy Result has 21 states, 21 states have (on average 50.0) internal successors, (1050), 21 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:32:32,036 INFO L81 ComplementDD]: Finished complementDD. Result has 21 states, 21 states have (on average 50.0) internal successors, (1050), 21 states have internal predecessors, (1050), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:32:32,036 INFO L175 Difference]: Start difference. First operand has 190 places, 363 transitions, 5771 flow. Second operand 20 states and 630 transitions. [2023-11-29 04:32:32,036 INFO L82 GeneralOperation]: Start removeRedundantFlow. Operand has 209 places, 500 transitions, 8459 flow [2023-11-29 04:32:32,483 INFO L88 GeneralOperation]: Finished removeRedundantFlow, result has has 206 places, 500 transitions, 8247 flow, removed 89 selfloop flow, removed 3 redundant places. [2023-11-29 04:32:32,494 INFO L231 Difference]: Finished difference. Result has 212 places, 436 transitions, 7446 flow [2023-11-29 04:32:32,494 INFO L264 CegarLoopForPetriNet]: {PETRI_ALPHABET=50, PETRI_DIFFERENCE_MINUEND_FLOW=5581, PETRI_DIFFERENCE_MINUEND_PLACES=187, PETRI_DIFFERENCE_MINUEND_TRANSITIONS=363, PETRI_DIFFERENCE_SUBTRAHEND_LETTERS_WITH_MORE_CHANGERS_THAN_LOOPERS=218, PETRI_DIFFERENCE_SUBTRAHEND_LOOPER_ONLY_LETTERS=128, PETRI_DIFFERENCE_SUBTRAHEND_STATES=20, PETRI_FLOW=7446, PETRI_PLACES=212, PETRI_TRANSITIONS=436} [2023-11-29 04:32:32,495 INFO L281 CegarLoopForPetriNet]: 49 programPoint places, 163 predicate places. [2023-11-29 04:32:32,495 INFO L495 AbstractCegarLoop]: Abstraction has has 212 places, 436 transitions, 7446 flow [2023-11-29 04:32:32,495 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 16 states, 16 states have (on average 27.1875) internal successors, (435), 16 states have internal predecessors, (435), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 04:32:32,495 INFO L200 CegarLoopForPetriNet]: Found error trace [2023-11-29 04:32:32,495 INFO L208 CegarLoopForPetriNet]: trace histogram [3, 3, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 04:32:32,499 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (34)] Ended with exit code 0 [2023-11-29 04:32:32,695 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:32:32,696 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr10ASSERT_VIOLATIONMEMORY_LEAK === [thread1Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread1Err1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, thread2Err0REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 19 more)] === [2023-11-29 04:32:32,696 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 04:32:32,696 INFO L85 PathProgramCache]: Analyzing trace with hash -310803818, now seen corresponding path program 5 times [2023-11-29 04:32:32,697 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 04:32:32,697 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [69033892] [2023-11-29 04:32:32,697 INFO L93 rtionOrderModulation]: Changing assertion order to INSIDE_LOOP_FIRST1 [2023-11-29 04:32:32,697 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-29 04:32:32,698 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 04:32:32,699 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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-29 04:32:32,700 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_289d7674-dd60-4f48-908b-9efb2fb64818/bin/uautomizer-verify-BQ2R08f2Ya/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 (35)] Waiting until timeout for monitored process [2023-11-29 04:32:32,950 INFO L228 tOrderPrioritization]: Assert order INSIDE_LOOP_FIRST1 issued 4 check-sat command(s) [2023-11-29 04:32:32,950 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 04:32:32,958 INFO L262 TraceCheckSpWp]: Trace formula consists of 175 conjuncts, 23 conjunts are in the unsatisfiable core [2023-11-29 04:32:32,962 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 04:32:34,158 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 04:32:34,158 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 4 select indices, 4 select index equivalence classes, 6 disjoint index pairs (out of 6 index pairs), introduced 4 new quantified variables, introduced 6 case distinctions, treesize of input 377 treesize of output 169 [2023-11-29 04:32:34,512 INFO L134 CoverageAnalysis]: Checked inductivity of 13 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 9 trivial. 0 not checked. [2023-11-29 04:32:34,512 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 04:32:41,756 INFO L349 Elim1Store]: treesize reduction 168, result has 22.6 percent of original size [2023-11-29 04:32:41,757 INFO L378 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 1292 treesize of output 500 [2023-11-29 04:33:29,358 WARN L293 SmtUtils]: Spent 16.74s on a formula simplification. DAG size of input: 812 DAG size of output: 812 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate)