./Ultimate.py --spec ../../sv-benchmarks/c/properties/valid-memsafety.prp --file ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i --full-output --architecture 32bit -------------------------------------------------------------------------------- Checking for memory safety (deref-memtrack) Using default analysis Version 0e0057cc Calling Ultimate with: /usr/lib/jvm/java-1.11.0-openjdk-amd64/bin/java -Dosgi.configuration.area=/tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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_1ce24895-b60c-430e-8c85-0503b2601e4a/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 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:15:11,546 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:15:11,607 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Default.epf [2023-11-29 03:15:11,612 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:15:11,612 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:15:11,636 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:15:11,637 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:15:11,637 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:15:11,638 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:15:11,638 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:15:11,639 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:15:11,639 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:15:11,640 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:15:11,641 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:15:11,641 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:15:11,642 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:15:11,642 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:15:11,643 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:15:11,643 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:15:11,644 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:15:11,644 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:15:11,645 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:15:11,645 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:15:11,646 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:15:11,646 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:15:11,647 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:15:11,647 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:15:11,647 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:15:11,648 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:15:11,648 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:15:11,648 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:15:11,649 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:15:11,649 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:15:11,650 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:15:11,650 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:15:11,650 INFO L153 SettingsManager]: * Trace refinement strategy=CAMEL [2023-11-29 03:15:11,650 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in [2023-11-29 03:15:11,650 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:15:11,651 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:15:11,651 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:15:11,651 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:15:11,651 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_1ce24895-b60c-430e-8c85-0503b2601e4a/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_1ce24895-b60c-430e-8c85-0503b2601e4a/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 -> 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 [2023-11-29 03:15:11,872 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:15:11,893 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:15:11,896 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:15:11,897 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:15:11,897 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:15:11,899 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2023-11-29 03:15:14,633 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:15:14,865 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:15:14,866 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2023-11-29 03:15:14,880 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/data/ebbc1671e/d48304bcfaef4654a12e65fac5a67584/FLAGcd28e3749 [2023-11-29 03:15:14,894 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/data/ebbc1671e/d48304bcfaef4654a12e65fac5a67584 [2023-11-29 03:15:14,897 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:15:14,898 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:15:14,900 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:15:14,900 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:15:14,905 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:15:14,906 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:15:14" (1/1) ... [2023-11-29 03:15:14,907 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@3a5e335c and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:14, skipping insertion in model container [2023-11-29 03:15:14,907 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:15:14" (1/1) ... [2023-11-29 03:15:14,950 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:15:15,225 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:15:15,237 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 03:15:15,237 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.CACSL2BoogieTranslatorObserver@42b5c256 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:15, skipping insertion in model container [2023-11-29 03:15:15,237 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:15:15,238 INFO L186 ToolchainWalker]: Toolchain execution was canceled (user or tool) before executing de.uni_freiburg.informatik.ultimate.boogie.procedureinliner [2023-11-29 03:15:15,240 INFO L158 Benchmark]: Toolchain (without parser) took 340.49ms. Allocated memory is still 136.3MB. Free memory was 89.6MB in the beginning and 77.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 03:15:15,240 INFO L158 Benchmark]: CDTParser took 0.17ms. Allocated memory is still 136.3MB. Free memory was 106.3MB in the beginning and 106.1MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. [2023-11-29 03:15:15,241 INFO L158 Benchmark]: CACSL2BoogieTranslator took 338.00ms. Allocated memory is still 136.3MB. Free memory was 89.6MB in the beginning and 77.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. [2023-11-29 03:15:15,243 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.17ms. Allocated memory is still 136.3MB. Free memory was 106.3MB in the beginning and 106.1MB in the end (delta: 159.4kB). There was no memory consumed. Max. memory is 16.1GB. * CACSL2BoogieTranslator took 338.00ms. Allocated memory is still 136.3MB. Free memory was 89.6MB in the beginning and 77.5MB in the end (delta: 12.1MB). Peak memory consumption was 12.6MB. Max. memory is 16.1GB. * Results from de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator: - UnsupportedSyntaxResult [Line: 571]: 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_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/data/config -Xmx15G -Xms4m -jar /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/data -tc /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/config/AutomizerMemDerefMemtrack.xml -i ../../sv-benchmarks/c/memsafety-ext/tree_dsw.i -s /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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_1ce24895-b60c-430e-8c85-0503b2601e4a/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 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 --- Real Ultimate output --- This is Ultimate 0.2.4-dev-0e0057c [2023-11-29 03:15:16,972 INFO L188 SettingsManager]: Resetting all preferences to default values... [2023-11-29 03:15:17,038 INFO L114 SettingsManager]: Loading settings from /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/config/svcomp-DerefFreeMemtrack-32bit-Automizer_Bitvector.epf [2023-11-29 03:15:17,053 WARN L101 SettingsManager]: Preference file contains the following unknown settings: [2023-11-29 03:15:17,054 WARN L103 SettingsManager]: * de.uni_freiburg.informatik.ultimate.core.Log level for class [2023-11-29 03:15:17,081 INFO L130 SettingsManager]: Preferences different from defaults after loading the file: [2023-11-29 03:15:17,081 INFO L151 SettingsManager]: Preferences of UltimateCore differ from their defaults: [2023-11-29 03:15:17,082 INFO L153 SettingsManager]: * Log level for class=de.uni_freiburg.informatik.ultimate.lib.smtlibutils.quantifier.QuantifierPusher=ERROR; [2023-11-29 03:15:17,083 INFO L151 SettingsManager]: Preferences of Boogie Preprocessor differ from their defaults: [2023-11-29 03:15:17,083 INFO L153 SettingsManager]: * Use memory slicer=true [2023-11-29 03:15:17,084 INFO L151 SettingsManager]: Preferences of Boogie Procedure Inliner differ from their defaults: [2023-11-29 03:15:17,084 INFO L153 SettingsManager]: * Ignore calls to procedures called more than once=ONLY_FOR_SEQUENTIAL_PROGRAMS [2023-11-29 03:15:17,085 INFO L151 SettingsManager]: Preferences of BlockEncodingV2 differ from their defaults: [2023-11-29 03:15:17,085 INFO L153 SettingsManager]: * Create parallel compositions if possible=false [2023-11-29 03:15:17,086 INFO L153 SettingsManager]: * Use SBE=true [2023-11-29 03:15:17,087 INFO L151 SettingsManager]: Preferences of CACSL2BoogieTranslator differ from their defaults: [2023-11-29 03:15:17,087 INFO L153 SettingsManager]: * sizeof long=4 [2023-11-29 03:15:17,088 INFO L153 SettingsManager]: * Overapproximate operations on floating types=true [2023-11-29 03:15:17,088 INFO L153 SettingsManager]: * sizeof POINTER=4 [2023-11-29 03:15:17,089 INFO L153 SettingsManager]: * Check division by zero=IGNORE [2023-11-29 03:15:17,089 INFO L153 SettingsManager]: * Check for the main procedure if all allocated memory was freed=true [2023-11-29 03:15:17,090 INFO L153 SettingsManager]: * Bitprecise bitfields=true [2023-11-29 03:15:17,090 INFO L153 SettingsManager]: * SV-COMP memtrack compatibility mode=true [2023-11-29 03:15:17,091 INFO L153 SettingsManager]: * If two pointers are subtracted or compared they have the same base address=IGNORE [2023-11-29 03:15:17,091 INFO L153 SettingsManager]: * Adapt memory model on pointer casts if necessary=true [2023-11-29 03:15:17,091 INFO L153 SettingsManager]: * Use bitvectors instead of ints=true [2023-11-29 03:15:17,092 INFO L153 SettingsManager]: * Memory model=HoenickeLindenmann_4ByteResolution [2023-11-29 03:15:17,092 INFO L153 SettingsManager]: * Check unreachability of reach_error function=false [2023-11-29 03:15:17,092 INFO L153 SettingsManager]: * sizeof long double=12 [2023-11-29 03:15:17,093 INFO L153 SettingsManager]: * Use constant arrays=true [2023-11-29 03:15:17,093 INFO L151 SettingsManager]: Preferences of RCFGBuilder differ from their defaults: [2023-11-29 03:15:17,093 INFO L153 SettingsManager]: * Size of a code block=SequenceOfStatements [2023-11-29 03:15:17,094 INFO L153 SettingsManager]: * Only consider context switches at boundaries of atomic blocks=true [2023-11-29 03:15:17,094 INFO L153 SettingsManager]: * SMT solver=External_DefaultMode [2023-11-29 03:15:17,094 INFO L153 SettingsManager]: * Command for external solver=z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:15:17,094 INFO L151 SettingsManager]: Preferences of TraceAbstraction differ from their defaults: [2023-11-29 03:15:17,095 INFO L153 SettingsManager]: * Compute Interpolants along a Counterexample=FPandBP [2023-11-29 03:15:17,095 INFO L153 SettingsManager]: * Trace refinement strategy=WOLF [2023-11-29 03:15:17,095 INFO L153 SettingsManager]: * Command for external solver=cvc4 --incremental --print-success --lang smt [2023-11-29 03:15:17,095 INFO L153 SettingsManager]: * Apply one-shot large block encoding in concurrent analysis=false [2023-11-29 03:15:17,096 INFO L153 SettingsManager]: * Automaton type used in concurrency analysis=PETRI_NET [2023-11-29 03:15:17,096 INFO L153 SettingsManager]: * Order on configurations for Petri net unfoldings=DBO [2023-11-29 03:15:17,096 INFO L153 SettingsManager]: * SMT solver=External_ModelsAndUnsatCoreMode [2023-11-29 03:15:17,096 INFO L153 SettingsManager]: * Logic for external solver=AUFBV [2023-11-29 03:15:17,096 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_1ce24895-b60c-430e-8c85-0503b2601e4a/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_1ce24895-b60c-430e-8c85-0503b2601e4a/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 -> 6527731a1486e677feb1440c4f57330edff23abded92b5eda1225729ba969b33 [2023-11-29 03:15:17,387 INFO L75 nceAwareModelManager]: Repository-Root is: /tmp [2023-11-29 03:15:17,408 INFO L261 ainManager$Toolchain]: [Toolchain 1]: Applicable parser(s) successfully (re)initialized [2023-11-29 03:15:17,410 INFO L217 ainManager$Toolchain]: [Toolchain 1]: Toolchain selected. [2023-11-29 03:15:17,411 INFO L270 PluginConnector]: Initializing CDTParser... [2023-11-29 03:15:17,412 INFO L274 PluginConnector]: CDTParser initialized [2023-11-29 03:15:17,413 INFO L431 ainManager$Toolchain]: [Toolchain 1]: Parsing single file: /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/../../sv-benchmarks/c/memsafety-ext/tree_dsw.i [2023-11-29 03:15:20,130 INFO L533 CDTParser]: Created temporary CDT project at NULL [2023-11-29 03:15:20,348 INFO L384 CDTParser]: Found 1 translation units. [2023-11-29 03:15:20,348 INFO L180 CDTParser]: Scanning /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/sv-benchmarks/c/memsafety-ext/tree_dsw.i [2023-11-29 03:15:20,362 INFO L427 CDTParser]: About to delete temporary CDT project at /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/data/dcae3ab10/a0ede42d0aaf45e3a242886370b687ef/FLAGb626ac560 [2023-11-29 03:15:20,372 INFO L435 CDTParser]: Successfully deleted /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/data/dcae3ab10/a0ede42d0aaf45e3a242886370b687ef [2023-11-29 03:15:20,374 INFO L299 ainManager$Toolchain]: ####################### [Toolchain 1] ####################### [2023-11-29 03:15:20,375 INFO L133 ToolchainWalker]: Walking toolchain with 6 elements. [2023-11-29 03:15:20,376 INFO L112 PluginConnector]: ------------------------CACSL2BoogieTranslator---------------------------- [2023-11-29 03:15:20,376 INFO L270 PluginConnector]: Initializing CACSL2BoogieTranslator... [2023-11-29 03:15:20,380 INFO L274 PluginConnector]: CACSL2BoogieTranslator initialized [2023-11-29 03:15:20,381 INFO L184 PluginConnector]: Executing the observer ACSLObjectContainerObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:15:20" (1/1) ... [2023-11-29 03:15:20,382 INFO L204 PluginConnector]: Invalid model from CACSL2BoogieTranslator for observer de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator.ACSLObjectContainerObserver@296f3601 and model type de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:20, skipping insertion in model container [2023-11-29 03:15:20,382 INFO L184 PluginConnector]: Executing the observer CACSL2BoogieTranslatorObserver from plugin CACSL2BoogieTranslator for "CDTParser AST 29.11 03:15:20" (1/1) ... [2023-11-29 03:15:20,429 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:15:20,720 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:15:20,733 INFO L199 MainTranslator]: Restarting translation with changed settings: SettingsChange [mNewPreferredMemoryModel=HoenickeLindenmann_1ByteResolution] [2023-11-29 03:15:20,748 INFO L177 MainTranslator]: Built tables and reachable declarations [2023-11-29 03:15:20,788 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:15:20,791 INFO L202 MainTranslator]: Completed pre-run [2023-11-29 03:15:20,827 INFO L209 PostProcessor]: Analyzing one entry point: main [2023-11-29 03:15:20,858 INFO L206 MainTranslator]: Completed translation [2023-11-29 03:15:20,858 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:20 WrapperNode [2023-11-29 03:15:20,858 INFO L131 PluginConnector]: ------------------------ END CACSL2BoogieTranslator---------------------------- [2023-11-29 03:15:20,859 INFO L112 PluginConnector]: ------------------------Boogie Procedure Inliner---------------------------- [2023-11-29 03:15:20,859 INFO L270 PluginConnector]: Initializing Boogie Procedure Inliner... [2023-11-29 03:15:20,859 INFO L274 PluginConnector]: Boogie Procedure Inliner initialized [2023-11-29 03:15:20,866 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:20" (1/1) ... [2023-11-29 03:15:20,884 INFO L184 PluginConnector]: Executing the observer Inliner from plugin Boogie Procedure Inliner for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:20" (1/1) ... [2023-11-29 03:15:20,910 INFO L138 Inliner]: procedures = 125, calls = 52, calls flagged for inlining = 2, calls inlined = 2, statements flattened = 168 [2023-11-29 03:15:20,910 INFO L131 PluginConnector]: ------------------------ END Boogie Procedure Inliner---------------------------- [2023-11-29 03:15:20,911 INFO L112 PluginConnector]: ------------------------Boogie Preprocessor---------------------------- [2023-11-29 03:15:20,911 INFO L270 PluginConnector]: Initializing Boogie Preprocessor... [2023-11-29 03:15:20,911 INFO L274 PluginConnector]: Boogie Preprocessor initialized [2023-11-29 03:15:20,922 INFO L184 PluginConnector]: Executing the observer EnsureBoogieModelObserver from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:20" (1/1) ... [2023-11-29 03:15:20,922 INFO L184 PluginConnector]: Executing the observer TypeChecker from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:20" (1/1) ... [2023-11-29 03:15:20,926 INFO L184 PluginConnector]: Executing the observer MemorySlicer from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:20" (1/1) ... [2023-11-29 03:15:20,946 INFO L175 MemorySlicer]: Split 37 memory accesses to 3 slices as follows [2, 34, 1]. 92 percent of accesses are in the largest equivalence class. The 2 initializations are split as follows [2, 0, 0]. The 17 writes are split as follows [0, 16, 1]. [2023-11-29 03:15:20,947 INFO L184 PluginConnector]: Executing the observer ConstExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:20" (1/1) ... [2023-11-29 03:15:20,947 INFO L184 PluginConnector]: Executing the observer StructExpander from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:20" (1/1) ... [2023-11-29 03:15:20,959 INFO L184 PluginConnector]: Executing the observer UnstructureCode from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:20" (1/1) ... [2023-11-29 03:15:20,963 INFO L184 PluginConnector]: Executing the observer FunctionInliner from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:20" (1/1) ... [2023-11-29 03:15:20,965 INFO L184 PluginConnector]: Executing the observer LTLStepAnnotator from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:20" (1/1) ... [2023-11-29 03:15:20,967 INFO L184 PluginConnector]: Executing the observer BoogieSymbolTableConstructor from plugin Boogie Preprocessor for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:20" (1/1) ... [2023-11-29 03:15:20,970 INFO L131 PluginConnector]: ------------------------ END Boogie Preprocessor---------------------------- [2023-11-29 03:15:20,971 INFO L112 PluginConnector]: ------------------------RCFGBuilder---------------------------- [2023-11-29 03:15:20,971 INFO L270 PluginConnector]: Initializing RCFGBuilder... [2023-11-29 03:15:20,972 INFO L274 PluginConnector]: RCFGBuilder initialized [2023-11-29 03:15:20,972 INFO L184 PluginConnector]: Executing the observer RCFGBuilderObserver from plugin RCFGBuilder for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:20" (1/1) ... [2023-11-29 03:15:20,978 INFO L173 SolverBuilder]: Constructing external solver with command: z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 [2023-11-29 03:15:20,988 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/z3 [2023-11-29 03:15:21,003 INFO L229 MonitoredProcess]: Starting monitored process 1 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (exit command is (exit), workingDir is null) [2023-11-29 03:15:21,006 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/z3 SMTLIB2_COMPLIANT=true -memory:2024 -smt2 -in -t:4000 (1)] Waiting until timeout for monitored process [2023-11-29 03:15:21,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnHeap [2023-11-29 03:15:21,035 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocInit [2023-11-29 03:15:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure #Ultimate.allocOnStack [2023-11-29 03:15:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#0 [2023-11-29 03:15:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#1 [2023-11-29 03:15:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure write~$Pointer$#2 [2023-11-29 03:15:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#0 [2023-11-29 03:15:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#1 [2023-11-29 03:15:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure read~$Pointer$#2 [2023-11-29 03:15:21,036 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.dealloc [2023-11-29 03:15:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#0 [2023-11-29 03:15:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#1 [2023-11-29 03:15:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure write~init~intINTTYPE1#2 [2023-11-29 03:15:21,037 INFO L130 BoogieDeclarations]: Found specification of procedure ULTIMATE.start [2023-11-29 03:15:21,037 INFO L138 BoogieDeclarations]: Found implementation of procedure ULTIMATE.start [2023-11-29 03:15:21,171 INFO L241 CfgBuilder]: Building ICFG [2023-11-29 03:15:21,173 INFO L267 CfgBuilder]: Building CFG for each procedure with an implementation [2023-11-29 03:15:21,835 INFO L282 CfgBuilder]: Performing block encoding [2023-11-29 03:15:21,894 INFO L304 CfgBuilder]: Using the 1 location(s) as analysis (start of procedure ULTIMATE.start) [2023-11-29 03:15:21,894 INFO L309 CfgBuilder]: Removed 4 assume(true) statements. [2023-11-29 03:15:21,895 INFO L201 PluginConnector]: Adding new model de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:15:21 BoogieIcfgContainer [2023-11-29 03:15:21,895 INFO L131 PluginConnector]: ------------------------ END RCFGBuilder---------------------------- [2023-11-29 03:15:21,897 INFO L112 PluginConnector]: ------------------------TraceAbstraction---------------------------- [2023-11-29 03:15:21,897 INFO L270 PluginConnector]: Initializing TraceAbstraction... [2023-11-29 03:15:21,900 INFO L274 PluginConnector]: TraceAbstraction initialized [2023-11-29 03:15:21,901 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "CDTParser AST 29.11 03:15:20" (1/3) ... [2023-11-29 03:15:21,901 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31cb55ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:15:21, skipping insertion in model container [2023-11-29 03:15:21,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.cacsl2boogietranslator AST 29.11 03:15:20" (2/3) ... [2023-11-29 03:15:21,902 INFO L204 PluginConnector]: Invalid model from TraceAbstraction for observer de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction.TraceAbstractionObserver@31cb55ac and model type de.uni_freiburg.informatik.ultimate.plugins.generator.traceabstraction AST 29.11 03:15:21, skipping insertion in model container [2023-11-29 03:15:21,902 INFO L184 PluginConnector]: Executing the observer TraceAbstractionObserver from plugin TraceAbstraction for "de.uni_freiburg.informatik.ultimate.plugins.generator.rcfgbuilder CFG 29.11 03:15:21" (3/3) ... [2023-11-29 03:15:21,903 INFO L112 eAbstractionObserver]: Analyzing ICFG tree_dsw.i [2023-11-29 03:15:21,935 INFO L203 ceAbstractionStarter]: Automizer settings: Hoare:false NWA Interpolation:FPandBP Determinization: PREDICATE_ABSTRACTION [2023-11-29 03:15:21,935 INFO L162 ceAbstractionStarter]: Applying trace abstraction to program that has 77 error locations. [2023-11-29 03:15:21,977 INFO L356 AbstractCegarLoop]: ======== Iteration 0 == of CEGAR loop == AllErrorsAtOnce ======== [2023-11-29 03:15:21,982 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;@43db0c34, mLbeIndependenceSettings=[IndependenceType=SEMANTIC, AbstractionType=NONE, UseConditional=false, UseSemiCommutativity=true, Solver=Z3, SolverTimeout=1000ms] [2023-11-29 03:15:21,982 INFO L358 AbstractCegarLoop]: Starting to check reachability of 77 error locations. [2023-11-29 03:15:21,986 INFO L276 IsEmpty]: Start isEmpty. Operand has 139 states, 61 states have (on average 2.557377049180328) internal successors, (156), 138 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 03:15:21,991 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 03:15:21,991 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:21,992 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 03:15:21,993 INFO L420 AbstractCegarLoop]: === Iteration 1 === Targeting ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:22,003 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:22,003 INFO L85 PathProgramCache]: Analyzing trace with hash 9304, now seen corresponding path program 1 times [2023-11-29 03:15:22,012 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:22,012 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2123896201] [2023-11-29 03:15:22,012 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:22,013 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 03:15:22,013 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:22,014 INFO L229 MonitoredProcess]: Starting monitored process 2 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:22,015 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:22,093 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:22,095 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:15:22,098 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:22,168 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 7 [2023-11-29 03:15:22,180 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 03:15:22,180 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:22,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:22,181 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2123896201] [2023-11-29 03:15:22,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2123896201] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:22,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:22,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:15:22,184 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [149423097] [2023-11-29 03:15:22,185 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:22,189 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:15:22,189 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:22,225 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:15:22,225 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:15:22,228 INFO L87 Difference]: Start difference. First operand has 139 states, 61 states have (on average 2.557377049180328) internal successors, (156), 138 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) Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:22,561 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:22,561 INFO L93 Difference]: Finished difference Result 151 states and 165 transitions. [2023-11-29 03:15:22,562 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:15:22,563 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-29 03:15:22,564 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:22,571 INFO L225 Difference]: With dead ends: 151 [2023-11-29 03:15:22,571 INFO L226 Difference]: Without dead ends: 150 [2023-11-29 03:15:22,573 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:15:22,576 INFO L413 NwaCegarLoop]: 82 mSDtfsCounter, 107 mSDsluCounter, 22 mSDsCounter, 0 mSdLazyCounter, 97 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 107 SdHoareTripleChecker+Valid, 104 SdHoareTripleChecker+Invalid, 102 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 97 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:22,577 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [107 Valid, 104 Invalid, 102 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 97 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:15:22,593 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 150 states. [2023-11-29 03:15:22,608 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 150 to 136. [2023-11-29 03:15:22,610 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 136 states, 61 states have (on average 2.442622950819672) internal successors, (149), 135 states have internal predecessors, (149), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:22,612 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 136 states to 136 states and 149 transitions. [2023-11-29 03:15:22,613 INFO L78 Accepts]: Start accepts. Automaton has 136 states and 149 transitions. Word has length 2 [2023-11-29 03:15:22,613 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:22,613 INFO L495 AbstractCegarLoop]: Abstraction has 136 states and 149 transitions. [2023-11-29 03:15:22,613 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:22,614 INFO L276 IsEmpty]: Start isEmpty. Operand 136 states and 149 transitions. [2023-11-29 03:15:22,614 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 3 [2023-11-29 03:15:22,614 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:22,614 INFO L195 NwaCegarLoop]: trace histogram [1, 1] [2023-11-29 03:15:22,624 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:22,816 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 2 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:22,816 INFO L420 AbstractCegarLoop]: === Iteration 2 === Targeting ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:22,817 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:22,817 INFO L85 PathProgramCache]: Analyzing trace with hash 9305, now seen corresponding path program 1 times [2023-11-29 03:15:22,818 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:22,818 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [437201369] [2023-11-29 03:15:22,818 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:22,818 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 03:15:22,818 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:22,820 INFO L229 MonitoredProcess]: Starting monitored process 3 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:22,821 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:22,872 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:22,873 INFO L262 TraceCheckSpWp]: Trace formula consists of 21 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:15:22,874 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:22,883 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 03:15:22,895 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 03:15:22,895 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:22,895 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:22,896 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [437201369] [2023-11-29 03:15:22,896 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [437201369] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:22,896 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:22,896 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [1] imperfect sequences [] total 1 [2023-11-29 03:15:22,897 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [807334005] [2023-11-29 03:15:22,897 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:22,898 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:15:22,898 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:22,899 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:15:22,899 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:15:22,900 INFO L87 Difference]: Start difference. First operand 136 states and 149 transitions. Second operand has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:23,290 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:23,290 INFO L93 Difference]: Finished difference Result 134 states and 147 transitions. [2023-11-29 03:15:23,291 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:15:23,291 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 2 [2023-11-29 03:15:23,291 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:23,294 INFO L225 Difference]: With dead ends: 134 [2023-11-29 03:15:23,294 INFO L226 Difference]: Without dead ends: 134 [2023-11-29 03:15:23,294 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 1 GetRequests, 0 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:15:23,295 INFO L413 NwaCegarLoop]: 69 mSDtfsCounter, 140 mSDsluCounter, 0 mSDsCounter, 0 mSdLazyCounter, 78 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 140 SdHoareTripleChecker+Valid, 69 SdHoareTripleChecker+Invalid, 85 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 78 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:23,296 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [140 Valid, 69 Invalid, 85 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 78 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:15:23,297 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 134 states. [2023-11-29 03:15:23,304 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 134 to 134. [2023-11-29 03:15:23,305 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 134 states, 61 states have (on average 2.4098360655737703) internal successors, (147), 133 states have internal predecessors, (147), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:23,308 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 134 states to 134 states and 147 transitions. [2023-11-29 03:15:23,311 INFO L78 Accepts]: Start accepts. Automaton has 134 states and 147 transitions. Word has length 2 [2023-11-29 03:15:23,311 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:23,311 INFO L495 AbstractCegarLoop]: Abstraction has 134 states and 147 transitions. [2023-11-29 03:15:23,312 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 1.0) internal successors, (2), 2 states have internal predecessors, (2), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:23,313 INFO L276 IsEmpty]: Start isEmpty. Operand 134 states and 147 transitions. [2023-11-29 03:15:23,313 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 03:15:23,313 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:23,313 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 03:15:23,315 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:23,514 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 3 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:23,514 INFO L420 AbstractCegarLoop]: === Iteration 3 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:23,515 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:23,515 INFO L85 PathProgramCache]: Analyzing trace with hash 1773092, now seen corresponding path program 1 times [2023-11-29 03:15:23,516 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:23,516 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [655607027] [2023-11-29 03:15:23,516 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:23,516 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 03:15:23,516 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:23,517 INFO L229 MonitoredProcess]: Starting monitored process 4 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:23,518 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:23,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:23,576 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:15:23,578 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:23,582 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 7 [2023-11-29 03:15:23,605 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 03:15:23,605 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:23,605 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:23,606 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [655607027] [2023-11-29 03:15:23,606 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [655607027] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:23,606 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:23,606 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:15:23,606 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1974476802] [2023-11-29 03:15:23,607 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:23,607 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:15:23,607 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:23,608 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:15:23,608 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:15:23,609 INFO L87 Difference]: Start difference. First operand 134 states and 147 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:23,964 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:23,964 INFO L93 Difference]: Finished difference Result 143 states and 160 transitions. [2023-11-29 03:15:23,965 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:15:23,965 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 03:15:23,965 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:23,966 INFO L225 Difference]: With dead ends: 143 [2023-11-29 03:15:23,966 INFO L226 Difference]: Without dead ends: 143 [2023-11-29 03:15:23,967 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:23,968 INFO L413 NwaCegarLoop]: 45 mSDtfsCounter, 185 mSDsluCounter, 30 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 32 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 185 SdHoareTripleChecker+Valid, 75 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 32 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:23,969 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [185 Valid, 75 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [32 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:15:23,970 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 143 states. [2023-11-29 03:15:23,977 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 143 to 119. [2023-11-29 03:15:23,977 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 119 states, 64 states have (on average 2.109375) internal successors, (135), 118 states have internal predecessors, (135), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:23,979 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 119 states to 119 states and 135 transitions. [2023-11-29 03:15:23,979 INFO L78 Accepts]: Start accepts. Automaton has 119 states and 135 transitions. Word has length 6 [2023-11-29 03:15:23,979 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:23,979 INFO L495 AbstractCegarLoop]: Abstraction has 119 states and 135 transitions. [2023-11-29 03:15:23,980 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:23,980 INFO L276 IsEmpty]: Start isEmpty. Operand 119 states and 135 transitions. [2023-11-29 03:15:23,980 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 7 [2023-11-29 03:15:23,980 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:23,981 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1] [2023-11-29 03:15:23,982 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:24,181 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 4 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:24,181 INFO L420 AbstractCegarLoop]: === Iteration 4 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:24,182 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:24,182 INFO L85 PathProgramCache]: Analyzing trace with hash 1773093, now seen corresponding path program 1 times [2023-11-29 03:15:24,182 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:24,182 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [557802846] [2023-11-29 03:15:24,183 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:24,183 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 03:15:24,183 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:24,184 INFO L229 MonitoredProcess]: Starting monitored process 5 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:24,185 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:24,244 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:24,246 INFO L262 TraceCheckSpWp]: Trace formula consists of 51 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:15:24,248 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:24,255 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 03:15:24,314 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 03:15:24,314 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:24,314 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:24,314 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [557802846] [2023-11-29 03:15:24,315 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [557802846] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:24,315 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:24,315 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:15:24,315 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1142278119] [2023-11-29 03:15:24,315 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:24,316 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:15:24,316 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:24,316 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:15:24,317 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:15:24,317 INFO L87 Difference]: Start difference. First operand 119 states and 135 transitions. Second operand has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:24,805 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:24,805 INFO L93 Difference]: Finished difference Result 160 states and 183 transitions. [2023-11-29 03:15:24,806 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:15:24,806 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 6 [2023-11-29 03:15:24,806 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:24,808 INFO L225 Difference]: With dead ends: 160 [2023-11-29 03:15:24,808 INFO L226 Difference]: Without dead ends: 160 [2023-11-29 03:15:24,809 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 6 GetRequests, 3 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:24,810 INFO L413 NwaCegarLoop]: 51 mSDtfsCounter, 212 mSDsluCounter, 39 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 27 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 212 SdHoareTripleChecker+Valid, 90 SdHoareTripleChecker+Invalid, 197 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 27 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:24,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [212 Valid, 90 Invalid, 197 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [27 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:15:24,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 160 states. [2023-11-29 03:15:24,818 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 160 to 143. [2023-11-29 03:15:24,819 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 88 states have (on average 1.9318181818181819) internal successors, (170), 142 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 03:15:24,821 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 170 transitions. [2023-11-29 03:15:24,821 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 170 transitions. Word has length 6 [2023-11-29 03:15:24,821 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:24,821 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 170 transitions. [2023-11-29 03:15:24,821 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 2.0) internal successors, (6), 3 states have internal predecessors, (6), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:24,821 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 170 transitions. [2023-11-29 03:15:24,822 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 10 [2023-11-29 03:15:24,822 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:24,822 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:24,828 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:25,022 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 5 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:25,023 INFO L420 AbstractCegarLoop]: === Iteration 5 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:25,024 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:25,024 INFO L85 PathProgramCache]: Analyzing trace with hash 1284023995, now seen corresponding path program 1 times [2023-11-29 03:15:25,024 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:25,024 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1912007513] [2023-11-29 03:15:25,024 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:25,025 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 03:15:25,025 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:25,026 INFO L229 MonitoredProcess]: Starting monitored process 6 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:25,027 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:25,104 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:25,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 66 conjuncts, 5 conjunts are in the unsatisfiable core [2023-11-29 03:15:25,107 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:25,111 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 7 [2023-11-29 03:15:25,149 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:15:25,150 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:15:25,158 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 03:15:25,158 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:25,158 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:25,158 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1912007513] [2023-11-29 03:15:25,159 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1912007513] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:25,159 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:25,159 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:15:25,159 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1633719725] [2023-11-29 03:15:25,159 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:25,160 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:15:25,160 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:25,160 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:15:25,161 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:15:25,161 INFO L87 Difference]: Start difference. First operand 143 states and 170 transitions. Second operand has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:25,454 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:25,455 INFO L93 Difference]: Finished difference Result 157 states and 184 transitions. [2023-11-29 03:15:25,455 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 4 states. [2023-11-29 03:15:25,455 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 9 [2023-11-29 03:15:25,455 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:25,456 INFO L225 Difference]: With dead ends: 157 [2023-11-29 03:15:25,456 INFO L226 Difference]: Without dead ends: 157 [2023-11-29 03:15:25,457 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 9 GetRequests, 6 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:25,457 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 96 mSDsluCounter, 68 mSDsCounter, 0 mSdLazyCounter, 158 mSolverCounterSat, 4 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 96 SdHoareTripleChecker+Valid, 145 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 4 IncrementalHoareTripleChecker+Valid, 158 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:25,458 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [96 Valid, 145 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [4 Valid, 158 Invalid, 0 Unknown, 0 Unchecked, 0.3s Time] [2023-11-29 03:15:25,459 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 157 states. [2023-11-29 03:15:25,464 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 157 to 143. [2023-11-29 03:15:25,464 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 143 states, 88 states have (on average 1.9204545454545454) internal successors, (169), 142 states have internal predecessors, (169), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:25,465 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 143 states to 143 states and 169 transitions. [2023-11-29 03:15:25,465 INFO L78 Accepts]: Start accepts. Automaton has 143 states and 169 transitions. Word has length 9 [2023-11-29 03:15:25,466 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:25,466 INFO L495 AbstractCegarLoop]: Abstraction has 143 states and 169 transitions. [2023-11-29 03:15:25,466 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 4 states have (on average 2.25) internal successors, (9), 3 states have internal predecessors, (9), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:25,466 INFO L276 IsEmpty]: Start isEmpty. Operand 143 states and 169 transitions. [2023-11-29 03:15:25,466 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 12 [2023-11-29 03:15:25,467 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:25,467 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:25,468 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:25,667 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 6 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:25,667 INFO L420 AbstractCegarLoop]: === Iteration 6 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:25,668 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:25,668 INFO L85 PathProgramCache]: Analyzing trace with hash -1871091351, now seen corresponding path program 1 times [2023-11-29 03:15:25,668 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:25,668 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [208647028] [2023-11-29 03:15:25,668 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:25,668 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 03:15:25,668 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:25,669 INFO L229 MonitoredProcess]: Starting monitored process 7 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:25,670 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:25,722 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:25,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 67 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:15:25,724 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:25,729 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:25,730 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:25,730 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:25,730 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [208647028] [2023-11-29 03:15:25,730 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [208647028] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:25,730 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:25,730 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:15:25,730 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [709641987] [2023-11-29 03:15:25,731 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:25,731 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:15:25,731 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:25,731 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:15:25,732 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:15:25,732 INFO L87 Difference]: Start difference. First operand 143 states and 169 transitions. Second operand has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:25,831 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:25,831 INFO L93 Difference]: Finished difference Result 145 states and 171 transitions. [2023-11-29 03:15:25,832 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:15:25,832 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 11 [2023-11-29 03:15:25,832 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:25,833 INFO L225 Difference]: With dead ends: 145 [2023-11-29 03:15:25,833 INFO L226 Difference]: Without dead ends: 145 [2023-11-29 03:15:25,834 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 10 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:15:25,834 INFO L413 NwaCegarLoop]: 108 mSDtfsCounter, 0 mSDsluCounter, 105 mSDsCounter, 0 mSdLazyCounter, 44 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 0 SdHoareTripleChecker+Valid, 213 SdHoareTripleChecker+Invalid, 44 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 44 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:25,835 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [0 Valid, 213 Invalid, 44 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 44 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:15:25,836 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 145 states. [2023-11-29 03:15:25,840 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 145 to 145. [2023-11-29 03:15:25,841 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 145 states, 90 states have (on average 1.9) internal successors, (171), 144 states have internal predecessors, (171), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:25,842 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 145 states to 145 states and 171 transitions. [2023-11-29 03:15:25,842 INFO L78 Accepts]: Start accepts. Automaton has 145 states and 171 transitions. Word has length 11 [2023-11-29 03:15:25,842 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:25,842 INFO L495 AbstractCegarLoop]: Abstraction has 145 states and 171 transitions. [2023-11-29 03:15:25,843 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 3.6666666666666665) internal successors, (11), 3 states have internal predecessors, (11), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:25,843 INFO L276 IsEmpty]: Start isEmpty. Operand 145 states and 171 transitions. [2023-11-29 03:15:25,843 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 13 [2023-11-29 03:15:25,843 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:25,844 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:25,845 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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)] Ended with exit code 0 [2023-11-29 03:15:26,044 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 7 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:26,044 INFO L420 AbstractCegarLoop]: === Iteration 7 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:26,045 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:26,045 INFO L85 PathProgramCache]: Analyzing trace with hash -2137401967, now seen corresponding path program 1 times [2023-11-29 03:15:26,045 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:26,045 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [786241811] [2023-11-29 03:15:26,045 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:26,045 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 03:15:26,045 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:26,046 INFO L229 MonitoredProcess]: Starting monitored process 8 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:26,047 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:26,103 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:26,105 INFO L262 TraceCheckSpWp]: Trace formula consists of 74 conjuncts, 10 conjunts are in the unsatisfiable core [2023-11-29 03:15:26,106 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:26,111 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:15:26,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:15:26,196 INFO L134 CoverageAnalysis]: Checked inductivity of 1 backedges. 1 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:26,196 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:26,196 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:26,197 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [786241811] [2023-11-29 03:15:26,197 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [786241811] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:26,197 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:26,197 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:15:26,197 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1573885878] [2023-11-29 03:15:26,197 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:26,197 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:15:26,197 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:26,198 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:15:26,198 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:26,198 INFO L87 Difference]: Start difference. First operand 145 states and 171 transitions. Second operand has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:26,720 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:26,720 INFO L93 Difference]: Finished difference Result 184 states and 220 transitions. [2023-11-29 03:15:26,720 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 7 states. [2023-11-29 03:15:26,721 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 12 [2023-11-29 03:15:26,721 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:26,722 INFO L225 Difference]: With dead ends: 184 [2023-11-29 03:15:26,722 INFO L226 Difference]: Without dead ends: 184 [2023-11-29 03:15:26,722 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 13 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=17, Invalid=25, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:15:26,723 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 52 mSDsluCounter, 248 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 52 SdHoareTripleChecker+Valid, 352 SdHoareTripleChecker+Invalid, 177 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:26,723 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [52 Valid, 352 Invalid, 177 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:15:26,724 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 184 states. [2023-11-29 03:15:26,726 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 184 to 157. [2023-11-29 03:15:26,727 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 157 states, 102 states have (on average 1.8529411764705883) internal successors, (189), 156 states have internal predecessors, (189), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:26,728 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 157 states to 157 states and 189 transitions. [2023-11-29 03:15:26,728 INFO L78 Accepts]: Start accepts. Automaton has 157 states and 189 transitions. Word has length 12 [2023-11-29 03:15:26,728 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:26,728 INFO L495 AbstractCegarLoop]: Abstraction has 157 states and 189 transitions. [2023-11-29 03:15:26,728 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 2.4) internal successors, (12), 5 states have internal predecessors, (12), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:26,728 INFO L276 IsEmpty]: Start isEmpty. Operand 157 states and 189 transitions. [2023-11-29 03:15:26,729 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 03:15:26,729 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:26,729 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:26,731 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:26,929 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 8 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:26,930 INFO L420 AbstractCegarLoop]: === Iteration 8 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:26,930 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:26,930 INFO L85 PathProgramCache]: Analyzing trace with hash 1627915196, now seen corresponding path program 1 times [2023-11-29 03:15:26,930 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:26,931 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1257337589] [2023-11-29 03:15:26,931 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:26,931 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 03:15:26,931 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:26,932 INFO L229 MonitoredProcess]: Starting monitored process 9 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:26,933 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:27,011 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:27,014 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:15:27,016 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:27,044 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:27,044 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:27,044 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:27,045 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1257337589] [2023-11-29 03:15:27,045 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1257337589] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:27,045 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:27,045 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:15:27,045 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1099334364] [2023-11-29 03:15:27,045 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:27,045 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:15:27,046 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:27,046 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:15:27,046 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:15:27,046 INFO L87 Difference]: Start difference. First operand 157 states and 189 transitions. Second operand has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:27,482 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:27,482 INFO L93 Difference]: Finished difference Result 194 states and 230 transitions. [2023-11-29 03:15:27,483 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:15:27,483 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 03:15:27,483 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:27,484 INFO L225 Difference]: With dead ends: 194 [2023-11-29 03:15:27,484 INFO L226 Difference]: Without dead ends: 194 [2023-11-29 03:15:27,485 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 11 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:27,485 INFO L413 NwaCegarLoop]: 76 mSDtfsCounter, 115 mSDsluCounter, 66 mSDsCounter, 0 mSdLazyCounter, 227 mSolverCounterSat, 8 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 115 SdHoareTripleChecker+Valid, 142 SdHoareTripleChecker+Invalid, 235 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 8 IncrementalHoareTripleChecker+Valid, 227 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:27,486 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [115 Valid, 142 Invalid, 235 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [8 Valid, 227 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:15:27,487 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 194 states. [2023-11-29 03:15:27,490 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 194 to 159. [2023-11-29 03:15:27,490 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 159 states, 104 states have (on average 1.8557692307692308) internal successors, (193), 158 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:27,491 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 159 states to 159 states and 193 transitions. [2023-11-29 03:15:27,491 INFO L78 Accepts]: Start accepts. Automaton has 159 states and 193 transitions. Word has length 14 [2023-11-29 03:15:27,491 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:27,491 INFO L495 AbstractCegarLoop]: Abstraction has 159 states and 193 transitions. [2023-11-29 03:15:27,491 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 4.666666666666667) internal successors, (14), 4 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:27,492 INFO L276 IsEmpty]: Start isEmpty. Operand 159 states and 193 transitions. [2023-11-29 03:15:27,492 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 03:15:27,492 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:27,493 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:27,496 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:27,693 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 9 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:27,693 INFO L420 AbstractCegarLoop]: === Iteration 9 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:27,694 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:27,694 INFO L85 PathProgramCache]: Analyzing trace with hash 1627915197, now seen corresponding path program 1 times [2023-11-29 03:15:27,694 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:27,694 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [784505109] [2023-11-29 03:15:27,694 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:27,694 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 03:15:27,694 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:27,695 INFO L229 MonitoredProcess]: Starting monitored process 10 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:27,696 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:27,778 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:27,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 113 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:15:27,782 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:27,860 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:27,860 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:27,861 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:27,861 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [784505109] [2023-11-29 03:15:27,861 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [784505109] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:27,861 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:27,861 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:15:27,861 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [109334027] [2023-11-29 03:15:27,861 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:27,862 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 6 states [2023-11-29 03:15:27,862 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:27,862 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 6 interpolants. [2023-11-29 03:15:27,862 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=10, Invalid=20, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:15:27,862 INFO L87 Difference]: Start difference. First operand 159 states and 193 transitions. Second operand has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:28,580 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:28,580 INFO L93 Difference]: Finished difference Result 267 states and 308 transitions. [2023-11-29 03:15:28,581 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:15:28,581 INFO L78 Accepts]: Start accepts. Automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 03:15:28,581 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:28,582 INFO L225 Difference]: With dead ends: 267 [2023-11-29 03:15:28,582 INFO L226 Difference]: Without dead ends: 267 [2023-11-29 03:15:28,582 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 18 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 9 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=41, Invalid=69, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:15:28,583 INFO L413 NwaCegarLoop]: 120 mSDtfsCounter, 368 mSDsluCounter, 141 mSDsCounter, 0 mSdLazyCounter, 301 mSolverCounterSat, 16 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 368 SdHoareTripleChecker+Valid, 261 SdHoareTripleChecker+Invalid, 317 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 16 IncrementalHoareTripleChecker+Valid, 301 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.6s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:28,583 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [368 Valid, 261 Invalid, 317 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [16 Valid, 301 Invalid, 0 Unknown, 0 Unchecked, 0.6s Time] [2023-11-29 03:15:28,584 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 267 states. [2023-11-29 03:15:28,590 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 267 to 161. [2023-11-29 03:15:28,590 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 161 states, 106 states have (on average 1.8584905660377358) internal successors, (197), 160 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:28,591 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 161 states to 161 states and 197 transitions. [2023-11-29 03:15:28,591 INFO L78 Accepts]: Start accepts. Automaton has 161 states and 197 transitions. Word has length 14 [2023-11-29 03:15:28,591 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:28,591 INFO L495 AbstractCegarLoop]: Abstraction has 161 states and 197 transitions. [2023-11-29 03:15:28,591 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 6 states, 5 states have (on average 2.8) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:28,591 INFO L276 IsEmpty]: Start isEmpty. Operand 161 states and 197 transitions. [2023-11-29 03:15:28,592 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 03:15:28,592 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:28,592 INFO L195 NwaCegarLoop]: trace histogram [2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:28,595 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:28,793 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 10 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:28,793 INFO L420 AbstractCegarLoop]: === Iteration 10 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:28,794 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:28,794 INFO L85 PathProgramCache]: Analyzing trace with hash 1627917118, now seen corresponding path program 1 times [2023-11-29 03:15:28,794 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:28,794 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1987288986] [2023-11-29 03:15:28,794 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:28,794 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 03:15:28,794 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:28,795 INFO L229 MonitoredProcess]: Starting monitored process 11 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:28,796 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:28,871 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:28,874 INFO L262 TraceCheckSpWp]: Trace formula consists of 108 conjuncts, 16 conjunts are in the unsatisfiable core [2023-11-29 03:15:28,876 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:28,883 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:15:28,888 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:15:28,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 03:15:28,920 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 03:15:29,091 INFO L134 CoverageAnalysis]: Checked inductivity of 2 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:29,091 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:29,091 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:29,091 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1987288986] [2023-11-29 03:15:29,091 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1987288986] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:29,091 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:29,092 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [7] imperfect sequences [] total 7 [2023-11-29 03:15:29,092 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1247637017] [2023-11-29 03:15:29,092 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:29,092 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:15:29,093 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:29,093 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:15:29,093 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:15:29,093 INFO L87 Difference]: Start difference. First operand 161 states and 197 transitions. Second operand has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:29,958 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:29,958 INFO L93 Difference]: Finished difference Result 250 states and 291 transitions. [2023-11-29 03:15:29,958 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:15:29,958 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 03:15:29,959 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:29,960 INFO L225 Difference]: With dead ends: 250 [2023-11-29 03:15:29,960 INFO L226 Difference]: Without dead ends: 250 [2023-11-29 03:15:29,960 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 16 GetRequests, 8 SyntacticMatches, 0 SemanticMatches, 8 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 6 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=28, Invalid=62, Unknown=0, NotChecked=0, Total=90 [2023-11-29 03:15:29,961 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 142 mSDsluCounter, 405 mSDsCounter, 0 mSdLazyCounter, 264 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 142 SdHoareTripleChecker+Valid, 510 SdHoareTripleChecker+Invalid, 269 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 264 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:29,961 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [142 Valid, 510 Invalid, 269 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 264 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:15:29,962 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 250 states. [2023-11-29 03:15:29,966 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 250 to 168. [2023-11-29 03:15:29,966 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 113 states have (on average 1.8053097345132743) internal successors, (204), 167 states have internal predecessors, (204), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:29,967 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 204 transitions. [2023-11-29 03:15:29,967 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 204 transitions. Word has length 14 [2023-11-29 03:15:29,967 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:29,967 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 204 transitions. [2023-11-29 03:15:29,968 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.0) internal successors, (14), 7 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:29,968 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 204 transitions. [2023-11-29 03:15:29,968 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 03:15:29,968 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:29,968 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:29,971 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:30,169 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 11 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:30,169 INFO L420 AbstractCegarLoop]: === Iteration 11 === Targeting ULTIMATE.startErr18REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:30,170 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:30,170 INFO L85 PathProgramCache]: Analyzing trace with hash -1609653609, now seen corresponding path program 1 times [2023-11-29 03:15:30,170 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:30,170 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [756734076] [2023-11-29 03:15:30,170 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:30,170 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 03:15:30,171 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:30,172 INFO L229 MonitoredProcess]: Starting monitored process 12 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:30,173 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:30,250 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:30,253 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:15:30,255 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:30,259 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 7 [2023-11-29 03:15:30,271 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:15:30,289 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 03:15:30,298 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 03:15:30,298 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:30,298 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:30,298 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [756734076] [2023-11-29 03:15:30,298 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [756734076] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:30,298 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:30,299 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:15:30,299 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1737684752] [2023-11-29 03:15:30,299 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:30,299 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:15:30,299 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:30,300 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:15:30,300 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:30,300 INFO L87 Difference]: Start difference. First operand 168 states and 204 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:30,760 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:30,760 INFO L93 Difference]: Finished difference Result 167 states and 202 transitions. [2023-11-29 03:15:30,760 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:15:30,761 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 03:15:30,761 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:30,762 INFO L225 Difference]: With dead ends: 167 [2023-11-29 03:15:30,762 INFO L226 Difference]: Without dead ends: 167 [2023-11-29 03:15:30,762 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:15:30,763 INFO L413 NwaCegarLoop]: 105 mSDtfsCounter, 5 mSDsluCounter, 163 mSDsCounter, 0 mSdLazyCounter, 236 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 268 SdHoareTripleChecker+Invalid, 236 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 236 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:30,763 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 268 Invalid, 236 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 236 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:15:30,764 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 167 states. [2023-11-29 03:15:30,766 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 167 to 167. [2023-11-29 03:15:30,767 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 167 states, 113 states have (on average 1.7876106194690264) internal successors, (202), 166 states have internal predecessors, (202), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:30,768 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 167 states to 167 states and 202 transitions. [2023-11-29 03:15:30,768 INFO L78 Accepts]: Start accepts. Automaton has 167 states and 202 transitions. Word has length 14 [2023-11-29 03:15:30,768 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:30,768 INFO L495 AbstractCegarLoop]: Abstraction has 167 states and 202 transitions. [2023-11-29 03:15:30,768 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:30,769 INFO L276 IsEmpty]: Start isEmpty. Operand 167 states and 202 transitions. [2023-11-29 03:15:30,769 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 15 [2023-11-29 03:15:30,769 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:30,769 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:30,772 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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)] Ended with exit code 0 [2023-11-29 03:15:30,972 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 12 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:30,972 INFO L420 AbstractCegarLoop]: === Iteration 12 === Targeting ULTIMATE.startErr19REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:30,972 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:30,972 INFO L85 PathProgramCache]: Analyzing trace with hash -1609653608, now seen corresponding path program 1 times [2023-11-29 03:15:30,973 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:30,973 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [925907806] [2023-11-29 03:15:30,973 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:30,973 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 03:15:30,973 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:30,974 INFO L229 MonitoredProcess]: Starting monitored process 13 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:30,974 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:31,045 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,047 INFO L262 TraceCheckSpWp]: Trace formula consists of 97 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 03:15:31,049 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:31,055 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 03:15:31,072 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:15:31,082 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:15:31,105 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 17 treesize of output 9 [2023-11-29 03:15:31,120 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 03:15:31,120 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:31,120 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:31,120 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [925907806] [2023-11-29 03:15:31,120 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [925907806] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:31,120 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:31,120 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:15:31,121 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [936693092] [2023-11-29 03:15:31,121 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:31,121 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:15:31,121 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:31,121 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:15:31,122 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:31,122 INFO L87 Difference]: Start difference. First operand 167 states and 202 transitions. Second operand has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:31,637 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:31,637 INFO L93 Difference]: Finished difference Result 166 states and 200 transitions. [2023-11-29 03:15:31,638 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:15:31,638 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 14 [2023-11-29 03:15:31,638 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:31,639 INFO L225 Difference]: With dead ends: 166 [2023-11-29 03:15:31,639 INFO L226 Difference]: Without dead ends: 166 [2023-11-29 03:15:31,639 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 14 GetRequests, 10 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:15:31,639 INFO L413 NwaCegarLoop]: 104 mSDtfsCounter, 3 mSDsluCounter, 146 mSDsCounter, 0 mSdLazyCounter, 252 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 250 SdHoareTripleChecker+Invalid, 252 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 252 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:31,640 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 250 Invalid, 252 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 252 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:15:31,640 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 166 states. [2023-11-29 03:15:31,642 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 166 to 166. [2023-11-29 03:15:31,642 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 166 states, 113 states have (on average 1.7699115044247788) internal successors, (200), 165 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 03:15:31,643 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 166 states to 166 states and 200 transitions. [2023-11-29 03:15:31,643 INFO L78 Accepts]: Start accepts. Automaton has 166 states and 200 transitions. Word has length 14 [2023-11-29 03:15:31,643 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:31,643 INFO L495 AbstractCegarLoop]: Abstraction has 166 states and 200 transitions. [2023-11-29 03:15:31,644 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 3.5) internal successors, (14), 5 states have internal predecessors, (14), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:31,644 INFO L276 IsEmpty]: Start isEmpty. Operand 166 states and 200 transitions. [2023-11-29 03:15:31,644 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 16 [2023-11-29 03:15:31,644 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:31,644 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:31,647 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:31,845 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 13 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:31,845 INFO L420 AbstractCegarLoop]: === Iteration 13 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:31,845 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:31,845 INFO L85 PathProgramCache]: Analyzing trace with hash -1074237455, now seen corresponding path program 1 times [2023-11-29 03:15:31,845 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:31,845 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [634637066] [2023-11-29 03:15:31,846 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:31,846 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 03:15:31,846 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:31,847 INFO L229 MonitoredProcess]: Starting monitored process 14 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:31,847 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:31,931 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:31,934 INFO L262 TraceCheckSpWp]: Trace formula consists of 115 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:15:31,935 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:31,987 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 03:15:31,987 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:15:32,023 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 03:15:32,024 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:32,024 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [634637066] [2023-11-29 03:15:32,024 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [634637066] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:15:32,024 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:15:32,024 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [5, 5] total 6 [2023-11-29 03:15:32,024 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [656749203] [2023-11-29 03:15:32,024 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:15:32,025 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:15:32,025 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:32,025 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:15:32,025 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=12, Invalid=30, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:15:32,025 INFO L87 Difference]: Start difference. First operand 166 states and 200 transitions. Second operand has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:32,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:32,434 INFO L93 Difference]: Finished difference Result 233 states and 271 transitions. [2023-11-29 03:15:32,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:15:32,434 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 15 [2023-11-29 03:15:32,435 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:32,436 INFO L225 Difference]: With dead ends: 233 [2023-11-29 03:15:32,436 INFO L226 Difference]: Without dead ends: 233 [2023-11-29 03:15:32,436 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 34 GetRequests, 23 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 14 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:15:32,437 INFO L413 NwaCegarLoop]: 96 mSDtfsCounter, 288 mSDsluCounter, 217 mSDsCounter, 0 mSdLazyCounter, 207 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 288 SdHoareTripleChecker+Valid, 313 SdHoareTripleChecker+Invalid, 209 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 207 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:32,437 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [288 Valid, 313 Invalid, 209 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 207 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:15:32,438 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 233 states. [2023-11-29 03:15:32,441 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 233 to 165. [2023-11-29 03:15:32,441 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 112 states have (on average 1.7678571428571428) internal successors, (198), 164 states have internal predecessors, (198), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:32,442 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 198 transitions. [2023-11-29 03:15:32,442 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 198 transitions. Word has length 15 [2023-11-29 03:15:32,443 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:32,443 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 198 transitions. [2023-11-29 03:15:32,443 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 2.4285714285714284) internal successors, (17), 6 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:32,443 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 198 transitions. [2023-11-29 03:15:32,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 03:15:32,444 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:32,444 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:32,446 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:32,646 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 14 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:32,647 INFO L420 AbstractCegarLoop]: === Iteration 14 === Targeting ULTIMATE.startErr22REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:32,647 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:32,647 INFO L85 PathProgramCache]: Analyzing trace with hash -688701634, now seen corresponding path program 1 times [2023-11-29 03:15:32,647 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:32,648 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [545481314] [2023-11-29 03:15:32,648 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:32,648 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 03:15:32,648 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:32,649 INFO L229 MonitoredProcess]: Starting monitored process 15 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:32,650 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:32,733 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:32,737 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 03:15:32,739 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:32,754 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 03:15:32,755 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2023-11-29 03:15:32,907 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 03:15:32,908 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2023-11-29 03:15:32,981 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:15:33,114 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:15:33,114 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 49 [2023-11-29 03:15:33,149 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 43 treesize of output 27 [2023-11-29 03:15:33,232 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 03:15:33,233 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:33,233 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:33,233 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [545481314] [2023-11-29 03:15:33,233 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [545481314] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:33,233 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:33,233 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:15:33,233 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [401779870] [2023-11-29 03:15:33,233 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:33,234 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:15:33,234 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:33,234 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:15:33,234 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:15:33,234 INFO L87 Difference]: Start difference. First operand 165 states and 198 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:34,421 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:34,422 INFO L93 Difference]: Finished difference Result 196 states and 228 transitions. [2023-11-29 03:15:34,422 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:15:34,422 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-29 03:15:34,422 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:34,423 INFO L225 Difference]: With dead ends: 196 [2023-11-29 03:15:34,423 INFO L226 Difference]: Without dead ends: 196 [2023-11-29 03:15:34,424 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.4s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:15:34,424 INFO L413 NwaCegarLoop]: 77 mSDtfsCounter, 159 mSDsluCounter, 228 mSDsCounter, 0 mSdLazyCounter, 521 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 159 SdHoareTripleChecker+Valid, 305 SdHoareTripleChecker+Invalid, 530 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 521 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:34,424 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [159 Valid, 305 Invalid, 530 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 521 Invalid, 0 Unknown, 0 Unchecked, 0.9s Time] [2023-11-29 03:15:34,425 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-11-29 03:15:34,427 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 165. [2023-11-29 03:15:34,427 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 165 states, 112 states have (on average 1.7589285714285714) internal successors, (197), 164 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:34,432 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 165 states to 165 states and 197 transitions. [2023-11-29 03:15:34,432 INFO L78 Accepts]: Start accepts. Automaton has 165 states and 197 transitions. Word has length 16 [2023-11-29 03:15:34,433 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:34,433 INFO L495 AbstractCegarLoop]: Abstraction has 165 states and 197 transitions. [2023-11-29 03:15:34,433 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:34,433 INFO L276 IsEmpty]: Start isEmpty. Operand 165 states and 197 transitions. [2023-11-29 03:15:34,434 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 17 [2023-11-29 03:15:34,434 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:34,434 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:34,436 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:34,634 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 15 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:34,634 INFO L420 AbstractCegarLoop]: === Iteration 15 === Targeting ULTIMATE.startErr23REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:34,635 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:34,635 INFO L85 PathProgramCache]: Analyzing trace with hash -688701633, now seen corresponding path program 1 times [2023-11-29 03:15:34,635 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:34,635 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [213063038] [2023-11-29 03:15:34,635 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:34,635 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 03:15:34,636 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:34,636 INFO L229 MonitoredProcess]: Starting monitored process 16 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:34,637 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:34,720 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:34,723 INFO L262 TraceCheckSpWp]: Trace formula consists of 116 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 03:15:34,725 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:34,728 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 7 [2023-11-29 03:15:34,771 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:15:34,771 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:15:34,779 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 5 [2023-11-29 03:15:34,805 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:15:34,811 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:15:34,894 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:15:34,895 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:15:34,901 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:15:34,923 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:15:34,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:15:34,950 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 03:15:34,950 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:34,950 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:34,951 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [213063038] [2023-11-29 03:15:34,951 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [213063038] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:34,951 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:34,951 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:15:34,951 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2086695435] [2023-11-29 03:15:34,951 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:34,951 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:15:34,952 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:34,952 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:15:34,952 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:15:34,952 INFO L87 Difference]: Start difference. First operand 165 states and 197 transitions. Second operand has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:35,871 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:35,871 INFO L93 Difference]: Finished difference Result 183 states and 216 transitions. [2023-11-29 03:15:35,872 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:15:35,872 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 16 [2023-11-29 03:15:35,872 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:35,873 INFO L225 Difference]: With dead ends: 183 [2023-11-29 03:15:35,873 INFO L226 Difference]: Without dead ends: 183 [2023-11-29 03:15:35,873 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 20 GetRequests, 9 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:15:35,874 INFO L413 NwaCegarLoop]: 46 mSDtfsCounter, 164 mSDsluCounter, 138 mSDsCounter, 0 mSdLazyCounter, 547 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 164 SdHoareTripleChecker+Valid, 184 SdHoareTripleChecker+Invalid, 559 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 547 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:35,874 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [164 Valid, 184 Invalid, 559 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 547 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:15:35,875 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 183 states. [2023-11-29 03:15:35,877 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 183 to 164. [2023-11-29 03:15:35,877 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 164 states, 112 states have (on average 1.7410714285714286) internal successors, (195), 163 states have internal predecessors, (195), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:35,877 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 164 states to 164 states and 195 transitions. [2023-11-29 03:15:35,877 INFO L78 Accepts]: Start accepts. Automaton has 164 states and 195 transitions. Word has length 16 [2023-11-29 03:15:35,877 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:35,878 INFO L495 AbstractCegarLoop]: Abstraction has 164 states and 195 transitions. [2023-11-29 03:15:35,878 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.2857142857142856) internal successors, (16), 7 states have internal predecessors, (16), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:35,878 INFO L276 IsEmpty]: Start isEmpty. Operand 164 states and 195 transitions. [2023-11-29 03:15:35,878 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 03:15:35,878 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:35,878 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:35,882 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:15:36,079 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 16 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:36,079 INFO L420 AbstractCegarLoop]: === Iteration 16 === Targeting ULTIMATE.startErr30REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:36,079 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:36,079 INFO L85 PathProgramCache]: Analyzing trace with hash 253568400, now seen corresponding path program 1 times [2023-11-29 03:15:36,080 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:36,080 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [996343795] [2023-11-29 03:15:36,080 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:36,080 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 03:15:36,080 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:36,081 INFO L229 MonitoredProcess]: Starting monitored process 17 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:36,081 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:36,141 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:36,143 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 7 conjunts are in the unsatisfiable core [2023-11-29 03:15:36,145 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:36,148 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 7 [2023-11-29 03:15:36,159 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:15:36,173 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 23 treesize of output 11 [2023-11-29 03:15:36,181 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 03:15:36,181 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:36,181 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:36,182 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [996343795] [2023-11-29 03:15:36,182 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [996343795] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:36,182 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:36,182 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:15:36,182 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [912333011] [2023-11-29 03:15:36,182 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:36,182 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:15:36,182 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:36,183 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:15:36,183 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:36,183 INFO L87 Difference]: Start difference. First operand 164 states and 195 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:36,639 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:36,639 INFO L93 Difference]: Finished difference Result 163 states and 193 transitions. [2023-11-29 03:15:36,640 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:15:36,640 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 03:15:36,640 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:36,641 INFO L225 Difference]: With dead ends: 163 [2023-11-29 03:15:36,641 INFO L226 Difference]: Without dead ends: 163 [2023-11-29 03:15:36,641 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:15:36,642 INFO L413 NwaCegarLoop]: 102 mSDtfsCounter, 5 mSDsluCounter, 157 mSDsCounter, 0 mSdLazyCounter, 233 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 5 SdHoareTripleChecker+Valid, 259 SdHoareTripleChecker+Invalid, 233 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 233 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:36,642 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [5 Valid, 259 Invalid, 233 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 233 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:15:36,642 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 163 states. [2023-11-29 03:15:36,644 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 163 to 163. [2023-11-29 03:15:36,644 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 112 states have (on average 1.7232142857142858) internal successors, (193), 162 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:36,645 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 193 transitions. [2023-11-29 03:15:36,645 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 193 transitions. Word has length 17 [2023-11-29 03:15:36,645 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:36,645 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 193 transitions. [2023-11-29 03:15:36,645 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:36,645 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions. [2023-11-29 03:15:36,645 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 18 [2023-11-29 03:15:36,646 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:36,646 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:36,648 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:36,846 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 17 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:36,846 INFO L420 AbstractCegarLoop]: === Iteration 17 === Targeting ULTIMATE.startErr31REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:36,847 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:36,847 INFO L85 PathProgramCache]: Analyzing trace with hash 253568401, now seen corresponding path program 1 times [2023-11-29 03:15:36,847 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:36,847 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [800295130] [2023-11-29 03:15:36,847 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:36,847 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 03:15:36,847 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:36,848 INFO L229 MonitoredProcess]: Starting monitored process 18 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:36,849 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:36,933 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:36,935 INFO L262 TraceCheckSpWp]: Trace formula consists of 107 conjuncts, 11 conjunts are in the unsatisfiable core [2023-11-29 03:15:36,937 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:36,944 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 03:15:36,963 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:15:36,967 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:15:36,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 9 [2023-11-29 03:15:37,006 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 03:15:37,006 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:37,006 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:37,006 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [800295130] [2023-11-29 03:15:37,007 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [800295130] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:37,007 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:37,007 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [4] imperfect sequences [] total 4 [2023-11-29 03:15:37,007 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [159959057] [2023-11-29 03:15:37,007 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:37,008 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:15:37,008 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:37,008 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:15:37,008 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:15:37,009 INFO L87 Difference]: Start difference. First operand 163 states and 193 transitions. Second operand has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:37,503 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:37,503 INFO L93 Difference]: Finished difference Result 162 states and 191 transitions. [2023-11-29 03:15:37,504 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:15:37,504 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 17 [2023-11-29 03:15:37,504 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:37,505 INFO L225 Difference]: With dead ends: 162 [2023-11-29 03:15:37,505 INFO L226 Difference]: Without dead ends: 162 [2023-11-29 03:15:37,506 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 17 GetRequests, 13 SyntacticMatches, 0 SemanticMatches, 4 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=11, Invalid=19, Unknown=0, NotChecked=0, Total=30 [2023-11-29 03:15:37,506 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 3 mSDsluCounter, 143 mSDsCounter, 0 mSdLazyCounter, 246 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 3 SdHoareTripleChecker+Valid, 244 SdHoareTripleChecker+Invalid, 246 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 246 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:37,507 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [3 Valid, 244 Invalid, 246 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 246 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:15:37,507 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 162 states. [2023-11-29 03:15:37,510 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 162 to 162. [2023-11-29 03:15:37,510 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 112 states have (on average 1.7053571428571428) internal successors, (191), 161 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:37,511 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 191 transitions. [2023-11-29 03:15:37,511 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 191 transitions. Word has length 17 [2023-11-29 03:15:37,511 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:37,511 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 191 transitions. [2023-11-29 03:15:37,511 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 4 states have (on average 4.25) internal successors, (17), 5 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:37,512 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 191 transitions. [2023-11-29 03:15:37,512 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:15:37,512 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:37,512 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:37,515 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:37,714 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 18 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:37,715 INFO L420 AbstractCegarLoop]: === Iteration 18 === Targeting ULTIMATE.startErr34REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:37,715 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:37,715 INFO L85 PathProgramCache]: Analyzing trace with hash -1133760379, now seen corresponding path program 1 times [2023-11-29 03:15:37,716 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:37,716 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [485090005] [2023-11-29 03:15:37,716 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:37,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 03:15:37,716 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:37,717 INFO L229 MonitoredProcess]: Starting monitored process 19 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:37,718 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:37,825 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:37,828 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 03:15:37,830 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:37,844 INFO L349 Elim1Store]: treesize reduction 13, result has 45.8 percent of original size [2023-11-29 03:15:37,844 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 12 treesize of output 22 [2023-11-29 03:15:37,983 INFO L349 Elim1Store]: treesize reduction 54, result has 29.9 percent of original size [2023-11-29 03:15:37,984 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 0 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 5 case distinctions, treesize of input 28 treesize of output 45 [2023-11-29 03:15:38,050 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:15:38,169 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:15:38,169 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 59 [2023-11-29 03:15:38,194 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 51 treesize of output 27 [2023-11-29 03:15:38,259 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 03:15:38,259 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:38,259 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:38,259 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [485090005] [2023-11-29 03:15:38,259 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [485090005] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:38,260 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:38,260 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:15:38,260 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1193889510] [2023-11-29 03:15:38,260 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:38,260 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:15:38,260 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:38,261 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:15:38,261 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:15:38,261 INFO L87 Difference]: Start difference. First operand 162 states and 191 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:39,433 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:39,433 INFO L93 Difference]: Finished difference Result 189 states and 221 transitions. [2023-11-29 03:15:39,434 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 8 states. [2023-11-29 03:15:39,434 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 03:15:39,434 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:39,435 INFO L225 Difference]: With dead ends: 189 [2023-11-29 03:15:39,435 INFO L226 Difference]: Without dead ends: 189 [2023-11-29 03:15:39,435 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:15:39,436 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 145 mSDsluCounter, 218 mSDsCounter, 0 mSdLazyCounter, 515 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.9s Time, 0 mProtectedPredicate, 0 mProtectedAction, 145 SdHoareTripleChecker+Valid, 293 SdHoareTripleChecker+Invalid, 524 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 515 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:39,436 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [145 Valid, 293 Invalid, 524 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 515 Invalid, 0 Unknown, 0 Unchecked, 1.0s Time] [2023-11-29 03:15:39,437 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 189 states. [2023-11-29 03:15:39,439 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 189 to 163. [2023-11-29 03:15:39,440 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 163 states, 113 states have (on average 1.7079646017699115) internal successors, (193), 162 states have internal predecessors, (193), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:39,440 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 163 states to 163 states and 193 transitions. [2023-11-29 03:15:39,440 INFO L78 Accepts]: Start accepts. Automaton has 163 states and 193 transitions. Word has length 19 [2023-11-29 03:15:39,440 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:39,440 INFO L495 AbstractCegarLoop]: Abstraction has 163 states and 193 transitions. [2023-11-29 03:15:39,441 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:39,441 INFO L276 IsEmpty]: Start isEmpty. Operand 163 states and 193 transitions. [2023-11-29 03:15:39,441 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 20 [2023-11-29 03:15:39,441 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:39,441 INFO L195 NwaCegarLoop]: trace histogram [1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:39,443 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:39,642 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 19 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:39,642 INFO L420 AbstractCegarLoop]: === Iteration 19 === Targeting ULTIMATE.startErr35REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:39,642 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:39,642 INFO L85 PathProgramCache]: Analyzing trace with hash -1133760378, now seen corresponding path program 1 times [2023-11-29 03:15:39,642 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:39,643 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1065981534] [2023-11-29 03:15:39,643 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:39,643 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 03:15:39,643 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:39,644 INFO L229 MonitoredProcess]: Starting monitored process 20 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:39,645 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:39,728 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:39,731 INFO L262 TraceCheckSpWp]: Trace formula consists of 126 conjuncts, 19 conjunts are in the unsatisfiable core [2023-11-29 03:15:39,733 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:39,736 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 7 [2023-11-29 03:15:39,775 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:15:39,775 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:15:39,783 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 5 [2023-11-29 03:15:39,802 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:15:39,813 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:15:39,884 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:15:39,884 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 62 treesize of output 57 [2023-11-29 03:15:39,893 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 30 treesize of output 13 [2023-11-29 03:15:39,909 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 13 [2023-11-29 03:15:39,913 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 9 treesize of output 3 [2023-11-29 03:15:39,930 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 03:15:39,931 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:39,931 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:39,931 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1065981534] [2023-11-29 03:15:39,931 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1065981534] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:39,931 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:39,931 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [6] imperfect sequences [] total 6 [2023-11-29 03:15:39,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1972618593] [2023-11-29 03:15:39,931 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:39,932 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:15:39,932 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:39,932 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:15:39,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=14, Invalid=42, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:15:39,933 INFO L87 Difference]: Start difference. First operand 163 states and 193 transitions. Second operand has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:40,731 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:40,731 INFO L93 Difference]: Finished difference Result 181 states and 212 transitions. [2023-11-29 03:15:40,731 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 9 states. [2023-11-29 03:15:40,731 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 19 [2023-11-29 03:15:40,732 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:40,732 INFO L225 Difference]: With dead ends: 181 [2023-11-29 03:15:40,732 INFO L226 Difference]: Without dead ends: 181 [2023-11-29 03:15:40,733 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 23 GetRequests, 12 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 7 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=46, Invalid=110, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:15:40,733 INFO L413 NwaCegarLoop]: 44 mSDtfsCounter, 155 mSDsluCounter, 113 mSDsCounter, 0 mSdLazyCounter, 439 mSolverCounterSat, 12 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 155 SdHoareTripleChecker+Valid, 157 SdHoareTripleChecker+Invalid, 451 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 12 IncrementalHoareTripleChecker+Valid, 439 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:40,733 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [155 Valid, 157 Invalid, 451 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [12 Valid, 439 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:15:40,734 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 181 states. [2023-11-29 03:15:40,736 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 181 to 162. [2023-11-29 03:15:40,736 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 162 states, 113 states have (on average 1.6902654867256637) internal successors, (191), 161 states have internal predecessors, (191), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:40,737 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 162 states to 162 states and 191 transitions. [2023-11-29 03:15:40,737 INFO L78 Accepts]: Start accepts. Automaton has 162 states and 191 transitions. Word has length 19 [2023-11-29 03:15:40,737 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:40,737 INFO L495 AbstractCegarLoop]: Abstraction has 162 states and 191 transitions. [2023-11-29 03:15:40,737 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 7 states have (on average 2.7142857142857144) internal successors, (19), 7 states have internal predecessors, (19), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:40,737 INFO L276 IsEmpty]: Start isEmpty. Operand 162 states and 191 transitions. [2023-11-29 03:15:40,738 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 21 [2023-11-29 03:15:40,738 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:40,738 INFO L195 NwaCegarLoop]: trace histogram [3, 2, 2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:40,741 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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)] Ended with exit code 0 [2023-11-29 03:15:40,938 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 20 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:40,939 INFO L420 AbstractCegarLoop]: === Iteration 20 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:40,939 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:40,939 INFO L85 PathProgramCache]: Analyzing trace with hash 355701704, now seen corresponding path program 1 times [2023-11-29 03:15:40,939 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:40,940 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [430519645] [2023-11-29 03:15:40,940 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:40,940 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 03:15:40,940 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:40,941 INFO L229 MonitoredProcess]: Starting monitored process 21 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:40,942 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:41,053 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:41,058 INFO L262 TraceCheckSpWp]: Trace formula consists of 157 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 03:15:41,060 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:41,064 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:15:41,071 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:15:41,161 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 03:15:41,171 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 03:15:41,213 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:41,213 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 14 [2023-11-29 03:15:41,220 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2023-11-29 03:15:41,307 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:41,307 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:15:41,412 INFO L134 CoverageAnalysis]: Checked inductivity of 10 backedges. 4 proven. 6 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:41,412 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:41,413 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [430519645] [2023-11-29 03:15:41,413 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [430519645] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:15:41,413 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:15:41,413 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2023-11-29 03:15:41,413 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [872209648] [2023-11-29 03:15:41,413 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:15:41,414 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 11 states [2023-11-29 03:15:41,414 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:41,414 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 11 interpolants. [2023-11-29 03:15:41,415 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=23, Invalid=87, Unknown=0, NotChecked=0, Total=110 [2023-11-29 03:15:41,415 INFO L87 Difference]: Start difference. First operand 162 states and 191 transitions. Second operand has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:42,438 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:42,438 INFO L93 Difference]: Finished difference Result 196 states and 229 transitions. [2023-11-29 03:15:42,438 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 14 states. [2023-11-29 03:15:42,438 INFO L78 Accepts]: Start accepts. Automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 20 [2023-11-29 03:15:42,439 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:42,439 INFO L225 Difference]: With dead ends: 196 [2023-11-29 03:15:42,439 INFO L226 Difference]: Without dead ends: 196 [2023-11-29 03:15:42,440 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 44 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 15 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 29 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=55, Invalid=217, Unknown=0, NotChecked=0, Total=272 [2023-11-29 03:15:42,440 INFO L413 NwaCegarLoop]: 98 mSDtfsCounter, 67 mSDsluCounter, 526 mSDsCounter, 0 mSdLazyCounter, 408 mSolverCounterSat, 9 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 67 SdHoareTripleChecker+Valid, 624 SdHoareTripleChecker+Invalid, 417 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 9 IncrementalHoareTripleChecker+Valid, 408 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.8s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:42,440 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [67 Valid, 624 Invalid, 417 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [9 Valid, 408 Invalid, 0 Unknown, 0 Unchecked, 0.8s Time] [2023-11-29 03:15:42,441 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 196 states. [2023-11-29 03:15:42,443 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 196 to 168. [2023-11-29 03:15:42,443 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 168 states, 119 states have (on average 1.6554621848739495) internal successors, (197), 167 states have internal predecessors, (197), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:42,443 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 168 states to 168 states and 197 transitions. [2023-11-29 03:15:42,443 INFO L78 Accepts]: Start accepts. Automaton has 168 states and 197 transitions. Word has length 20 [2023-11-29 03:15:42,444 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:42,444 INFO L495 AbstractCegarLoop]: Abstraction has 168 states and 197 transitions. [2023-11-29 03:15:42,444 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 11 states, 11 states have (on average 2.090909090909091) internal successors, (23), 11 states have internal predecessors, (23), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:42,444 INFO L276 IsEmpty]: Start isEmpty. Operand 168 states and 197 transitions. [2023-11-29 03:15:42,444 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 03:15:42,444 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:42,445 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:42,447 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:42,645 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 21 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:42,645 INFO L420 AbstractCegarLoop]: === Iteration 21 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:42,645 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:42,646 INFO L85 PathProgramCache]: Analyzing trace with hash -1867182894, now seen corresponding path program 2 times [2023-11-29 03:15:42,646 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:42,646 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [109617641] [2023-11-29 03:15:42,646 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST1 [2023-11-29 03:15:42,646 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 03:15:42,646 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:42,647 INFO L229 MonitoredProcess]: Starting monitored process 22 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:42,648 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:42,775 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST1 issued 2 check-sat command(s) [2023-11-29 03:15:42,776 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:15:42,781 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 24 conjunts are in the unsatisfiable core [2023-11-29 03:15:42,783 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:42,787 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 7 [2023-11-29 03:15:42,809 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:15:42,861 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 31 treesize of output 24 [2023-11-29 03:15:42,893 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:42,894 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 46 treesize of output 18 [2023-11-29 03:15:42,929 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 11 [2023-11-29 03:15:42,965 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:42,965 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:15:43,025 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 0 proven. 24 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:43,025 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:43,025 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [109617641] [2023-11-29 03:15:43,025 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [109617641] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:15:43,025 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:15:43,026 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [10, 9] total 11 [2023-11-29 03:15:43,026 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [805059485] [2023-11-29 03:15:43,026 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:15:43,026 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 03:15:43,026 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:43,027 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 03:15:43,027 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:15:43,027 INFO L87 Difference]: Start difference. First operand 168 states and 197 transitions. Second operand has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:44,688 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:44,688 INFO L93 Difference]: Finished difference Result 283 states and 327 transitions. [2023-11-29 03:15:44,689 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 03:15:44,689 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 03:15:44,689 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:44,690 INFO L225 Difference]: With dead ends: 283 [2023-11-29 03:15:44,690 INFO L226 Difference]: Without dead ends: 283 [2023-11-29 03:15:44,690 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 63 GetRequests, 40 SyntacticMatches, 0 SemanticMatches, 23 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 102 ImplicationChecksByTransitivity, 0.3s TimeCoverageRelationStatistics Valid=97, Invalid=503, Unknown=0, NotChecked=0, Total=600 [2023-11-29 03:15:44,691 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 262 mSDsluCounter, 346 mSDsCounter, 0 mSdLazyCounter, 1110 mSolverCounterSat, 20 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 262 SdHoareTripleChecker+Valid, 411 SdHoareTripleChecker+Invalid, 1130 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 20 IncrementalHoareTripleChecker+Valid, 1110 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:44,691 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [262 Valid, 411 Invalid, 1130 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [20 Valid, 1110 Invalid, 0 Unknown, 0 Unchecked, 1.4s Time] [2023-11-29 03:15:44,692 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 283 states. [2023-11-29 03:15:44,695 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 283 to 192. [2023-11-29 03:15:44,696 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 192 states, 143 states have (on average 1.6433566433566433) internal successors, (235), 191 states have internal predecessors, (235), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:44,697 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 192 states to 192 states and 235 transitions. [2023-11-29 03:15:44,697 INFO L78 Accepts]: Start accepts. Automaton has 192 states and 235 transitions. Word has length 26 [2023-11-29 03:15:44,697 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:44,697 INFO L495 AbstractCegarLoop]: Abstraction has 192 states and 235 transitions. [2023-11-29 03:15:44,697 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 11 states have (on average 2.6363636363636362) internal successors, (29), 12 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:44,697 INFO L276 IsEmpty]: Start isEmpty. Operand 192 states and 235 transitions. [2023-11-29 03:15:44,698 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 27 [2023-11-29 03:15:44,698 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:44,698 INFO L195 NwaCegarLoop]: trace histogram [4, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:44,702 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:44,898 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 22 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:44,899 INFO L420 AbstractCegarLoop]: === Iteration 22 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:44,899 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:44,899 INFO L85 PathProgramCache]: Analyzing trace with hash -1867182893, now seen corresponding path program 1 times [2023-11-29 03:15:44,899 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:44,899 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [569007564] [2023-11-29 03:15:44,899 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:44,900 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 03:15:44,900 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:44,900 INFO L229 MonitoredProcess]: Starting monitored process 23 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:44,902 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:45,056 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:45,062 INFO L262 TraceCheckSpWp]: Trace formula consists of 206 conjuncts, 33 conjunts are in the unsatisfiable core [2023-11-29 03:15:45,064 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:45,113 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:15:45,121 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:15:45,229 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 03:15:45,239 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 20 [2023-11-29 03:15:45,287 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:45,287 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 14 [2023-11-29 03:15:45,294 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2023-11-29 03:15:45,364 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 7 [2023-11-29 03:15:45,443 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:45,443 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:15:45,744 INFO L134 CoverageAnalysis]: Checked inductivity of 24 backedges. 3 proven. 21 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:45,744 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:45,744 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [569007564] [2023-11-29 03:15:45,745 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [569007564] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:15:45,745 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:15:45,745 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 19 [2023-11-29 03:15:45,745 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [274902636] [2023-11-29 03:15:45,745 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:15:45,745 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 19 states [2023-11-29 03:15:45,745 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:45,746 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 19 interpolants. [2023-11-29 03:15:45,746 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=49, Invalid=293, Unknown=0, NotChecked=0, Total=342 [2023-11-29 03:15:45,746 INFO L87 Difference]: Start difference. First operand 192 states and 235 transitions. Second operand has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:47,213 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:47,214 INFO L93 Difference]: Finished difference Result 280 states and 331 transitions. [2023-11-29 03:15:47,214 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:15:47,215 INFO L78 Accepts]: Start accepts. Automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 26 [2023-11-29 03:15:47,215 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:47,216 INFO L225 Difference]: With dead ends: 280 [2023-11-29 03:15:47,216 INFO L226 Difference]: Without dead ends: 280 [2023-11-29 03:15:47,216 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 55 GetRequests, 33 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 81 ImplicationChecksByTransitivity, 0.5s TimeCoverageRelationStatistics Valid=79, Invalid=473, Unknown=0, NotChecked=0, Total=552 [2023-11-29 03:15:47,217 INFO L413 NwaCegarLoop]: 116 mSDtfsCounter, 231 mSDsluCounter, 754 mSDsCounter, 0 mSdLazyCounter, 753 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 231 SdHoareTripleChecker+Valid, 870 SdHoareTripleChecker+Invalid, 760 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 753 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 1.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:47,217 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [231 Valid, 870 Invalid, 760 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 753 Invalid, 0 Unknown, 0 Unchecked, 1.3s Time] [2023-11-29 03:15:47,218 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 280 states. [2023-11-29 03:15:47,220 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 280 to 193. [2023-11-29 03:15:47,220 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 144 states have (on average 1.6388888888888888) internal successors, (236), 192 states have internal predecessors, (236), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:47,221 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 236 transitions. [2023-11-29 03:15:47,221 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 236 transitions. Word has length 26 [2023-11-29 03:15:47,221 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:47,221 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 236 transitions. [2023-11-29 03:15:47,221 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 19 states, 19 states have (on average 2.4210526315789473) internal successors, (46), 19 states have internal predecessors, (46), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:47,221 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 236 transitions. [2023-11-29 03:15:47,222 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 28 [2023-11-29 03:15:47,222 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:47,222 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:47,225 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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)] Ended with exit code 0 [2023-11-29 03:15:47,422 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 23 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:47,422 INFO L420 AbstractCegarLoop]: === Iteration 23 === Targeting ULTIMATE.startErr44REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:47,423 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:47,423 INFO L85 PathProgramCache]: Analyzing trace with hash -2048095845, now seen corresponding path program 1 times [2023-11-29 03:15:47,423 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:47,423 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [20770222] [2023-11-29 03:15:47,423 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:47,423 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 03:15:47,424 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:47,424 INFO L229 MonitoredProcess]: Starting monitored process 24 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:47,425 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:47,543 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:47,548 INFO L262 TraceCheckSpWp]: Trace formula consists of 208 conjuncts, 14 conjunts are in the unsatisfiable core [2023-11-29 03:15:47,549 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:47,699 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 03:15:47,699 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:15:47,800 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 18 trivial. 0 not checked. [2023-11-29 03:15:47,801 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:47,801 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [20770222] [2023-11-29 03:15:47,801 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [20770222] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:15:47,801 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:15:47,801 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [4, 4] total 7 [2023-11-29 03:15:47,801 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1030735825] [2023-11-29 03:15:47,801 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:15:47,801 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 7 states [2023-11-29 03:15:47,802 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:47,802 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 7 interpolants. [2023-11-29 03:15:47,802 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:15:47,802 INFO L87 Difference]: Start difference. First operand 193 states and 236 transitions. Second operand has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:48,311 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:48,311 INFO L93 Difference]: Finished difference Result 261 states and 309 transitions. [2023-11-29 03:15:48,312 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:15:48,312 INFO L78 Accepts]: Start accepts. Automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 27 [2023-11-29 03:15:48,312 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:48,314 INFO L225 Difference]: With dead ends: 261 [2023-11-29 03:15:48,314 INFO L226 Difference]: Without dead ends: 261 [2023-11-29 03:15:48,314 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 52 GetRequests, 47 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 5 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:15:48,314 INFO L413 NwaCegarLoop]: 93 mSDtfsCounter, 211 mSDsluCounter, 290 mSDsCounter, 0 mSdLazyCounter, 245 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 211 SdHoareTripleChecker+Valid, 383 SdHoareTripleChecker+Invalid, 247 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 245 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:48,315 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [211 Valid, 383 Invalid, 247 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 245 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:15:48,315 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 261 states. [2023-11-29 03:15:48,317 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 261 to 195. [2023-11-29 03:15:48,318 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 146 states have (on average 1.6369863013698631) internal successors, (239), 194 states have internal predecessors, (239), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:48,318 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 239 transitions. [2023-11-29 03:15:48,319 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 239 transitions. Word has length 27 [2023-11-29 03:15:48,319 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:48,319 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 239 transitions. [2023-11-29 03:15:48,319 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 7 states, 7 states have (on average 4.428571428571429) internal successors, (31), 7 states have internal predecessors, (31), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:48,319 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 239 transitions. [2023-11-29 03:15:48,319 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 03:15:48,319 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:48,320 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:48,322 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:15:48,520 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 24 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:48,520 INFO L420 AbstractCegarLoop]: === Iteration 24 === Targeting ULTIMATE.startErr47REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:48,520 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:48,520 INFO L85 PathProgramCache]: Analyzing trace with hash 933543381, now seen corresponding path program 1 times [2023-11-29 03:15:48,521 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:48,521 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [508560515] [2023-11-29 03:15:48,521 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:48,521 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 03:15:48,521 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:48,522 INFO L229 MonitoredProcess]: Starting monitored process 25 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:48,523 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:48,661 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:48,665 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:15:48,666 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:48,672 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 03:15:48,679 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 03:15:48,680 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:48,680 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:48,680 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [508560515] [2023-11-29 03:15:48,680 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [508560515] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:48,680 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:48,680 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:15:48,680 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [395592875] [2023-11-29 03:15:48,680 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:48,681 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:15:48,681 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:48,681 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:15:48,681 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:15:48,682 INFO L87 Difference]: Start difference. First operand 195 states and 239 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:48,929 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:48,929 INFO L93 Difference]: Finished difference Result 199 states and 243 transitions. [2023-11-29 03:15:48,929 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:15:48,930 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 03:15:48,930 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:48,931 INFO L225 Difference]: With dead ends: 199 [2023-11-29 03:15:48,931 INFO L226 Difference]: Without dead ends: 199 [2023-11-29 03:15:48,931 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:15:48,932 INFO L413 NwaCegarLoop]: 94 mSDtfsCounter, 9 mSDsluCounter, 47 mSDsCounter, 0 mSdLazyCounter, 96 mSolverCounterSat, 2 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 9 SdHoareTripleChecker+Valid, 141 SdHoareTripleChecker+Invalid, 98 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 2 IncrementalHoareTripleChecker+Valid, 96 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:48,932 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [9 Valid, 141 Invalid, 98 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [2 Valid, 96 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:15:48,932 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 199 states. [2023-11-29 03:15:48,935 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 199 to 195. [2023-11-29 03:15:48,935 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 195 states, 148 states have (on average 1.6283783783783783) internal successors, (241), 194 states have internal predecessors, (241), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:48,936 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 195 states to 195 states and 241 transitions. [2023-11-29 03:15:48,936 INFO L78 Accepts]: Start accepts. Automaton has 195 states and 241 transitions. Word has length 28 [2023-11-29 03:15:48,936 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:48,936 INFO L495 AbstractCegarLoop]: Abstraction has 195 states and 241 transitions. [2023-11-29 03:15:48,936 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:48,936 INFO L276 IsEmpty]: Start isEmpty. Operand 195 states and 241 transitions. [2023-11-29 03:15:48,937 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 03:15:48,937 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:48,937 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:48,940 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:49,137 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 25 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:49,138 INFO L420 AbstractCegarLoop]: === Iteration 25 === Targeting ULTIMATE.startErr46REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:49,138 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:49,138 INFO L85 PathProgramCache]: Analyzing trace with hash 933543380, now seen corresponding path program 1 times [2023-11-29 03:15:49,138 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:49,138 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [2066714408] [2023-11-29 03:15:49,138 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:49,139 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 03:15:49,139 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:49,142 INFO L229 MonitoredProcess]: Starting monitored process 26 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:49,143 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:49,256 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:49,261 INFO L262 TraceCheckSpWp]: Trace formula consists of 219 conjuncts, 3 conjunts are in the unsatisfiable core [2023-11-29 03:15:49,262 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:49,266 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 7 [2023-11-29 03:15:49,269 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 03:15:49,270 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:15:49,270 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:49,270 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [2066714408] [2023-11-29 03:15:49,270 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [2066714408] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:15:49,270 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:15:49,270 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [2] imperfect sequences [] total 2 [2023-11-29 03:15:49,270 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [450139658] [2023-11-29 03:15:49,270 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:15:49,270 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:15:49,270 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:49,271 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:15:49,271 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:15:49,271 INFO L87 Difference]: Start difference. First operand 195 states and 241 transitions. Second operand has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:49,462 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:49,462 INFO L93 Difference]: Finished difference Result 210 states and 256 transitions. [2023-11-29 03:15:49,462 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:15:49,462 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 03:15:49,462 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:49,463 INFO L225 Difference]: With dead ends: 210 [2023-11-29 03:15:49,463 INFO L226 Difference]: Without dead ends: 210 [2023-11-29 03:15:49,464 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 27 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:15:49,464 INFO L413 NwaCegarLoop]: 103 mSDtfsCounter, 18 mSDsluCounter, 57 mSDsCounter, 0 mSdLazyCounter, 91 mSolverCounterSat, 5 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.2s Time, 0 mProtectedPredicate, 0 mProtectedAction, 18 SdHoareTripleChecker+Valid, 160 SdHoareTripleChecker+Invalid, 96 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 5 IncrementalHoareTripleChecker+Valid, 91 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.2s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:49,464 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [18 Valid, 160 Invalid, 96 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [5 Valid, 91 Invalid, 0 Unknown, 0 Unchecked, 0.2s Time] [2023-11-29 03:15:49,465 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 210 states. [2023-11-29 03:15:49,466 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 210 to 193. [2023-11-29 03:15:49,467 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 193 states, 148 states have (on average 1.6081081081081081) internal successors, (238), 192 states have internal predecessors, (238), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:49,467 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 193 states to 193 states and 238 transitions. [2023-11-29 03:15:49,467 INFO L78 Accepts]: Start accepts. Automaton has 193 states and 238 transitions. Word has length 28 [2023-11-29 03:15:49,467 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:49,468 INFO L495 AbstractCegarLoop]: Abstraction has 193 states and 238 transitions. [2023-11-29 03:15:49,468 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 2 states have (on average 8.5) internal successors, (17), 3 states have internal predecessors, (17), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:49,468 INFO L276 IsEmpty]: Start isEmpty. Operand 193 states and 238 transitions. [2023-11-29 03:15:49,468 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 03:15:49,468 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:49,468 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:49,471 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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)] Ended with exit code 0 [2023-11-29 03:15:49,668 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 26 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:49,669 INFO L420 AbstractCegarLoop]: === Iteration 26 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:49,669 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:49,669 INFO L85 PathProgramCache]: Analyzing trace with hash 482123244, now seen corresponding path program 1 times [2023-11-29 03:15:49,669 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:49,669 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1454512767] [2023-11-29 03:15:49,669 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:49,669 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 03:15:49,669 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:49,670 INFO L229 MonitoredProcess]: Starting monitored process 27 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:49,671 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:49,774 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:49,777 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 12 conjunts are in the unsatisfiable core [2023-11-29 03:15:49,778 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:49,949 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:49,949 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:15:50,392 INFO L349 Elim1Store]: treesize reduction 4, result has 63.6 percent of original size [2023-11-29 03:15:50,392 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 30 treesize of output 25 [2023-11-29 03:15:50,401 INFO L349 Elim1Store]: treesize reduction 10, result has 9.1 percent of original size [2023-11-29 03:15:50,401 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 03:15:50,447 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 4 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:50,447 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:15:50,447 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1454512767] [2023-11-29 03:15:50,447 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1454512767] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:15:50,447 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:15:50,447 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [7, 7] total 8 [2023-11-29 03:15:50,447 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [862015016] [2023-11-29 03:15:50,448 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:15:50,448 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 8 states [2023-11-29 03:15:50,448 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:15:50,448 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 8 interpolants. [2023-11-29 03:15:50,448 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=15, Invalid=41, Unknown=0, NotChecked=0, Total=56 [2023-11-29 03:15:50,449 INFO L87 Difference]: Start difference. First operand 193 states and 238 transitions. Second operand has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:51,266 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:15:51,266 INFO L93 Difference]: Finished difference Result 231 states and 283 transitions. [2023-11-29 03:15:51,266 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 11 states. [2023-11-29 03:15:51,267 INFO L78 Accepts]: Start accepts. Automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 03:15:51,267 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:15:51,268 INFO L225 Difference]: With dead ends: 231 [2023-11-29 03:15:51,268 INFO L226 Difference]: Without dead ends: 231 [2023-11-29 03:15:51,268 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 60 GetRequests, 49 SyntacticMatches, 0 SemanticMatches, 11 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 8 ImplicationChecksByTransitivity, 0.2s TimeCoverageRelationStatistics Valid=48, Invalid=108, Unknown=0, NotChecked=0, Total=156 [2023-11-29 03:15:51,269 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 99 mSDsluCounter, 271 mSDsCounter, 0 mSdLazyCounter, 294 mSolverCounterSat, 29 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 99 SdHoareTripleChecker+Valid, 362 SdHoareTripleChecker+Invalid, 323 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 29 IncrementalHoareTripleChecker+Valid, 294 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:15:51,269 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [99 Valid, 362 Invalid, 323 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [29 Valid, 294 Invalid, 0 Unknown, 0 Unchecked, 0.7s Time] [2023-11-29 03:15:51,270 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 231 states. [2023-11-29 03:15:51,272 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 231 to 210. [2023-11-29 03:15:51,273 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 210 states, 165 states have (on average 1.5696969696969696) internal successors, (259), 209 states have internal predecessors, (259), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:51,273 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 210 states to 210 states and 259 transitions. [2023-11-29 03:15:51,273 INFO L78 Accepts]: Start accepts. Automaton has 210 states and 259 transitions. Word has length 28 [2023-11-29 03:15:51,273 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:15:51,273 INFO L495 AbstractCegarLoop]: Abstraction has 210 states and 259 transitions. [2023-11-29 03:15:51,273 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 8 states, 8 states have (on average 3.75) internal successors, (30), 8 states have internal predecessors, (30), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:15:51,273 INFO L276 IsEmpty]: Start isEmpty. Operand 210 states and 259 transitions. [2023-11-29 03:15:51,274 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 03:15:51,274 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:15:51,274 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:15:51,277 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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)] Ended with exit code 0 [2023-11-29 03:15:51,474 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 27 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:51,475 INFO L420 AbstractCegarLoop]: === Iteration 27 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:15:51,475 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:15:51,475 INFO L85 PathProgramCache]: Analyzing trace with hash -732476368, now seen corresponding path program 1 times [2023-11-29 03:15:51,475 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:15:51,476 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1776652277] [2023-11-29 03:15:51,476 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:15:51,476 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 03:15:51,476 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:15:51,477 INFO L229 MonitoredProcess]: Starting monitored process 28 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:51,477 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:15:51,594 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:15:51,598 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 18 conjunts are in the unsatisfiable core [2023-11-29 03:15:51,600 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:15:51,602 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 7 [2023-11-29 03:15:51,716 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:15:51,716 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:15:51,765 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 19 treesize of output 1 [2023-11-29 03:15:51,878 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:15:51,879 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 03:15:51,955 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:15:51,956 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 44 treesize of output 43 [2023-11-29 03:15:52,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 15 [2023-11-29 03:15:52,095 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:15:52,095 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:15:52,169 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_842 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_842) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (_ bv1 1)))) is different from false [2023-11-29 03:15:56,244 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_842 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_841))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) v_ArrVal_842)) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:15:56,262 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_841 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_842 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_841))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_842))) |c_ULTIMATE.start_main_~root~0#1.base|) (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:15:56,274 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:56,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 48 treesize of output 39 [2023-11-29 03:15:56,297 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:56,297 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 310 treesize of output 267 [2023-11-29 03:15:56,310 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 207 treesize of output 191 [2023-11-29 03:15:56,330 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:15:56,330 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 191 treesize of output 175 [2023-11-29 03:16:31,455 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:16:31,455 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:16:31,455 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1776652277] [2023-11-29 03:16:31,456 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1776652277] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:16:31,456 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:16:31,456 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 19 [2023-11-29 03:16:31,456 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [888524927] [2023-11-29 03:16:31,456 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:16:31,456 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 03:16:31,456 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:16:31,457 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 03:16:31,457 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=86, Invalid=224, Unknown=8, NotChecked=102, Total=420 [2023-11-29 03:16:31,458 INFO L87 Difference]: Start difference. First operand 210 states and 259 transitions. Second operand has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:16:38,945 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:16:38,945 INFO L93 Difference]: Finished difference Result 346 states and 435 transitions. [2023-11-29 03:16:38,946 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:16:38,946 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 03:16:38,946 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:16:38,948 INFO L225 Difference]: With dead ends: 346 [2023-11-29 03:16:38,948 INFO L226 Difference]: Without dead ends: 346 [2023-11-29 03:16:38,949 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 62 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 25 ConstructedPredicates, 3 IntricatePredicates, 0 DeprecatedPredicates, 129 ImplicationChecksByTransitivity, 41.3s TimeCoverageRelationStatistics Valid=169, Invalid=386, Unknown=9, NotChecked=138, Total=702 [2023-11-29 03:16:38,949 INFO L413 NwaCegarLoop]: 65 mSDtfsCounter, 562 mSDsluCounter, 408 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 76 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.8s Time, 0 mProtectedPredicate, 0 mProtectedAction, 562 SdHoareTripleChecker+Valid, 473 SdHoareTripleChecker+Invalid, 1799 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 76 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 835 IncrementalHoareTripleChecker+Unchecked, 3.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:16:38,950 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [562 Valid, 473 Invalid, 1799 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [76 Valid, 888 Invalid, 0 Unknown, 835 Unchecked, 3.1s Time] [2023-11-29 03:16:38,951 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 346 states. [2023-11-29 03:16:38,954 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 346 to 241. [2023-11-29 03:16:38,954 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 241 states, 196 states have (on average 1.596938775510204) internal successors, (313), 240 states have internal predecessors, (313), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:16:38,955 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 241 states to 241 states and 313 transitions. [2023-11-29 03:16:38,955 INFO L78 Accepts]: Start accepts. Automaton has 241 states and 313 transitions. Word has length 28 [2023-11-29 03:16:38,955 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:16:38,955 INFO L495 AbstractCegarLoop]: Abstraction has 241 states and 313 transitions. [2023-11-29 03:16:38,955 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:16:38,955 INFO L276 IsEmpty]: Start isEmpty. Operand 241 states and 313 transitions. [2023-11-29 03:16:38,955 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 03:16:38,955 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:16:38,955 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:16:38,958 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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)] Ended with exit code 0 [2023-11-29 03:16:39,156 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 28 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:16:39,156 INFO L420 AbstractCegarLoop]: === Iteration 28 === Targeting ULTIMATE.startErr5REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:16:39,156 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:16:39,156 INFO L85 PathProgramCache]: Analyzing trace with hash -732476367, now seen corresponding path program 1 times [2023-11-29 03:16:39,157 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:16:39,157 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1342030469] [2023-11-29 03:16:39,157 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:16:39,157 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 03:16:39,157 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:16:39,158 INFO L229 MonitoredProcess]: Starting monitored process 29 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:16:39,159 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:16:39,295 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:16:39,300 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 25 conjunts are in the unsatisfiable core [2023-11-29 03:16:39,302 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:16:39,306 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 7 [2023-11-29 03:16:39,510 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 03:16:39,531 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:16:39,531 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:16:39,584 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:16:39,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:16:39,758 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:16:39,758 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:16:39,766 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:16:39,869 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:16:39,869 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:16:39,878 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:16:40,069 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 13 [2023-11-29 03:16:40,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:16:40,105 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:16:40,105 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:16:40,495 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_885 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_885) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0) (_ bv4 32)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_884) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0)))) (forall ((v_ArrVal_885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_885) |c_ULTIMATE.start_main_~root~0#1.base|) .cse0))) (bvule .cse1 (bvadd .cse1 (_ bv4 32))))))) is different from false [2023-11-29 03:16:40,542 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_885) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_885 (Array (_ BitVec 32) (_ BitVec 32)))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_885) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)) (select |c_#length| (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_884) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)))))) is different from false [2023-11-29 03:16:40,587 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|)) (.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_882) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_883) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_885) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (bvule .cse0 (bvadd (_ bv4 32) .cse0)))) (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse4 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_883))) (let ((.cse3 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_882) .cse3 v_ArrVal_885) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse4 .cse3 v_ArrVal_884) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)))))))) is different from false [2023-11-29 03:16:40,687 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse4 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse4)) (.cse2 (bvadd (_ bv4 32) |c_ULTIMATE.start_main_~root~0#1.offset|))) (and (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_884 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_883))) (let ((.cse1 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) .cse4))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_882) .cse1 v_ArrVal_885) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)) (select |c_#length| (select (select (store .cse3 .cse1 v_ArrVal_884) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2)))))) (forall ((v_ArrVal_882 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_883 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_885 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_882) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_883) |c_ULTIMATE.start_main_~n~0#1.base|) .cse4) v_ArrVal_885) |c_ULTIMATE.start_main_~root~0#1.base|) .cse2))) (bvule .cse5 (bvadd (_ bv4 32) .cse5))))))) is different from false [2023-11-29 03:16:40,715 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:40,715 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 87 treesize of output 78 [2023-11-29 03:16:40,733 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:40,733 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 67 treesize of output 58 [2023-11-29 03:16:40,740 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 98 treesize of output 80 [2023-11-29 03:16:40,772 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:40,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 266 treesize of output 235 [2023-11-29 03:16:40,789 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 86 treesize of output 78 [2023-11-29 03:16:40,796 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 112 treesize of output 88 [2023-11-29 03:16:40,811 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 62 treesize of output 54 [2023-11-29 03:16:40,972 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:40,972 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 89 treesize of output 90 [2023-11-29 03:16:40,991 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:40,992 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 79 treesize of output 60 [2023-11-29 03:16:40,997 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:16:40,998 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:16:41,004 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:16:41,005 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 56 [2023-11-29 03:16:41,010 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:16:41,015 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:16:41,015 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 12 [2023-11-29 03:16:41,414 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 7 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:16:41,415 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:16:41,415 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1342030469] [2023-11-29 03:16:41,415 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1342030469] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:16:41,415 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:16:41,415 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [9, 10] total 19 [2023-11-29 03:16:41,415 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1087492458] [2023-11-29 03:16:41,415 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:16:41,415 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 21 states [2023-11-29 03:16:41,415 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:16:41,416 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 21 interpolants. [2023-11-29 03:16:41,416 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=59, Invalid=225, Unknown=4, NotChecked=132, Total=420 [2023-11-29 03:16:41,416 INFO L87 Difference]: Start difference. First operand 241 states and 313 transitions. Second operand has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:16:46,066 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:16:46,067 INFO L93 Difference]: Finished difference Result 356 states and 438 transitions. [2023-11-29 03:16:46,067 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 17 states. [2023-11-29 03:16:46,068 INFO L78 Accepts]: Start accepts. Automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 03:16:46,068 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:16:46,069 INFO L225 Difference]: With dead ends: 356 [2023-11-29 03:16:46,069 INFO L226 Difference]: Without dead ends: 356 [2023-11-29 03:16:46,070 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 68 GetRequests, 35 SyntacticMatches, 2 SemanticMatches, 31 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 130 ImplicationChecksByTransitivity, 1.8s TimeCoverageRelationStatistics Valid=205, Invalid=619, Unknown=4, NotChecked=228, Total=1056 [2023-11-29 03:16:46,070 INFO L413 NwaCegarLoop]: 79 mSDtfsCounter, 543 mSDsluCounter, 532 mSDsCounter, 0 mSdLazyCounter, 1186 mSolverCounterSat, 74 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 543 SdHoareTripleChecker+Valid, 611 SdHoareTripleChecker+Invalid, 2401 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 74 IncrementalHoareTripleChecker+Valid, 1186 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1141 IncrementalHoareTripleChecker+Unchecked, 3.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:16:46,070 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [543 Valid, 611 Invalid, 2401 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [74 Valid, 1186 Invalid, 0 Unknown, 1141 Unchecked, 3.7s Time] [2023-11-29 03:16:46,071 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 356 states. [2023-11-29 03:16:46,074 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 356 to 258. [2023-11-29 03:16:46,074 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 258 states, 218 states have (on average 1.536697247706422) internal successors, (335), 257 states have internal predecessors, (335), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:16:46,075 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 258 states to 258 states and 335 transitions. [2023-11-29 03:16:46,075 INFO L78 Accepts]: Start accepts. Automaton has 258 states and 335 transitions. Word has length 28 [2023-11-29 03:16:46,075 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:16:46,075 INFO L495 AbstractCegarLoop]: Abstraction has 258 states and 335 transitions. [2023-11-29 03:16:46,075 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 21 states, 20 states have (on average 2.8) internal successors, (56), 20 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:16:46,075 INFO L276 IsEmpty]: Start isEmpty. Operand 258 states and 335 transitions. [2023-11-29 03:16:46,076 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 29 [2023-11-29 03:16:46,076 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:16:46,076 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:16:46,078 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:16:46,276 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 29 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:16:46,276 INFO L420 AbstractCegarLoop]: === Iteration 29 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:16:46,277 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:16:46,277 INFO L85 PathProgramCache]: Analyzing trace with hash -732482196, now seen corresponding path program 1 times [2023-11-29 03:16:46,277 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:16:46,277 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1663478031] [2023-11-29 03:16:46,277 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:16:46,277 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 03:16:46,278 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:16:46,278 INFO L229 MonitoredProcess]: Starting monitored process 30 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:16:46,279 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:16:46,417 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:16:46,422 INFO L262 TraceCheckSpWp]: Trace formula consists of 166 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 03:16:46,424 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:16:46,427 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 7 [2023-11-29 03:16:46,441 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 03:16:46,444 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 03:16:46,747 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:16:46,748 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:16:46,817 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:16:46,818 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-29 03:16:46,831 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:16:46,835 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-29 03:16:46,992 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:16:46,993 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 53 [2023-11-29 03:16:47,011 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 11 [2023-11-29 03:16:47,118 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:16:47,118 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 53 [2023-11-29 03:16:47,129 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 11 [2023-11-29 03:16:47,289 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:16:47,289 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:16:47,402 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_929) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_928 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_928) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) is different from false [2023-11-29 03:16:47,423 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))))) (and (forall ((v_ArrVal_929 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_929) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_928 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_928) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) is different from false [2023-11-29 03:16:47,451 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_927) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_929) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_926))) (store .cse1 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_928)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) is different from false [2023-11-29 03:16:47,482 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (and (forall ((v_ArrVal_927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_927) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_926) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_929) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_926))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_928)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))))) is different from false [2023-11-29 03:16:47,523 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |c_ULTIMATE.start_main_#t~malloc20#1.base|)))) (and (forall ((|ULTIMATE.start_main_#t~malloc20#1.offset| (_ BitVec 32)) (v_ArrVal_927 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_929 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |ULTIMATE.start_main_#t~malloc20#1.offset|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_927) (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_926) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_929) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_928 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_926 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_926))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_928)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))))) is different from false [2023-11-29 03:16:54,022 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:54,023 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2023-11-29 03:16:54,037 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2023-11-29 03:16:54,046 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 9 treesize of output 7 [2023-11-29 03:16:54,051 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2023-11-29 03:16:54,067 INFO L349 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2023-11-29 03:16:54,068 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 1 [2023-11-29 03:16:54,075 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 3 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:16:54,075 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:16:54,075 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1663478031] [2023-11-29 03:16:54,075 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1663478031] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:16:54,075 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:16:54,075 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [12, 14] total 23 [2023-11-29 03:16:54,075 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1919876331] [2023-11-29 03:16:54,075 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:16:54,076 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 03:16:54,076 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:16:54,076 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 03:16:54,077 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=271, Unknown=12, NotChecked=190, Total=552 [2023-11-29 03:16:54,077 INFO L87 Difference]: Start difference. First operand 258 states and 335 transitions. Second operand has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:16:57,735 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:16:57,735 INFO L93 Difference]: Finished difference Result 355 states and 457 transitions. [2023-11-29 03:16:57,736 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 16 states. [2023-11-29 03:16:57,736 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 28 [2023-11-29 03:16:57,736 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:16:57,738 INFO L225 Difference]: With dead ends: 355 [2023-11-29 03:16:57,738 INFO L226 Difference]: Without dead ends: 355 [2023-11-29 03:16:57,738 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 66 GetRequests, 32 SyntacticMatches, 2 SemanticMatches, 32 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 135 ImplicationChecksByTransitivity, 7.2s TimeCoverageRelationStatistics Valid=219, Invalid=600, Unknown=13, NotChecked=290, Total=1122 [2023-11-29 03:16:57,739 INFO L413 NwaCegarLoop]: 72 mSDtfsCounter, 217 mSDsluCounter, 610 mSDsCounter, 0 mSdLazyCounter, 888 mSolverCounterSat, 34 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 2.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 217 SdHoareTripleChecker+Valid, 682 SdHoareTripleChecker+Invalid, 1880 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 34 IncrementalHoareTripleChecker+Valid, 888 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 958 IncrementalHoareTripleChecker+Unchecked, 2.9s IncrementalHoareTripleChecker+Time [2023-11-29 03:16:57,739 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [217 Valid, 682 Invalid, 1880 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [34 Valid, 888 Invalid, 0 Unknown, 958 Unchecked, 2.9s Time] [2023-11-29 03:16:57,740 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 355 states. [2023-11-29 03:16:57,744 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 355 to 282. [2023-11-29 03:16:57,744 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 282 states, 242 states have (on average 1.5165289256198347) internal successors, (367), 281 states have internal predecessors, (367), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:16:57,745 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 282 states to 282 states and 367 transitions. [2023-11-29 03:16:57,745 INFO L78 Accepts]: Start accepts. Automaton has 282 states and 367 transitions. Word has length 28 [2023-11-29 03:16:57,745 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:16:57,745 INFO L495 AbstractCegarLoop]: Abstraction has 282 states and 367 transitions. [2023-11-29 03:16:57,745 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 24 states have (on average 2.0) internal successors, (48), 23 states have internal predecessors, (48), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:16:57,745 INFO L276 IsEmpty]: Start isEmpty. Operand 282 states and 367 transitions. [2023-11-29 03:16:57,746 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 03:16:57,746 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:16:57,746 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:16:57,748 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:16:57,946 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 30 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:16:57,946 INFO L420 AbstractCegarLoop]: === Iteration 30 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:16:57,947 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:16:57,947 INFO L85 PathProgramCache]: Analyzing trace with hash 2140809433, now seen corresponding path program 1 times [2023-11-29 03:16:57,947 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:16:57,947 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1831155981] [2023-11-29 03:16:57,947 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:16:57,947 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 03:16:57,947 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:16:57,948 INFO L229 MonitoredProcess]: Starting monitored process 31 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:16:57,949 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:16:58,091 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:16:58,096 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 03:16:58,099 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:16:58,102 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 7 [2023-11-29 03:16:58,216 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:16:58,217 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:16:58,275 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:16:58,285 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:16:58,446 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:16:58,447 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-11-29 03:16:58,454 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:16:58,557 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:16:58,557 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 52 treesize of output 47 [2023-11-29 03:16:58,570 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:16:58,736 INFO L349 Elim1Store]: treesize reduction 36, result has 46.3 percent of original size [2023-11-29 03:16:58,736 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 27 treesize of output 41 [2023-11-29 03:16:58,846 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 35 treesize of output 19 [2023-11-29 03:16:58,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:16:59,107 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:16:59,107 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:16:59,496 WARN L854 $PredicateComparison]: unable to prove that (and (or (forall ((v_ArrVal_985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_985) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_986) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1))))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_986) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) .cse0) (_ bv1 1))) (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))) is different from false [2023-11-29 03:16:59,527 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_986) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1)))) (forall ((v_ArrVal_985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_985) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_986) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) .cse1) (_ bv1 1)))))))) is different from false [2023-11-29 03:16:59,569 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_984 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_983))) (let ((.cse0 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (or (forall ((v_ArrVal_985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_984) .cse0 v_ArrVal_985) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_987 (_ BitVec 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) (select (select (store .cse1 .cse0 v_ArrVal_986) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1)) (_ bv0 1))))))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse2 (select (select (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_983))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_986)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) .cse2) (_ bv1 1)) (_ bv0 1)) (= .cse2 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))) is different from false [2023-11-29 03:16:59,610 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_984 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_983))) (let ((.cse1 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (or (forall ((v_ArrVal_985 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_984) .cse1 v_ArrVal_985) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_987 (_ BitVec 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) (select (select (store .cse2 .cse1 v_ArrVal_986) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1)) (_ bv0 1))))))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_983 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_986 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse3 (select (select (let ((.cse4 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_983))) (store .cse4 (select (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_986)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= .cse3 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) .cse3) (_ bv1 1)) (_ bv0 1))))))) is different from false [2023-11-29 03:16:59,630 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:59,630 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 56 [2023-11-29 03:16:59,651 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:59,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 291 treesize of output 258 [2023-11-29 03:16:59,666 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 171 treesize of output 163 [2023-11-29 03:16:59,690 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:16:59,690 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 163 treesize of output 151 [2023-11-29 03:17:12,425 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:17:12,425 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 80 treesize of output 64 [2023-11-29 03:17:12,438 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:17:12,438 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 28 treesize of output 29 [2023-11-29 03:17:12,463 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:17:12,463 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 333 treesize of output 304 [2023-11-29 03:17:12,500 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:17:12,500 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 230 treesize of output 224 [2023-11-29 03:17:12,512 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 199 treesize of output 191 [2023-11-29 03:17:12,551 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:17:12,551 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 154 treesize of output 149 [2023-11-29 03:17:12,567 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 52 treesize of output 50 [2023-11-29 03:17:12,578 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 68 [2023-11-29 03:17:25,605 WARN L293 SmtUtils]: Spent 5.50s on a formula simplification that was a NOOP. DAG size: 649 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:17:42,085 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse19 (= |c_ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~root~0#1.base|)) (.cse39 (store |c_#valid| |c_ULTIMATE.start_main_~n~0#1.base| (_ bv1 1))) (.cse1 (store |c_#valid| |c_ULTIMATE.start_main_~root~0#1.base| (_ bv1 1)))) (let ((.cse4 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_107) (_ bv1 1)))))) (.cse154 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse213 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse213 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse213 v_arrayElimCell_107) (_ bv1 1))))))) (.cse152 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|)))) (.cse3 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse212 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse212 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse212 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)))))) (.cse72 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse211 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse211 v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse211 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)))))) (.cse22 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_107) (_ bv1 1)))))) (.cse70 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse30 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse210 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse210 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse210 v_arrayElimCell_113) (_ bv1 1))))))) (.cse45 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)))) (.cse13 (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~root~0#1.offset|)) (.cse40 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_112) (_ bv1 1))))) (.cse5 (not .cse19)) (.cse35 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv0 1)))) (.cse26 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)))) (.cse83 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse209 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse209 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse209 v_arrayElimCell_112) (_ bv1 1)) (_ bv0 1)))))) (.cse24 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~root~0#1.base|))))) (let ((.cse25 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse208 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse208 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse208 v_arrayElimCell_107) (_ bv1 1))))))))))) (.cse48 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_109) (_ bv1 1))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|)))) (.cse50 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) |v_ULTIMATE.start_main_#t~malloc14#1.base_20|) (_ bv1 1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|)))))) (.cse52 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse207 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse207 v_arrayElimCell_113) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse207 |v_ULTIMATE.start_main_#t~malloc14#1.base_20|) (_ bv1 1))) (= (bvadd (select .cse207 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)))))))) (.cse55 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse206 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse206 |v_ULTIMATE.start_main_#t~malloc14#1.base_20|) (_ bv1 1))) (= (bvadd (select .cse206 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|)))))) (.cse56 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse205 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse205 v_arrayElimCell_113) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse205 |v_ULTIMATE.start_main_#t~malloc14#1.base_20|) (_ bv1 1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|)))))) (.cse62 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_107) (_ bv1 1)))))))) (.cse49 (or .cse83 .cse24)) (.cse51 (or .cse19 .cse26 .cse24)) (.cse54 (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_113) (_ bv1 1))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|))) .cse5 .cse35)) (.cse36 (forall ((v_arrayElimCell_113 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_113) (_ bv1 1)))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|)))) (.cse37 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse204 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse204 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse204 v_arrayElimCell_112) (_ bv1 1))))))) (.cse41 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse203 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse203 v_arrayElimCell_113) (_ bv1 1))) (= (bvadd (select .cse203 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)))))) (.cse44 (or .cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse202 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse202 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (bvadd (select .cse202 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1))))))) (.cse31 (or .cse19 .cse26)) (.cse32 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_112) (_ bv1 1)) (_ bv0 1)))) (.cse33 (forall ((v_arrayElimCell_113 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_113) (_ bv1 1)))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|)))) (.cse58 (or .cse40 .cse5 .cse35)) (.cse9 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1))))) (.cse17 (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse201 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse201 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse201 v_arrayElimCell_107) (_ bv1 1)))))))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|)))) (.cse15 (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_109) (_ bv1 1)))))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|)))) (.cse10 (or .cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse200 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse200 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse200 v_arrayElimCell_107) (_ bv1 1)))))))) (.cse68 (or .cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse199 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse199 v_arrayElimCell_107) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse199 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse81 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse198 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse198 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (bvadd (select .cse198 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse198 v_arrayElimCell_110) (_ bv1 1))))))) (.cse75 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse197 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse197 v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse197 v_arrayElimCell_113) (_ bv1 1)))))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|)))))) (.cse76 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1)))))) (.cse27 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse196 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse196 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse196 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)))))) (.cse28 (or .cse83 .cse13)) (.cse84 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse195 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse195 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse195 v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse195 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)))))) (.cse64 (or .cse83 .cse24 .cse13)) (.cse80 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse194 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse194 v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse194 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1))))) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|)))))) (.cse77 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse193 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse193 v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse193 v_arrayElimCell_113) (_ bv1 1))))))))) (.cse65 (or .cse26 .cse24)) (.cse59 (or .cse35 .cse45)) (.cse87 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse192 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse192 v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse192 v_arrayElimCell_113) (_ bv1 1))) (= (bvadd (select .cse192 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|)))))) (.cse60 (or .cse30 .cse24)) (.cse88 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse191 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse191 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse191 v_arrayElimCell_105) (_ bv1 1))))))))))) (.cse89 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse190 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse190 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse190 v_arrayElimCell_109) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse190 v_arrayElimCell_105) (_ bv1 1)))))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|))))) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|)))))) (.cse105 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_105) (_ bv1 1))))))))) (.cse110 (or .cse70 .cse35)) (.cse111 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse189 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse189 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse189 v_arrayElimCell_109) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse189 v_arrayElimCell_105) (_ bv1 1)))))))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|)))))))) (.cse112 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_105) (_ bv1 1))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|)))))) (.cse113 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse188 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse188 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse188 v_arrayElimCell_109) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse188 v_arrayElimCell_105) (_ bv1 1))))))))))))))) (.cse114 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse187 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse187 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse187 v_arrayElimCell_109) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse187 v_arrayElimCell_105) (_ bv1 1))))))))))) (.cse129 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse186 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse186 v_arrayElimCell_109) (_ bv1 1))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|) (= (bvadd (select .cse186 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1)))))) (.cse119 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse185 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse185 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse185 v_arrayElimCell_105) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse185 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))))) (.cse120 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse184 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse184 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse184 v_arrayElimCell_105) (_ bv1 1))))))))))) (.cse121 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse183 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse183 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse183 v_arrayElimCell_109) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse183 v_arrayElimCell_105) (_ bv1 1)))))))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|)))))))) (.cse91 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse182 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse182 v_arrayElimCell_109) (_ bv1 1))) (= (bvadd (select .cse182 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|)))))) (.cse134 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse181 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse181 v_arrayElimCell_107) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse181 v_arrayElimCell_109) (_ bv1 1))) (= (bvadd (select .cse181 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|)))))) (.cse108 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (forall ((v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse180 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse180 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse180 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse180 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse109 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_108 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse179 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse179 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse179 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse122 (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse178 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse178 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse178 v_arrayElimCell_107) (_ bv1 1)))))) .cse22)) (.cse127 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse177 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse177 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse177 v_arrayElimCell_105) (_ bv1 1))))))))))) (.cse130 (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|))) .cse35)) (.cse131 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse176 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse176 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse176 v_arrayElimCell_109) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse176 v_arrayElimCell_105) (_ bv1 1))))))))))))) (.cse104 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_108 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse175 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse175 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse175 v_arrayElimCell_108) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse175 v_arrayElimCell_105) (_ bv1 1)))))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))))))) (.cse126 (or .cse72 .cse35)) (.cse128 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse174 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse174 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse174 v_arrayElimCell_105) (_ bv1 1)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|)))))) (.cse136 (or .cse24 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse173 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse173 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse173 v_arrayElimCell_107) (_ bv1 1)))))))) (.cse138 (or .cse24 .cse22)) (.cse132 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_105) (_ bv1 1))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|)))))) (.cse133 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse172 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse172 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse172 v_arrayElimCell_109) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse172 v_arrayElimCell_105) (_ bv1 1))))))))))))) (.cse2 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse171 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse171 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse171 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)))))))) (.cse92 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse170 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= (_ bv0 1) (bvadd (select .cse170 v_arrayElimCell_105) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse170 v_arrayElimCell_107) (_ bv1 1))))))) (.cse95 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse169 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse169 v_arrayElimCell_105) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse169 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse169 v_arrayElimCell_107) (_ bv1 1))))))))))) (.cse93 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse168 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse168 v_arrayElimCell_107) (_ bv1 1))))) (= (_ bv0 1) (bvadd (select .cse168 v_arrayElimCell_105) (_ bv1 1))) (= (bvadd (select .cse168 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse7 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32))) (or (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse167 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse167 v_arrayElimCell_107) (_ bv1 1))))) (= (bvadd (select .cse167 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)))))))) (.cse100 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse166 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse166 v_arrayElimCell_105) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse166 v_arrayElimCell_107) (_ bv1 1))))))))) (.cse12 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_107) (_ bv1 1)))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse21 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse165 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse165 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse165 v_arrayElimCell_107) (_ bv1 1))))))))) (.cse99 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse164 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse164 v_arrayElimCell_105) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse164 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse164 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse96 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse163 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse163 v_arrayElimCell_105) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse163 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse163 v_arrayElimCell_107) (_ bv1 1))))))))) (.cse101 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse162 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse162 v_arrayElimCell_105) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse162 v_arrayElimCell_107) (_ bv1 1))))))) (.cse18 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse161 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse161 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse161 v_arrayElimCell_107) (_ bv1 1)))))))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse137 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_105) (_ bv1 1))))))))) (.cse123 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse160 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse160 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse160 v_arrayElimCell_107) (_ bv1 1))))))) (.cse115 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_108 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse159 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse159 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse159 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse159 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse118 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse158 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse158 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse158 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse116 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse157 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse157 v_arrayElimCell_107) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse157 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (bvadd (select .cse157 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1)))))))) (.cse117 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse156 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse156 v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse156 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1)))))) (.cse139 (or (and .cse3 .cse22) .cse24)) (.cse125 (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse155 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse155 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse155 v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|)))) .cse22)) (.cse148 (or .cse5 .cse35 .cse152)) (.cse149 (or .cse154 .cse24)) (.cse66 (or .cse19 .cse4)) (.cse150 (or .cse19 .cse24 .cse4))) (and (or (let ((.cse14 (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse23 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse23 v_arrayElimCell_109) (_ bv1 1))) (= (bvadd (select .cse23 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|))))) (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse0 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse0 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse0 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))))))) .cse2 .cse3 .cse4 (or (and (or .cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse6 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse6 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse6 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse6 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)))))) .cse7 (or (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse8 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse8 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse8 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) .cse9) .cse5) .cse10 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse11 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse11 v_arrayElimCell_107) (_ bv1 1))))) (= (bvadd (select .cse11 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse11 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) .cse12) .cse13) (or .cse5 (and .cse14 .cse15)) (or .cse5 (and (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse16 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse16 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse16 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse16 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|))) .cse17 .cse14 .cse15)) .cse18 (or .cse19 (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse20 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse20 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse20 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse20 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))))) .cse21)) .cse22)) .cse24) (or .cse19 .cse24 (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_107) (_ bv1 1)))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|))) .cse25)) (or .cse24 (and (or .cse26 .cse5) .cse27 .cse28 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse29 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse29 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse29 v_arrayElimCell_113) (_ bv1 1))) (= (bvadd (select .cse29 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))) .cse30 .cse31 (or .cse5 (and (or .cse32 .cse13) .cse33 (forall ((v_arrayElimCell_113 (_ BitVec 32))) (or (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse34 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse34 v_arrayElimCell_113) (_ bv1 1))) (= (bvadd (select .cse34 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))))))))) (or .cse35 (and (or (and .cse36 (or .cse37 .cse13) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse38 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse38 v_arrayElimCell_113) (_ bv1 1))) (= (bvadd (select .cse38 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse38 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)))))) (or .cse40 .cse13) .cse41 (forall ((v_arrayElimCell_113 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse42 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse42 v_arrayElimCell_113) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse42 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)))))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|)))) .cse5) (or .cse5 .cse37 .cse13) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse43 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse43 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (bvadd (select .cse43 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse43 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)))))) .cse44 .cse45 (or .cse19 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse46 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse46 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse46 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))))))) (or .cse35 (and (or .cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse47 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse47 v_arrayElimCell_107) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse47 v_arrayElimCell_109) (_ bv1 1))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|))))) (or .cse48 .cse5))) (or (and .cse49 .cse50 .cse51 .cse52 (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse53 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse53 v_arrayElimCell_113) (_ bv1 1))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|) (= (_ bv0 1) (bvadd (select .cse53 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)))))) .cse35) .cse54 .cse55 .cse56 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) |v_ULTIMATE.start_main_#t~malloc14#1.base_20|) (_ bv1 1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))))) (forall ((v_arrayElimCell_113 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse57 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (= (_ bv0 1) (bvadd (select .cse57 v_arrayElimCell_113) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse57 |v_ULTIMATE.start_main_#t~malloc14#1.base_20|) (_ bv1 1)))))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|))) .cse58 .cse59 .cse60) .cse13) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|))) .cse35) (or (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse61 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse61 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse61 v_arrayElimCell_107) (_ bv1 1)))))))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|))))) .cse62) .cse19 .cse24) (or (and .cse25 .cse62) .cse19 .cse24) (or .cse24 .cse62) (or .cse48 .cse5 .cse35) (or .cse19 (and .cse50 .cse52 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((v_arrayElimCell_113 (_ BitVec 32))) (or (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse63 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse63 v_arrayElimCell_113) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse63 |v_ULTIMATE.start_main_#t~malloc14#1.base_20|) (_ bv1 1)))))))))) .cse64 .cse55 .cse56 .cse65 .cse59 .cse60)) (or .cse24 (and .cse66 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse67 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse67 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse67 v_arrayElimCell_107) (_ bv1 1)))))))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))) .cse62)) (or (and .cse68 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse69 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse69 v_arrayElimCell_107) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse69 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse69 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)))))))) .cse70 (or (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (forall ((v_arrayElimCell_108 (_ BitVec 32))) (or (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse71 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse71 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse71 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse71 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)))))))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) .cse72 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse73 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse73 v_arrayElimCell_107) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse73 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))))))) .cse13) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse74 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse74 v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse74 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))))) .cse35) (or (and .cse49 .cse51 (or .cse19 (and .cse75 .cse76 .cse77 .cse65)) (or .cse35 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse78 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse78 v_arrayElimCell_113) (_ bv1 1))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|) (= (_ bv0 1) (bvadd (select .cse78 v_arrayElimCell_110) (_ bv1 1))))))) (forall ((v_arrayElimCell_113 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse79 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (= (bvadd (select .cse79 v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse79 v_arrayElimCell_113) (_ bv1 1)))))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1))))) .cse80 .cse54 (or .cse35 (and .cse81 (or .cse5 (and (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse82 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse82 v_arrayElimCell_113) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse82 v_arrayElimCell_110) (_ bv1 1)))))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|))) .cse36 .cse40 .cse37 .cse41)) .cse44)) (or .cse24 (and .cse27 .cse83 .cse84 .cse30 .cse31 (or (and .cse32 .cse33 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (or (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse85 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse85 v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse85 v_arrayElimCell_113) (_ bv1 1))))))))) .cse5))) (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse86 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse86 v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse86 v_arrayElimCell_113) (_ bv1 1)))))))) .cse58 .cse59 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1)) (v_arrayElimCell_110 (_ BitVec 32))) (= (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1))))) .cse87 .cse60) .cse13) (or (let ((.cse124 (or .cse19 .cse22)) (.cse107 (or .cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)))))) (.cse90 (or .cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_109) (_ bv1 1))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (and .cse88 .cse89 (or (and .cse90 .cse91) .cse35) (or .cse24 (let ((.cse94 (forall ((v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse103 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse103 v_arrayElimCell_105) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse103 v_arrayElimCell_109) (_ bv1 1)))))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|))))) (and .cse2 .cse92 .cse93 .cse7 (or .cse5 (and .cse94 .cse15)) .cse95 (or (and .cse21 .cse96) .cse19) (or .cse5 (and .cse9 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32))) (or (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse97 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse97 v_arrayElimCell_105) (_ bv1 1))) (= (bvadd (select .cse97 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1))))))))) .cse4 (or (and .cse17 .cse94 (forall ((v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse98 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse98 v_arrayElimCell_105) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse98 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse98 v_arrayElimCell_107) (_ bv1 1)))))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|))) .cse15) .cse5) .cse99 .cse10 .cse100 .cse101 .cse18 .cse12 .cse22 (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse102 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse102 v_arrayElimCell_105) (_ bv1 1))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse102 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse102 v_arrayElimCell_107) (_ bv1 1)))))) .cse5)))) .cse104 .cse105 (or .cse35 (and (or .cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse106 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse106 v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse106 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)))))) .cse107 .cse108 .cse109)) .cse110 .cse111 .cse112 .cse113 .cse114 (or (and .cse68 .cse115 .cse72 .cse70 .cse116 .cse117 .cse118) .cse35) .cse119 .cse120 .cse121 (or .cse122 .cse19 .cse24) (or (and .cse123 .cse124 .cse4) .cse24) (or (and .cse123 .cse124) .cse24) (or .cse19 .cse125 .cse24) (or (and .cse107 .cse109) .cse35) .cse126 .cse127 .cse128 (or .cse129 .cse19 .cse35) .cse130 .cse131 .cse132 .cse133 (or (and .cse90 .cse91 .cse134 (or .cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse135 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse135 v_arrayElimCell_107) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse135 v_arrayElimCell_109) (_ bv1 1))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) .cse35) .cse136 .cse137 .cse138 .cse139)) .cse13) (or .cse19 (and (or .cse81 .cse35) .cse75 .cse76 (or (and .cse27 .cse28 .cse84 .cse30 .cse26) .cse24) .cse64 .cse80 .cse77 .cse65 .cse59 .cse87 .cse60)) (or (let ((.cse142 (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse146 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse146 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse146 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1))))) .cse35))) (and .cse88 .cse89 .cse105 .cse110 .cse111 .cse112 .cse113 .cse114 (or .cse129 .cse35) .cse119 .cse120 .cse121 (or .cse24 (and .cse123 .cse4 .cse22)) (or .cse35 (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (= (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1))))) .cse91 .cse134 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse140 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse140 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse140 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse141 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse141 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse141 v_arrayElimCell_105) (_ bv1 1)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))))) (or (and .cse104 .cse142 (or (and .cse108 .cse109) .cse35) .cse136 .cse138) .cse13) (or .cse122 .cse24) (or .cse35 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse143 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse143 v_arrayElimCell_109) (_ bv1 1))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|) (= (bvadd (select .cse143 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1)))))) .cse127 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse144 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse144 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse144 v_arrayElimCell_105) (_ bv1 1)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))))) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_108 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse145 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse145 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse145 v_arrayElimCell_108) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse145 v_arrayElimCell_105) (_ bv1 1)))))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))))))) .cse136 .cse138) .cse13) .cse130 .cse131 (or (and .cse104 .cse142 .cse126 .cse128 .cse136 .cse138) .cse13) .cse132 .cse133 (or (and .cse2 .cse92 .cse95 (or .cse13 (and .cse93 .cse7 .cse100 .cse12)) .cse21 .cse4 .cse99 .cse96 .cse101 .cse18 .cse22) .cse24) .cse137 (or .cse24 (and .cse123 .cse22)) (or (and (or (and .cse115 .cse72 .cse118) .cse13) .cse70 .cse116 .cse117) .cse35) .cse139 (or .cse125 .cse24))) .cse19) (or .cse13 (and (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse147 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse147 v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse147 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|)))) .cse35) .cse148 (or .cse24 .cse4) .cse149)) (or .cse13 (and .cse150 .cse148 (or (and (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse151 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse151 v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse151 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|)))) .cse5) (or .cse5 .cse152)) .cse35) .cse149)) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|))) .cse35) (or .cse24 (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse153 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse153 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse153 v_arrayElimCell_107) (_ bv1 1)))))))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|))) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|))) .cse66)) (or (and .cse150 (or .cse154 .cse19 .cse24)) .cse13))))) is different from true [2023-11-29 03:18:23,930 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:18:23,930 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:18:23,930 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1831155981] [2023-11-29 03:18:23,930 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1831155981] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:18:23,930 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:18:23,930 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 21 [2023-11-29 03:18:23,931 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1131772415] [2023-11-29 03:18:23,931 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:18:23,931 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 23 states [2023-11-29 03:18:23,931 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:18:23,931 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 23 interpolants. [2023-11-29 03:18:23,932 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=75, Invalid=246, Unknown=5, NotChecked=180, Total=506 [2023-11-29 03:18:23,932 INFO L87 Difference]: Start difference. First operand 282 states and 367 transitions. Second operand has 23 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:18:24,972 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec, FloatRoundingMode], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:18:28,023 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.76s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:18:32,294 WARN L876 $PredicateComparison]: unable to prove that (let ((.cse61 (select |c_#valid| |c_ULTIMATE.start_main_~root~0#1.base|)) (.cse19 (= |c_ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~root~0#1.base|)) (.cse39 (store |c_#valid| |c_ULTIMATE.start_main_~n~0#1.base| (_ bv1 1))) (.cse1 (store |c_#valid| |c_ULTIMATE.start_main_~root~0#1.base| (_ bv1 1)))) (let ((.cse4 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_107) (_ bv1 1)))))) (.cse155 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse214 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse214 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse214 v_arrayElimCell_107) (_ bv1 1))))))) (.cse153 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|)))) (.cse3 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse213 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse213 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse213 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)))))) (.cse73 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse212 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse212 v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse212 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)))))) (.cse22 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_107) (_ bv1 1)))))) (.cse71 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse30 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse211 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse211 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse211 v_arrayElimCell_113) (_ bv1 1))))))) (.cse45 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)))) (.cse13 (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~root~0#1.offset|)) (.cse40 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_112) (_ bv1 1))))) (.cse5 (not .cse19)) (.cse35 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv0 1)))) (.cse26 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)))) (.cse84 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse210 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse210 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse210 v_arrayElimCell_112) (_ bv1 1)) (_ bv0 1)))))) (.cse24 (not (= (_ bv0 1) .cse61)))) (let ((.cse25 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse209 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse209 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse209 v_arrayElimCell_107) (_ bv1 1))))))))))) (.cse48 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_109) (_ bv1 1))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|)))) (.cse50 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) |v_ULTIMATE.start_main_#t~malloc14#1.base_20|) (_ bv1 1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|)))))) (.cse52 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse208 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse208 v_arrayElimCell_113) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse208 |v_ULTIMATE.start_main_#t~malloc14#1.base_20|) (_ bv1 1))) (= (bvadd (select .cse208 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)))))))) (.cse55 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse207 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse207 |v_ULTIMATE.start_main_#t~malloc14#1.base_20|) (_ bv1 1))) (= (bvadd (select .cse207 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|)))))) (.cse56 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse206 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse206 v_arrayElimCell_113) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse206 |v_ULTIMATE.start_main_#t~malloc14#1.base_20|) (_ bv1 1)))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|)))))) (.cse63 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_107) (_ bv1 1)))))))) (.cse49 (or .cse84 .cse24)) (.cse51 (or .cse19 .cse26 .cse24)) (.cse54 (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_113) (_ bv1 1))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|))) .cse5 .cse35)) (.cse36 (forall ((v_arrayElimCell_113 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_113) (_ bv1 1)))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|)))) (.cse37 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse205 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse205 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse205 v_arrayElimCell_112) (_ bv1 1))))))) (.cse41 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse204 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse204 v_arrayElimCell_113) (_ bv1 1))) (= (bvadd (select .cse204 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)))))) (.cse44 (or .cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse203 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse203 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (bvadd (select .cse203 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1))))))) (.cse31 (or .cse19 .cse26)) (.cse32 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_112 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_112) (_ bv1 1)) (_ bv0 1)))) (.cse33 (forall ((v_arrayElimCell_113 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_113) (_ bv1 1)))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|)))) (.cse58 (or .cse40 .cse5 .cse35)) (.cse9 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1))))) (.cse17 (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse202 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse202 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse202 v_arrayElimCell_107) (_ bv1 1)))))))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|)))) (.cse15 (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_109) (_ bv1 1)))))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|)))) (.cse10 (or .cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse201 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse201 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse201 v_arrayElimCell_107) (_ bv1 1)))))))) (.cse69 (or .cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse200 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse200 v_arrayElimCell_107) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse200 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse82 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse199 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse199 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (bvadd (select .cse199 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse199 v_arrayElimCell_110) (_ bv1 1))))))) (.cse76 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse198 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse198 v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse198 v_arrayElimCell_113) (_ bv1 1)))))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|)))))) (.cse77 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1)))))) (.cse27 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse197 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse197 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse197 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)))))) (.cse28 (or .cse84 .cse13)) (.cse85 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse196 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse196 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse196 v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse196 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)))))) (.cse65 (or .cse84 .cse24 .cse13)) (.cse81 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse195 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse195 v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse195 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1))))) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|)))))) (.cse78 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse194 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse194 v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse194 v_arrayElimCell_113) (_ bv1 1))))))))) (.cse66 (or .cse26 .cse24)) (.cse59 (or .cse35 .cse45)) (.cse88 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse193 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse193 v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse193 v_arrayElimCell_113) (_ bv1 1))) (= (bvadd (select .cse193 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|)))))) (.cse60 (or .cse30 .cse24)) (.cse89 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse192 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse192 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse192 v_arrayElimCell_105) (_ bv1 1))))))))))) (.cse90 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse191 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse191 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse191 v_arrayElimCell_109) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse191 v_arrayElimCell_105) (_ bv1 1)))))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|))))) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|)))))) (.cse106 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_105) (_ bv1 1))))))))) (.cse111 (or .cse71 .cse35)) (.cse112 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse190 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse190 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse190 v_arrayElimCell_109) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse190 v_arrayElimCell_105) (_ bv1 1)))))))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|)))))))) (.cse113 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_105) (_ bv1 1))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|)))))) (.cse114 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse189 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse189 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse189 v_arrayElimCell_109) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse189 v_arrayElimCell_105) (_ bv1 1))))))))))))))) (.cse115 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse188 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse188 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse188 v_arrayElimCell_109) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse188 v_arrayElimCell_105) (_ bv1 1))))))))))) (.cse130 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse187 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse187 v_arrayElimCell_109) (_ bv1 1))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|) (= (bvadd (select .cse187 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1)))))) (.cse120 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse186 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse186 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse186 v_arrayElimCell_105) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse186 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)))))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))))) (.cse121 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse185 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse185 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse185 v_arrayElimCell_105) (_ bv1 1))))))))))) (.cse122 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse184 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse184 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse184 v_arrayElimCell_109) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse184 v_arrayElimCell_105) (_ bv1 1)))))))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|)))))))) (.cse92 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse183 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse183 v_arrayElimCell_109) (_ bv1 1))) (= (bvadd (select .cse183 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|)))))) (.cse135 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse182 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse182 v_arrayElimCell_107) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse182 v_arrayElimCell_109) (_ bv1 1))) (= (bvadd (select .cse182 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|)))))) (.cse109 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (forall ((v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse181 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse181 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse181 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse181 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse110 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_108 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse180 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse180 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse180 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse123 (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse179 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse179 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse179 v_arrayElimCell_107) (_ bv1 1)))))) .cse22)) (.cse128 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse178 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse178 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse178 v_arrayElimCell_105) (_ bv1 1))))))))))) (.cse131 (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|))) .cse35)) (.cse132 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse177 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse177 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse177 v_arrayElimCell_109) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse177 v_arrayElimCell_105) (_ bv1 1))))))))))))) (.cse105 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_108 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse176 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse176 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse176 v_arrayElimCell_108) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse176 v_arrayElimCell_105) (_ bv1 1)))))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))))))) (.cse127 (or .cse73 .cse35)) (.cse129 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse175 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse175 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse175 v_arrayElimCell_105) (_ bv1 1)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|)))))) (.cse137 (or .cse24 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse174 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse174 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse174 v_arrayElimCell_107) (_ bv1 1)))))))) (.cse139 (or .cse24 .cse22)) (.cse133 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_105) (_ bv1 1))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|)))))) (.cse134 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse173 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse173 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse173 v_arrayElimCell_109) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse173 v_arrayElimCell_105) (_ bv1 1))))))))))))) (.cse2 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse172 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse172 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse172 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)))))))) (.cse93 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse171 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= (_ bv0 1) (bvadd (select .cse171 v_arrayElimCell_105) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse171 v_arrayElimCell_107) (_ bv1 1))))))) (.cse96 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse170 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse170 v_arrayElimCell_105) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse170 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse170 v_arrayElimCell_107) (_ bv1 1))))))))))) (.cse94 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse169 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse169 v_arrayElimCell_107) (_ bv1 1))))) (= (_ bv0 1) (bvadd (select .cse169 v_arrayElimCell_105) (_ bv1 1))) (= (bvadd (select .cse169 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse7 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32))) (or (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse168 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse168 v_arrayElimCell_107) (_ bv1 1))))) (= (bvadd (select .cse168 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)))))))) (.cse101 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse167 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse167 v_arrayElimCell_105) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse167 v_arrayElimCell_107) (_ bv1 1))))))))) (.cse12 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_107) (_ bv1 1)))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse21 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse166 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse166 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse166 v_arrayElimCell_107) (_ bv1 1))))))))) (.cse100 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse165 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse165 v_arrayElimCell_105) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse165 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse165 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse97 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse164 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse164 v_arrayElimCell_105) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse164 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse164 v_arrayElimCell_107) (_ bv1 1))))))))) (.cse102 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse163 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse163 v_arrayElimCell_105) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse163 v_arrayElimCell_107) (_ bv1 1))))))) (.cse18 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse162 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse162 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse162 v_arrayElimCell_107) (_ bv1 1)))))))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse138 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_105) (_ bv1 1))))))))) (.cse124 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse161 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse161 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse161 v_arrayElimCell_107) (_ bv1 1))))))) (.cse116 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_108 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse160 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse160 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse160 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse160 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (.cse119 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse159 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse159 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse159 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))) (.cse117 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse158 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse158 v_arrayElimCell_107) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse158 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (bvadd (select .cse158 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1)))))))) (.cse118 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse157 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse157 v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse157 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1)))))) (.cse140 (or (and .cse3 .cse22) .cse24)) (.cse126 (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse156 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse156 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse156 v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|)))) .cse22)) (.cse149 (or .cse5 .cse35 .cse153)) (.cse150 (or .cse155 .cse24)) (.cse67 (or .cse19 .cse4)) (.cse151 (or .cse19 .cse24 .cse4))) (and (or (let ((.cse14 (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse23 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse23 v_arrayElimCell_109) (_ bv1 1))) (= (bvadd (select .cse23 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|))))) (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse0 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse0 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse0 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse0 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))))))) .cse2 .cse3 .cse4 (or (and (or .cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse6 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse6 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse6 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse6 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1)))))) .cse7 (or (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse8 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse8 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse8 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) .cse9) .cse5) .cse10 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse11 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse11 v_arrayElimCell_107) (_ bv1 1))))) (= (bvadd (select .cse11 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse11 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) .cse12) .cse13) (or .cse5 (and .cse14 .cse15)) (or .cse5 (and (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse16 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse16 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse16 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse16 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|))) .cse17 .cse14 .cse15)) .cse18 (or .cse19 (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse20 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse20 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse20 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse20 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))))) .cse21)) .cse22)) .cse24) (or .cse19 .cse24 (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_107) (_ bv1 1)))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|))) .cse25)) (or .cse24 (and (or .cse26 .cse5) .cse27 .cse28 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse29 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse29 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse29 v_arrayElimCell_113) (_ bv1 1))) (= (bvadd (select .cse29 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))) .cse30 .cse31 (or .cse5 (and (or .cse32 .cse13) .cse33 (forall ((v_arrayElimCell_113 (_ BitVec 32))) (or (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse34 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse34 v_arrayElimCell_113) (_ bv1 1))) (= (bvadd (select .cse34 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1)) (_ bv0 1))))))))))) (or .cse35 (and (or (and .cse36 (or .cse37 .cse13) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse38 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse38 v_arrayElimCell_113) (_ bv1 1))) (= (bvadd (select .cse38 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse38 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)))))) (or .cse40 .cse13) .cse41 (forall ((v_arrayElimCell_113 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse42 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse42 v_arrayElimCell_113) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse42 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)))))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|)))) .cse5) (or .cse5 .cse37 .cse13) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse43 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse43 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (bvadd (select .cse43 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse43 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)))))) .cse44 .cse45 (or .cse19 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_114 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse46 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse46 v_arrayElimCell_114) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse46 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))))))) (or .cse35 (and (or .cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse47 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse47 v_arrayElimCell_107) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse47 v_arrayElimCell_109) (_ bv1 1))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|))))) (or .cse48 .cse5))) (or (and .cse49 .cse50 .cse51 .cse52 (or (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse53 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse53 v_arrayElimCell_113) (_ bv1 1))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|) (= (_ bv0 1) (bvadd (select .cse53 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)))))) .cse35) .cse54 .cse55 .cse56 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) |v_ULTIMATE.start_main_#t~malloc14#1.base_20|) (_ bv1 1)))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))))) (forall ((v_arrayElimCell_113 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse57 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (= (_ bv0 1) (bvadd (select .cse57 v_arrayElimCell_113) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse57 |v_ULTIMATE.start_main_#t~malloc14#1.base_20|) (_ bv1 1)))))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|))) .cse58 .cse59 .cse60) .cse13) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|))) .cse35) (= (bvadd .cse61 (_ bv1 1)) (_ bv0 1)) (or (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse62 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse62 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse62 v_arrayElimCell_107) (_ bv1 1)))))))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|))))) .cse63) .cse19 .cse24) (or (and .cse25 .cse63) .cse19 .cse24) (or .cse24 .cse63) (or .cse48 .cse5 .cse35) .cse19 (or .cse19 (and .cse50 .cse52 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((v_arrayElimCell_113 (_ BitVec 32))) (or (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse64 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse64 v_arrayElimCell_113) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse64 |v_ULTIMATE.start_main_#t~malloc14#1.base_20|) (_ bv1 1)))))))))) .cse65 .cse55 .cse56 .cse66 .cse59 .cse60)) (or .cse24 (and .cse67 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse68 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse68 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse68 v_arrayElimCell_107) (_ bv1 1)))))))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))) .cse63)) (or (and .cse69 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse70 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse70 v_arrayElimCell_107) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse70 |c_ULTIMATE.start_main_~root~0#1.base|) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse70 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)))))))) .cse71 (or (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (forall ((v_arrayElimCell_108 (_ BitVec 32))) (or (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse72 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse72 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse72 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse72 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)))))))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) .cse73 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse74 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse74 v_arrayElimCell_107) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse74 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))))))) .cse13) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse75 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse75 v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse75 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1))))))) .cse35) (or (and .cse49 .cse51 (or .cse19 (and .cse76 .cse77 .cse78 .cse66)) (or .cse35 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse79 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse79 v_arrayElimCell_113) (_ bv1 1))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|) (= (_ bv0 1) (bvadd (select .cse79 v_arrayElimCell_110) (_ bv1 1))))))) (forall ((v_arrayElimCell_113 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1)) (v_arrayElimCell_110 (_ BitVec 32))) (let ((.cse80 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (= (bvadd (select .cse80 v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse80 v_arrayElimCell_113) (_ bv1 1)))))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|))) (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (= (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1))))) .cse81 .cse54 (or .cse35 (and .cse82 (or .cse5 (and (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse83 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse83 v_arrayElimCell_113) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse83 v_arrayElimCell_110) (_ bv1 1)))))) (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|))) .cse36 .cse40 .cse37 .cse41)) .cse44)) (or .cse24 (and .cse27 .cse84 .cse85 .cse30 .cse31 (or (and .cse32 .cse33 (forall ((v_arrayElimCell_113 (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32))) (or (= v_arrayElimCell_113 |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse86 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse86 v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse86 v_arrayElimCell_113) (_ bv1 1))))))))) .cse5))) (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((v_arrayElimCell_113 (_ BitVec 32)) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_110 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse87 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse87 v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse87 v_arrayElimCell_113) (_ bv1 1)))))))) .cse58 .cse59 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1)) (v_arrayElimCell_110 (_ BitVec 32))) (= (bvadd (select (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_110) (_ bv1 1)) (_ bv0 1))))) .cse88 .cse60) .cse13) (or (let ((.cse125 (or .cse19 .cse22)) (.cse108 (or .cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)))))) (.cse91 (or .cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_109) (_ bv1 1))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) (and .cse89 .cse90 (or (and .cse91 .cse92) .cse35) (or .cse24 (let ((.cse95 (forall ((v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse104 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse104 v_arrayElimCell_105) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse104 v_arrayElimCell_109) (_ bv1 1)))))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|))))) (and .cse2 .cse93 .cse94 .cse7 (or .cse5 (and .cse95 .cse15)) .cse96 (or (and .cse21 .cse97) .cse19) (or .cse5 (and .cse9 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32))) (or (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse98 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse98 v_arrayElimCell_105) (_ bv1 1))) (= (bvadd (select .cse98 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1))))))))) .cse4 (or (and .cse17 .cse95 (forall ((v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse99 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse99 v_arrayElimCell_105) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse99 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse99 v_arrayElimCell_107) (_ bv1 1)))))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|))) .cse15) .cse5) .cse100 .cse10 .cse101 .cse102 .cse18 .cse12 .cse22 (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse103 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse103 v_arrayElimCell_105) (_ bv1 1))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse103 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse103 v_arrayElimCell_107) (_ bv1 1)))))) .cse5)))) .cse105 .cse106 (or .cse35 (and (or .cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse107 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse107 v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse107 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)))))) .cse108 .cse109 .cse110)) .cse111 .cse112 .cse113 .cse114 .cse115 (or (and .cse69 .cse116 .cse73 .cse71 .cse117 .cse118 .cse119) .cse35) .cse120 .cse121 .cse122 (or .cse123 .cse19 .cse24) (or (and .cse124 .cse125 .cse4) .cse24) (or (and .cse124 .cse125) .cse24) (or .cse19 .cse126 .cse24) (or (and .cse108 .cse110) .cse35) .cse127 .cse128 .cse129 (or .cse130 .cse19 .cse35) .cse131 .cse132 .cse133 .cse134 (or (and .cse91 .cse92 .cse135 (or .cse5 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse136 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse136 v_arrayElimCell_107) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse136 v_arrayElimCell_109) (_ bv1 1))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|)))))) .cse35) .cse137 .cse138 .cse139 .cse140)) .cse13) (or .cse19 (and (or .cse82 .cse35) .cse76 .cse77 (or (and .cse27 .cse28 .cse85 .cse30 .cse26) .cse24) .cse65 .cse81 .cse78 .cse66 .cse59 .cse88 .cse60)) .cse13 (or (let ((.cse143 (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse147 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse147 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse147 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1))))) .cse35))) (and .cse89 .cse90 .cse106 .cse111 .cse112 .cse113 .cse114 .cse115 (or .cse130 .cse35) .cse120 .cse121 .cse122 (or .cse24 (and .cse124 .cse4 .cse22)) (or .cse35 (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (= (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1))))) .cse92 .cse135 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse141 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse141 v_arrayElimCell_107) (_ bv1 1))) (= (bvadd (select .cse141 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1))))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse142 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse142 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse142 v_arrayElimCell_105) (_ bv1 1)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))))) (or (and .cse105 .cse143 (or (and .cse109 .cse110) .cse35) .cse137 .cse139) .cse13) (or .cse123 .cse24) (or .cse35 (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32)) (v_arrayElimCell_109 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse144 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (_ bv0 1) (bvadd (select .cse144 v_arrayElimCell_109) (_ bv1 1))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|) (= (bvadd (select .cse144 v_arrayElimCell_105) (_ bv1 1)) (_ bv0 1)))))) .cse128 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse145 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse145 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse145 v_arrayElimCell_105) (_ bv1 1)))))))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))))) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ BitVec 32))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_20| |c_ULTIMATE.start_main_~n~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20|))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_105 (_ BitVec 32))) (or (= v_arrayElimCell_105 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_arrayElimCell_108 (_ BitVec 32))) (or (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse146 (store (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_20| (_ bv1 1)) |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (bvadd (select .cse146 v_arrayElimCell_107) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse146 v_arrayElimCell_108) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse146 v_arrayElimCell_105) (_ bv1 1)))))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|))))))))) .cse137 .cse139) .cse13) .cse131 .cse132 (or (and .cse105 .cse143 .cse127 .cse129 .cse137 .cse139) .cse13) .cse133 .cse134 (or (and .cse2 .cse93 .cse96 (or .cse13 (and .cse94 .cse7 .cse101 .cse12)) .cse21 .cse4 .cse100 .cse97 .cse102 .cse18 .cse22) .cse24) .cse138 (or .cse24 (and .cse124 .cse22)) (or (and (or (and .cse116 .cse73 .cse119) .cse13) .cse71 .cse117 .cse118) .cse35) .cse140 (or .cse126 .cse24))) .cse19) (or .cse13 (and (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse148 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse148 v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse148 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|)))) .cse35) .cse149 (or .cse24 .cse4) .cse150)) (or .cse13 (and .cse151 .cse149 (or (and (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_108 (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (let ((.cse152 (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse152 v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_108 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= (bvadd (select .cse152 v_arrayElimCell_108) (_ bv1 1)) (_ bv0 1)) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|)))) .cse5) (or .cse5 .cse153)) .cse35) .cse150)) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32)) (v_arrayElimCell_107 (_ BitVec 32)) (v_ArrVal_987 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (select (store .cse39 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987) v_arrayElimCell_107) (_ bv1 1))) (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~n~0#1.base|))) .cse35) (or .cse24 (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_17| (_ BitVec 32))) (or (forall ((v_arrayElimCell_109 (_ BitVec 32))) (or (forall ((v_arrayElimCell_107 (_ BitVec 32))) (or (= v_arrayElimCell_107 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (forall ((v_ArrVal_987 (_ BitVec 1))) (let ((.cse154 (store .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| v_ArrVal_987))) (or (= (_ bv0 1) (bvadd (select .cse154 v_arrayElimCell_109) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse154 v_arrayElimCell_107) (_ bv1 1)))))))) (= v_arrayElimCell_109 |v_ULTIMATE.start_main_~#sentinel~0#1.base_17|) (= v_arrayElimCell_109 |c_ULTIMATE.start_main_~root~0#1.base|))) (= |v_ULTIMATE.start_main_~#sentinel~0#1.base_17| |c_ULTIMATE.start_main_~root~0#1.base|))) .cse67)) (or (and .cse151 (or .cse155 .cse19 .cse24)) .cse13))))) is different from true [2023-11-29 03:18:36,869 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:18:46,260 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.08s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:18:49,025 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.66s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:18:56,777 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:19:02,032 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:19:05,802 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.57s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:19:07,029 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:19:13,733 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 03:19:20,295 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:19:24,344 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 [0, 1] [2023-11-29 03:19:28,698 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.03s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:19:30,299 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.26s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:19:33,936 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:19:35,026 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:19:36,679 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:19:38,378 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:19:42,643 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 [0, 1] [2023-11-29 03:19:44,657 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.99s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:19:46,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:19:48,432 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:19:52,522 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.37s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:19:55,757 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:19:57,742 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:20:00,197 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:20:03,796 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:20:05,891 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.60s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:20:06,998 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.09s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:20:11,389 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 03:20:15,427 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 03:20:19,480 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 4.03s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:20:20,944 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.33s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:20:22,210 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:20:24,377 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.54s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:20:26,974 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:20:31,112 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.70s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:20:32,985 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:20:34,419 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:20:36,760 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.31s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:20:38,908 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:20:42,144 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.41s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:20:43,306 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.14s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:20:44,473 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:20:48,523 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 03:20:52,096 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.36s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:20:53,702 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.58s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:20:56,648 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.92s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:21:02,726 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.15s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:21:06,339 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.94s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:21:07,556 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.19s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:21:09,797 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.22s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:21:10,916 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.07s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:21:12,508 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.56s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:21:15,518 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.46s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:21:16,631 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:21:16,631 INFO L93 Difference]: Finished difference Result 548 states and 700 transitions. [2023-11-29 03:21:16,632 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 23 states. [2023-11-29 03:21:16,632 INFO L78 Accepts]: Start accepts. Automaton has has 23 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-29 03:21:16,632 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:21:16,634 INFO L225 Difference]: With dead ends: 548 [2023-11-29 03:21:16,634 INFO L226 Difference]: Without dead ends: 548 [2023-11-29 03:21:16,634 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 76 GetRequests, 37 SyntacticMatches, 5 SemanticMatches, 34 ConstructedPredicates, 6 IntricatePredicates, 0 DeprecatedPredicates, 190 ImplicationChecksByTransitivity, 37.2s TimeCoverageRelationStatistics Valid=214, Invalid=673, Unknown=7, NotChecked=366, Total=1260 [2023-11-29 03:21:16,635 INFO L413 NwaCegarLoop]: 73 mSDtfsCounter, 299 mSDsluCounter, 628 mSDsCounter, 0 mSdLazyCounter, 1542 mSolverCounterSat, 42 mSolverCounterUnsat, 7 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 149.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 299 SdHoareTripleChecker+Valid, 701 SdHoareTripleChecker+Invalid, 3183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 42 IncrementalHoareTripleChecker+Valid, 1542 IncrementalHoareTripleChecker+Invalid, 7 IncrementalHoareTripleChecker+Unknown, 1592 IncrementalHoareTripleChecker+Unchecked, 150.7s IncrementalHoareTripleChecker+Time [2023-11-29 03:21:16,635 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [299 Valid, 701 Invalid, 3183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [42 Valid, 1542 Invalid, 7 Unknown, 1592 Unchecked, 150.7s Time] [2023-11-29 03:21:16,636 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 548 states. [2023-11-29 03:21:16,640 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 548 to 411. [2023-11-29 03:21:16,641 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 411 states, 371 states have (on average 1.4878706199460916) internal successors, (552), 410 states have internal predecessors, (552), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:16,642 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 411 states to 411 states and 552 transitions. [2023-11-29 03:21:16,642 INFO L78 Accepts]: Start accepts. Automaton has 411 states and 552 transitions. Word has length 30 [2023-11-29 03:21:16,642 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:21:16,642 INFO L495 AbstractCegarLoop]: Abstraction has 411 states and 552 transitions. [2023-11-29 03:21:16,642 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 23 states, 22 states have (on average 2.5) internal successors, (55), 22 states have internal predecessors, (55), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:16,642 INFO L276 IsEmpty]: Start isEmpty. Operand 411 states and 552 transitions. [2023-11-29 03:21:16,642 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 03:21:16,642 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:21:16,642 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:21:16,646 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:16,843 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 31 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:16,843 INFO L420 AbstractCegarLoop]: === Iteration 31 === Targeting ULTIMATE.startErr37REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:21:16,843 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:21:16,843 INFO L85 PathProgramCache]: Analyzing trace with hash 2140809434, now seen corresponding path program 1 times [2023-11-29 03:21:16,844 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:21:16,844 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [273600030] [2023-11-29 03:21:16,844 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:21:16,844 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 03:21:16,844 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:21:16,845 INFO L229 MonitoredProcess]: Starting monitored process 32 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:16,846 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:16,993 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:21:16,998 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 03:21:17,001 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:21:17,003 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 7 [2023-11-29 03:21:17,099 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:21:17,100 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:21:17,113 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 5 [2023-11-29 03:21:17,146 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 11 treesize of output 7 [2023-11-29 03:21:17,154 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:21:17,271 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:21:17,272 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:21:17,280 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:21:17,360 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:21:17,360 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 50 treesize of output 45 [2023-11-29 03:21:17,365 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 24 treesize of output 11 [2023-11-29 03:21:17,477 INFO L349 Elim1Store]: treesize reduction 21, result has 44.7 percent of original size [2023-11-29 03:21:17,478 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 18 treesize of output 21 [2023-11-29 03:21:17,558 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 33 treesize of output 17 [2023-11-29 03:21:17,564 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 7 treesize of output 3 [2023-11-29 03:21:17,750 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:21:17,750 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:21:18,805 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_18| (_ BitVec 32)) (v_ArrVal_1043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1044 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_1043) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= .cse0 |v_ULTIMATE.start_main_~#sentinel~0#1.base_18|) (forall ((v_ArrVal_1045 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select (store |c_#length| |v_ULTIMATE.start_main_~#sentinel~0#1.base_18| v_ArrVal_1045) .cse0)))))) (forall ((v_ArrVal_1044 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_18| (_ BitVec 32)) (v_ArrVal_1043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1045 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) .cse1) (select (store |c_#length| |v_ULTIMATE.start_main_~#sentinel~0#1.base_18| v_ArrVal_1045) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_1043) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) (= .cse1 (_ bv0 32))))) (forall ((v_ArrVal_1044 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_1044) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (bvule .cse2 (bvadd (_ bv4 32) .cse2))))) is different from false [2023-11-29 03:21:18,873 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_1044 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse0 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1044) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_18| (_ BitVec 32)) (v_ArrVal_1043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1045 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) .cse0) (select (store |c_#length| |v_ULTIMATE.start_main_~#sentinel~0#1.base_18| v_ArrVal_1045) (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1043) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) (= (_ bv0 32) .cse0)))) (forall ((v_ArrVal_1044 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1044) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (bvule .cse2 (bvadd (_ bv4 32) .cse2)))) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_18| (_ BitVec 32)) (v_ArrVal_1043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1044 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store |c_#memory_$Pointer$#1.base| .cse1 v_ArrVal_1043) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= .cse3 |v_ULTIMATE.start_main_~#sentinel~0#1.base_18|) (forall ((v_ArrVal_1045 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store |c_#memory_$Pointer$#1.offset| .cse1 v_ArrVal_1044) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select (store |c_#length| |v_ULTIMATE.start_main_~#sentinel~0#1.base_18| v_ArrVal_1045) .cse3)))))))) is different from false [2023-11-29 03:21:19,470 WARN L854 $PredicateComparison]: unable to prove that (and (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_18| (_ BitVec 32)) (v_ArrVal_1042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1044 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1042))) (let ((.cse0 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (let ((.cse1 (select (select (store .cse2 .cse0 v_ArrVal_1043) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (forall ((v_ArrVal_1045 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1041) .cse0 v_ArrVal_1044) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (select (store |c_#length| |v_ULTIMATE.start_main_~#sentinel~0#1.base_18| v_ArrVal_1045) .cse1))) (= .cse1 |v_ULTIMATE.start_main_~#sentinel~0#1.base_18|)))))) (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1044 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse3 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1041) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1042) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1044) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (bvule .cse3 (bvadd (_ bv4 32) .cse3)))) (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1044 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse5 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1042))) (let ((.cse6 (select (select .cse5 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (let ((.cse4 (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1041) .cse6 v_ArrVal_1044) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (= .cse4 (_ bv0 32)) (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_18| (_ BitVec 32)) (v_ArrVal_1043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1045 (_ BitVec 32))) (bvule (bvadd (_ bv4 32) .cse4) (select (store |c_#length| |v_ULTIMATE.start_main_~#sentinel~0#1.base_18| v_ArrVal_1045) (select (select (store .cse5 .cse6 v_ArrVal_1043) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))))))) is different from false [2023-11-29 03:21:19,572 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse3 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (and (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1044 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1042))) (let ((.cse2 (select (select .cse1 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (let ((.cse0 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1041) .cse2 v_ArrVal_1044) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (forall ((|v_ULTIMATE.start_main_~#sentinel~0#1.base_18| (_ BitVec 32)) (v_ArrVal_1043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1045 (_ BitVec 32))) (bvule (bvadd .cse0 (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_~#sentinel~0#1.base_18| v_ArrVal_1045) (select (select (store .cse1 .cse2 v_ArrVal_1043) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))) (= .cse0 (_ bv0 32))))))) (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_~#sentinel~0#1.base_18| (_ BitVec 32)) (v_ArrVal_1042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1043 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1044 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse6 (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1042))) (let ((.cse4 (select (select .cse6 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|))) (let ((.cse5 (select (select (store .cse6 .cse4 v_ArrVal_1043) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (or (forall ((v_ArrVal_1045 (_ BitVec 32))) (bvule (bvadd (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1041) .cse4 v_ArrVal_1044) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv4 32)) (select (store |c_#length| |v_ULTIMATE.start_main_~#sentinel~0#1.base_18| v_ArrVal_1045) .cse5))) (= .cse5 |v_ULTIMATE.start_main_~#sentinel~0#1.base_18|)))))) (forall ((v_ArrVal_1041 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1042 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1044 (Array (_ BitVec 32) (_ BitVec 32)))) (let ((.cse7 (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse3 v_ArrVal_1041) (select (select (store |c_#memory_$Pointer$#1.base| .cse3 v_ArrVal_1042) |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1044) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (bvule .cse7 (bvadd .cse7 (_ bv4 32))))))) is different from false [2023-11-29 03:21:19,600 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:21:19,601 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 71 treesize of output 64 [2023-11-29 03:21:19,611 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:21:19,611 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 55 treesize of output 48 [2023-11-29 03:21:19,615 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 80 treesize of output 68 [2023-11-29 03:21:19,644 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:21:19,645 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 128 treesize of output 119 [2023-11-29 03:21:19,665 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 74 treesize of output 66 [2023-11-29 03:21:19,684 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 66 treesize of output 62 [2023-11-29 03:21:19,691 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 92 treesize of output 80 [2023-11-29 03:21:19,834 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:21:19,834 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 76 treesize of output 77 [2023-11-29 03:21:19,852 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:21:19,852 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 105 treesize of output 73 [2023-11-29 03:21:19,856 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:21:19,857 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:21:19,870 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 109 treesize of output 73 [2023-11-29 03:21:19,876 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:21:19,881 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 48 treesize of output 36 [2023-11-29 03:21:19,891 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 26 treesize of output 22 [2023-11-29 03:21:19,943 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:21:19,943 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 113 treesize of output 105 [2023-11-29 03:21:19,957 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:21:19,958 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 1 case distinctions, treesize of input 97 treesize of output 73 [2023-11-29 03:21:19,961 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:21:19,962 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:21:19,965 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 97 treesize of output 69 [2023-11-29 03:21:19,970 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:21:19,973 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 55 treesize of output 39 [2023-11-29 03:21:19,982 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 16 treesize of output 14 [2023-11-29 03:21:24,063 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 0 proven. 4 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:21:24,063 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:21:24,063 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [273600030] [2023-11-29 03:21:24,063 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [273600030] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:21:24,063 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:21:24,063 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 12] total 22 [2023-11-29 03:21:24,064 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1104782469] [2023-11-29 03:21:24,064 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:21:24,064 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 24 states [2023-11-29 03:21:24,064 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:21:24,065 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 24 interpolants. [2023-11-29 03:21:24,065 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=65, Invalid=327, Unknown=4, NotChecked=156, Total=552 [2023-11-29 03:21:24,065 INFO L87 Difference]: Start difference. First operand 411 states and 552 transitions. Second operand has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:34,664 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:21:34,665 INFO L93 Difference]: Finished difference Result 711 states and 918 transitions. [2023-11-29 03:21:34,665 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 28 states. [2023-11-29 03:21:34,665 INFO L78 Accepts]: Start accepts. Automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-29 03:21:34,666 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:21:34,668 INFO L225 Difference]: With dead ends: 711 [2023-11-29 03:21:34,668 INFO L226 Difference]: Without dead ends: 711 [2023-11-29 03:21:34,669 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 82 GetRequests, 36 SyntacticMatches, 2 SemanticMatches, 44 ConstructedPredicates, 4 IntricatePredicates, 0 DeprecatedPredicates, 312 ImplicationChecksByTransitivity, 7.8s TimeCoverageRelationStatistics Valid=336, Invalid=1398, Unknown=4, NotChecked=332, Total=2070 [2023-11-29 03:21:34,669 INFO L413 NwaCegarLoop]: 101 mSDtfsCounter, 452 mSDsluCounter, 801 mSDsCounter, 0 mSdLazyCounter, 1934 mSolverCounterSat, 62 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 7.6s Time, 0 mProtectedPredicate, 0 mProtectedAction, 452 SdHoareTripleChecker+Valid, 902 SdHoareTripleChecker+Invalid, 3489 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 62 IncrementalHoareTripleChecker+Valid, 1934 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 1493 IncrementalHoareTripleChecker+Unchecked, 8.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:21:34,669 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [452 Valid, 902 Invalid, 3489 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [62 Valid, 1934 Invalid, 0 Unknown, 1493 Unchecked, 8.3s Time] [2023-11-29 03:21:34,670 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 711 states. [2023-11-29 03:21:34,677 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 711 to 522. [2023-11-29 03:21:34,678 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 522 states, 482 states have (on average 1.487551867219917) internal successors, (717), 521 states have internal predecessors, (717), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:34,679 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 522 states to 522 states and 717 transitions. [2023-11-29 03:21:34,679 INFO L78 Accepts]: Start accepts. Automaton has 522 states and 717 transitions. Word has length 30 [2023-11-29 03:21:34,679 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:21:34,680 INFO L495 AbstractCegarLoop]: Abstraction has 522 states and 717 transitions. [2023-11-29 03:21:34,680 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 24 states, 23 states have (on average 2.4347826086956523) internal successors, (56), 23 states have internal predecessors, (56), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:34,680 INFO L276 IsEmpty]: Start isEmpty. Operand 522 states and 717 transitions. [2023-11-29 03:21:34,680 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 03:21:34,680 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:21:34,680 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:21:34,685 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:34,881 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 32 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:34,881 INFO L420 AbstractCegarLoop]: === Iteration 32 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:21:34,882 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:21:34,882 INFO L85 PathProgramCache]: Analyzing trace with hash -1153280483, now seen corresponding path program 1 times [2023-11-29 03:21:34,882 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:21:34,882 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [419613216] [2023-11-29 03:21:34,882 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:21:34,882 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 03:21:34,882 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:21:34,883 INFO L229 MonitoredProcess]: Starting monitored process 33 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:34,883 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:35,044 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:21:35,050 INFO L262 TraceCheckSpWp]: Trace formula consists of 200 conjuncts, 29 conjunts are in the unsatisfiable core [2023-11-29 03:21:35,052 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:21:35,055 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 7 [2023-11-29 03:21:35,070 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 03:21:35,075 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 8 treesize of output 1 [2023-11-29 03:21:35,375 INFO L349 Elim1Store]: treesize reduction 6, result has 40.0 percent of original size [2023-11-29 03:21:35,375 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 13 treesize of output 13 [2023-11-29 03:21:35,423 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:21:35,424 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-29 03:21:35,436 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:21:35,439 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 27 treesize of output 11 [2023-11-29 03:21:35,607 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:21:35,608 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 53 [2023-11-29 03:21:35,619 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 11 [2023-11-29 03:21:35,720 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:21:35,721 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 58 treesize of output 53 [2023-11-29 03:21:35,734 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 11 [2023-11-29 03:21:35,956 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:21:35,956 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:21:36,210 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))))) (and (forall ((v_ArrVal_1102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1102) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1103 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1103) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) is different from false [2023-11-29 03:21:36,232 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (and (forall ((v_ArrVal_1100 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1100))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1102)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (forall ((v_ArrVal_1100 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1101 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1103 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1101) (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1103) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) is different from false [2023-11-29 03:21:36,260 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1))) (and (forall ((v_ArrVal_1100 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1101 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1103 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store |c_#memory_$Pointer$#1.offset| .cse0 v_ArrVal_1101) (select (select (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1100) |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1103) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1100 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (store |c_#memory_$Pointer$#1.base| .cse0 v_ArrVal_1100))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1102)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32)))))) is different from false [2023-11-29 03:21:36,307 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse0 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse1 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |c_ULTIMATE.start_main_#t~malloc20#1.base|)))) (and (forall ((|ULTIMATE.start_main_#t~malloc20#1.offset| (_ BitVec 32)) (v_ArrVal_1100 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1101 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1103 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |ULTIMATE.start_main_#t~malloc20#1.offset|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_1101) (select (select (store .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_1100) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1103) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))) (forall ((v_ArrVal_1100 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 32) (select (select (let ((.cse2 (store .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_1100))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1102)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))) is different from false [2023-11-29 03:21:36,368 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse1 (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|)) (.cse0 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (and (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_25| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_25|))) (forall ((|ULTIMATE.start_main_#t~malloc20#1.offset| (_ BitVec 32)) (v_ArrVal_1100 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1101 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1103 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (store (store (store |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#1.offset| |c_ULTIMATE.start_main_~n~0#1.base|) .cse0 |ULTIMATE.start_main_#t~malloc20#1.offset|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_25| v_ArrVal_1101) (select (select (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse1 .cse0 |v_ULTIMATE.start_main_#t~malloc20#1.base_25|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_25| v_ArrVal_1100) |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1103) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_25| (_ BitVec 32))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_25|))) (forall ((v_ArrVal_1100 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1102 (Array (_ BitVec 32) (_ BitVec 32)))) (= (select (select (let ((.cse2 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store .cse1 .cse0 |v_ULTIMATE.start_main_#t~malloc20#1.base_25|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_25| v_ArrVal_1100))) (store .cse2 (select (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse0) v_ArrVal_1102)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|) (_ bv0 32))))))) is different from false [2023-11-29 03:21:45,629 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:21:45,629 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 47 [2023-11-29 03:21:45,641 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 28 treesize of output 18 [2023-11-29 03:21:45,648 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 9 treesize of output 7 [2023-11-29 03:21:45,651 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 25 treesize of output 15 [2023-11-29 03:21:45,664 INFO L349 Elim1Store]: treesize reduction 14, result has 6.7 percent of original size [2023-11-29 03:21:45,664 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 2 new quantified variables, introduced 2 case distinctions, treesize of input 45 treesize of output 1 [2023-11-29 03:21:45,670 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 2 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:21:45,670 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:21:45,670 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [419613216] [2023-11-29 03:21:45,670 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [419613216] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:21:45,671 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:21:45,671 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 15] total 24 [2023-11-29 03:21:45,671 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [804507479] [2023-11-29 03:21:45,671 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:21:45,671 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 25 states [2023-11-29 03:21:45,671 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:21:45,672 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 25 interpolants. [2023-11-29 03:21:45,672 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=79, Invalid=295, Unknown=26, NotChecked=200, Total=600 [2023-11-29 03:21:45,672 INFO L87 Difference]: Start difference. First operand 522 states and 717 transitions. Second operand has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:50,254 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:21:50,254 INFO L93 Difference]: Finished difference Result 617 states and 826 transitions. [2023-11-29 03:21:50,255 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 22 states. [2023-11-29 03:21:50,255 INFO L78 Accepts]: Start accepts. Automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-29 03:21:50,255 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:21:50,258 INFO L225 Difference]: With dead ends: 617 [2023-11-29 03:21:50,258 INFO L226 Difference]: Without dead ends: 617 [2023-11-29 03:21:50,258 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 79 GetRequests, 35 SyntacticMatches, 6 SemanticMatches, 38 ConstructedPredicates, 5 IntricatePredicates, 0 DeprecatedPredicates, 239 ImplicationChecksByTransitivity, 10.8s TimeCoverageRelationStatistics Valid=265, Invalid=907, Unknown=38, NotChecked=350, Total=1560 [2023-11-29 03:21:50,258 INFO L413 NwaCegarLoop]: 71 mSDtfsCounter, 306 mSDsluCounter, 593 mSDsCounter, 0 mSdLazyCounter, 899 mSolverCounterSat, 40 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 3.0s Time, 0 mProtectedPredicate, 0 mProtectedAction, 306 SdHoareTripleChecker+Valid, 664 SdHoareTripleChecker+Invalid, 1925 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 40 IncrementalHoareTripleChecker+Valid, 899 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 986 IncrementalHoareTripleChecker+Unchecked, 3.3s IncrementalHoareTripleChecker+Time [2023-11-29 03:21:50,259 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [306 Valid, 664 Invalid, 1925 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [40 Valid, 899 Invalid, 0 Unknown, 986 Unchecked, 3.3s Time] [2023-11-29 03:21:50,259 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 617 states. [2023-11-29 03:21:50,264 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 617 to 507. [2023-11-29 03:21:50,265 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 507 states, 467 states have (on average 1.4839400428265526) internal successors, (693), 506 states have internal predecessors, (693), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:50,266 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 507 states to 507 states and 693 transitions. [2023-11-29 03:21:50,266 INFO L78 Accepts]: Start accepts. Automaton has 507 states and 693 transitions. Word has length 30 [2023-11-29 03:21:50,266 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:21:50,266 INFO L495 AbstractCegarLoop]: Abstraction has 507 states and 693 transitions. [2023-11-29 03:21:50,266 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 25 states, 25 states have (on average 2.08) internal successors, (52), 24 states have internal predecessors, (52), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:50,266 INFO L276 IsEmpty]: Start isEmpty. Operand 507 states and 693 transitions. [2023-11-29 03:21:50,266 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 31 [2023-11-29 03:21:50,266 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:21:50,267 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:21:50,270 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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)] Forceful destruction successful, exit code 0 [2023-11-29 03:21:50,467 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 33 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:50,467 INFO L420 AbstractCegarLoop]: === Iteration 33 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:21:50,467 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:21:50,468 INFO L85 PathProgramCache]: Analyzing trace with hash -1731456037, now seen corresponding path program 1 times [2023-11-29 03:21:50,468 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:21:50,468 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [116788278] [2023-11-29 03:21:50,468 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:21:50,468 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 03:21:50,468 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:21:50,469 INFO L229 MonitoredProcess]: Starting monitored process 34 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:50,470 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:50,575 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:21:50,579 INFO L262 TraceCheckSpWp]: Trace formula consists of 199 conjuncts, 8 conjunts are in the unsatisfiable core [2023-11-29 03:21:50,580 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:21:50,662 INFO L134 CoverageAnalysis]: Checked inductivity of 4 backedges. 2 proven. 0 refuted. 0 times theorem prover too weak. 2 trivial. 0 not checked. [2023-11-29 03:21:50,663 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:21:50,663 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:21:50,663 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [116788278] [2023-11-29 03:21:50,663 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [116788278] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:21:50,663 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:21:50,663 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [5] imperfect sequences [] total 5 [2023-11-29 03:21:50,663 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [629303991] [2023-11-29 03:21:50,663 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:21:50,664 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 5 states [2023-11-29 03:21:50,664 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:21:50,664 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 5 interpolants. [2023-11-29 03:21:50,664 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=7, Invalid=13, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:21:50,664 INFO L87 Difference]: Start difference. First operand 507 states and 693 transitions. Second operand has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:51,206 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:21:51,206 INFO L93 Difference]: Finished difference Result 595 states and 808 transitions. [2023-11-29 03:21:51,207 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 6 states. [2023-11-29 03:21:51,207 INFO L78 Accepts]: Start accepts. Automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 30 [2023-11-29 03:21:51,207 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:21:51,209 INFO L225 Difference]: With dead ends: 595 [2023-11-29 03:21:51,209 INFO L226 Difference]: Without dead ends: 595 [2023-11-29 03:21:51,209 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 26 SyntacticMatches, 0 SemanticMatches, 5 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 1 ImplicationChecksByTransitivity, 0.1s TimeCoverageRelationStatistics Valid=15, Invalid=27, Unknown=0, NotChecked=0, Total=42 [2023-11-29 03:21:51,210 INFO L413 NwaCegarLoop]: 86 mSDtfsCounter, 22 mSDsluCounter, 176 mSDsCounter, 0 mSdLazyCounter, 203 mSolverCounterSat, 3 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 22 SdHoareTripleChecker+Valid, 262 SdHoareTripleChecker+Invalid, 206 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 3 IncrementalHoareTripleChecker+Valid, 203 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:21:51,210 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [22 Valid, 262 Invalid, 206 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [3 Valid, 203 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:21:51,210 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 595 states. [2023-11-29 03:21:51,215 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 595 to 521. [2023-11-29 03:21:51,215 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 521 states, 481 states have (on average 1.4553014553014554) internal successors, (700), 520 states have internal predecessors, (700), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:51,216 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 521 states to 521 states and 700 transitions. [2023-11-29 03:21:51,216 INFO L78 Accepts]: Start accepts. Automaton has 521 states and 700 transitions. Word has length 30 [2023-11-29 03:21:51,216 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:21:51,216 INFO L495 AbstractCegarLoop]: Abstraction has 521 states and 700 transitions. [2023-11-29 03:21:51,216 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 5 states, 5 states have (on average 5.8) internal successors, (29), 5 states have internal predecessors, (29), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:51,216 INFO L276 IsEmpty]: Start isEmpty. Operand 521 states and 700 transitions. [2023-11-29 03:21:51,217 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 03:21:51,217 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:21:51,217 INFO L195 NwaCegarLoop]: trace histogram [5, 4, 4, 4, 4, 3, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:21:51,219 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:51,417 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 34 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:51,417 INFO L420 AbstractCegarLoop]: === Iteration 34 === Targeting ULTIMATE.startErr36REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:21:51,418 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:21:51,418 INFO L85 PathProgramCache]: Analyzing trace with hash -1971972516, now seen corresponding path program 3 times [2023-11-29 03:21:51,418 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:21:51,418 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1969142446] [2023-11-29 03:21:51,418 INFO L93 rtionOrderModulation]: Changing assertion order to OUTSIDE_LOOP_FIRST2 [2023-11-29 03:21:51,418 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 03:21:51,418 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:21:51,419 INFO L229 MonitoredProcess]: Starting monitored process 35 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:51,420 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:51,621 INFO L228 tOrderPrioritization]: Assert order OUTSIDE_LOOP_FIRST2 issued 5 check-sat command(s) [2023-11-29 03:21:51,621 INFO L229 tOrderPrioritization]: Conjunction of SSA is unsat [2023-11-29 03:21:51,627 INFO L262 TraceCheckSpWp]: Trace formula consists of 255 conjuncts, 31 conjunts are in the unsatisfiable core [2023-11-29 03:21:51,629 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:21:51,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:21:51,670 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 13 treesize of output 9 [2023-11-29 03:21:51,772 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 03:21:51,785 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 21 treesize of output 20 [2023-11-29 03:21:51,841 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:21:51,841 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 14 [2023-11-29 03:21:51,848 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 2 select indices, 2 select index equivalence classes, 1 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 0 case distinctions, treesize of input 36 treesize of output 14 [2023-11-29 03:21:51,961 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 26 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:21:51,961 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:21:52,077 INFO L134 CoverageAnalysis]: Checked inductivity of 44 backedges. 26 proven. 18 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:21:52,077 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:21:52,077 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1969142446] [2023-11-29 03:21:52,077 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1969142446] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:21:52,077 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:21:52,077 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [11, 10] total 12 [2023-11-29 03:21:52,078 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1659186094] [2023-11-29 03:21:52,078 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:21:52,078 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 12 states [2023-11-29 03:21:52,078 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:21:52,078 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 12 interpolants. [2023-11-29 03:21:52,079 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=25, Invalid=107, Unknown=0, NotChecked=0, Total=132 [2023-11-29 03:21:52,079 INFO L87 Difference]: Start difference. First operand 521 states and 700 transitions. Second operand has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:54,487 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:21:54,487 INFO L93 Difference]: Finished difference Result 733 states and 926 transitions. [2023-11-29 03:21:54,488 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 18 states. [2023-11-29 03:21:54,488 INFO L78 Accepts]: Start accepts. Automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-29 03:21:54,488 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:21:54,492 INFO L225 Difference]: With dead ends: 733 [2023-11-29 03:21:54,492 INFO L226 Difference]: Without dead ends: 713 [2023-11-29 03:21:54,492 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 78 GetRequests, 56 SyntacticMatches, 0 SemanticMatches, 22 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 83 ImplicationChecksByTransitivity, 0.6s TimeCoverageRelationStatistics Valid=106, Invalid=446, Unknown=0, NotChecked=0, Total=552 [2023-11-29 03:21:54,492 INFO L413 NwaCegarLoop]: 210 mSDtfsCounter, 209 mSDsluCounter, 1144 mSDsCounter, 0 mSdLazyCounter, 890 mSolverCounterSat, 7 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 1.7s Time, 0 mProtectedPredicate, 0 mProtectedAction, 209 SdHoareTripleChecker+Valid, 1354 SdHoareTripleChecker+Invalid, 897 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 7 IncrementalHoareTripleChecker+Valid, 890 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 2.0s IncrementalHoareTripleChecker+Time [2023-11-29 03:21:54,492 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [209 Valid, 1354 Invalid, 897 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [7 Valid, 890 Invalid, 0 Unknown, 0 Unchecked, 2.0s Time] [2023-11-29 03:21:54,493 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 713 states. [2023-11-29 03:21:54,500 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 713 to 527. [2023-11-29 03:21:54,501 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 487 states have (on average 1.4558521560574949) internal successors, (709), 526 states have internal predecessors, (709), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:54,502 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 709 transitions. [2023-11-29 03:21:54,502 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 709 transitions. Word has length 32 [2023-11-29 03:21:54,503 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:21:54,503 INFO L495 AbstractCegarLoop]: Abstraction has 527 states and 709 transitions. [2023-11-29 03:21:54,503 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 12 states, 12 states have (on average 2.9166666666666665) internal successors, (35), 12 states have internal predecessors, (35), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:54,503 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 709 transitions. [2023-11-29 03:21:54,504 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 03:21:54,504 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:21:54,504 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:21:54,507 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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)] Ended with exit code 0 [2023-11-29 03:21:54,707 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 35 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:54,707 INFO L420 AbstractCegarLoop]: === Iteration 35 === Targeting ULTIMATE.startErr76ASSERT_VIOLATIONMEMORY_LEAK === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:21:54,707 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:21:54,708 INFO L85 PathProgramCache]: Analyzing trace with hash 955181950, now seen corresponding path program 1 times [2023-11-29 03:21:54,708 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:21:54,708 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1204092162] [2023-11-29 03:21:54,708 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:21:54,708 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 03:21:54,708 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:21:54,709 INFO L229 MonitoredProcess]: Starting monitored process 36 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:54,710 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 (36)] Waiting until timeout for monitored process [2023-11-29 03:21:54,851 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:21:54,857 INFO L262 TraceCheckSpWp]: Trace formula consists of 250 conjuncts, 2 conjunts are in the unsatisfiable core [2023-11-29 03:21:54,858 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:21:54,868 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 03:21:54,869 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:21:54,869 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:21:54,869 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1204092162] [2023-11-29 03:21:54,869 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1204092162] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:21:54,869 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:21:54,869 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:21:54,869 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1863422823] [2023-11-29 03:21:54,869 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:21:54,870 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 3 states [2023-11-29 03:21:54,870 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:21:54,870 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 3 interpolants. [2023-11-29 03:21:54,870 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:21:54,870 INFO L87 Difference]: Start difference. First operand 527 states and 709 transitions. Second operand has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:55,018 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:21:55,018 INFO L93 Difference]: Finished difference Result 527 states and 708 transitions. [2023-11-29 03:21:55,019 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 3 states. [2023-11-29 03:21:55,019 INFO L78 Accepts]: Start accepts. Automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-29 03:21:55,019 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:21:55,021 INFO L225 Difference]: With dead ends: 527 [2023-11-29 03:21:55,021 INFO L226 Difference]: Without dead ends: 527 [2023-11-29 03:21:55,021 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 31 GetRequests, 30 SyntacticMatches, 0 SemanticMatches, 1 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=3, Invalid=3, Unknown=0, NotChecked=0, Total=6 [2023-11-29 03:21:55,021 INFO L413 NwaCegarLoop]: 91 mSDtfsCounter, 1 mSDsluCounter, 85 mSDsCounter, 0 mSdLazyCounter, 49 mSolverCounterSat, 0 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.1s Time, 0 mProtectedPredicate, 0 mProtectedAction, 1 SdHoareTripleChecker+Valid, 176 SdHoareTripleChecker+Invalid, 49 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 0 IncrementalHoareTripleChecker+Valid, 49 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.1s IncrementalHoareTripleChecker+Time [2023-11-29 03:21:55,022 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [1 Valid, 176 Invalid, 49 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [0 Valid, 49 Invalid, 0 Unknown, 0 Unchecked, 0.1s Time] [2023-11-29 03:21:55,022 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 527 states. [2023-11-29 03:21:55,026 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 527 to 527. [2023-11-29 03:21:55,027 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 527 states, 487 states have (on average 1.4537987679671458) internal successors, (708), 526 states have internal predecessors, (708), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:55,028 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 527 states to 527 states and 708 transitions. [2023-11-29 03:21:55,028 INFO L78 Accepts]: Start accepts. Automaton has 527 states and 708 transitions. Word has length 32 [2023-11-29 03:21:55,028 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:21:55,028 INFO L495 AbstractCegarLoop]: Abstraction has 527 states and 708 transitions. [2023-11-29 03:21:55,028 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 3 states, 3 states have (on average 7.0) internal successors, (21), 3 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:55,028 INFO L276 IsEmpty]: Start isEmpty. Operand 527 states and 708 transitions. [2023-11-29 03:21:55,029 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 03:21:55,029 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:21:55,029 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:21:55,032 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 (36)] Ended with exit code 0 [2023-11-29 03:21:55,229 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 36 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:55,229 INFO L420 AbstractCegarLoop]: === Iteration 36 === Targeting ULTIMATE.startErr52REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:21:55,229 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:21:55,230 INFO L85 PathProgramCache]: Analyzing trace with hash 955184465, now seen corresponding path program 1 times [2023-11-29 03:21:55,230 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:21:55,230 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [894629967] [2023-11-29 03:21:55,230 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:21:55,230 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 03:21:55,230 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:21:55,231 INFO L229 MonitoredProcess]: Starting monitored process 37 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:55,232 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 (37)] Waiting until timeout for monitored process [2023-11-29 03:21:55,375 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:21:55,380 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 4 conjunts are in the unsatisfiable core [2023-11-29 03:21:55,381 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:21:55,385 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 7 [2023-11-29 03:21:55,405 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 03:21:55,406 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:21:55,406 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:21:55,406 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [894629967] [2023-11-29 03:21:55,406 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [894629967] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:21:55,406 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:21:55,406 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:21:55,406 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [1923201146] [2023-11-29 03:21:55,406 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:21:55,406 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:21:55,406 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:21:55,407 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:21:55,407 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:21:55,407 INFO L87 Difference]: Start difference. First operand 527 states and 708 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:55,807 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:21:55,807 INFO L93 Difference]: Finished difference Result 538 states and 720 transitions. [2023-11-29 03:21:55,808 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:21:55,808 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-29 03:21:55,808 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:21:55,810 INFO L225 Difference]: With dead ends: 538 [2023-11-29 03:21:55,810 INFO L226 Difference]: Without dead ends: 538 [2023-11-29 03:21:55,810 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:21:55,810 INFO L413 NwaCegarLoop]: 81 mSDtfsCounter, 38 mSDsluCounter, 88 mSDsCounter, 0 mSdLazyCounter, 151 mSolverCounterSat, 11 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.3s Time, 0 mProtectedPredicate, 0 mProtectedAction, 38 SdHoareTripleChecker+Valid, 169 SdHoareTripleChecker+Invalid, 162 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 11 IncrementalHoareTripleChecker+Valid, 151 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.4s IncrementalHoareTripleChecker+Time [2023-11-29 03:21:55,810 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [38 Valid, 169 Invalid, 162 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [11 Valid, 151 Invalid, 0 Unknown, 0 Unchecked, 0.4s Time] [2023-11-29 03:21:55,811 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 538 states. [2023-11-29 03:21:55,815 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 538 to 523. [2023-11-29 03:21:55,815 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 523 states, 488 states have (on average 1.444672131147541) internal successors, (705), 522 states have internal predecessors, (705), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:55,817 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 523 states to 523 states and 705 transitions. [2023-11-29 03:21:55,817 INFO L78 Accepts]: Start accepts. Automaton has 523 states and 705 transitions. Word has length 32 [2023-11-29 03:21:55,817 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:21:55,817 INFO L495 AbstractCegarLoop]: Abstraction has 523 states and 705 transitions. [2023-11-29 03:21:55,817 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:55,817 INFO L276 IsEmpty]: Start isEmpty. Operand 523 states and 705 transitions. [2023-11-29 03:21:55,818 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 33 [2023-11-29 03:21:55,818 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:21:55,818 INFO L195 NwaCegarLoop]: trace histogram [3, 3, 3, 3, 3, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:21:55,821 INFO L552 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 (37)] Ended with exit code 0 [2023-11-29 03:21:56,018 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 37 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:56,019 INFO L420 AbstractCegarLoop]: === Iteration 37 === Targeting ULTIMATE.startErr53REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:21:56,019 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:21:56,019 INFO L85 PathProgramCache]: Analyzing trace with hash 955184466, now seen corresponding path program 1 times [2023-11-29 03:21:56,019 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:21:56,019 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [1228445336] [2023-11-29 03:21:56,019 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:21:56,020 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 03:21:56,020 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:21:56,020 INFO L229 MonitoredProcess]: Starting monitored process 38 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:56,021 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 (38)] Waiting until timeout for monitored process [2023-11-29 03:21:56,175 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:21:56,182 INFO L262 TraceCheckSpWp]: Trace formula consists of 254 conjuncts, 6 conjunts are in the unsatisfiable core [2023-11-29 03:21:56,184 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:21:56,189 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 03:21:56,234 INFO L134 CoverageAnalysis]: Checked inductivity of 21 backedges. 0 proven. 0 refuted. 0 times theorem prover too weak. 21 trivial. 0 not checked. [2023-11-29 03:21:56,234 INFO L323 TraceCheckSpWp]: Omiting computation of backward sequence because forward sequence was already perfect [2023-11-29 03:21:56,234 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:21:56,235 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [1228445336] [2023-11-29 03:21:56,235 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [1228445336] provided 1 perfect and 0 imperfect interpolant sequences [2023-11-29 03:21:56,235 INFO L185 FreeRefinementEngine]: Found 1 perfect and 0 imperfect interpolant sequences. [2023-11-29 03:21:56,235 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [3] imperfect sequences [] total 3 [2023-11-29 03:21:56,235 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [263750817] [2023-11-29 03:21:56,235 INFO L85 oduleStraightlineAll]: Using 1 perfect interpolants to construct interpolant automaton [2023-11-29 03:21:56,235 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 4 states [2023-11-29 03:21:56,236 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:21:56,236 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 4 interpolants. [2023-11-29 03:21:56,236 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=5, Invalid=7, Unknown=0, NotChecked=0, Total=12 [2023-11-29 03:21:56,236 INFO L87 Difference]: Start difference. First operand 523 states and 705 transitions. Second operand has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:56,742 INFO L144 Difference]: Subtrahend was deterministic. Have not used determinization. [2023-11-29 03:21:56,742 INFO L93 Difference]: Finished difference Result 559 states and 743 transitions. [2023-11-29 03:21:56,743 INFO L141 InterpolantAutomaton]: Switched to read-only mode: deterministic interpolant automaton has 5 states. [2023-11-29 03:21:56,743 INFO L78 Accepts]: Start accepts. Automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) Word has length 32 [2023-11-29 03:21:56,743 INFO L84 Accepts]: Finished accepts. some prefix is accepted. [2023-11-29 03:21:56,745 INFO L225 Difference]: With dead ends: 559 [2023-11-29 03:21:56,745 INFO L226 Difference]: Without dead ends: 559 [2023-11-29 03:21:56,745 INFO L412 NwaCegarLoop]: 0 DeclaredPredicates, 32 GetRequests, 29 SyntacticMatches, 0 SemanticMatches, 3 ConstructedPredicates, 0 IntricatePredicates, 0 DeprecatedPredicates, 0 ImplicationChecksByTransitivity, 0.0s TimeCoverageRelationStatistics Valid=9, Invalid=11, Unknown=0, NotChecked=0, Total=20 [2023-11-29 03:21:56,745 INFO L413 NwaCegarLoop]: 75 mSDtfsCounter, 46 mSDsluCounter, 76 mSDsCounter, 0 mSdLazyCounter, 170 mSolverCounterSat, 13 mSolverCounterUnsat, 0 mSolverCounterUnknown, 0 mSolverCounterNotChecked, 0.4s Time, 0 mProtectedPredicate, 0 mProtectedAction, 46 SdHoareTripleChecker+Valid, 151 SdHoareTripleChecker+Invalid, 183 SdHoareTripleChecker+Unknown, 0 SdHoareTripleChecker+Unchecked, 0.0s SdHoareTripleChecker+Time, 13 IncrementalHoareTripleChecker+Valid, 170 IncrementalHoareTripleChecker+Invalid, 0 IncrementalHoareTripleChecker+Unknown, 0 IncrementalHoareTripleChecker+Unchecked, 0.5s IncrementalHoareTripleChecker+Time [2023-11-29 03:21:56,746 INFO L414 NwaCegarLoop]: SdHoareTripleChecker [46 Valid, 151 Invalid, 183 Unknown, 0 Unchecked, 0.0s Time], IncrementalHoareTripleChecker [13 Valid, 170 Invalid, 0 Unknown, 0 Unchecked, 0.5s Time] [2023-11-29 03:21:56,746 INFO L82 GeneralOperation]: Start minimizeSevpa. Operand 559 states. [2023-11-29 03:21:56,751 INFO L88 GeneralOperation]: Finished minimizeSevpa. Reduced states from 559 to 528. [2023-11-29 03:21:56,752 INFO L82 GeneralOperation]: Start removeUnreachable. Operand has 528 states, 497 states have (on average 1.4406438631790746) internal successors, (716), 527 states have internal predecessors, (716), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:56,753 INFO L88 GeneralOperation]: Finished removeUnreachable. Reduced from 528 states to 528 states and 716 transitions. [2023-11-29 03:21:56,753 INFO L78 Accepts]: Start accepts. Automaton has 528 states and 716 transitions. Word has length 32 [2023-11-29 03:21:56,753 INFO L84 Accepts]: Finished accepts. word is rejected. [2023-11-29 03:21:56,754 INFO L495 AbstractCegarLoop]: Abstraction has 528 states and 716 transitions. [2023-11-29 03:21:56,754 INFO L496 AbstractCegarLoop]: INTERPOLANT automaton has has 4 states, 3 states have (on average 7.0) internal successors, (21), 4 states have internal predecessors, (21), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:21:56,754 INFO L276 IsEmpty]: Start isEmpty. Operand 528 states and 716 transitions. [2023-11-29 03:21:56,754 INFO L282 IsEmpty]: Finished isEmpty. Found accepting run of length 34 [2023-11-29 03:21:56,754 INFO L187 NwaCegarLoop]: Found error trace [2023-11-29 03:21:56,755 INFO L195 NwaCegarLoop]: trace histogram [2, 2, 2, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1, 1] [2023-11-29 03:21:56,759 INFO L540 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 (38)] Forceful destruction successful, exit code 0 [2023-11-29 03:21:56,955 WARN L477 AbstractCegarLoop]: Destroyed unattended storables created during the last iteration: 38 /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:56,955 INFO L420 AbstractCegarLoop]: === Iteration 38 === Targeting ULTIMATE.startErr4REQUIRES_VIOLATIONMEMORY_DEREFERENCE === [ULTIMATE.startErr0REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr1REQUIRES_VIOLATIONMEMORY_DEREFERENCE, ULTIMATE.startErr2REQUIRES_VIOLATIONMEMORY_DEREFERENCE (and 74 more)] === [2023-11-29 03:21:56,955 INFO L160 PredicateUnifier]: Initialized classic predicate unifier [2023-11-29 03:21:56,955 INFO L85 PathProgramCache]: Analyzing trace with hash -13010665, now seen corresponding path program 1 times [2023-11-29 03:21:56,956 INFO L118 FreeRefinementEngine]: Executing refinement strategy WOLF [2023-11-29 03:21:56,956 INFO L334 FreeRefinementEngine]: Using trace check IpTcStrategyModuleMathsat [948820741] [2023-11-29 03:21:56,956 INFO L95 rtionOrderModulation]: Keeping assertion order NOT_INCREMENTALLY [2023-11-29 03:21:56,956 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 03:21:56,956 INFO L189 MonitoredProcess]: No working directory specified, using /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/bin/uautomizer-verify-BQ2R08f2Ya/mathsat [2023-11-29 03:21:56,957 INFO L229 MonitoredProcess]: Starting monitored process 39 with /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 03:21:56,958 INFO L327 MonitoredProcess]: [MP /tmp/vcloud_worker_vcloud-master_on_vcloud-master/run_dir_1ce24895-b60c-430e-8c85-0503b2601e4a/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 (39)] Waiting until timeout for monitored process [2023-11-29 03:21:57,160 INFO L136 AnnotateAndAsserter]: Conjunction of SSA is unsat [2023-11-29 03:21:57,166 INFO L262 TraceCheckSpWp]: Trace formula consists of 225 conjuncts, 28 conjunts are in the unsatisfiable core [2023-11-29 03:21:57,169 INFO L285 TraceCheckSpWp]: Computing forward predicates... [2023-11-29 03:21:57,171 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 7 [2023-11-29 03:21:57,279 INFO L349 Elim1Store]: treesize reduction 22, result has 35.3 percent of original size [2023-11-29 03:21:57,279 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 19 treesize of output 27 [2023-11-29 03:21:57,316 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 0 select indices, 0 select index equivalence classes, 1 disjoint index pairs (out of 0 index pairs), introduced 0 new quantified variables, introduced 0 case distinctions, treesize of input 15 treesize of output 1 [2023-11-29 03:21:57,437 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:21:57,437 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:21:57,545 INFO L349 Elim1Store]: treesize reduction 19, result has 20.8 percent of original size [2023-11-29 03:21:57,545 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 36 treesize of output 35 [2023-11-29 03:21:57,653 INFO L349 Elim1Store]: treesize reduction 60, result has 34.1 percent of original size [2023-11-29 03:21:57,653 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 1 stores, 3 select indices, 3 select index equivalence classes, 1 disjoint index pairs (out of 3 index pairs), introduced 3 new quantified variables, introduced 4 case distinctions, treesize of input 32 treesize of output 44 [2023-11-29 03:21:57,760 INFO L190 IndexEqualityManager]: detected not equals via solver [2023-11-29 03:21:57,764 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 2 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 53 treesize of output 29 [2023-11-29 03:21:57,989 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:21:57,990 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2023-11-29 03:21:58,108 INFO L349 Elim1Store]: treesize reduction 21, result has 19.2 percent of original size [2023-11-29 03:21:58,108 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 64 treesize of output 57 [2023-11-29 03:21:58,382 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:21:58,382 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 51 treesize of output 23 [2023-11-29 03:21:58,417 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 2 proven. 5 refuted. 0 times theorem prover too weak. 0 trivial. 0 not checked. [2023-11-29 03:21:58,417 INFO L327 TraceCheckSpWp]: Computing backward predicates... [2023-11-29 03:21:58,508 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1491 (Array (_ BitVec 32) (_ BitVec 32)))) (= (_ bv0 1) (bvadd (select |c_#valid| (select (select (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem22#1.base| v_ArrVal_1491) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1)))) is different from false [2023-11-29 03:22:02,600 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1491 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (let ((.cse0 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem21#1.base| v_ArrVal_1490))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32))) v_ArrVal_1491)) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:22:02,728 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1491 (Array (_ BitVec 32) (_ BitVec 32)))) (= (bvadd (select |c_#valid| (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |c_ULTIMATE.start_main_#t~malloc20#1.base|)) |c_ULTIMATE.start_main_#t~malloc20#1.base| v_ArrVal_1490))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1491))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1)) (_ bv0 1))) is different from false [2023-11-29 03:22:02,754 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1491 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_ArrVal_1487 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_ArrVal_1487) (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (store (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base| (store (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|)) |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_ArrVal_1490))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1491))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1)) (_ bv0 1)))) is different from false [2023-11-29 03:22:02,820 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1486 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_ArrVal_1487 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_ArrVal_1487) (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem16#1.base| v_ArrVal_1486))) (store .cse2 |c_ULTIMATE.start_main_~n~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|))) |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_ArrVal_1490))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1491))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)) (_ bv1 1))))) is different from false [2023-11-29 03:22:02,852 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1486 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_ArrVal_1487 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_ArrVal_1487) (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (store (let ((.cse2 (store |c_#memory_$Pointer$#1.base| (select (select |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1486))) (store .cse2 |c_ULTIMATE.start_main_~n~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|))) |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_ArrVal_1490))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1491))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|))) (_ bv0 1)))) is different from false [2023-11-29 03:22:02,891 WARN L854 $PredicateComparison]: unable to prove that (forall ((v_ArrVal_1490 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1491 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1485 (Array (_ BitVec 32) (_ BitVec 32))) (v_ArrVal_1486 (Array (_ BitVec 32) (_ BitVec 32))) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_ArrVal_1487 (_ BitVec 1))) (or (not (= (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_ArrVal_1487) (select (select (let ((.cse1 (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)))) (let ((.cse0 (store (let ((.cse2 (let ((.cse3 (store |c_#memory_$Pointer$#1.base| |c_ULTIMATE.start_main_#t~mem15#1.base| v_ArrVal_1485))) (store .cse3 (select (select .cse3 |c_ULTIMATE.start_main_~n~0#1.base|) |c_ULTIMATE.start_main_~n~0#1.offset|) v_ArrVal_1486)))) (store .cse2 |c_ULTIMATE.start_main_~n~0#1.base| (store (select .cse2 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|))) |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_ArrVal_1490))) (store .cse0 (select (select .cse0 |c_ULTIMATE.start_main_~n~0#1.base|) .cse1) v_ArrVal_1491))) |c_ULTIMATE.start_main_~root~0#1.base|) |c_ULTIMATE.start_main_~root~0#1.offset|)))))) is different from false [2023-11-29 03:22:03,037 INFO L173 IndexEqualityManager]: detected equality via solver [2023-11-29 03:22:03,131 INFO L349 Elim1Store]: treesize reduction 15, result has 64.3 percent of original size [2023-11-29 03:22:03,132 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 1 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 2 new quantified variables, introduced 2 case distinctions, treesize of input 13770 treesize of output 12612 [2023-11-29 03:22:03,184 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:22:03,185 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 2, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 2258 treesize of output 2174 [2023-11-29 03:22:03,238 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 691 treesize of output 671 [2023-11-29 03:22:03,282 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:22:03,282 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 932 treesize of output 906 [2023-11-29 03:22:03,312 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 200 treesize of output 184 [2023-11-29 03:22:03,341 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 1 select indices, 1 select index equivalence classes, 0 disjoint index pairs (out of 0 index pairs), introduced 1 new quantified variables, introduced 0 case distinctions, treesize of input 6 treesize of output 4 [2023-11-29 03:22:09,661 INFO L349 Elim1Store]: treesize reduction 0, result has 100.0 percent of original size [2023-11-29 03:22:09,662 INFO L378 Elim1Store]: Elim1 eliminated variable of array dimension 1, 0 stores, 2 select indices, 2 select index equivalence classes, 0 disjoint index pairs (out of 1 index pairs), introduced 2 new quantified variables, introduced 1 case distinctions, treesize of input 1488 treesize of output 1472 [2023-11-29 03:22:57,389 WARN L293 SmtUtils]: Spent 28.37s on a formula simplification. DAG size of input: 907 DAG size of output: 903 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:23:09,462 WARN L854 $PredicateComparison]: unable to prove that (let ((.cse57 (= (bvadd |c_ULTIMATE.start_main_~n~0#1.offset| (_ bv4 32)) |c_ULTIMATE.start_main_~root~0#1.offset|)) (.cse56 (store |c_#valid| |c_ULTIMATE.start_main_~root~0#1.base| (_ bv1 1))) (.cse19 (= |c_ULTIMATE.start_main_~n~0#1.base| |c_ULTIMATE.start_main_~root~0#1.base|))) (let ((.cse0 (not .cse19)) (.cse66 (store |c_#valid| |c_ULTIMATE.start_main_~n~0#1.base| (_ bv1 1))) (.cse67 (not (= (select |c_#valid| |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv0 1)))) (.cse73 (and (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_prenex_103 (_ BitVec 1)) (v_prenex_104 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_103) v_prenex_104) (_ bv1 1)))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (forall ((v_prenex_131 (_ BitVec 32)) (v_prenex_129 (_ BitVec 32)) (v_prenex_130 (_ BitVec 1))) (let ((.cse109 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_130))) (or (= (_ bv0 1) (bvadd (select .cse109 v_prenex_131) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse109 v_prenex_129) (_ bv1 1)))))))))) (.cse71 (forall ((v_prenex_65 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_66 (_ BitVec 1)) (v_prenex_67 (_ BitVec 32)) (v_prenex_68 (_ BitVec 32))) (let ((.cse108 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_66))) (or (= (_ bv0 1) (bvadd (select .cse108 v_prenex_65) (_ bv1 1))) (= (_ bv0 1) (bvadd v_prenex_66 (_ bv1 1))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select .cse108 v_prenex_68) (_ bv1 1))) (= (bvadd (select .cse108 v_prenex_67) (_ bv1 1)) (_ bv0 1)))))) (.cse41 (not .cse57)) (.cse70 (forall ((v_prenex_63 (_ BitVec 32)) (v_prenex_64 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_62 (_ BitVec 1))) (let ((.cse107 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_62))) (or (= (_ bv0 1) (bvadd (select .cse107 v_prenex_63) (_ bv1 1))) (= (_ bv0 1) (bvadd v_prenex_62 (_ bv1 1))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select .cse107 v_prenex_64) (_ bv1 1))))))) (.cse72 (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_112 (_ BitVec 1)) (v_prenex_113 (_ BitVec 32)) (v_prenex_110 (_ BitVec 32)) (v_prenex_111 (_ BitVec 32))) (let ((.cse106 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_112))) (or (= (_ bv0 1) (bvadd (select .cse106 v_prenex_113) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse106 v_prenex_111) (_ bv1 1))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select .cse106 v_prenex_110) (_ bv1 1))))))) (.cse15 (not (= (bvadd (select .cse56 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (_ bv0 1)))) (.cse16 (not (= (_ bv0 1) (select |c_#valid| |c_ULTIMATE.start_main_~root~0#1.base|)))) (.cse77 (forall ((v_prenex_127 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_128 (_ BitVec 32)) (v_prenex_126 (_ BitVec 32))) (let ((.cse105 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_127))) (or (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (bvadd (select .cse105 v_prenex_126) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse105 v_prenex_128) (_ bv1 1)))))))) (let ((.cse44 (or .cse15 .cse16 .cse77)) (.cse48 (or .cse72 .cse15 .cse16)) (.cse49 (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (forall ((v_prenex_94 (_ BitVec 32)) (v_prenex_93 (_ BitVec 32)) (v_prenex_92 (_ BitVec 1))) (let ((.cse103 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_92))) (or (= (bvadd (select .cse103 v_prenex_94) (_ bv1 1)) (_ bv0 1)) (= (bvadd (_ bv1 1) (select .cse103 v_prenex_93)) (_ bv0 1))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (forall ((v_prenex_120 (_ BitVec 32)) (v_prenex_122 (_ BitVec 1)) (v_prenex_123 (_ BitVec 32)) (v_prenex_121 (_ BitVec 32))) (let ((.cse104 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_122))) (or (= (_ bv0 1) (bvadd (select .cse104 v_prenex_120) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse104 v_prenex_121) (_ bv1 1))) (= (bvadd (select .cse104 v_prenex_123) (_ bv1 1)) (_ bv0 1)))))))) .cse15 .cse16)) (.cse37 (or .cse41 .cse70)) (.cse45 (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_prenex_54 (_ BitVec 32)) (v_prenex_53 (_ BitVec 1)) (v_prenex_55 (_ BitVec 32))) (let ((.cse102 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_53))) (or (= (_ bv0 1) (bvadd (select .cse102 v_prenex_54) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse102 v_prenex_55) (_ bv1 1)))))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1)))))) (.cse21 (or .cse41 .cse71)) (.cse46 (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_prenex_72 (_ BitVec 32)) (v_prenex_71 (_ BitVec 32)) (v_prenex_70 (_ BitVec 1)) (v_prenex_69 (_ BitVec 32))) (let ((.cse101 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_70))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse101 v_prenex_72))) (= (_ bv0 1) (bvadd (select .cse101 v_prenex_71) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse101 v_prenex_69) (_ bv1 1)))))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1)))))) (.cse51 (or .cse15 .cse16 .cse73)) (.cse47 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ BitVec 32))) (let ((.cse100 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ bv1 1)))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_24| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24|))) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (not (= (_ bv0 1) (select .cse100 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|))) (forall ((v_prenex_125 (_ BitVec 1)) (v_arrayElimCell_173 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store .cse100 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_125) v_arrayElimCell_173) (_ bv1 1)))))) (not (= (bvadd (select .cse100 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (_ bv0 1))))))) (.cse50 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ BitVec 32))) (let ((.cse99 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ bv1 1)))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_24| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24|))) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_prenex_100 (_ BitVec 1)) (v_arrayElimCell_173 (_ BitVec 32)) (v_prenex_124 (_ BitVec 32))) (let ((.cse98 (store .cse99 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_100))) (or (= (bvadd (select .cse98 v_arrayElimCell_173) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse98 v_prenex_124)))))) (not (= (_ bv0 1) (select .cse99 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|))))) (not (= (bvadd (select .cse99 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (_ bv0 1))))))) (.cse65 (= |c_ULTIMATE.start_main_~n~0#1.offset| |c_ULTIMATE.start_main_~root~0#1.offset|)) (.cse38 (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (not (= (select .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (forall ((v_prenex_24 (_ BitVec 1)) (v_prenex_25 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_24) v_prenex_25) (_ bv1 1)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_prenex_118 (_ BitVec 32)) (v_prenex_117 (_ BitVec 32)) (v_prenex_119 (_ BitVec 1))) (let ((.cse97 (store .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_119))) (or (= (bvadd (select .cse97 v_prenex_117) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse97 v_prenex_118)))))) (not (= (select .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1)))))) .cse67)) (.cse39 (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (forall ((v_prenex_30 (_ BitVec 32)) (v_prenex_32 (_ BitVec 1)) (v_prenex_34 (_ BitVec 32))) (let ((.cse96 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_32))) (or (= (bvadd (select .cse96 v_prenex_30) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse96 v_prenex_34) (_ bv1 1)) (_ bv0 1))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_prenex_31 (_ BitVec 1)) (v_prenex_33 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_31) v_prenex_33) (_ bv1 1)))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1)))))) .cse16)) (.cse40 (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_prenex_36 (_ BitVec 1)) (v_arrayElimCell_177 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_36) v_arrayElimCell_177) (_ bv1 1)))) (not (= (select .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_prenex_26 (_ BitVec 1)) (v_prenex_27 (_ BitVec 32)) (v_prenex_35 (_ BitVec 32))) (let ((.cse95 (store .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_26))) (or (= (bvadd (select .cse95 v_prenex_35) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse95 v_prenex_27) (_ bv1 1)) (_ bv0 1))))) (not (= (select .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1)))))) .cse67)) (.cse43 (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_prenex_38 (_ BitVec 1)) (v_prenex_39 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_38) v_prenex_39) (_ bv1 1))) (= (_ bv0 1) (bvadd v_prenex_38 (_ bv1 1))))) (not (= (select .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (not (= (select .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (forall ((v_prenex_28 (_ BitVec 1)) (v_prenex_37 (_ BitVec 32)) (v_prenex_29 (_ BitVec 32))) (let ((.cse94 (store .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_28))) (or (= (_ bv0 1) (bvadd (select .cse94 v_prenex_29) (_ bv1 1))) (= (bvadd v_prenex_28 (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse94 v_prenex_37) (_ bv1 1)) (_ bv0 1)))))))) .cse67)) (.cse18 (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_prenex_56 (_ BitVec 1)) (v_prenex_58 (_ BitVec 32)) (v_prenex_57 (_ BitVec 32))) (let ((.cse93 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_56))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse93 v_prenex_58))) (= (_ bv0 1) (bvadd (select .cse93 v_prenex_57) (_ bv1 1))) (= (bvadd v_prenex_56 (_ bv1 1)) (_ bv0 1))))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1)))))) (.cse23 (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (forall ((v_prenex_85 (_ BitVec 32)) (v_prenex_87 (_ BitVec 32)) (v_prenex_86 (_ BitVec 1))) (let ((.cse91 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_86))) (or (= (_ bv0 1) (bvadd (select .cse91 v_prenex_87) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse91 v_prenex_85) (_ bv1 1)))))))) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_prenex_61 (_ BitVec 32)) (v_prenex_59 (_ BitVec 32)) (v_prenex_60 (_ BitVec 1))) (let ((.cse92 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_60))) (or (= (bvadd (select .cse92 v_prenex_59) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse92 v_prenex_61) (_ bv1 1))) (= (_ bv0 1) (bvadd v_prenex_60 (_ bv1 1)))))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1)))))) .cse0)) (.cse24 (or (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_72 (_ BitVec 32)) (v_prenex_71 (_ BitVec 32)) (v_prenex_70 (_ BitVec 1)) (v_prenex_69 (_ BitVec 32))) (let ((.cse90 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_70))) (or (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse90 v_prenex_72))) (= (_ bv0 1) (bvadd (select .cse90 v_prenex_71) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse90 v_prenex_69) (_ bv1 1)))))) .cse19)) (.cse25 (or (forall ((v_prenex_54 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_53 (_ BitVec 1)) (v_prenex_55 (_ BitVec 32))) (let ((.cse89 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_53))) (or (= (_ bv0 1) (bvadd (select .cse89 v_prenex_54) (_ bv1 1))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select .cse89 v_prenex_55) (_ bv1 1)))))) .cse19)) (.cse26 (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_prenex_52 (_ BitVec 32)) (v_prenex_51 (_ BitVec 1))) (= (bvadd (select (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_51) v_prenex_52) (_ bv1 1)) (_ bv0 1))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (forall ((v_prenex_41 (_ BitVec 32)) (v_prenex_40 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_40) v_prenex_41))) (= (_ bv0 1) (bvadd v_prenex_40 (_ bv1 1)))))))) .cse0)) (.cse29 (or .cse41 (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_45 (_ BitVec 1)) (v_prenex_47 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse88 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_45))) (or (= (_ bv0 1) (bvadd v_prenex_45 (_ bv1 1))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select .cse88 v_prenex_46) (_ bv1 1))) (= (bvadd (select .cse88 v_prenex_47) (_ bv1 1)) (_ bv0 1))))))) (.cse31 (or .cse41 (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32)) (v_prenex_88 (_ BitVec 32)) (v_prenex_91 (_ BitVec 1))) (let ((.cse87 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_91))) (or (= (_ bv0 1) (bvadd v_prenex_91 (_ bv1 1))) (= (bvadd (select .cse87 v_prenex_89) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse87 v_prenex_88) (_ bv1 1)) (_ bv0 1)) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select .cse87 v_prenex_90) (_ bv1 1)))))))) (.cse32 (or .cse57 (forall ((v_prenex_80 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_78 (_ BitVec 1)) (v_prenex_77 (_ BitVec 32)) (v_prenex_79 (_ BitVec 32))) (let ((.cse86 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_78))) (or (= (bvadd (select .cse86 v_prenex_77) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse86 v_prenex_79) (_ bv1 1)) (_ bv0 1)) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (bvadd (_ bv1 1) (select .cse86 v_prenex_80)) (_ bv0 1))))))) (.cse33 (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_prenex_84 (_ BitVec 32)) (v_prenex_81 (_ BitVec 32)) (v_prenex_83 (_ BitVec 32)) (v_prenex_82 (_ BitVec 1))) (let ((.cse85 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_82))) (or (= (bvadd (select .cse85 v_prenex_81) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd v_prenex_82 (_ bv1 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse85 v_prenex_84))) (= (_ bv0 1) (bvadd (select .cse85 v_prenex_83) (_ bv1 1)))))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1)))))) (.cse34 (or .cse57 (forall ((v_prenex_48 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_50 (_ BitVec 32)) (v_prenex_49 (_ BitVec 32))) (let ((.cse84 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_48))) (or (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select .cse84 v_prenex_50) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse84 v_prenex_49) (_ bv1 1)))))))) (.cse1 (or (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_3 (_ BitVec 1)) (v_prenex_4 (_ BitVec 32))) (or (= (_ bv0 1) (bvadd (select (store .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_3) v_prenex_4) (_ bv1 1))) (not (= (select .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))))) .cse67)) (.cse2 (or (forall ((v_prenex_13 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_12 (_ BitVec 32)) (v_prenex_14 (_ BitVec 32))) (let ((.cse83 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_13))) (or (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (bvadd (select .cse83 v_prenex_14) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse83 v_prenex_12) (_ bv1 1)))))) .cse16)) (.cse3 (or (forall ((v_prenex_17 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_16 (_ BitVec 32)) (v_prenex_15 (_ BitVec 32)) (v_prenex_18 (_ BitVec 32))) (let ((.cse82 (store .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_17))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse82 v_prenex_18))) (= (bvadd (select .cse82 v_prenex_16) (_ bv1 1)) (_ bv0 1)) (not (= (select .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select .cse82 v_prenex_15) (_ bv1 1)))))) .cse67)) (.cse7 (or (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_107 (_ BitVec 32)) (v_prenex_108 (_ BitVec 32)) (v_prenex_109 (_ BitVec 1))) (let ((.cse81 (store .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_109))) (or (= (bvadd (select .cse81 v_prenex_108) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse81 v_prenex_107) (_ bv1 1)) (_ bv0 1)) (not (= (select .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1)))))) .cse67)) (.cse8 (or (forall ((v_arrayElimCell_178 (_ BitVec 32)) (v_prenex_6 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_5 (_ BitVec 32))) (let ((.cse80 (store .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_6))) (or (= (_ bv0 1) (bvadd (select .cse80 v_arrayElimCell_178) (_ bv1 1))) (not (= (select .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (bvadd (select .cse80 v_prenex_5) (_ bv1 1)) (_ bv0 1))))) .cse67)) (.cse9 (or (forall ((v_prenex_21 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_22 (_ BitVec 1)) (v_prenex_23 (_ BitVec 32))) (let ((.cse79 (store .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_22))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse79 v_prenex_21))) (not (= (select .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (_ bv0 1) (bvadd (select .cse79 v_prenex_23) (_ bv1 1)))))) .cse67)) (.cse12 (or (forall ((v_prenex_20 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_19 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_19) v_prenex_20))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))))) .cse16)) (.cse13 (or (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_7 (_ BitVec 32)) (v_prenex_8 (_ BitVec 1))) (or (= (bvadd (select (store .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_8) v_prenex_7) (_ bv1 1)) (_ bv0 1)) (not (= (select .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))))) .cse67))) (and (or (let ((.cse35 (or (forall ((v_prenex_63 (_ BitVec 32)) (v_prenex_64 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32)) (v_prenex_62 (_ BitVec 1))) (let ((.cse64 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_62))) (or (= (_ bv0 1) (bvadd (select .cse64 v_prenex_63) (_ bv1 1))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (bvadd (_ bv1 1) (select .cse64 v_arrayElimCell_181)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse64 v_prenex_64) (_ bv1 1)))))) .cse57)) (.cse36 (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_prenex_63 (_ BitVec 32)) (v_prenex_64 (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32)) (v_prenex_62 (_ BitVec 1))) (let ((.cse63 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_62))) (or (= (_ bv0 1) (bvadd (select .cse63 v_prenex_63) (_ bv1 1))) (= (_ bv0 1) (bvadd v_prenex_62 (_ bv1 1))) (= (bvadd (_ bv1 1) (select .cse63 v_arrayElimCell_181)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse63 v_prenex_64) (_ bv1 1)))))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1)))))) (.cse17 (or (forall ((v_prenex_43 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_42 (_ BitVec 1)) (v_arrayElimCell_181 (_ BitVec 32)) (v_prenex_44 (_ BitVec 32))) (let ((.cse62 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_42))) (or (= (_ bv0 1) (bvadd (select .cse62 v_prenex_44) (_ bv1 1))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (bvadd (select .cse62 v_prenex_43) (_ bv1 1)) (_ bv0 1)) (= (bvadd (_ bv1 1) (select .cse62 v_arrayElimCell_181)) (_ bv0 1))))) .cse57)) (.cse20 (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_prenex_65 (_ BitVec 32)) (v_prenex_66 (_ BitVec 1)) (v_arrayElimCell_181 (_ BitVec 32)) (v_prenex_67 (_ BitVec 32)) (v_prenex_68 (_ BitVec 32))) (let ((.cse61 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_66))) (or (= (_ bv0 1) (bvadd (select .cse61 v_prenex_65) (_ bv1 1))) (= (_ bv0 1) (bvadd v_prenex_66 (_ bv1 1))) (= (bvadd (select .cse61 v_arrayElimCell_181) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse61 v_prenex_68) (_ bv1 1))) (= (bvadd (select .cse61 v_prenex_67) (_ bv1 1)) (_ bv0 1))))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1)))))) (.cse27 (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (forall ((v_prenex_45 (_ BitVec 1)) (v_arrayElimCell_181 (_ BitVec 32)) (v_prenex_47 (_ BitVec 32)) (v_prenex_46 (_ BitVec 32))) (let ((.cse60 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_45))) (or (= (_ bv0 1) (bvadd v_prenex_45 (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse60 v_prenex_46) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse60 v_arrayElimCell_181) (_ bv1 1))) (= (bvadd (select .cse60 v_prenex_47) (_ bv1 1)) (_ bv0 1)))))))) (.cse28 (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_arrayElimCell_181 (_ BitVec 32)) (v_prenex_90 (_ BitVec 32)) (v_prenex_89 (_ BitVec 32)) (v_prenex_88 (_ BitVec 32)) (v_prenex_91 (_ BitVec 1))) (let ((.cse59 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_91))) (or (= (_ bv0 1) (bvadd v_prenex_91 (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse59 v_arrayElimCell_181) (_ bv1 1))) (= (bvadd (select .cse59 v_prenex_89) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse59 v_prenex_88) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse59 v_prenex_90) (_ bv1 1)))))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1)))))) (.cse30 (or .cse57 (forall ((v_prenex_73 (_ BitVec 32)) (v_prenex_76 (_ BitVec 32)) (v_prenex_75 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_arrayElimCell_181 (_ BitVec 32)) (v_prenex_74 (_ BitVec 1))) (let ((.cse58 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_74))) (or (= (bvadd (select .cse58 v_prenex_75) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse58 v_arrayElimCell_181) (_ bv1 1))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (bvadd (select .cse58 v_prenex_73) (_ bv1 1)) (_ bv0 1)) (= (bvadd (select .cse58 v_prenex_76) (_ bv1 1)) (_ bv0 1))))))) (.cse22 (or (forall ((v_prenex_65 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_66 (_ BitVec 1)) (v_arrayElimCell_181 (_ BitVec 32)) (v_prenex_67 (_ BitVec 32)) (v_prenex_68 (_ BitVec 32))) (let ((.cse55 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_66))) (or (= (_ bv0 1) (bvadd (select .cse55 v_prenex_65) (_ bv1 1))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (bvadd (select .cse55 v_arrayElimCell_181) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse55 v_prenex_68) (_ bv1 1))) (= (bvadd (select .cse55 v_prenex_67) (_ bv1 1)) (_ bv0 1))))) .cse57))) (and (or .cse0 (and .cse1 .cse2 .cse3 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ BitVec 32))) (let ((.cse4 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ bv1 1)))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_24| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24|))) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (not (= (_ bv0 1) (select .cse4 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|))) (forall ((v_arrayElimCell_181 (_ BitVec 32)) (v_prenex_9 (_ BitVec 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store .cse4 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_9) v_arrayElimCell_181)))))) (not (= (bvadd (select .cse4 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (_ bv0 1)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ BitVec 32))) (let ((.cse6 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ bv1 1)))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_24| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_prenex_10 (_ BitVec 32)) (v_prenex_11 (_ BitVec 1)) (v_arrayElimCell_181 (_ BitVec 32))) (let ((.cse5 (store .cse6 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_11))) (or (= (bvadd v_prenex_11 (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse5 v_prenex_10))) (= (_ bv0 1) (bvadd (select .cse5 v_arrayElimCell_181) (_ bv1 1)))))) (not (= (_ bv0 1) (select .cse6 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24|))) (not (= (bvadd (select .cse6 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (_ bv0 1)))))) .cse7 .cse8 .cse9 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ BitVec 32))) (let ((.cse11 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ bv1 1)))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_prenex_10 (_ BitVec 32)) (v_prenex_11 (_ BitVec 1)) (v_arrayElimCell_181 (_ BitVec 32))) (let ((.cse10 (store .cse11 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_11))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse10 v_prenex_10))) (= (_ bv0 1) (bvadd (select .cse10 v_arrayElimCell_181) (_ bv1 1)))))) (not (= (_ bv0 1) (select .cse11 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|))))) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_24| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24|))) (not (= (bvadd (select .cse11 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (_ bv0 1)))))) .cse12 .cse13 (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ BitVec 32))) (let ((.cse14 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ bv1 1)))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_24| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24|))) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_arrayElimCell_181 (_ BitVec 32)) (v_prenex_9 (_ BitVec 1))) (or (= (_ bv0 1) (bvadd (_ bv1 1) (select (store .cse14 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_9) v_arrayElimCell_181))) (= (_ bv0 1) (bvadd v_prenex_9 (_ bv1 1))))) (not (= (_ bv0 1) (select .cse14 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|))))) (not (= (bvadd (select .cse14 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (_ bv0 1)))))))) (or .cse15 .cse16 (and .cse17 .cse18 (or .cse19 (and .cse20 .cse21 .cse22)) .cse23 .cse24 .cse25 .cse26 .cse27 .cse28 .cse29 .cse30 .cse31 .cse32 .cse33 .cse34 (or .cse19 (and .cse35 .cse36 .cse37)))) (or (and .cse38 .cse39 .cse40 (or .cse41 (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ BitVec 32))) (let ((.cse42 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ bv1 1)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24|))) (not (= (_ bv0 1) (select .cse42 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|))) (not (= (bvadd (select .cse42 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (_ bv0 1))))))) .cse43) .cse0) (or .cse19 (and .cse44 (or (and .cse35 .cse36 .cse17 .cse18 .cse37 .cse45 .cse20 .cse21 .cse46 .cse27 .cse28 .cse29 .cse30 .cse22 .cse31 .cse32 .cse33 .cse34) .cse15 .cse16) .cse47 .cse48 .cse49 .cse50 .cse51)) (or .cse19 (and (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ BitVec 32))) (let ((.cse52 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ bv1 1)))) (or (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (forall ((v_prenex_125 (_ BitVec 1)) (v_arrayElimCell_181 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store .cse52 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_125) v_arrayElimCell_181) (_ bv1 1)))) (not (= (_ bv0 1) (select .cse52 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|))))) (= |v_ULTIMATE.start_main_#t~malloc14#1.base_24| |c_ULTIMATE.start_main_~root~0#1.base|) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24|))) (not (= (bvadd (select .cse52 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (_ bv0 1)))))) (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ BitVec 32))) (let ((.cse54 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ bv1 1)))) (or (= |v_ULTIMATE.start_main_#t~malloc14#1.base_24| |c_ULTIMATE.start_main_~root~0#1.base|) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_prenex_100 (_ BitVec 1)) (v_arrayElimCell_181 (_ BitVec 32)) (v_prenex_124 (_ BitVec 32))) (let ((.cse53 (store .cse54 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_100))) (or (= (bvadd (select .cse53 v_arrayElimCell_181) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (_ bv1 1) (select .cse53 v_prenex_124)))))) (not (= (_ bv0 1) (select .cse54 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|))))) (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24|))) (not (= (bvadd (select .cse54 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (_ bv0 1)))))))))) .cse65) (or (and .cse44 .cse47 .cse48 .cse49 (or .cse15 .cse16 (and .cse18 .cse37 .cse45 .cse21 .cse46 .cse29 .cse31 .cse32 .cse33 .cse34) .cse65) .cse50 .cse51) .cse19) (or (and .cse47 .cse50) (not .cse65) .cse19) (or (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_101 (_ BitVec 1)) (v_prenex_102 (_ BitVec 32))) (or (= (bvadd (_ bv1 1) (select (store .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_101) v_prenex_102)) (_ bv0 1)) (not (= (select .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))))) .cse0 .cse67) (or (and (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (forall ((v_prenex_106 (_ BitVec 1)) (v_prenex_105 (_ BitVec 32)) (v_arrayElimCell_176 (_ BitVec 32))) (let ((.cse68 (store .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_106))) (or (= (_ bv0 1) (bvadd (select .cse68 v_arrayElimCell_176) (_ bv1 1))) (= (bvadd (select .cse68 v_prenex_105) (_ bv1 1)) (_ bv0 1))))) (not (= (select .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))))) (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32))) (or (= |c_ULTIMATE.start_main_~root~0#1.base| |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (not (= (select .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (forall ((v_prenex_1 (_ BitVec 1)) (v_prenex_2 (_ BitVec 32))) (= (_ bv0 1) (bvadd (select (store .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_1) v_prenex_2) (_ bv1 1))))))) .cse67) (or .cse0 .cse67 (forall ((v_prenex_115 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_116 (_ BitVec 32)) (v_prenex_114 (_ BitVec 32))) (let ((.cse69 (store .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_115))) (or (= (bvadd (select .cse69 v_prenex_114) (_ bv1 1)) (_ bv0 1)) (= (_ bv0 1) (bvadd (select .cse69 v_prenex_116) (_ bv1 1))) (not (= (select .cse66 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))))))) (or .cse65 (and (or (and .cse38 .cse39 .cse40 .cse43) .cse0) (or (and .cse18 (or .cse41 .cse70 .cse19) .cse23 .cse24 .cse25 .cse26 .cse29 .cse31 .cse32 (or .cse41 .cse19 .cse71) .cse33 .cse34) .cse15 .cse16))) (or .cse72 .cse19 .cse15 .cse16) (or (and .cse1 .cse2 .cse3 .cse7 .cse8 .cse9 .cse12 .cse13) .cse0) (or .cse19 .cse15 .cse16 .cse73) (or (and (or (forall ((|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_94 (_ BitVec 32)) (v_prenex_93 (_ BitVec 32)) (v_prenex_92 (_ BitVec 1))) (let ((.cse74 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_92))) (or (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (bvadd (select .cse74 v_prenex_94) (_ bv1 1)) (_ bv0 1)) (= (bvadd (_ bv1 1) (select .cse74 v_prenex_93)) (_ bv0 1))))) .cse19) (or .cse0 (forall ((v_prenex_97 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_98 (_ BitVec 1)) (v_prenex_99 (_ BitVec 32))) (let ((.cse75 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_98))) (or (= (_ bv0 1) (bvadd (select .cse75 v_prenex_97) (_ bv1 1))) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (bvadd (select .cse75 v_prenex_99) (_ bv1 1)) (_ bv0 1)))))) (or (forall ((v_prenex_96 (_ BitVec 32)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_95 (_ BitVec 1))) (or (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1))) (= (_ bv0 1) (bvadd (_ bv1 1) (select (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_95) v_prenex_96))))) .cse0) (or .cse19 (forall ((v_prenex_120 (_ BitVec 32)) (v_prenex_122 (_ BitVec 1)) (|v_ULTIMATE.start_main_#t~malloc20#1.base_27| (_ BitVec 32)) (v_prenex_123 (_ BitVec 32)) (v_prenex_121 (_ BitVec 32))) (let ((.cse76 (store .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27| v_prenex_122))) (or (= (_ bv0 1) (bvadd (select .cse76 v_prenex_120) (_ bv1 1))) (= (_ bv0 1) (bvadd (select .cse76 v_prenex_121) (_ bv1 1))) (= (bvadd (select .cse76 v_prenex_123) (_ bv1 1)) (_ bv0 1)) (not (= (select .cse56 |v_ULTIMATE.start_main_#t~malloc20#1.base_27|) (_ bv0 1)))))))) .cse15 .cse16) (or .cse19 .cse15 .cse16 .cse77) (forall ((|v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ BitVec 32))) (let ((.cse78 (store |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24| (_ bv1 1)))) (or (not (= (_ bv0 1) (select |c_#valid| |v_ULTIMATE.start_main_#t~malloc14#1.base_24|))) (not (= (_ bv0 1) (select .cse78 |c_ULTIMATE.start_main_~root~0#1.base|))) (forall ((v_arrayElimCell_179 (_ BitVec 32)) (v_ArrVal_1487 (_ BitVec 1))) (= (_ bv0 1) (bvadd (select (store .cse78 |c_ULTIMATE.start_main_~root~0#1.base| v_ArrVal_1487) v_arrayElimCell_179) (_ bv1 1)))) (not (= (bvadd (select .cse78 |c_ULTIMATE.start_main_~n~0#1.base|) (_ bv1 1)) (_ bv0 1)))))))))) is different from false [2023-11-29 03:23:48,699 INFO L134 CoverageAnalysis]: Checked inductivity of 7 backedges. 0 proven. 3 refuted. 0 times theorem prover too weak. 0 trivial. 4 not checked. [2023-11-29 03:23:48,700 INFO L136 FreeRefinementEngine]: Strategy WOLF found an infeasible trace [2023-11-29 03:23:48,700 INFO L334 FreeRefinementEngine]: Using interpolant generator IpTcStrategyModuleMathsat [948820741] [2023-11-29 03:23:48,700 INFO L158 FreeRefinementEngine]: IpTcStrategyModuleMathsat [948820741] provided 0 perfect and 2 imperfect interpolant sequences [2023-11-29 03:23:48,700 INFO L185 FreeRefinementEngine]: Found 0 perfect and 2 imperfect interpolant sequences. [2023-11-29 03:23:48,700 INFO L198 FreeRefinementEngine]: Number of different interpolants: perfect sequences [] imperfect sequences [13, 16] total 29 [2023-11-29 03:23:48,700 INFO L121 tionRefinementEngine]: Using interpolant automaton builder IpAbStrategyModuleStraightlineAll [2110414695] [2023-11-29 03:23:48,700 INFO L85 oduleStraightlineAll]: Using 2 imperfect interpolants to construct interpolant automaton [2023-11-29 03:23:48,701 INFO L571 AbstractCegarLoop]: INTERPOLANT automaton has 31 states [2023-11-29 03:23:48,701 INFO L100 FreeRefinementEngine]: Using predicate unifier PredicateUnifier provided by strategy WOLF [2023-11-29 03:23:48,701 INFO L143 InterpolantAutomaton]: Constructing interpolant automaton starting with 31 interpolants. [2023-11-29 03:23:48,702 INFO L145 InterpolantAutomaton]: CoverageRelationStatistics Valid=142, Invalid=377, Unknown=19, NotChecked=392, Total=930 [2023-11-29 03:23:48,702 INFO L87 Difference]: Start difference. First operand 528 states and 716 transitions. Second operand has 31 states, 30 states have (on average 2.2) internal successors, (66), 30 states have internal predecessors, (66), 0 states have call successors, (0), 0 states have call predecessors, (0), 0 states have return successors, (0), 0 states have call predecessors, (0), 0 states have call successors, (0) [2023-11-29 03:23:51,010 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.05s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:23:56,874 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 03:24:00,933 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 03:24:09,751 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 03:24:21,852 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.82s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:24:25,443 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.23s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:24:33,519 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 03:24:38,781 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 03:24:42,238 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.00s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:24:45,722 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.39s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:24:49,266 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.42s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:24:58,553 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 03:25:02,213 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.06s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:25:32,373 WARN L293 SmtUtils]: Spent 26.12s on a formula simplification. DAG size of input: 933 DAG size of output: 875 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:25:35,173 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.78s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:25:36,607 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.40s for a HTC check with result UNKNOWN. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:25:41,337 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 03:25:45,387 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 03:26:04,302 WARN L293 SmtUtils]: Spent 13.88s on a formula simplification that was a NOOP. DAG size: 931 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:26:06,609 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.29s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:26:10,647 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 03:26:14,876 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 03:26:16,572 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.65s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:26:20,631 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 03:26:24,669 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 03:26:28,748 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 03:26:30,219 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.43s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:26:34,253 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.98s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:26:38,303 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 03:26:40,969 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.62s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:26:43,146 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.13s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:26:47,579 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 [0, 1] [2023-11-29 03:27:27,727 WARN L293 SmtUtils]: Spent 35.61s on a formula simplification. DAG size of input: 946 DAG size of output: 888 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:27:31,756 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 03:27:35,801 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 03:27:39,855 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 [0, 1] [2023-11-29 03:27:44,037 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 [0, 1] [2023-11-29 03:27:48,216 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 [0, 1] [2023-11-29 03:27:52,265 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 03:27:56,298 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 03:28:00,393 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 03:28:04,482 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 03:28:08,546 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 03:28:12,600 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 03:28:17,516 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 [0, 1] [2023-11-29 03:28:21,675 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 [0, 1] [2023-11-29 03:28:23,846 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.02s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:28:27,887 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 03:28:31,841 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.93s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:28:35,736 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.87s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:28:38,527 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 2.73s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:28:50,790 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 [0, 1] [2023-11-29 03:28:52,311 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.48s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:28:55,487 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 1.59s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [0, 1] [2023-11-29 03:29:33,887 WARN L293 SmtUtils]: Spent 33.63s on a formula simplification. DAG size of input: 938 DAG size of output: 880 (called from [L 391] de.uni_freiburg.informatik.ultimate.lib.modelcheckerutils.smt.predicates.PredicateUnifier.getOrConstructPredicate) [2023-11-29 03:29:37,102 WARN L539 Checker$ProtectedHtc]: IncrementalHoareTripleChecker took 3.21s for a HTC check with result INVALID. Formula has sorts [Array, Bool, BitVec], hasArrays=true, hasNonlinArith=false, quantifiers [1] [2023-11-29 03:29:41,163 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 03:29:45,592 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 03:29:49,654 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 [0, 1] [2023-11-29 03:29:53,716 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 03:29:57,750 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 03:30:01,841 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 03:30:05,881 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]